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 numberof 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 RSdecoder is given. The decoding complexity is compared with the Viterbi minimal trellis decoder.
展开▼
