A discrete Fourier transform, or DFT, is an isomorphism from a group algebra to a direct sum of matrix algebras. An algorithm that efficiently applies a DFT is called a fast Fourier transform, or FFT. The concept of a DFT will be introduced and examined from both a general and algebraic perspective. We will then present and analyze a specific FFT for the symmetric group.
Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1182 |
Date | 01 May 2006 |
Creators | Brand, Tristan |
Publisher | Scholarship @ Claremont |
Source Sets | Claremont Colleges |
Detected Language | English |
Type | text |
Format | application/pdf |
Source | HMC Senior Theses |
Page generated in 0.0019 seconds