Abstract
In this and the next chapters, we present several mathematical results needed to design the algorithms of the text. We assume that the reader has some knowledge of groups, rings and vector spaces but no extensive knowledge is required. Instead, we focus on those mathematical objects which will be used repeatedly in this text.
This is a preview of subscription content, log in via an institution to check access.
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
Ireland and Rosen A Classical Introduction to Modern Number Theory, Springer-Verlag 1980.
Halmos, P. R. Finite-Dimensional Vector Spaces, Springer-Verlag 1974.
Herstein, I. N. Topics in Algebra, XEROX College Publishing, 1964.
References of Preface
Heideman, M. T., Johnson, D. H. and Burrus, C. S. “Gauss and the History of the Fast Fourier Transform”, IEEE ASSP Magazine, October 1984.
Cooley, J. W. and Tukey, J. W. “An Algorithm for the Machine Calculation of Complex Fourier Series”, Math. Comp., vol. 19, No. 2.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1989 Springer Science+Business Media New York
About this chapter
Cite this chapter
Tolimieri, R., An, M., Lu, C. (1989). Introduction to Abstract Algebra. In: Burrus, C.S. (eds) Algorithms for Discrete Fourier Transform and Convolution. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3854-4_1
Download citation
DOI: https://doi.org/10.1007/978-1-4757-3854-4_1
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4757-3856-8
Online ISBN: 978-1-4757-3854-4
eBook Packages: Springer Book Archive