Complexity reduction of the MLSD/MLSDE receiver using the adaptive state allocation algorithm

摘要: The idea of adaptive state allocation (ASA) algorithm is used in this paper to substantially reduce the computational complexity maximum-likelihood sequence detection and estimation (MLSD/MLSDE) receiver without a significant degradation its performance. In ASA algorithm, total number states assigned trellis selected from entire set are changed adaptively based on short-term power channel impulse response (CIR) or estimate. combination two methods: threshold (AT) partitioning (AP). AT method, value formulated probability removing correct diagram. At each time, only paths whose costs less than minimum cost (corresponding best survivor path) plus retained extended next stage. method significantly reduces regular MLSDE mostly at high signal-to-noise ratio (SNR) with negligible loss Simulation results for fading channels show that typically selects one (the possible states) SNRs. AP branch metrics fused diffused by using Kullback-Leibler (KL) distance metric invoked quantifying differences between density functions incorrect trellis. adaptation done such coefficients assumed be zero computing metrics. decreases low