Back to results
US 2022/0067119 A1Published application
Recursive discrete fourier transform device
AssigneeNational Central University
InventorsMuh-Tian SHIUE, Chih-Feng WU, Chun-Hung CHEN
Life of this patent
Estimating the term…
Abstract
A recursive discrete Fourier transform (RDFT) of this invention uses an input-decimation technique to reduce the number of input sequences for a recursive-filter so as to decrease the computation cycle of the recursive-filter. Therefore, the time complexity of the RDFT can be minimized, namely, increasing the throughput of the RDFT.
Claims10
A recursive discrete Fourier transform device, comprising:
- M pre-processors, configured to perform an input-decimation operation to divide N input signals into M aggregated signals, wherein M is a factor of N;
- a multiplexer, coupled to the M pre-processors, configured to sequentially output the M aggregated signals;
- a buffer, coupled to the multiplexer, configured to store an outputted aggregated signal output by the multiplexer, wherein the size of the buffer is equivalent to
- N
- M
- ;
- a recursive-filter, coupled to the buffer, configured to receive the output aggregated signals from the buffer and configured to perform a computation on the outputted aggregated signal;
- and
- an output-stage, coupled to the recursive-filter, generating two output signals according to the output of the recursive-filter.
6 more elements
Dependencies are inferred from the claim text.