Close category search window
 

16-Point Reversible Integer Discrete Fourier Transform With 12 Control Bits

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

1 Author(s)
Grigoryan, A.M. ; Dept. of Electr. & Comput. Eng., Univ. of Texas at San Antonio, San Antonio, TX, USA

This correspondence discusses the reversible integer 16-point discrete Fourier transform (RiDFT) which uses integer operations with control bits. The decomposition of the RiDFT is based on the paired representation, when the Fourier transform is split recursively into a set of short transforms of orders 8, 4, 2, and 1. Control bits allow for inverting the integer approximations of multiplications by twiddle factors. The proposed 16-point RiDFT uses 16 operations of real multiplication and 62 additions. The integer approximation of the transform with eight control bits with additional two lifting schemes, which requires two more multiplications, is also considered.

Published in:
Signal Processing, IEEE Transactions on  (Volume:58 ,  Issue: 2 )

Date of Publication: Feb. 2010

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.