16-point reversible integer discrete Fourier transform with 12 control bits

Authors:
Artyom M. Grigoryan
Affiliations:
Department of Electrical and Computer Engineering, University of Texas at San Antonio, San Antonio, TX
Venue:
IEEE Transactions on Signal Processing
Year:
2010

Citing 4
Cited 0

Integer fast Fourier transform

IEEE Transactions on Signal Processing
Method of flow graph simplification for the 16-point discrete Fourier transform

IEEE Transactions on Signal Processing
2-D and 1-D multipaired transforms: frequency-time type wavelets

IEEE Transactions on Signal Processing
Novel Reversible Integer Fourier Transform With Control Bits

IEEE Transactions on Signal Processing

Quantified Score

Hi-index	35.68

Visualization

Abstract

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.