Book contents
- Frontmatter
- Contents
- Preface
- Part I Finite Abelian Groups
- 1 Congruences and the Quotient Ring of the Integers mod n
- 2 The Discrete Fourier Transform on the Finite Circle ℤ/nℤ
- 3 Graphs of ℤ/nℤ, Adjacency Operators, Eigenvalues
- 4 Four Questions about Cayley Graphs
- 5 Finite Euclidean Graphs and Three Questions about Their Spectra
- 6 Random Walks on Cayley Graphs
- 7 Applications in Geometry and Analysis. Connections between Continuous and Finite Problems. Dido's Problem for Polygons
- 8 The Quadratic Reciprocity Law
- 9 The Fast Fourier Transform or FFT
- 10 The DFT on Finite Abelian Groups – Finite Tori
- 11 Error-Correcting Codes
- 12 The Poisson Sum Formula on a Finite Abelian Group
- 13 Some Applications in Chemistry and Physics
- 14 The Uncertainty Principle
- Part II Finite Nonabelian Groups
- References
- Index
2 - The Discrete Fourier Transform on the Finite Circle ℤ/nℤ
from Part I - Finite Abelian Groups
Published online by Cambridge University Press: 06 July 2010
- Frontmatter
- Contents
- Preface
- Part I Finite Abelian Groups
- 1 Congruences and the Quotient Ring of the Integers mod n
- 2 The Discrete Fourier Transform on the Finite Circle ℤ/nℤ
- 3 Graphs of ℤ/nℤ, Adjacency Operators, Eigenvalues
- 4 Four Questions about Cayley Graphs
- 5 Finite Euclidean Graphs and Three Questions about Their Spectra
- 6 Random Walks on Cayley Graphs
- 7 Applications in Geometry and Analysis. Connections between Continuous and Finite Problems. Dido's Problem for Polygons
- 8 The Quadratic Reciprocity Law
- 9 The Fast Fourier Transform or FFT
- 10 The DFT on Finite Abelian Groups – Finite Tori
- 11 Error-Correcting Codes
- 12 The Poisson Sum Formula on a Finite Abelian Group
- 13 Some Applications in Chemistry and Physics
- 14 The Uncertainty Principle
- Part II Finite Nonabelian Groups
- References
- Index
Summary
We come now to reality. The truth is that the digital computer has totally defeated the analog computer. The input is a sequence of numbers and not a continuous function. The output is another sequence of numbers, whether it comes from a digital filter or a finite element stress analysis or an image processor. The question is whether the special ideas of Fourier analysis still have a part to play, and the answer is absolutely yes.
G. Strang [1986, p. 290]First we consider the easiest kind of Fourier analysis – that on the additive group ℤ/nℤ, the integers modulo n. This is an abelian group of order n and it is cyclic (generated by the congruence class 1 mod n). Thus it is the simplest possible group for Fourier analysis. Yet it seems to have the most applications. As we saw in the last chapter, it may be viewed as the multiplicative group of nth roots of unity. This can be drawn as n equally spaced points on a circle of radius 1. Thus ℤ/nℤ is a finite analogue of the circle (or even of the real line).
The discrete Fourier transform on ℤ/nℤ, or DFT, arises whenever anyone needs to compute the classical Fourier series and integrals of sines and cosines. In fact, the first application of the discrete Fourier transform was perhaps A.-C. Clairaut's use of it in 1754 to compute an orbit, which can be considered as a finite Fourier series of cosines.
- Type
- Chapter
- Information
- Fourier Analysis on Finite Groups and Applications , pp. 30 - 45Publisher: Cambridge University PressPrint publication year: 1999