Many fast algorithms have been proposed for computing the discrete Fourier transformation. Most of them are based on factorization with the goal of reducing the number of multiplications. They usejoating point arithmetic to avoid repetitious scaling and a sizeable wordlength to minimize quantization
Multiple radix fast fourier transformation based on number theoretic transforms
β Scribed by Brooks Lawrence; Robert Polge; Reza Adhami
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 476 KB
- Volume
- 328
- Category
- Article
- ISSN
- 0016-0032
No coin nor oath required. For personal study only.
β¦ Synopsis
A multi-radix ,fust Fourier transform/number theoretic transftirm is proposed ,ftir the calculation of the discrete Fourier transform of sequences with a prime length, P. The proposed technique is applicable to sequences of length P = 2"' * 3K2* SK3+ 1, where Kl, K2 and K3 are integers. Advantages include availability of fast algorithms for a set of prime lengths, residue arithmetic with benefit in speed and hardware cost andparallel implementation. A Discrete Power Spectrum example is included.
π SIMILAR VOLUMES
## Abstract This article presents an efficient hybrid method with the IEβFFT algorithm for solving scattering and radiation problems of wire antennas mounted on electrically large platforms. To model arbitrary metallic structures, including wire antennas and both open and closed surfaces, in this m
## Abstract Operation of any mass spectrometer requires implementation of mass calibration laws to translate experimentally measured physical quantities into a __m__/__z__ range. While internal calibration in Fourier transform ion cyclotron resonance mass spectrometry (FTβICRβMS) offers several att