Skip to main content

Part of the book series: Signal Processing and Digital Filtering ((SIGNAL PROCESS))

  • 378 Accesses

Abstract

Multiplicative character theory provides a natural setting for developing the complexity results of Auslander-Feig- Winograd [1]. The first reason for this is the simplicity of the formulas describing the action of FT on multiplicative characters. We will now discuss a second important property of multiplicative characters. In a sense defined below, the spaces spanned by the subsets V k , 1 ≤ k > m, of multiplicative characters are rational subspaces. As a consequence, we will be able to rationally manipulate the FT matrix F(p m) into block diagonal matrices where each block action corresponds to some polynomial multiplication modulo a rational polynomial of a special kind. This is the main result in the work of Auslander-Feig-Winograd. Details from the point of view of multiplicative character theory can be found in [2].

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Auslander, L. Feig, E. and Winograd, S. “The Multiplicative Complexity of the Discrete Fourier Transform”, Adv. in Appl. Math. 5 (1984), 31–55.

    Article  MathSciNet  MATH  Google Scholar 

  2. Tolimieri, R. “Multiplicative Characters and the Discrete Fourier Transform”, Adv. in Appl. Math. 7 (1986), 344–380.

    Article  MathSciNet  MATH  Google Scholar 

  3. Rader, C. “Discrete Fourier Transforms When the Number of Data Samples is Prime”, Proc. of IEEE, 56 (1968), 1107–1108.

    Article  Google Scholar 

  4. Winograd, S. Arithmetic Complexity of Computations, CBMS Regional Conf. Ser. in Math. Vol. 33, Soc. Indus. Appl. Math., Philadelphia, 1980.

    Google Scholar 

  5. Tolimieri, R. “The Construction of Orthogonal Basis Diagonalizing the Discrete Fourier Transform”, Adv. in Appl. Math. 5 (1984), 56–86.

    Article  MathSciNet  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer Science+Business Media New York

About this chapter

Cite this chapter

Tolimieri, R., An, M., Lu, C. (1989). Rationality. 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_15

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3854-4_15

  • 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

Publish with us

Policies and ethics