A Stopping Criterion for Low-Density Parity-Check Codes

スポンサーリンク

概要

• 論文の詳細を見る

• We propose a new stopping criterion for decoding LDPC codes which consists of a measure of decoder behaviors and a decision rule to predict decoding failure. We will show that the proposed measure, the number of satisfied check nodes, does not need (or minimizes) additional complexity, and the decision rule is efficient and more importantly channel independent, which was not possible in the previous work.

• （社）電子情報通信学会の論文
• 2008-04-01

著者

• Lee Hyuckjae

  School Of Engineering Information And Communications University

• Heo Kyoungwoo

  School Of Engineering Information And Communications University

• SHIN Donghyuk

  School of Engineering, Information and Communications University

• HA Jeongseok

  School of Engineering, Information and Communications University

• Ha Jeongseok

  School Of Engineering Information And Communications University

• Shin Donghyuk

  School Of Engineering Information And Communications University

関連論文

• Low Complexity Fano-Based Detection Algorithm with Iterative Structure for V-BLAST Systems
• Efficient Transmit Power Allocation with Partial Feedback for Closed-Loop SQRD Based V-BLAST Systems
• A Stopping Criterion for Low-Density Parity-Check Codes

スポンサーリンク