IEEE Transactions on Consumer Electronics · 2003 · 82 citations · 16 references
EngineeringComputer EngineeringElectrical EngineeringAlgorithmsHardware-software Co-designMicroelectronicsCmos Circuit DesignDigital Integrated Circuit DesignDigital Logic DesignDigital Signal ProcessingField-programmable Gate Array ArchitectureLogic SynthesisDigital Signal Processing Block ArchitectureDigital Signal Processing BlocksLogic Gate DesignLogic Gate ImplementationLogic Gate NetworksMultiplier DesignMultipliersProcessing
In this paper, we propose a new efficient FFT algorithm for OFDM/DMT applications and present its pipeline implementation results. Since the proposed algorithm is based on the radix-4 butterfly unit, the processing rate can be twice as fast as that based on the radix-23 algorithm. Also, its implementation is more area-efficient than the implementation from conventional radix-4 algorithm due to reduced number of nontrivial multipliers like using the radix-2/sup 3/ algorithm. In order to compare the proposed algorithm with the conventional radix-4 algorithm, the 64-point MDC pipelined FFT processor based on the proposed algorithm was implemented. After the logic synthesis using 0.35 /spl mu/m CMOS technology, the logic gate count for the processor with the proposed algorithm is only about 70% of that for the processor with the conventional radix-4 algorithm. Since the proposed algorithm can achieve higher processing rate and better efficiency than the conventional algorithm, it is very suitable for the OFDM/DMT applications such as the WLAN, DAB/DVB, and ADSL/VDSL systems.
16
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley, John W. Tukey · Mathematics of Computation · 1965 · 12.2K citations
Parallel Processing with the Perfect Shuffle
Harold S. Stone · IEEE Transactions on Computers · 1971 · 1.3K citations