Title :
Reducing the number of operations in certain finite- field transforms (Corresp.)
Author :
Mandelbaum, David M.
fDate :
5/1/1984 12:00:00 AM
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;
Journal_Title :
Information Theory, IEEE Transactions on
DOI :
10.1109/TIT.1984.1056908