Semi-Fast Fourier Transforms over GF(2&lt;sup&gt;m&lt;/sup&gt;).

D.V. Sarwate

doi:10.1109/TC.1978.1675088

Publication
1978
Issue No. 3 - March
Abstract - Semi-Fast Fourier Transforms over GF(2<sup>m</sup>).

	This Article
	Subscribers, please Login Purchase article: $19 PDF IEEE Xplore Subscribers RSS feed
	Share
	Email this Article to a friend
	Bibliographic References
	ASCII Text BibTex RefWorks Procite/RefMan/EndNote
	Add to:
	Digg Furl Spurl Blink Simpy Google Del.icio.us Y!MyWeb
	Search
	Similar Articles Articles by D.V. Sarwate

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

March 1978 (vol. 27 no. 3)

pp. 283-285

	ASCII Text	x
	D.V. Sarwate, "Semi-Fast Fourier Transforms over GF(2<sup>m</sup>).," IEEE Transactions on Computers, vol. 27, no. 3, pp. 283-285, March, 1978.

	BibTex	x
	@article{ 10.1109/TC.1978.1675088, author = {D.V. Sarwate}, title = {Semi-Fast Fourier Transforms over GF(2<sup>m</sup>).}, journal ={IEEE Transactions on Computers}, volume = {27}, number = {3}, issn = {0018-9340}, year = {1978}, pages = {283-285}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675088}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }

	RefWorks Procite/RefMan/Endnote	x
	TY - JOUR JO - IEEE Transactions on Computers TI - Semi-Fast Fourier Transforms over GF(2<sup>m</sup>). IS - 3 SN - 0018-9340 SP283 EP285 EPD - 283-285 A1 - D.V. Sarwate, PY - 1978 KW - Fourier transforms KW - Analysis of algorithms KW - computational complexity KW - error-correcting codes KW - finite fields VL - 27 JA - IEEE Transactions on Computers ER -

D.V. Sarwate, Coordinated Science Laboratory and the Department of Electrical Engineerig, University of Illinois

DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TC.1978.1675088

An algorithm which computes the Fourier transform of a sequence of length n over GF(2^m) using approximately 2nm multiplications and n²+ nm additions is developed. The number of multiplications is thus considerably smaller than the n²multiplications required for a direct evaluation, though the number of additions is slightly larger. Unlike the fast Fourier transform

Index Terms:

Fourier transforms, Analysis of algorithms, computational complexity, error-correcting codes, finite fields

Citation:

D.V. Sarwate, "Semi-Fast Fourier Transforms over GF(2^m).," IEEE Transactions on Computers, vol. 27, no. 3, pp. 283-285, March 1978, doi:10.1109/TC.1978.1675088

Peer Review Notice | Give Us Feedback

Usage of this product signifies your acceptance of the Terms of Use.