LCD codes and iterative decoding by projections, a first step towards an intuitive description of iterative decoding

Jalal Etesami, Fangning Hu, Werner Henkel

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

From our earlier works, we know that in the case of analog codes, a Turbo-like iterative decoding can be nicely illustrated as iterative projections onto super codes that correspond to parts of the parity check matrix. So-called LCD (linear code with complementary dual) codes are recognized as a counterpart in finite fields for the orthogonal case, where two iterative projections lead to the final solution. A method for decomposing an arbitrary LCD code C into two super LCD codes C1 and C2 such that decoding by iteratively projecting the received vector onto C1 and C2 results in the same decoding solution as directly projecting the vector onto the original code space C. This is not necessarily a maximum-likelihood solution opposite to the analog case. A bound on the probability of finding the nearest codeword is provided.

Original languageEnglish
Title of host publication2011 IEEE Global Telecommunications Conference, GLOBECOM 2011
DOIs
StatePublished - 2011
Externally publishedYes
Event54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011 - Houston, TX, United States
Duration: 5 Dec 20119 Dec 2011

Publication series

NameGLOBECOM - IEEE Global Telecommunications Conference

Conference

Conference54th Annual IEEE Global Telecommunications Conference: "Energizing Global Communications", GLOBECOM 2011
Country/TerritoryUnited States
CityHouston, TX
Period5/12/119/12/11

Keywords

  • Analog codes
  • LCD code
  • LDPC codes
  • Turbo codes
  • dual code
  • iterative decoding

Fingerprint

Dive into the research topics of 'LCD codes and iterative decoding by projections, a first step towards an intuitive description of iterative decoding'. Together they form a unique fingerprint.

Cite this