Efficient complexity reduction technique in trellis decoding algorithm

Satellite Commun. Syst. Dept., Electron. & Telecommun. Res. Inst., Daejeon
Electronics Letters (Impact Factor: 1.04). 02/1999; DOI: 10.1049/el:19990081
Source: IEEE Xplore

ABSTRACT An efficient reduced search trellis decoding algorithm in which
the decoder selects a part of existing paths by using a threshold value
of the path metric is proposed. The threshold value at each time stage
of the trellis is found by simply investigating the statistics of the
path metrics, and does not require any prior knowledge such as the
signal-to-noise ratio

  • [Show abstract] [Hide abstract]
    ABSTRACT: In this paper, we propose an efficient reduced-search SOVA (soft output Viterbi algorithm) for block turbo codes. To reduce complexity, the decoder selects a part of the existing paths using the statistics of the path metrics. In addition, we compensate for the performance degradation incurred from soft output values at the parity part of the trellis that were too optimistically estimated, so that the performance of the reduced-search decoder almost approximates that of a full-search decoder. Our simulation results reveal that the proposed reduced-search method can reduce the complexity by about 10 times with just about 0.1dB performance degradation in coding gain.
    Communications, 2003. ICC '03. IEEE International Conference on; 06/2003