Fast algorithm for computer complex number-theoretic transforms
- 12 May 1977
- journal article
- Published by Institution of Engineering and Technology (IET) in Electronics Letters
- Vol. 13 (10) , 278-280
- https://doi.org/10.1049/el:19770205
Abstract
A high-radix f.f.t. algorithm for computing transforms over GF(q2), where q is a Mersenne prime, is developed to implement fast circular convolutions. This new algorithm requires substantially fewer multiplications than the conventional f.f.t.Keywords
This publication has 0 references indexed in Scilit: