IEEE.org| IEEE Xplore Digital Library| IEEE Standards| IEEE Spectrum| More Sites

Cart (Loading....) | Create Account | 

Close category search window
Author Searchbeta |  Advanced Search  |  Preferences |  Search Tips  |  More Search Options  
 
Browse Conference Publications > Circuits and Systems, 1989., ... Help

Fast computation of real discrete Fourier transform for any number of data points

Full Text Sign-In or Purchase

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing! close button
puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Hu, N. ; Sch. of Electr. Eng., Purdue Univ., West Lafayette, IN, USA ; Ersoy, O.K.

In many applications, it is desirable to have a fast algorithm (FRFT) for the computation of the real discrete Fourier transform (RDFT) for any number of data points. To achieve this, the two-factor Cooley-Tukey FRFT algorithm is developed and expressed in terms of matrix factorization using Kronecker products. This is generalized to any number of factors. Each factor M involves the computation of size M RDFTs, which is carried out by the best size M FRFT algorithm available

Published in:
Circuits and Systems, 1989., IEEE International Symposium on

Date of Conference: 8-11 May 1989

Page(s):
306 - 308 vol.1
Meeting Date :
08 May 1989-11 May 1989
INSPEC Accession Number:
3624039
Conference Location :
Portland, OR
Digital Object Identifier :
10.1109/ISCAS.1989.100352
Product Type:
Conference Publications

IEEE Account

Purchase Details

Profile Information

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.