Low Complexity Encoding Based on Richardson's LDPC Codes(Fundamental Theories for Communications)

スポンサーリンク

概要

• 論文の詳細を見る

• The key weakness of Low-Density Parity Check codes is the complexity of the encoding scheme. The generator matrices can be made by Gaussian elimination of parity check matrices for normal block codes. Richardson succeeded in making parity bits from parity check matrices by the low density computation. In this letter, we focus on the execution of numerical experiments which show that even if the matrix D, which is the part of the Richardson's LDPC matrix, is restricted, proposed LDPC codes is lower complexity than Richardson's LDPC codes. The constraint of D results in reducing complexity from O(n+g^2) to O(n) due to the omission of computing inverse matrices of φ and T in Richardson's encoding scheme. All the sub-matrices in parity check matrix are composed of Circulant Permutation Matrices based on Galois Fields.

• 社団法人電子情報通信学会の論文
• 2007-08-01

著者

• LEE Moon

  Institute of Information & Communication, Chonbuk National University

• Yoo Hyunseuk

  Chonbuk National Univ. Kor

• YOO Hyunseuk

  Department of Information & Communication Engineering, Chonbuk National University

• CHOE Chang

  Department of Information Security, Chonbuk National University

• Choe Chang

  Department Of Information Security Chonbuk National University

• Lee Moon

  Institute Of Agricultural Sciences Office Of Rural Development Suweon

関連論文

• Fast Jacket Transform Algorithm Based on Simple Matrices Factorization(Digital Signal Processing)
• New Polynomial Construction of Jacket Transform
• ARGON PLASMA COAGULATION FOR THE ENDOSCOPIC TREATMENT OF A NON-RESECTABLE KLATSKIN TUMOR : IN VITRO AND IN VIVO STUDY
• Efficient Encoding Architecture for IEEE 802.16e LDPC Codes
• Multiuser Detection Based on Particle Swarm Optimization Algorithm over Multipath Fading Channels(Wireless Communication Technologies)
• 2-D Laplace-Z Transformation(Digital Signal Processing)
• Construction of Dual OVSF Codes with Lower Correlations(Coding Theory)
• Recursive Estimation of the Partial Clipping Noise in IDMA System with Limited Peak
• Remark about Transition Probabilities Calculation for Single Server Queues with Lognormal Inter-Arrival or Service Time Distributions
• Doubly Stochastic Processing on Jacket Matrices(General Fundamentals and Boundaries)
• Fast Decoding of the p-Ary First-Order Reed-Muller Codes Based on Jacket Transform
• Nonlinear Control of Active Queue Management for Multiple Bottleneck Network(Fundamental Theories for Communications)
• Low Complexity Encoding Based on Richardson's LDPC Codes(Fundamental Theories for Communications)
• A Class of Cocyclic Quasi Jacket Block Matrix(Digital Signal Processing)
• Design LDPC Codes on u/u+υ Construction(Coding Theory)
• A New Class of Bent Functions(Spread Spectrum Technologies and Applications)
• Low Complexity MIMO-LDPC CDMA Systems over Multipath Channels(Wireless Communication Technologies)
• QPSK Differential Space Time Coding on Different Unitary Matrices Sets and Initializations(Coding Theory)
• A High Rate Transmission for Space-Time Block Coding with One Additional Bit Information
• FAUNA OF SPIDERS IN A PADDY FIELD IN SUWEON, KOREAI’

もっと見る 閉じる

スポンサーリンク