Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model
Author
Summary, in English
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.
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.
Publishing year
2009
Language
English
Pages
1649-1653
Document type
Conference paper
Topic
- Electrical Engineering, Electronic Engineering, Information Engineering
Keywords
- Intersymbol Interference
- Shannon Capacity
Conference name
IEEE International Symposium on Information Theory (ISIT), 2009
Conference date
2009-06-28 - 2009-07-03
Conference place
Seoul, Korea, Democratic People's Republic of
Status
Published
Research group
- Telecommunication Theory