A High-Speed Low-Complexity Modified FFT Processor for High Rate WPAN Applications

T Cho, H Lee - IEEE Transactions on Very Large Scale …, 2012 - ieeexplore.ieee.org
This paper presents a high-speed low-complexity modified radix-2 5 512-point fast Fourier
transform (FFT) processor using an eight data-path pipelined approach for high rate wireless …

A high-speed low-complexity modified radix-25 FFT processor for gigabit WPAN applications

T Cho, H Lee, J Park, C Park - 2011 IEEE international …, 2011 - ieeexplore.ieee.org
In this paper, we present a novel modified radix-2 5 algorithm for 512-point fast Fourier
transform (FFT) computation and high-speed eight-parallel data-path architecture for multi …

A 2.4-GS/s FFT processor for OFDM-based WPAN applications

SN Tang, JW Tsai, TY Chang - IEEE Transactions on Circuits …, 2010 - ieeexplore.ieee.org
This brief presents a fast Fourier transform (FFT) processor that provides high throughput
rate (TR) by applying the eight-data-path pipelined approach for wireless personal area …

A high-flexible low-latency memory-based FFT processor for 4G, WLAN, and future 5G

S Liu, D Liu - IEEE Transactions on Very Large Scale …, 2018 - ieeexplore.ieee.org
A high-throughput programmable fast Fourier transform (FFT) processor is designed
supporting 16-to 4096-point FFTs and 12-to 2400-point discrete Fourier transforms (DFTs) …

A 64-point Fourier transform chip for high-speed wireless LAN application using OFDM

K Maharatna, E Grass… - IEEE Journal of Solid-State …, 2004 - ieeexplore.ieee.org
In this paper, we present a novel fixed-point 16-bit word-width 64-point FFT/IFFT processor
developed primarily for the application in an OFDM-based IEEE 802.11 a wireless LAN …

A 60-mode high-throughput parallel-processing FFT processor for 5G/4G applications

Y Guo, Z Wang, Q Hong, H Luo, X Qiu… - IEEE Transactions on …, 2022 - ieeexplore.ieee.org
This article presents a 60-mode high-throughput parallel-processing memory-based fast
Fourier transform (FFT) processor for fifth-generation (5G)/4G applications. The proposed …

An efficient pipelined FFT architecture

YN Chang, KK Parhi - … Transactions on Circuits and Systems II …, 2003 - ieeexplore.ieee.org
This paper presents an efficient VLSI architecture of the pipeline fast Fourier transform (FFT)
processor based on radix-4 decimation-in-time algorithm with the use of digit-serial …

An area-efficient and low-power 64-point pipeline Fast Fourier Transform for OFDM applications

GK Ganjikunta, SK Sahoo - Integration, 2017 - Elsevier
In an orthogonal frequency division multiplexing (OFDM) based wireless systems, Fast
Fourier Transform (FFT) is a critical block as it occupies large area and consumes more …

A High-Throughput Low-Complexity Radix- - - FFT/IFFT Processor With Parallel and Normal Input/Output Order for IEEE 802.11ad Systems

C Wang, Y Yan, X Fu - IEEE Transactions on Very Large Scale …, 2014 - ieeexplore.ieee.org
This brief presents a high-throughput low-complexity 512-point fast Fourier transform
(FFT)/inverse fast Fourier transform (IFFT) processor for IEEE 802.11 ad standard aiming at …

COBRA: A 100-MOPS single-chip programmable and expandable FFT

T Chen, G Sunada, J Jin - … on very large scale integration (vlsi) …, 1999 - ieeexplore.ieee.org
This paper presents an optimized column fast Fourier transform (FFT) architecture, which
utilizes bit-serial arithmetic and dynamic reconfiguration to achieve a complete overlap …