Citation
Abstract
A high-radix FFT algorithm for computing transforms over GF(q?), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional FFT.
Details
- Volume
- 42-39
- Published
- June 15, 1977
- Pages
- 71–75
- File Size
- 350.1 KB