DocumentCode
338760
Title
Adaptive T-algorithm in MLSD/MLSDE receivers for fading channels
Author
Zamiri-Jafarian, H. ; Pasupathy, S.
Author_Institution
Dept. of Electr. & Comput. Eng., Toronto Univ., Ont., Canada
Volume
1
fYear
1999
fDate
1999
Firstpage
539
Abstract
This paper develops a threshold method called adaptive T-algorithm to reduce the number of states in the maximum likelihood sequence detection and estimation (MLSD/MLSDE) receivers. This algorithm removes the states whose costs are larger than the minimum cost (the cost of the best survivor path) plus a threshold at each time. The threshold value is formulated based on the probability of removing the correct state in the trellis diagram and it is a function of short-term power of the channel impulse response and the variance of the additive white Gaussian noise. Simulation results for frequency flat and selective fading channels show that the adaptive T-algorithm greatly reduces the computational complexity of the MLSD/MLSDE receivers especially at high SNR with negligible loss in their performances
Keywords
AWGN; computational complexity; fading channels; maximum likelihood detection; maximum likelihood estimation; radio receivers; transient response; MLSD; MLSD/MLSDE receivers; adaptive T-algorithm; additive white Gaussian noise; channel impulse response; computational complexity; fading channels; frequency flat; maximum likelihood sequence detection; performances; receivers; selective fading channels; short-term power; threshold method; threshold value; trellis diagram; Additive white noise; Computational complexity; Computational modeling; Costs; Fading; Frequency; Maximum likelihood detection; Maximum likelihood estimation; Signal to noise ratio; State estimation;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1999. ICC '99. 1999 IEEE International Conference on
Conference_Location
Vancouver, BC
Print_ISBN
0-7803-5284-X
Type
conf
DOI
10.1109/ICC.1999.767997
Filename
767997
Link To Document