Cart (Loading....) | Create Account
Close category search window
 

The arithmetic Fourier transform

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)
Sadasiv, G. ; Dept. of Electr. Eng., Rhode Island Univ., RI, USA

Preliminary results are presented on the VLSI design and implementation of a novel algorithm for accurate high-speed Fourier analysis and synthesis. The arithmetic Fourier transform (AFT) is based on the number-theoretic method of Mobius inversion. Its computations proceed in parallel, and the individual operations are very simple. Except for a small number of scalings in one state of the computation, only multiplications by 0, +1, and -1 are required. If the input samples were not quantized and if ideal real-number operations were used internally, then the results would be exact. The accuracy of the computation is limited only by the input A/D (analog-to-digital) conversion process, any constraints on the word lengths of internal accumulating registers, and the implementation of the few scaling operations. Further simplifications are obtained by using delta modulation to represent the input function in digital form, so that only binary (or preferably, ternary) sequences needs to be processed in the parallel computations. The required accumulations can be replaced by up/down counters. The dynamic range of the resulting transformation can be increased by the use of adaptive delta modulation.<>

Published in:

ASSP Magazine, IEEE  (Volume:5 ,  Issue: 1 )

Date of Publication:

Jan. 1988

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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.