Title :
ML sequence estimation for long ISI channels with controllable complexity
Author :
Ohno, Shuichi ; Giannakis, Georgios B.
Author_Institution :
Dept. of Artifical Complex Syst. Eng., Hiroshima Univ., Japan
Abstract :
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.
Keywords :
computational complexity; digital communication; diversity reception; error statistics; intersymbol interference; maximum likelihood sequence estimation; radio networks; radio receivers; radio transmitters; radiofrequency interference; time-varying channels; ISI channels; ML sequence estimation; Viterbi algorithm; bit error performance; computational complexity; computationally cumbersome maximum likelihood sequence estimation; controllable complexity; high-rate digital transmissions; information-bearing symbols; multipath diversity; Bit error rate; Computational complexity; Control systems; Decision feedback equalizers; Frequency; Intersymbol interference; Maximum likelihood estimation; OFDM; Transmitters; Viterbi algorithm;
Conference_Titel :
Communications, 2004 IEEE International Conference on
Print_ISBN :
0-7803-8533-0
DOI :
10.1109/ICC.2004.1313037