TY - JOUR
T1 - ML sequence estimation for long ISI channels with controllable complexity
AU - Ohno, Shuichi
AU - Giannakis, Georgios B.
PY - 2004/1/1
Y1 - 2004/1/1
N2 - Channels with long impulse response often arise in high-rate digital transmissions due to severe multipath. This necessitates sophisticated equalization at the receiver. On the other hand, exploiting the available multipath diversity improves bit error performance. To collect the full multipath diversity, computationally cumbersome maximum likelihood sequence estimation (MLSE) is required. Although the Viterbi algorithm (VA) for MLSE is more efficient than the exhaustive ML search, its complexity increases exponentially with the channel length, which varies with the propagation environment. Since the computational power of the receiver is limited, VA becomes infeasible for long channels. In this paper, we develop a transmission capable of handling relatively long channels. The transmitter controls the computational complexity of MLSE at the receiver by periodically inserting zeros within information-bearing symbols, depending on the channel length and the computational power of the receiver. The optimal MLSE with reduced complexity becomes available at the expense of reduced data rate.
AB - Channels with long impulse response often arise in high-rate digital transmissions due to severe multipath. This necessitates sophisticated equalization at the receiver. On the other hand, exploiting the available multipath diversity improves bit error performance. To collect the full multipath diversity, computationally cumbersome maximum likelihood sequence estimation (MLSE) is required. Although the Viterbi algorithm (VA) for MLSE is more efficient than the exhaustive ML search, its complexity increases exponentially with the channel length, which varies with the propagation environment. Since the computational power of the receiver is limited, VA becomes infeasible for long channels. In this paper, we develop a transmission capable of handling relatively long channels. The transmitter controls the computational complexity of MLSE at the receiver by periodically inserting zeros within information-bearing symbols, depending on the channel length and the computational power of the receiver. The optimal MLSE with reduced complexity becomes available at the expense of reduced data rate.
UR - http://www.scopus.com/inward/record.url?scp=4143075924&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=4143075924&partnerID=8YFLogxK
U2 - 10.1109/icc.2004.1313037
DO - 10.1109/icc.2004.1313037
M3 - Conference article
AN - SCOPUS:4143075924
SN - 0536-1486
VL - 5
SP - 2782
EP - 2786
JO - IEEE International Conference on Communications
JF - IEEE International Conference on Communications
T2 - 2004 IEEE International Conference on Communications
Y2 - 20 June 2004 through 24 June 2004
ER -