Inverse Z-transform by Mobius inversion and the error bounds of aliasing in sampling
- 1 January 1994
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Signal Processing
- Vol. 42 (10) , 2823-2831
- https://doi.org/10.1109/78.324746
Abstract
A general algorithm based on two special Mobius inversion formulae is developed to compute the inverse Z-transform. This approach to Fourier analysis uses what is called the arithmetic Fourier transform (AFT). With the new AFT algorithm. One can compute the inverse Z-transform of an infinite two-sided sequence. It is compared with the conventional DFT approach. Both methods have aliasing errors due to sampling. The error bounds of the aliasing effects in the DFT and the new proposed method are established and compared. In general, the AFT algorithm is not so vulnerable to the aliasing errors in the high-frequency components as the DFT approachKeywords
This publication has 8 references indexed in Scilit:
- Iterative Realization of the Arithmetic Fourier TransformIEEE Transactions on Signal Processing, 1993
- A VLSI architecture for simplified arithmetic Fourier transform algorithmIEEE Transactions on Signal Processing, 1992
- An algorithm for computing the inverse Z transformIEEE Transactions on Signal Processing, 1992
- Fourier analysis and signal processing by use of the Mobius inversion formulaIEEE Transactions on Acoustics, Speech, and Signal Processing, 1990
- A note on the computational complexity of the arithmetic Fourier transformIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- Comments on, "A note on the computational complexity of the arithmetic Fourier transform" by N. TepedelenliogluIEEE Transactions on Acoustics, Speech, and Signal Processing, 1989
- A sampling theorem and Wintner's results on Fourier coefficientsJournal of Mathematical Analysis and Applications, 1988
- An algorithm for the machine calculation of complex Fourier seriesMathematics of Computation, 1965