Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Log inSign up
Challenges
Datasets
Workspaces
Papers
Discussions
Leaderboard
Blog
Job Board
Q3AS

© 2026 Aqora Quantum S.A.S.

TermsPrivacyLegal Notice

統計数理

最適化手法に基づく誤り訂正符号の復号アルゴリズムについて (特集 最適化技術に基づく統計的推論)

正 和田山

Published Jun 1, 2013• 0 citations
OpenAlex

Abstract

月 28 日;改訂 8 月 28 日;採択 9 月 5 日) 要 旨 近年,線形計画法などの連続最適化に基づく誤り訂正符号の復号法が登場し,符号理論研究 者の注目を集めている.本稿では,著者の提案する内点法に基づく LDPC 符号 (Low-Density Parity-Check 符号) の復号法の概要とその特徴を紹介する.この復号法 (内点復号法) は,LDPC 符号の復号問題を凸計画問題として定式化し,バリア関数に基づく主パス追跡内点法により近 似的にその凸計画問題を高速に解く,という考え方に基づいて構成されている.本復号アルゴ リズムは,線形ベクトル通信路の範疇に入る定常無記憶通信路,シンボル間干渉通信路,MIMO 通信路,マルチプルアクセス通信路など様々な通信路に適用が可能であり,幅広い応用が期待 されている. キーワード: 内点法,凸計画問題,低密度パリティ検査符号. 1. 緒言

Related papers

量子誤り訂正符号を用いたエンタングルメント蒸留プロトコルの性能評価に関する検討(LDPC符号,一般)

雅一 吉田, 学 萩原, 隆之 宮寺 +1 more

Information technology newsletter•Sep 14, 2010•0 citations

低密度パリティ検査符号とその復号法 : LDPC(Low density parity check)符号/sum-product復号法

正 和田山, トリケップス企画部

トリケップス eBooks•Jan 1, 2002•0 citations

メッセージ伝播型復号法に効果的な非正則LDPC符号の構成法と復号順序の決定法(フレッシュマンセッション,フレッシュマンセッション,一般)

祐樹 谷口, 剛 細谷, 正幸 後藤 +1 more

Information technology newsletter•Jul 16, 2009•0 citations

Low-complexity iterative detection and decoding in finite geometry LDPC-coded MIMO systems

Nuwan Balasuriya, Pradeepa Yahampath, Telex M. N. Ngatched +1 more

This paper presents a low-complexity iterative joint detection and decoding algorithm for finite geometry-low density parity check (FG-LDPC) coded multiple-input multiple-output (MIMO) systems, in which the MIMO channel detector and the FG-LDPC decoder iteratively exchange soft information. The key to the simplicity of the algorithm is the use of a bit flipping-based decoder for FG-LDPC code. An important issue addressed here is the generation of soft information from the binary outputs of the bit-flipping decoder to be fed back to the MIMO detector. Simulation results show that the proposed joint detection and decoding algorithm achieves a substantial reduction in decoding error probability compared to a cascaded detector and a decoder. We also compare the performance with belief-propagation (BP) based detector-decoders which are significantly more complex. The new algorithm provides a practical approach to joint detection and decoding of popular FG-LDPC codes in a MIMO system, a task which is computationally unmanageable with a BP algorithm.

IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC)•Sep 1, 2009•2 citations

Symbol-based BP detection for MIMO systems associated with non-binary LDPC codes

Ali Haroun, Charbel Abdel Nour, Matthieu Arzel +1 more

In this paper, an efficient iterative receiver for digital communication systems is investigated. It combines a Non-Binary Low-Density Parity-Check (NB-LDPC) decoder with a high-order constellation demapper and a Multiple-Input Multiple-Output (MIMO) detector. A suboptimal MIMO detector based on the Belief Propagation (BP) algorithm is investigated as an alternative to a Maximum Likelihood (ML) detector. Extrinsic information is exchanged between the detector and the decoder thanks to an iterative process. EXtrinsic Information Transfer (EXIT) charts enable to analyze the convergence behaviour of the proposed MIMO-BP detector. A suitable schedule for the different types of iterations is finally proposed to reduce the receiver latency and improve its error correction performance.

IEEE Wireless Communications and Networking Conference•Apr 1, 2014•13 citations

詳細に規定された非正則LDPC符号アンサンブルに対する残余グラフ次数分布の解析

隆之 野崎, T. Nozaki, 健太 笠井 +3 more

•Oct 1, 2007•0 citations
月 28 日;改訂 8 月 28 日;採択 9 月 5 日) 要 旨 近年,線形計画法などの連続最適化に基づく誤り訂正符号の復号法が登場し,符号理論研究 者の注目を集めている.本稿では,著者の提案する内点法に基づく LDPC 符号 (Low-Density Parity-Check 符号) の復号法の概要とその特徴を紹介する.この復号法 (内点復号法) は,LDPC 符号の復号問題を凸計画問題として定式化し,バリア関数に基づく主パス追跡内点法により近 似的にその凸計画問題を高速に解く,という考え方に基づいて構成されている.本復号アルゴ リズムは,線形ベクトル通信路の範疇に入る定常無記憶通信路,シンボル間干渉通信路,MIMO 通信路,マルチプルアクセス通信路など様々な通信路に適用が可能であり,幅広い応用が期待 されている. キーワード: 内点法,凸計画問題,低密度パリティ検査符号. 1. 緒言
This paper presents a low-complexity iterative joint detection and decoding algorithm for finite geometry-low density parity check (FG-LDPC) coded multiple-input multiple-output (MIMO) systems, in which the MIMO channel detector and the FG-LDPC decoder iteratively exchange soft information. The key to the simplicity of the algorithm is the use of a bit flipping-based decoder for FG-LDPC code. An important issue addressed here is the generation of soft information from the binary outputs of the bit-flipping decoder to be fed back to the MIMO detector. Simulation results show that the proposed joint detection and decoding algorithm achieves a substantial reduction in decoding error probability compared to a cascaded detector and a decoder. We also compare the performance with belief-propagation (BP) based detector-decoders which are significantly more complex. The new algorithm provides a practical approach to joint detection and decoding of popular FG-LDPC codes in a MIMO system, a task which is computationally unmanageable with a BP algorithm.
In this paper, an efficient iterative receiver for digital communication systems is investigated. It combines a Non-Binary Low-Density Parity-Check (NB-LDPC) decoder with a high-order constellation demapper and a Multiple-Input Multiple-Output (MIMO) detector. A suboptimal MIMO detector based on the Belief Propagation (BP) algorithm is investigated as an alternative to a Maximum Likelihood (ML) detector. Extrinsic information is exchanged between the detector and the decoder thanks to an iterative process. EXtrinsic Information Transfer (EXIT) charts enable to analyze the convergence behaviour of the proposed MIMO-BP detector. A suitable schedule for the different types of iterations is finally proposed to reduce the receiver latency and improve its error correction performance.