Using Loosely Triangular Form in Encoding LDPC codes with the LU-decomposition
スポンサーリンク
概要
- 論文の詳細を見る
A permutation strategy for an encoding algorithm of LDPC codes is discussed. The encoding algorithm, proposed by the author, computes parity check symbols by making use of the LU-decomposition of a parity check matrix. To make the algorithm efficient, it is crucial to transform the parity check matrix so that its LU-factors become as sparse as possible. In this paper, we consider to transform the matrix to "loosely triangular" form, and observe how the complexity of the algorithm changes.
- 社団法人電子情報通信学会の論文
- 2005-05-18
著者
-
Kaji Yuichi
Nara Institute Of Science And Technology
-
Kaji Yuichi
Nara Inst. Of Sci. And Technol. Ikoma‐shi Jpn
関連論文
- A Time-Limited Key Management Scheme Based on a One-Way Permutation Tree
- Layered Transducing Term Rewriting System and Its Recognizability Preserving Property (Special Issue on Selected Papers from LA Symposium)
- Termination Property of Inverse Finite Path Overlapping Term Rewriting System is Decidable
- Finite State Translation Systems and Parallel Multiple Context-Free Grammars
- FOREWORD
- Using Loosely Triangular Form in Encoding LDPC codes with the LU-decomposition
- On the minimum weight of a certain subclass of array LDPC Codes
- A minimum weight test for a certain subclass of array LDPC codes(HISC2006)
- FEC-Based Reliable Transmission for Multiple Bursts in OBS Networks(Switching for Communications)
- Error Control for High-density Monochrome Two-dimensional Barcodes
- Encoding LDPC Codes Using the Triangular Factorization(Coding Theory,Information Theory and Its Applications)