Soft-Decision Decoding Algorithm for Binary Linear Block Codes

スポンサーリンク

概要

• 論文の詳細を見る

• A soft-decision decoding algorithm for binary linear block codes is proposed. This algorithm seeks to minimize the block error probability. With careful examinations of the first hard-decision decoded results, the candidate codewords are efficiently searched for. Thus, we can reduce the decoding complexity (the number of hard-decision decodings) and lower the block error probability. Computer simulation results are presented for the (23,12) Golay code. They show that the decoding complexity is considerably reduced and the block error probability is close to that of the maximum likelihood decoder.

• 社団法人電子情報通信学会の論文
• 1993-11-25

著者

• Shim Yonggeol

  The Department Of Electronics Engineering Dankook University

• Lee ChoongWoong

  the Department of Electronics Engineering, Seoul National University

• Lee Choongwoong

  The Department Of Electronics Engineering Seoul National University

関連論文

• Soft-Decision Decoding Algorithm for Binary Linear Block Codes

スポンサーリンク