Fast, efficient Fermat number transform used to compute F'(x) analogous to computation of syndrome in conventional decoding scheme. Eliminates polynomial multiplications and reduces number of multiplications in reconstruction of F'(x) to n log (n). Euclidean algorithm used to evaluate F(x) directly, without going through intermediate steps of solving error-locator and error-evaluator polynomials. Algorithm suitable for implementation in very-large-scale integrated circuits.
Fast Transform Decoding Of Nonsystematic Reed-Solomon Codes
NASA Tech Briefs ; 16 , 4
1992-04-01
Miscellaneous
No indication
English
Nonsystematic convolutional codes for sequential decoding in space applications
Tema Archive | 1971
|A decoding procedure for the Reed-Solomon codes
TIBKAT | 1978
|Mapping Between Distinct Reed-Solomon Codes
Online Contents | 1994
NTRS | 1986
|Soft Decoding of Reed-Solomon Codes: Applications to the DVB-RCS standard
British Library Conference Proceedings | 2001
|