Journal ArticleDOI
Fourier analysis and signal processing by use of the Mobius inversion formula
TLDR
A novel Fourier technique for digital signal processing is developed based on the number-theoretic method of the Mobius inversion of series that competes with the classical FFT (fast Fourier transform) approach in terms of accuracy, complexity, and speed.Abstract:
A novel Fourier technique for digital signal processing is developed. This approach to Fourier analysis is based on the number-theoretic method of the Mobius inversion of series. The Fourier transform method developed is shown also to yield the convolution of two signals. A computer simulation shows that this method for finding Fourier coefficients is quite suitable for digital signal processing. It competes with the classical FFT (fast Fourier transform) approach in terms of accuracy, complexity, and speed. >read more
Citations
More filters
Proceedings ArticleDOI
Trading Accuracy for Power with an Underdesigned Multiplier Architecture
TL;DR: A novel multiplier architecture with tunable error characteristics, that leverages a modified inaccurate 2x2 building block, that can achieve 2X - 8X better Signal-Noise-Ratio (SNR) for the same power savings when compared to recent voltage over-scaling based power-error tradeoff methods is proposed.
Journal ArticleDOI
A cluster-based approach for detecting man-made objects and changes in imagery
TL;DR: A new unified approach to object and change detection is presented that involves clustering and analyzing the distribution of pixel values within clusters over one or more images, and preliminary results show cluster-basedchange detection is less sensitive to image misregistration errors than global change detection.
Journal ArticleDOI
Trading Accuracy for Power in a Multiplier Architecture
TL;DR: This work proposes a novel multiplier architecture with tunable error characteristics, that leverages a modified inaccurate 2x2 multiplier as its building block, and enhances the design to allow for correct operation of the multiplier using a correction unit, for non error-resilient applications which share the hardware resource.
Proceedings ArticleDOI
Highly energy and performance efficient embedded computing through approximately correct arithmetic: a mathematical foundation and preliminary experimental validation
Lakshmi N. Chakrapani,Kirthi Krishna Muntimadugu,Avinash Lingamneni,Jason George,Krishna V. Palem +4 more
TL;DR: This work develops a theoretical foundation to characterize a novel methodology for low energy and high performance dsp for embedded computing and shows that this approach is better than the conventional uniform voltage scaling approach for comparable computational speed or performance.
Journal ArticleDOI
A VLSI architecture for simplified arithmetic Fourier transform algorithm
TL;DR: The arithmetic Fourier transform is shown to yield an algorithm of less complexity and of improved performance over certain AFT algorithms, and a VLSI architecture is suggested for this simplified AFT algorithm.
References
More filters
Journal ArticleDOI
An algorithm for the machine calculation of complex Fourier series
J.W. Cooley,John W. Tukey +1 more
TL;DR: Good generalized these methods and gave elegant algorithms for which one class of applications is the calculation of Fourier series, applicable to certain problems in which one must multiply an N-vector by an N X N matrix which can be factored into m sparse matrices.
Journal ArticleDOI
Some improvements in practical Fourier analysis and their application to x-ray scattering from liquids
G.C. Danielson,Cornelius Lanczos +1 more
Journal ArticleDOI
A recursive moving-target-indication algorithm for optical image sequences
TL;DR: A recursive track-before-detect algorithm, producing potentially large signal-to-noise ratio (SNR) gains under realizable conditions, is described, and this procedure adapts easily to digital processing and achieves SNR gains comparable to those from other robust track- before-detection algorithms.
Journal ArticleDOI
A method for computing the fast Fourier transform with auxiliary memory and limited high-speed storage
TL;DR: An ALGOL procedure for computing the complex Fourier transform with four, six, or eight files is listed, and timing and accuracy test results are given.
Journal ArticleDOI
The arithmetic Fourier transform
TL;DR: Preliminary results are presented on the VLSI design and implementation of a novel algorithm for accurate high-speed Fourier analysis and synthesis, based on the number-theoretic method of Mobius inversion.