Citation
Abstract
Fourier-like transforms over GF(F,,), where F, = 2°" + 1 is a Fermat prime, have found application in decoding Reed-Solomon codes. It is shown here that such transforms can be computed using high-radix fast Fourier transform (FFT) algorithms requiring considerably fewer multiplications than the more usual radix 2 FFT algorithm. A special 256-symbol, 16-symbol-error-correcting, ReedSolomon (RS) code for space communication-link applications can be encoded and decoded using this high-radix FFT algorithm over GF(F;).
Details
- Volume
- 42-36
- Published
- December 15, 1976
- Pages
- 75–80
- File Size
- 398.0 KB