论文信息 - High-radix transforms for Reed-Solomon codes over Fermat primes (Corresp.)

High-radix transforms for Reed-Solomon codes over Fermat primes (Corresp.)

A method is proposed to streamline the transform decoding algorithm for Reed-Solomon (RS) codes of length equal to 2 raised to the power 2n. It is shown that a high-radix fast Fourier transform (FFT) type algorithm with generator equal to 3 on GF(F sub n), where F sub n is a Fermat prime, can be used to decode RS codes of this length. For a 256-symbol RS code, a radix 4 and radix 16 FFT over GF(F sub 3) require, respectively, 30 and 70% fewer modulo F sub n multiplications than the usual radix 2 FFT.

Trieu-Kien Truong | Irving S. Reed | Kuang Yung Liu

[1] Jørn Justesen,et al. On the complexity of decoding Reed-Solomon codes (Corresp.) , 1976, IEEE Trans. Inf. Theory.

[2] Trieu-Kien Truong,et al. The use of finite fields to compute convolutions , 1975, IEEE Trans. Inf. Theory.

[3] Elwyn R. Berlekamp,et al. Algebraic coding theory , 1984, McGraw-Hill series in systems science.

[4] G. David Forney,et al. Convolutional codes I: Algebraic structure , 1970, IEEE Trans. Inf. Theory.

[5] J. McClellan,et al. Hardware realization of a Fermat number transform , 1976 .

[6] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .

[7] Hideo Murakami,et al. A transform decoder for Reed-Solomon codes in multiple-user communication systems , 1977, IEEE Trans. Inf. Theory.

[8] G. D. Bergland,et al. A fast Fourier transform algorithm using base 8 iterations , 1968 .

[9] R. Singleton. An algorithm for computing the mixed radix fast Fourier transform , 1969 .

[10] Charles M. Rader,et al. Discrete Convolutions via Mersenne Transrorms , 1972, IEEE Transactions on Computers.

[11] L. Leibowitz. A simplified binary arithmetic for the Fermat number transform , 1976 .

[12] C. Burrus,et al. Number theoretic transforms to implement fast digital convolution , 1975 .