NDLI: Canonic real-valued FFT structures

Content Provider	IEEE Xplore Digital Library
Author	Parhi, M. Yingjie Lao Parhi, K.K.
Copyright Year	2014
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Univ. of Minnesota, Minneapolis, MN, USA (Parhi, M.; Yingjie Lao; Parhi, K.K.)
Abstract	An N-point FFT processes N complex signals to compute N output complex signals using decimation-in-time (DIT) or decimation-in-frequency (DIF) approach. The FFT makes use of n = $log_{2}N$ stages of computations where each stage computes N complex signals; N is assumed to be power-of-two. This paper considers implementation of a real signal of length N. Since the degrees of freedom of the input data is N, each stage of the FFT should not need to compute more than N signal values, where a signal value can corresponds to a purely real or purely imaginary value. Any more than N samples computed at any FFT stage is inherently redundant. This paper, for the first time, presents novel DIT and DIF structures for computing real FFT, referred as RFFT, that are canonic with respect to the number signal values computed at each FFT stage. In the proposed structure, in an N-point RFFT, exactly N signal values are computed at the output of each FFT stage and at the output. No prior canonic DIT RFFT structure was presented before. This paper, for the first time, presents a formal approach to compute RFFT using DIT in a canonic manner. While canonic FFT structures based on decimation-in-frequency were presented before, these structures were derived in an adhoc way. This paper presents a formal method to derive canonic DIF RFFT structures.
Starting Page	1261
Ending Page	1265
File Size	207992
Page Count	5
File Format	PDF
e-ISBN	9781479982974
DOI	10.1109/ACSSC.2014.7094662
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2014-11-02
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Computer architecture Signal processing algorithms Circuits and systems Merging Redundancy Digital signal processing twiddle factor transformation Fast Fourier Transform (FFT) Real-Valued FFT canonic FFT decimation-in-time decimation-in-frequency
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

A Pipelined FFT Architecture for Real-Valued Signals

Efficient VLSI Architecture for Decimation-in-Time Fast Fourier Transform of Real-Valued Data

A Novel Memory-Based FFT Architecture for Real-Valued Signals Based on a Radix-2 Decimation-In-Frequency Algorithm

Memory usage reduction method for FFT implementations on DSP based embedded system

Multiplier-less based architecture for variable-length FFT hardware implementation

An obfuscated radix-2 real FFT architecture

Pipelined FFT architectures for real-time signal processing and wireless communication applications

On the Fixed-Point Accuracy Analysis of FFT Algorithms

Lecture #26: fast fourier transforms – i.

Canonic real-valued FFT structures

Similar Documents

A Pipelined FFT Architecture for Real-Valued Signals

Efficient VLSI Architecture for Decimation-in-Time Fast Fourier Transform of Real-Valued Data

A Novel Memory-Based FFT Architecture for Real-Valued Signals Based on a Radix-2 Decimation-In-Frequency Algorithm

Memory usage reduction method for FFT implementations on DSP based embedded system

Multiplier-less based architecture for variable-length FFT hardware implementation

An obfuscated radix-2 real FFT architecture

Pipelined FFT architectures for real-time signal processing and wireless communication applications

On the Fixed-Point Accuracy Analysis of FFT Algorithms

Lecture #26: fast fourier transforms – i.

Canonic real-valued FFT structures