On construction of concatenated low-density generator matrix codes

Yusuke Kumano, Tomoaki Ohtsuki

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publication2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, Conference Proceedings, PACRIM
Pages442-445
Number of pages4
DOIs
Publication statusPublished - 2007 Dec 1
Event2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM - Victoria, BC, Canada
Duration: 2007 Aug 222007 Aug 24

Publication series

NameIEEE Pacific RIM Conference on Communications, Computers, and Signal Processing - Proceedings

Other

Other2007 IEEE Pacific Rim Conference on Communications, Computers and Signal Processing, PACRIM
Country/TerritoryCanada
CityVictoria, BC
Period07/8/2207/8/24

ASJC Scopus subject areas

  • Signal Processing
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'On construction of concatenated low-density generator matrix codes'. Together they form a unique fingerprint.

Cite this