NDLI: General FFT pruning algorithm

Content Provider	IEEE Xplore Digital Library
Author	Alves, R.G. Osorio, P.L. Swamy, M.N.S.
Copyright Year	2000
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Concordia Univ., Montreal, Que., Canada (Alves, R.G.)
Abstract	The efficiency of the fast Fourier transform may be increased by removing operations on input values which are zero, and on output values which are not required; this procedure is known as FFT pruning algorithm. Up to now some algorithms have been proposed considering decimation-in-time (DIT) or decimation-in-frequency (DIF) procedures, and considering that for a N = 2/sup M/ input points of the FFT only quantities equals to 2/sup k/ (to an integer k), of nonzero input or desired output points are required. In this paper we propose a new FFT pruning algorithm where the number of nonzero inputs or desired outputs can be arbitrary. The idea of the proposed algorithm works well with DIT as well as DIEF procedures, and the implementation is similar to the FFT algorithms that use in-place computation, with a small alteration.
Starting Page	1192
Ending Page	1195
File Size	302204
Page Count	4
File Format	PDF
ISBN	0780364759
DOI	10.1109/MWSCAS.2000.951428
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2000-08-08
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Fast Fourier transforms Circuits and systems Flow graphs Testing
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Generalized FFT algorithm

Design of split-radix FFT pruning for OFDM based cognitive radio system

Pruning split-radix FFT with time shift

Automating the design of prime length FFT programs

Efficient FFT engine with reduced addressing logic

A Digit Reversal Circuit for the Variable-Length Radix-4 FFT

Efficient output-pruning of the 2-D FFT algorithm

High-resolution narrow-band spectra by FFT pruning

Conflict free memory addressing for dedicated FFT hardware

General FFT pruning algorithm

Similar Documents

Generalized FFT algorithm

Design of split-radix FFT pruning for OFDM based cognitive radio system

Pruning split-radix FFT with time shift

Automating the design of prime length FFT programs

Efficient FFT engine with reduced addressing logic

A Digit Reversal Circuit for the Variable-Length Radix-4 FFT

Efficient output-pruning of the 2-D FFT algorithm

High-resolution narrow-band spectra by FFT pruning

Conflict free memory addressing for dedicated FFT hardware

General FFT pruning algorithm