Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model
(2009) IEEE International Symposium on Information Theory (ISIT), 2009 p.1649-1653- 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.
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/1277678
- author
- Rusek, Fredrik LU and Fertonani, Dario
- organization
- publishing date
- 2009
- type
- Contribution to conference
- publication status
- published
- subject
- keywords
- Intersymbol Interference, Shannon Capacity
- pages
- 1649 - 1653
- conference name
- IEEE International Symposium on Information Theory (ISIT), 2009
- conference location
- Seoul, Korea, Democratic People's Republic of
- conference dates
- 2009-06-28 - 2009-07-03
- external identifiers
-
- wos:000280141401042
- scopus:70449476546
- language
- English
- LU publication?
- yes
- id
- e049b5be-b089-4e9a-9e8d-d0ec79e34d20 (old id 1277678)
- date added to LUP
- 2016-04-04 14:05:32
- date last changed
- 2025-04-04 15:20:06
@misc{e049b5be-b089-4e9a-9e8d-d0ec79e34d20, abstract = {{We consider the problem of lower bounding the information rate of intersymbol interference channels via Monte Carlo algorithms.<br/><br> We adopt a novel approach based on the Ungerboeck observation model, unlike the existing ones that are all based on the Forney model.<br/><br> 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.<br/><br> In particular, the proposed approach significantly outperforms the existing ones at low-to-medium values of the signal-to-noise ratio.}}, author = {{Rusek, Fredrik and Fertonani, Dario}}, keywords = {{Intersymbol Interference; Shannon Capacity}}, language = {{eng}}, pages = {{1649--1653}}, title = {{Lower bounds on the information rate of intersymbol interference channels based on the Ungerboeck observation model}}, year = {{2009}}, }