Title :
Algebraic-iterative Reed-Solomon trellis decoding
Author :
Kosmach, James J. ; Wicker, Stephen B.
Author_Institution :
Motorola Inc., Austin, TX, USA
Abstract :
A suboptimal soft-decision Reed-Solomon decoder for an RS(n,k) code is developed which searches the less complex trellis of a higher rate RS(n,k´) code where k´>k along with a set of hard-decision decoders. An exact expression for the number of edges and vertices for the minimal trellis of any RS code is given. The Viterbi trellis decoding complexity is determined for all RS codes. An expression for an approximate upper bound on the number of `arithmetic´ operations for the proposed RS decoder is given. The decoding complexity is compared with the Viterbi minimal trellis decoder
Keywords :
Reed-Solomon codes; Viterbi decoding; algebraic codes; computational complexity; iterative decoding; maximum likelihood decoding; trellis codes; RS code; Viterbi trellis decoding complexity; algebraic-iterative Reed-Solomon trellis decoding; decoding complexity; hard-decision decoders; minimal trellis; suboptimal soft-decision Reed-Solomon decoder; Arithmetic; Fading; Iterative algorithms; Iterative decoding; Maximum likelihood decoding; Maximum likelihood estimation; Probability density function; Reed-Solomon codes; Upper bound; Viterbi algorithm;
Conference_Titel :
Vehicular Technology Conference, 1999 IEEE 49th
Conference_Location :
Houston, TX
Print_ISBN :
0-7803-5565-2
DOI :
10.1109/VETEC.1999.778059
