Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model

Fredrik Rusek, Dario Fertonani

Research output: Contribution to conferencePaper, not in proceedingpeer-review

9 Citations (SciVal)

Abstract

We consider the problem of lower bounding the information rate of intersymbol interference channels via Monte Carlo algorithms.
We adopt a novel approach based on the Ungerboeck observation model, unlike the existing ones that are all based on the Forney model.
The two approaches, yet equivalent in the case of full-complexity detection, lead to different results in the case of reduced-complexity detection, which is the only viable option when the channel memory is large.
In particular, the proposed approach significantly outperforms the existing ones at low-to-medium values of the signal-to-noise ratio.
Original languageEnglish
Pages1649-1653
Publication statusPublished - 2009
EventIEEE International Symposium on Information Theory (ISIT), 2009 - Seoul, Korea, Seoul, Korea, Democratic People's Republic of
Duration: 2009 Jun 282009 Jul 3

Conference

ConferenceIEEE International Symposium on Information Theory (ISIT), 2009
Country/TerritoryKorea, Democratic People's Republic of
CitySeoul
Period2009/06/282009/07/03

Subject classification (UKÄ)

  • Electrical Engineering, Electronic Engineering, Information Engineering

Keywords

  • Intersymbol Interference
  • Shannon Capacity

Fingerprint

Dive into the research topics of 'Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model'. Together they form a unique fingerprint.

Cite this