Abstract
New hardware-oriented supervectorized algorithmic models for numerical sequences discrete Fourier transform, convolution and correlation computing are described. The models being fully parallelized give possibility to achieve minimal calculation time in comparison with known ones.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
S.Y. Kung, H.J. Whitehouse, T. Kailath. VLSI and Modem Signal processing. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1985.
L.R. Rabiner and B. Gold. Theory and application of digital signal processing. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1975
A. V. Openheim, R. V. Shafer. Digital signal processing. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1988.
S.Y. Kung. VLSI array processors. Prentice-Hall, Inc., Englewood Cliffs, N.J., 1975
A. P. Tsaryov. Parallel algorithm adaptation for accelerated Fourier Discrete Transformation computation to be realized on vector computers. Proceedings of Higher Schools of the USSR, Series: Radioelectronics, 1985, № 1, p. 98–100.
A. P. Tsaryov. Algorithmic principles of vectorizing computations over digital date arrays. Acta ACademia, International Informatization Academi, Chişinău. Evrica, 1997, pp. 67–99.
E. E. Dagman and G. A. Kukharev. Fast discrete orthogonal transforms. Novosibirsk, Nauka, 1983.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2002 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tariov, A.P., Mąka, T., Melnic, E. (2002). Algorithmic Models for Supervectoring Calculation in Solving Base DSP Problems. In: Sołdek, J., Pejaś, J. (eds) Advanced Computer Systems. The Springer International Series in Engineering and Computer Science, vol 664. Springer, Boston, MA. https://doi.org/10.1007/978-1-4419-8530-9_21
Download citation
DOI: https://doi.org/10.1007/978-1-4419-8530-9_21
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-4635-7
Online ISBN: 978-1-4419-8530-9
eBook Packages: Springer Book Archive