The classical Fourier transform is, in essence, a way to take data and extract components (in the form of complex exponentials) which are invariant under cyclic shifts. We consider a case in which the components must instead be invariant under automorphisms of a binary tree. We present a technique by which a slightly relaxed form of the generalized Fourier transform in this case can eventually be computed using only simple tools from linear algebra, which has possible advantages in computational efficiency.
| Identifer | oai:union.ndltd.org:CLAREMONT/oai:scholarship.claremont.edu:hmc_theses-1149 |
| Date | 01 May 2003 |
| Creators | Eldredge, Nate |
| Publisher | Scholarship @ Claremont |
| Source Sets | Claremont Colleges |
| Detected Language | English |
| Type | text |
| Format | application/pdf |
| Source | HMC Senior Theses |
Page generated in 0.0023 seconds