Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
スポンサーリンク
概要
- 論文の詳細を見る
A parity check matrix for a binary linear code defines a bipartite graph (Tanner graph) which is isomorphic to a subgraph of a factor graph which explains a mechanism of the iterative decoding based on the sum-product algorithm. It is known that this decoding algorithm well approximates MAP decoding, but degradation of the approximation becomes serious when there exist cycles of short length, especially length 4, in Tanner graph. In this paper, based on the generating idempotents, we propose some methods to design parity check matrices for cyclic codes which define Tanner graphs with no cycles of length 4. We also show numerically error performance of cyclic codes by the iterative decoding implemented on factor graphs derived from the proposed parity check matrices.
- 社団法人電子情報通信学会の論文
- 2003-04-01
著者
-
Sakaniwa Kohichi
Departmen Of Communications And Integrated Systems Tokyo Institute Of Technology
-
Shibuya Tomoharu
Department Of Communications And Integrated Systems Tokyo Institute Of Technology
関連論文
- A Higher Order Generalization of an Alias-Free Discrete Time-Frequency Analysis(Special Section on Digital Signal Processing)
- A Note on Constrained Least Squares Design of M-D FIR Filter Based on Convex Projection Techniques(Special Section on Digital Signal Processing)
- CONSTRAINED LEAST SQUARES DESIGN OF M-D FIR FILTER BASED ON CONVEX PROJECTION TECHNIQUES
- A-6-2 Modified Cancellation for Non-Binary LDPC Codes
- Encoding of Linear Codes Based on the Rearrangement of Block-Triangularized Parity-Check Matrices
- On Generalized Hamming Weights of Codes Constructed on Affine Algebraic Varieties (Special Section on Information Theory and Its Applications)
- Fast Acquisition of PN Sequences in DS-CDMA Systems with Incoherent Demodulator(Wireless Communication Technologies)
- An Associative Memory Neural Network to Recall Nearest Pattern from Input
- An Improved Bound for the Dimension of Subfield Subcodes
- A Set-Theoretic Blind Image Deconvolution Based on Hybrid Steepest Descent Method (Special Section on Digital Signal Processing)
- Multi-edge type LDPC code ensembles with exponentially few codewords of linear small weight (情報理論)
- A note on analytical solution of covariance evolution for regular LDPC codes (情報理論)
- Performance Analysis of LDPC Code Ensembles with Support Weight Distribution
- A-6-1 Design of Irregular LDPC Codes with Uniform Check Node Degree Distributions
- Design of IRA codes with Joint Degree Distributions
- Iterative Decoding Based on the Concave-Convex Procedure(Coding Theory)
- Justesen-Type Modified Expander Codes and Their Decoding Algorithm(Coding Theory, Information Theory and Its Applications)
- On the Performance of Algebraic Geometric Codes
- A Note on Robust Adaptive Volterra Filtering Based on Parallel Subgradient Projection Techniques(Digital Signal Processing)
- A Lower Bound for Generalized Hamming Weights and a Condition for t-th Rank MDS
- Some Classes of Quasi-Cyclic LDPC Codes : Properties and Efficient Encoding Method(Coding Theory)
- On the size of circulant matrices for which reversible codes exist (ワイドバンドシステム)
- Construction of Cyclic Codes Suitable for Iterative Decoding via Generating Idempotents
- Characterization of Factor Graph by Mooij's Sufficient Condition for Convergence of the Sum-Product Algorithm
- Improvement of Extended Symbol-Aided Estimation for Rayleigh Fading Channels (Special Section on Information Theory and Its Applications)
- Sufficient conditions for convergence of the sum-product decoding (情報理論)
- On the size of circulant matrices for which reversible codes exist (情報処理)
- Sufficient conditions for convergence of the sum-product decoding (情報セキュリティ)
- On the size of circulant matrices for which reversible codes exist (情報セキュリティ)
- Sufficient conditions for convergence of the sum-product decoding (ワイドバンドシステム)
- Rate-Compatible Non-Binary LDPC Codes for Rate Adaptive Systems
- Analysis of Stopping Constellation Distribution for Irregular Non-binary LDPC Code Ensemble
- Ring Theoretic Approach to Reversible Codes Based on Circulant Matrices
- Design and Performance of Rate-Compatible Non-binary LDPC Convolutional Codes
- Spatially Coupled Protograph-Based LDPC Codes for Decode-and-Forward in Erasure Relay Channel
- On the dependence of error performance of spatially coupled LDPC codes on their design parameters
- On the Dependence of Error Performance of Spatially Coupled LDPC Codes on Their Design Parameters