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

Authors:
Fredrik Rusek;Dario Fertonani
Affiliations:
Department of Electrical and Information Technology, Lund University, Lund, Sweden;Department of Electrical Engineering, Arizona State University, Tempe, AZ
Venue:
ISIT'09 Proceedings of the 2009 IEEE international conference on Symposium on Information Theory - Volume 3
Year:
2009

Citing 6
Cited 0

Discrete-time signal processing

Discrete-time signal processing
Elements of information theory

Elements of information theory
Optimization of information rate upper and lower bounds for channels with memory

IEEE Transactions on Information Theory
On Reduced-Complexity Equalization Based on Ungerboeck and Forney Observation Models

IEEE Transactions on Signal Processing - Part I
The intersymbol interference channel: lower bounds on capacity and channel precoding loss

IEEE Transactions on Information Theory
Simulation-Based Computation of Information Rates for Channels With Memory

IEEE Transactions on Information Theory

Quantified Score

Hi-index	0.00

Visualization

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. The proposed approach significantly outperforms the existing ones for all practical values of the signal-to-noise ratio.