Referenced Items are not available for this document.
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, this method does not depend on the factors of n and can be used when n is not highly composite or is a prime.
Published in:
Computers, IEEE Transactions on
(Volume:C-27
,
Issue:
3
)
Date of Publication: March 1978
- Page(s):
- 283 - 285
- ISSN :
- 0018-9340
- Digital Object Identifier :
- 10.1109/TC.1978.1675088
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 21 August 2006
- Issue Date :
- March 1978
- Sponsored by :
- IEEE Computer Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
