IEICE TRANSACTIONS on Fundamentals
Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels
Summary :
This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.10 pp.2696-2703
- Publication Date
- 2008/10/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.10.2696
- Type of Manuscript
- Special Section SURVEY PAPER (Special Section on Information Theory and Its Applications)
- Category
- Communication Theory
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Brian M. KURKOSKI, "Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 10, pp. 2696-2703, October 2008, doi: 10.1093/ietfec/e91-a.10.2696.
Abstract: This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.10.2696/_p
Copy
@ARTICLE{e91-a_10_2696,
author={Brian M. KURKOSKI, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels},
year={2008},
volume={E91-A},
number={10},
pages={2696-2703},
abstract={This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.},
keywords={},
doi={10.1093/ietfec/e91-a.10.2696},
ISSN={1745-1337},
month={October},}
Copy
TY - JOUR
TI - Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2696
EP - 2703
AU - Brian M. KURKOSKI
PY - 2008
DO - 10.1093/ietfec/e91-a.10.2696
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 10
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - October 2008
AB - This paper gives a survey and comparison of algorithms for the detection of binary data in the presence of two-dimensional (2-D) intersymbol interference. This is a general problem of communication theory, because it can be applied to various practical problems in data storage and transmission. Major results on trellis-based detection algorithms, previously disparate are drawn together, and placed into a common framework. All algorithms have better complexity than optimal detection, and complexity is compared. On the one hand, many algorithms perform within 1.0 dB or better of optimal performance. On the other hand, none of these proposed algorithms can find the optimal solution at high SNR, which is surprising. Extensive discussion outlines further open problems.
ER -
English
