Extremal problems of information combining

Yibo Jiang, Alexei Ashikhmin, Ralf Koetter, Andrew C. Singer

Research output: Contribution to journalArticle

Abstract

In this paper, we study moments of soft bits of binary-input symmetric-output channels and solve some extremal problems of the moments.We use these results to solve the extremal information combining problem. Further, we extend the information combining problem by adding a constraint on the second moment of soft bits, and find the extremal distributions for this new problem. The results for this extension problem are used to improve the prediction of convergence of the belief propagation decoding of low-density parity-check (LDPC) codes, provided that another extremal problem related to the variable nodes is solved.

Original languageEnglish (US)
Pages (from-to)51-71
Number of pages21
JournalIEEE Transactions on Information Theory
Volume54
Issue number1
DOIs
StatePublished - Jan 1 2008

Keywords

  • Extrinsic information transfer (EXIT) functions
  • Information combining
  • Low-density parity-check (LDPC) codes

ASJC Scopus subject areas

  • Information Systems
  • Computer Science Applications
  • Library and Information Sciences

Fingerprint Dive into the research topics of 'Extremal problems of information combining'. Together they form a unique fingerprint.

  • Cite this