Webbläsaren som du använder stöds inte av denna webbplats. Alla versioner av Internet Explorer stöds inte längre, av oss eller Microsoft (läs mer här: * https://www.microsoft.com/en-us/microsoft-365/windows/end-of-ie-support).

Var god och använd en modern webbläsare för att ta del av denna webbplats, som t.ex. nyaste versioner av Edge, Chrome, Firefox eller Safari osv.

Bounds on the Information Rate of Intersymbol Interference Channels Based on Mismatched Receivers

In English

Författare

Summary, in English

We consider the problem of bounding the information rate of intersymbol interference channels via simulation-based algorithms. The adopted approach, which is based on a general class of reduced-complexity receivers that includes several previously studied receivers as special cases, leads to provable upper and lower bounds on the information rate of interest. As a by-product of the information-theoretic investigations, novel insights on the design of efficient reduced-complexity receivers are also provided, since the proposed lower bounds are known to be achievable by practical receivers. In many scenarios, our novel approach significantly outperforms the existing ones, for all practical values of the signal-to-noise ratio.

Publiceringsår

2012

Språk

Engelska

Sidor

1470-1482

Publikation/Tidskrift/Serie

IEEE Transactions on Information Theory

Volym

58

Issue

3

Dokumenttyp

Artikel i tidskrift

Förlag

IEEE - Institute of Electrical and Electronics Engineers Inc.

Ämne

  • Electrical Engineering, Electronic Engineering, Information Engineering

Nyckelord

  • Forney model
  • information rate
  • intersymbol interference (ISI) channels
  • reduced-complexity detection
  • Ungerboeck model

Status

Published

ISBN/ISSN/Övrigt

  • ISSN: 0018-9448