The advent of turbo decoding techniques has revived the interest in soft-input soft-output (SISO) decoders that are capable of outputting reliability information (soft decisions). A classical way of implementing a SIS...
详细信息
ISBN:
(纸本)0780383443
The advent of turbo decoding techniques has revived the interest in soft-input soft-output (SISO) decoders that are capable of outputting reliability information (soft decisions). A classical way of implementing a SISO decoder for a linear block code is to use a trellis-based decodingalgorithm, such as MAP, Max-Log-MAP or SOVA [1]. Recently, the idea of sectionalizing the trellis diagram representing a code has been proposed as a means to decrease the decoding complexity associated with the SISO decoders [1], [2]. In this paper, we investigate the application of a nonbinary SOVA decodingalgorithm [3] to the sectionalized trellis of a binary linear block code. We generalize the nonbinary SOVA to a code with time-varying symbol set. Based on the above study, we also derive a new simplified algorithm, called the Nonbinary SOVA with Bit-Level Reliabilities (NSOVA with BLR), that we also investigate in terms of complexity for a serial and a parallel implementation. Based on the computational complexity figures for both algorithms,, we show that optimal sectionalizations can be found, that minimize the computational complexity entailed when using these algorithms for decoding.
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 tre...
详细信息
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.
暂无评论