Cart (Loading....) | Create Account
Close category search window

Semi-Fast Fourier Transforms over GF(2m).

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)
Sarwate, D.V. ; Coordinated Science Laboratory and the Department of Electrical Engineerig, University of Illinois

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

Need Help?

IEEE Advancing Technology for Humanity 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 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.