The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Cet article donne une étude et une comparaison des algorithmes pour la détection de données binaires en présence d'interférences intersymboles bidimensionnelles (2D). Il s’agit d’un problème général de théorie de la communication, car il peut être appliqué à divers problèmes pratiques de stockage et de transmission de données. Les principaux résultats sur les algorithmes de détection basés sur un treillis, auparavant disparates, sont rassemblés et placés dans un cadre commun. Tous les algorithmes ont une meilleure complexité que la détection optimale, et la complexité est comparée. D'une part, de nombreux algorithmes fonctionnent à 1.0 dB ou mieux des performances optimales. D’un autre côté, aucun de ces algorithmes proposés ne peut trouver la solution optimale à un SNR élevé, ce qui est surprenant. Une discussion approfondie met en évidence d’autres problèmes ouverts.
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.
Copier
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
Copier
@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},}
Copier
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 -