Publication Type:

Conference Paper

Authors:

Jayshankar

Source:

IEEE Region 10 Annual International Conference, Proceedings/TENCON, Hyderabad (2008)

ISBN:

1424424089; 9781424424085

URL:

http://www.scopus.com/inward/record.url?eid=2-s2.0-63049099072&partnerID=40&md5=3e4dfd66dd1bdea555133a7e8a8deb06

Keywords:

Efficient computations, Efficient methods, Fast Fourier transforms, Multicarrier modulation, Probability density function, Real-world applications

Abstract:

In this paper, an efficient method for computation of the DFT of a 2N - point real sequence by using DIT FFT with CORDIC based butterflies is presented. Most of the real world applications use long real valued sequences. By using FFT with CORDIC based butterflies, the space required on ROM and also the time required to perform the operation can be reduced. Further, to calculate the 2N - point DFT, by using one N-point DFT involving complex valued data, efficiency is almost doubled.

Notes:

cited By (since 1996)0; Conference of org.apache.xalan.xsltc.dom.DOMAdapter@4375cb2c ; Conference Date: org.apache.xalan.xsltc.dom.DOMAdapter@6a6dd84d Through org.apache.xalan.xsltc.dom.DOMAdapter@5193ddd1; Conference Code:75688

Cite this Research Publication

, “Efficient computation of the DFT of a 2N - Point real sequence using FFT with CORDIC based butterflies”, in IEEE Region 10 Annual International Conference, Proceedings/TENCON, Hyderabad, 2008.