An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values


The KIPS Transactions:PartC, Vol. 11, No. 1, pp. 75-80, Feb. 2004
10.3745/KIPSTC.2004.11.1.75,   PDF Download:

Abstract

An iterative soft-decision decoding algorithm of block codes is proposed. With careful examinations of the first hard-decision decoding result, the candidate codewords are efficiently searched for. An approach to reducing decoding complexity and lowering error probability is to select a small number of candidate codewords. With high probability, we include the codewords which are at the short distance from the received signal. The decoder then computes the distance to each of the candidate codewords and selects the codeword which is the closest. We can search for the candidate codewords which make the error patterns contain the bits with small reliability values. Also, we can reduce the cases that we select the same candidate codeword already searched for. Computer simulation results are presented for (23, 12) Golay code. They show that decoding complexity is considerly reduced and the block error probability is lowered.


Statistics
Show / Hide Statistics

Statistics (Cumulative Counts from September 1st, 2017)
Multiple requests among the same browser session are counted as one view.
If you mouse over a chart, the values of data points will be shown.


Cite this article
[IEEE Style]
S. Y. Geol, "An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values," The KIPS Transactions:PartC, vol. 11, no. 1, pp. 75-80, 2004. DOI: 10.3745/KIPSTC.2004.11.1.75.

[ACM Style]
Sim Yong Geol. 2004. An Iterative Soft-Decision Decoding Algorithm of Block Codes Using Reliability Values. The KIPS Transactions:PartC, 11, 1, (2004), 75-80. DOI: 10.3745/KIPSTC.2004.11.1.75.