LDPC codes over Ergodic and non-Ergodic relay channels

Jun Hu, Tolga M. Duman

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

3 Scopus citations

Abstract

In this work, we exploit the capacity approaching capability of low density parity check (LDPC) codes over wireless relay channels. We consider the classical full-duplex relay channel model under both ergodic and non-ergodic scenarios, and propose two practical relaying schemes. By comparing with the theoretical information rate bounds, we show that the LDPC coded relay systems can approach the ergodic/outage information rates (i.e., constrained channel capacities) very closely. Specifically, we show that they can even outperform the existing turbo coded relay systems under appropriate code design. In addition, based on the measure of average mutual information, we analyze the convergence behavior of the proposed schemes which also demonstrates their great potential to perform near capacity over both ergodic and non-ergodic wireless relay channels.

Original languageEnglish (US)
Title of host publication44th Annual Allerton Conference on Communication, Control, and Computing 2006
PublisherUniversity of Illinois at Urbana-Champaign, Coordinated Science Laboratory and Department of Computer and Electrical Engineering
Pages454-461
Number of pages8
ISBN (Electronic)9781604237924
StatePublished - 2006
Event44th Annual Allerton Conference on Communication, Control, and Computing 2006 - Monticello, United States
Duration: Sep 27 2006Sep 29 2006

Publication series

Name44th Annual Allerton Conference on Communication, Control, and Computing 2006
Volume1

Other

Other44th Annual Allerton Conference on Communication, Control, and Computing 2006
Country/TerritoryUnited States
CityMonticello
Period9/27/069/29/06

ASJC Scopus subject areas

  • Computer Science Applications
  • Computer Networks and Communications

Fingerprint

Dive into the research topics of 'LDPC codes over Ergodic and non-Ergodic relay channels'. Together they form a unique fingerprint.

Cite this