Optimized Pipelined Fast Fourier Transform Using Split and Merge Parallel Processing Units for OFDM
- 19 May 2020
- journal article
- research article
- Published by Springer Nature in Wireless Personal Communications
- Vol. 117 (4) , 3067-3089
Abstract
No abstract availableKeywords
This publication has 29 references indexed in Scilit:
- FFT Architectures for Real-Valued Signals Based on Radix-$2^{3}$ and Radix-$2^{4}$ AlgorithmsIEEE Transactions on Circuits and Systems I: Regular Papers, 2013
- Pipelined Radix-$2^{k}$ Feedforward FFT ArchitecturesIEEE Transactions on Very Large Scale Integration (VLSI) Systems, 2011
- Low-Complexity Channel Estimation Using Short-Point FFT/IFFT for an Iterative Receiver in an LDPC-Coded OFDM SystemWireless Personal Communications, 2010
- Low-power variable-length fast Fourier transform processorIEE Proceedings - Computers and Digital Techniques, 2005
- High-speed and low-power split-radix FFTIEEE Transactions on Signal Processing, 2003
- Radix-2 decimation-in-frequency algorithm for the computation of the real-valued FFTIEEE Transactions on Signal Processing, 1999
- A radix-8 wafer scale FFT processorJournal of Signal Processing Systems, 1992
- Synthesis of control circuits in folded pipelined DSP architecturesIEEE Journal of Solid-State Circuits, 1992
- A pipelined FFT processor for word-sequential dataIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965