Adaptive soft-input soft-output algorithms for iterative detection with parametric uncertainty

被引:77
作者
Anastasopoulos, A [1 ]
Chugg, K
机构
[1] Univ Michigan, Dept Elect Engn & Comp Sci, Ann Arbor, MI 48109 USA
[2] Univ So Calif, Dept Elect Engn Syst, Los Angeles, CA 90089 USA
基金
美国国家科学基金会;
关键词
channel estimation; frequency-selective fading; intersymbol interference; iterative decoding; Kalman filters; per-survivor processing; serially concatenated codes; soft statistics; symbol-by-symbol MAP detection; turbo codes;
D O I
10.1109/26.871389
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
The soft-input soft-output (SISO) module is the basic building block for established iterative detection (ID) algorithms for a system consisting of a network of finite state machines. The problem of performing ID for systems having parametric uncertainty has received relatively little attention in the open literature. Previously proposed adaptive SISO (A-SISO) algorithms are either based on an oversimplified channel model, or have complexity that grows exponentially with the observation length N (or the smoothing lag D), In this paper, the exact expressions for the soft metrics in the presence of parametric uncertainty modeled as a Gauss-Markov process are derived in a novel way that enables the decoupling of complexity and observation length. Starting from these expressions, a family of suboptimal (practical) algorithms is motivated, based on forward/backward adaptive processing with linear complexity in N, Recently proposed A-SISO algorithms, as well as existing adaptive hard-decision algorithms are interpreted as special cases within this framework. Using a representative application-joint iterative equalization-decoding for trellis-based codes over frequency-selective channels-several design options are compared and the impact of parametric uncertainty on previously established results for ID with perfect channel state information is assessed.
引用
收藏
页码:1638 / 1649
页数:12
相关论文
共 36 条
[1]   Adaptive soft-decision algorithms for mobile fading channels [J].
Anastasopoulos, A ;
Polydoros, A .
EUROPEAN TRANSACTIONS ON TELECOMMUNICATIONS, 1998, 9 (02) :183-190
[2]  
ANASTASOPOULOS A, 1997, P AS C SIGN SYST COM, P177
[3]  
ANASTASOPOULOS A, 1999, THESIS U SO CALIFORN
[4]  
ANASTASOPOULOS A, 1999, P INT C COMM VANC BC
[5]  
ANASTASOPOULOS A, 1998, P INT C COMM ATL GA
[6]  
Anderson B., 1979, OPTIMAL FILTERING
[7]   SEQUENTIAL CODING ALGORITHMS - A SURVEY AND COST-ANALYSIS [J].
ANDERSON, JB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (02) :169-176
[8]   Combined channel estimation and data detection using soft statistics for frequency-selective fast-fading digital links [J].
Baccarelli, E ;
Cusani, R .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1998, 46 (04) :424-427
[9]   OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].
BAHL, LR ;
COCKE, J ;
JELINEK, F ;
RAVIV, J .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287
[10]   Serial concatenation of interleaved codes: Performance analysis, design, and iterative decoding [J].
Benedetto, S ;
Divsalar, D ;
Montorsi, G ;
Pollara, F .
IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :909-926