By Topic

On Construction of Concatenated Low-Density Generator Matrix Codes

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kumano, Yusuke ; Keio Univ., Yokohama ; Ohtsuki, T.

Low-density generator-matrix (LDGM) codes have advantages - fast encoding and parallel decoding, however the performance of the LDGM code is asymptotically bad. This problem can be solved by concatenating two LDGM codes serially. However, little is known about the construction of the concatenated LDGM codes - component LDGM codes, the combination of inner and outer coding rates, inner and outer code weights. In this paper, we investigate the parity check matrix of component LDGM codes that suited to concatenated LDGM codes. We also investigate appropriate combination of inner and outer coding rates and inner and outer code weights, and so on. In addition, we investigate how to set the maximum number of inner and outer iterations for concatenated LDGM codes. Our results are useful for the construction of concatenated LDGM codes.

Published in:

Communications, Computers and Signal Processing, 2007. PacRim 2007. IEEE Pacific Rim Conference on

Date of Conference:

22-24 Aug. 2007