Name
Abstract | ||
|---|---|---|
An algorithm which computes the Fourier transform of a sequence of length n over GF(2m) using approximately 2nm multiplications and n2+ nm additions is developed. The number of multiplications is thus considerably smaller than the n2multiplications required for a direct evaluation, though the number of additions is slightly larger. Unlike the fast Fourier transform |
Year | DOI | Venue |
|---|---|---|
1978 | 10.1109/TC.1978.1675088 | IEEE Transactions on Computers |
Keywords | DocType | Volume |
length n,Semi-Fast Fourier Transforms,nm addition,direct evaluation | Journal | 27 |
Issue | ISSN | Citations |
3 | 0018-9340 | 4 |
PageRank | References | Authors |
0.52 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| D. V. Sarwate | 1 | 431 | 121.44 |