Power and bandwidth efficient FFT for DDR memory

摘要

Systems and methods are disclosed for calculating Fast Fourier Transforms (FFT) in a power and memory bandwidth efficient manner. For example, an apparatus is provided that includes a memory interface operable to read data samples stored in a memory and store a first set of the data samples in a read reorder buffer, wherein the read reorder buffer selects a first portion of the first set of the data samples in accordance with a radix-reversed order. Also included is a first core circuit that is operable to process the first portion of the first set of the data samples in response to receiving the first portion from the read reorder buffer, wherein the processing includes calculating output samples corresponding to a part of an FFT.

主权项

1. A method for efficiently transferring data samples stored in a memory for calculating Fast Fourier Transforms (FFTs), the method comprising:
storing a first set of the data samples in a first read reorder buffer, wherein the first set of the data samples corresponds to a first set of indices; selecting, using the first read reorder buffer, a first portion of the first set of the data samples, wherein the first portion of the first set of data samples corresponds to a second set of indices; transmitting, using the first read reorder buffer, the first portion of the first set of the data samples to a first circuit; and processing, using the first circuit, the first portion of the first set of the data samples in response to the transmitting the first portion using the first read reorder buffer, wherein the processing includes calculating output data samples corresponding to a part of a first FFT.