Polynomial Transforms and Their Fast Algorithms
Part of the Applied and Numerical Harmonic Analysis book series (ANHA)
This chapter presents some essential and important concepts that are frequently used in the theory of polynomial transforms and fast algorithms.
KeywordsFast Algorithm Diophantine Equation Primitive Root Chinese Remainder Theorem Residue Number System
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Unable to display preview. Download preview PDF.
- 2.R. E. Blahut, Fast Algorithms for Digital Signal Processing, Addison-Wesley, Reading, MA, 1984.Google Scholar
- 3.P. Duhamel and C. Guillemot, Polynomial transform computation of the 2-D DOT, Proc. ICASSP, 1515–1518, 1990.Google Scholar
- 4.Z. R. Jiang and Y. H. Zeng, Polynomial Transform and its Applications, National Uni-versity of Defense Technology Press, Changsha, P. R. China, 1989 (in Chinese).Google Scholar
- 5.Z. R. Jiang, Y. H. Zeng and P. N. Yu, Fast Algorithms, National University of Defense Technology Press, Changsha, P. R. China, 1994 (in Chinese).Google Scholar
- 6.E. V. Labunets, V. G. Labunets, K. Egiazarian and J. Astola, New fast algorithms of multidimensional Fourier and Radon discrete transforms, Proc. ICASSP, 3193–3196, 1999.Google Scholar
- 8.J. H. McClellan and C.M. Radar, Number Theory in Digital Signal Processing, Prentice- Hall, Inc., Englewood Cliffs, NJ, 1979.Google Scholar
- 12.J. Prado and P. Duhamel, A polynomial transform based computation of the 2-D DCT with minimum multiplicative complexity, Proc. ICASSP, vol. 3, 1347–1350, 1996.Google Scholar
- 19.Y. H. Zeng, L. Z. Cheng and M. Zhou, Parallel algorithms for digital signal process-ing, National University of Defense Technology Press, Changsha, P. R. China, 1998 (in Chinese).Google Scholar
© Springer Science+Business Media New York 2004