DocumentCode
938855
Title
Reducing the number of operations in certain finite- field transforms (Corresp.)
Author
Mandelbaum, David M.
Volume
30
Issue
3
fYear
1984
fDate
5/1/1984 12:00:00 AM
Firstpage
546
Lastpage
547
Abstract
It is shown how the use of relatively sparse polynomials, including p-polynomials and trace polynomials, can be used as intermediate divisors in the Goertzel transform over a finite field to reduce the number of additions. The number of multiplications can also be reduced if the characteristic of the field is larger than two. These methods can also be used in preliminary stages of a finite-field Winograd transform. Applications are for the decoding of Reed-Solomon and Bose-Chaudhuri-Hocquenghen codes in the spectral mode.
Keywords
DFT; Discrete Fourier transforms (DFT´s); Galois fields; Polynomials; Reed-Solomon coding; Aerospace electronics; Decoding; Discrete Fourier transforms; Discrete transforms; Galois fields; Notice of Violation; Polynomials; Protection; Reed-Solomon codes; Research and development;
fLanguage
English
Journal_Title
Information Theory, IEEE Transactions on
Publisher
ieee
ISSN
0018-9448
Type
jour
DOI
10.1109/TIT.1984.1056908
Filename
1056908
Link To Document