Abstract
Consider a finite abelian group A. A mapping
is called a homomorphism of A if it satisfies
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Bibliography
Gertner, I. (1988), “A New Efficient Algorithm to Compute the Two-Dimensional Discrete Fourier Transform,” IEEE Trans. ASSP ASSP-36 (7), 1036–1050.
Gertner, I. and Shamash, M. (1987), “VLSI Architectures for Multidimensional Fourier Transform Processing,” IEEE Trans. Comput. C-36(ll), 1265–1274.
Gertner, I. and Tolimieri, R. (1989), “Fast Algorithm to Compute Multidimensional Discrete Fourier Transform,” SPIE Real-Time Signal Processing Proceedings, San Diego, CA, 132–146.
Jordan, C. (1870), Traete des Substitutions, Paris, 96–97.
Vulis, M. (1989), “The Weighted Redundancy Transform,” IEEE Trans. ASSP ASSP-37 (11).
Vulis, M. and Tsai, D. (1990), “Computing Discrete Fourier Transform on a Rectangular Data Array,” IEEE Trans. ASSP ASSP-38 (2).
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer-Verlag New York, Inc.
About this chapter
Cite this chapter
Tolimieri, R., An, M., Lu, C. (1993). Duality of Lines and Planes. In: Mathematics of Multidimensional Fourier Transform Algorithms. Signal Processing and Digital Filtering. Springer, New York, NY. https://doi.org/10.1007/978-1-4684-0205-6_7
Download citation
DOI: https://doi.org/10.1007/978-1-4684-0205-6_7
Publisher Name: Springer, New York, NY
Print ISBN: 978-1-4684-0207-0
Online ISBN: 978-1-4684-0205-6
eBook Packages: Springer Book Archive