An Efficient Algorithm for Soft-Decision Decoding of Linear Block Codes


The KIPS Transactions:PartC, Vol. 10, No. 1, pp. 27-32, Feb. 2003
10.3745/KIPSTC.2003.10.1.27,   PDF Download:

Abstract

An efficient soft-decision decoding algorithm for binary block codes is proposed. The proposed soft-decision decoding algorithm is implemented by a series of hard-decision decoding process. By the hard-decision decoding result, the candidate codewords are efficiently searched for. A new decoding method, which prevents the missing of the candidate codeword, is proposed. Also, the method for reducing complexity is developed. This method removes the practical complexity increase caused by the improved algorithm. These facts are confirmed by the simulation results for binary (63, 36) BCH code.


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]
Y. G. Shim, "An Efficient Algorithm for Soft-Decision Decoding of Linear Block Codes," The KIPS Transactions:PartC, vol. 10, no. 1, pp. 27-32, 2003. DOI: 10.3745/KIPSTC.2003.10.1.27.

[ACM Style]
Yong Geol Shim. 2003. An Efficient Algorithm for Soft-Decision Decoding of Linear Block Codes. The KIPS Transactions:PartC, 10, 1, (2003), 27-32. DOI: 10.3745/KIPSTC.2003.10.1.27.