Generalizing the discrete fourier transform
β Scribed by Thomas Beth
- Publisher
- Elsevier Science
- Year
- 1985
- Tongue
- English
- Weight
- 297 KB
- Volume
- 56
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
Spectral analysis is an important tool for examining time-series data and can be particularly powerful in detecting periodicity in animal behaviour patterns. Because of its simplicity and the speed of current computing algorithms, the discrete Fourier transform is most often used in spectral analysi
For conventional multiband encoding techniques such as Hadamard encoding, scan time scales linearly with the number of slices encoded simultaneously. In this work, a new multiband encoding technique called partial discrete Fourier transform (PDFT) encoding is introduced, which overcomes this restric
The discrete transformation LF x s f x s Γ 2n q 1 r2 P x F n , ns0 n Ε½ . where the P x 's denote the well-known Legendre polynomials, is an isomorphism n Ε½ . between the space L β«ήβ¬ of the complex-valued sequences of rapid descent and 0 ## Ε½ . the space L L y1, 1 of all infinitely differentiable