Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels

スポンサーリンク

概要

• 論文の詳細を見る

• 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.0dB 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.

• （社）電子情報通信学会の論文
• 2008-10-01

著者

• Kurkoski Brian

  Department Of Information And Communications Engineering University Of Electro-communications

関連論文

• Robust image hashing against geometric attacks using image normalization and SVD decomposition
• Robust image hashing against geometric attacks using image normalization and SVD decomposition (ワイドバンドシステム・情報通信基礎サブソサイエティ合同研究会)
• A Decoding Algorithm for LDPC Codes using Threshold Control for the Burst Error Channel
• Robust image hashing against geometric attacks using image normalization and SVD decomposition (情報セキュリティ・情報通信基礎サブソサイエティ合同研究会)
• Vector Quantization of Convolutional Decoder State Metrics
• Towards Efficient Detection of Two-Dimensional Intersymbol Interference Channels

スポンサーリンク