Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure(Cording Theory)(<Special Section>Information Theory and Its Applications)
スポンサーリンク
概要
- 論文の詳細を見る
In this letter, we show the effectiveness of a double-loop algorithm based on the concave-convex procedure (CCCP) in decoding linear codes. For this purpose, we numerically compare the error performance of CCCP-based decoding algorithm with that of a conventional iterative decoding algorithm based on belief propagation (BP). We also investigate computational complexity and its relation to the error performance.
- 社団法人電子情報通信学会の論文
- 2003-10-01
著者
-
Shibuya Tomoharu
R&D Department, National Institute of Multimedia Education
-
Sakaniwa Kohichi
The Deoartament Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- A Design of Near Perfect Reconstruction Linear-Phase QMF Banks Based on Hybrid Steepest Descent Method(Special Section on Digital Signal Processing)
- Extended Symbol-Aided Estimation for Non-selective Rayleigh Fading Channels
- An Analysis of a 16QAM System Using Extended Symbol-Aided Estimation under Rician Fading Channels
- Fast Acquisition of PN Sequences in DS/CDMA Systems(Regular Section)
- Simple Estimation for the Dimension of Subfield Subcodes of AG Codes
- A Simple Nonlinear Pre-Filtering for a Set-Theoretic Linear Blind Deconvolution Scheme(Special Section on Digital Signal Processing)
- Design of IRA codes with Joint Degree Distributions
- Detailedly Represented Irregular Low-Density Parity-Check Codes(Coding Theory)(Information Theory and Its Applications)
- A Fast Blind Multiple Access Interference Reduction in DS/CDMA Systems Based on Adaptive Projected Subgradient Method(Signal Processing for Communications)(Digital Signal Processing)
- Iterative Decoding Based on the Concave-Convex Procedure(Coding Theory)
- On Tanner's Lower Bound for the Minimum Distance of Regular LDPC Codes Based on Combinatorial Designs(Coding Theory)(Information Theory and Its Applications)
- A Dual of Well-Behaving Type Designed Minimum Distance
- Performance of a Decoding Algorithm for LDPC Codes Based on the Concave-Convex Procedure(Cording Theory)(Information Theory and Its Applications)
- Fast Encoding of Algebraic Geometry Codes(Special Section on Information Theory and Its Applications)
- Some Notes on the CCCP Decoding of Linear Codes
- A Fast Neural Network Learning with Guaranteed Convergence to Zero System Error (Special Section on Information Theory and Its Applications)
- A Note on a Lower Bound for Generalized Hamming Weights
- Simple Nonbinary Coding Strategy for Very Noisy Relay Channels
- Analysis of Error Floors for Non-binary LDPC Codes over General Linear Group through q-Ary Memoryless Symmetric Channels