PER-SURVIVOR PROCESSING - A GENERAL-APPROACH TO MLSE IN UNCERTAIN ENVIRONMENTS

被引:437
作者
RAHELI, R
POLYDOROS, A
TZOU, CK
机构
[1] UNIV SO CALIF, INST COMMUN SCI, DEPT ELECT ENGN SYST, LOS ANGELES, CA 90089 USA
[2] IND TECHNOL RES INST, COMP & COMMUN RES LAB, HSINCHU 310, TAIWAN
基金
美国国家航空航天局; 美国国家科学基金会;
关键词
D O I
10.1109/26.380054
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Per-Survivor Processing (PSP) provides a general framework for the approximation of Maximum Likelihood Sequence Estimation (MLSE) algorithms whenever the presence of unknown quantities prevents the precise use of the classical Viterbi algorithm, This principle stems from the idea that data-aided estimation of unknown parameters may be embedded into the structure of the Viterbi algorithm itself, Among the numerous possible applications, we concentrate here on (a) adaptive MLSE, (b) simultaneous Trellis Coded Modulation (TCM) decoding and phase synchronization, (c) adaptive Reduced State Sequence Estimation (RSSE). As a matter of fact, PSP is interpretable as a generalization of decision feedback techniques of RSSE to decoding in the presence of unknown parameters. A number of algorithms for the simultaneous estimation of data sequence and unknown channel parameters are presented and compared with ''conventional'' techniques based on the use of tentative decisions, Results for uncoded modulations over InterSymbol Interference (IST) fading channels and joint TCM decoding and carrier synchronization are presented, In all cases, it is found that PSP algorithms are clearly more robust than conventional techniques both in tracking a time-varying channel and acquiring its characteristics without training.
引用
收藏
页码:354 / 364
页数:11
相关论文
共 41 条
[1]   SEQUENTIAL CODING ALGORITHMS - A SURVEY AND COST-ANALYSIS [J].
ANDERSON, JB .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (02) :169-176
[2]  
BERGMANS JWM, 1987, PHILIPS J RES, V42, P399
[3]   DECODING OF TRELLIS-ENCODED SIGNALS IN THE PRESENCE OF INTERSYMBOL INTERFERENCE AND NOISE [J].
CHEVILLAT, PR ;
ELEFTHERIOU, E .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (07) :669-676
[4]  
DANDREA AN, 1994, FEB IEEE T COMM 1, V42, P1033
[5]  
DANDREA AN, 1991, 5TH P INT WORKSH DIG, P413
[6]   REDUCED-STATE SEQUENCE ESTIMATION WITH SET PARTITIONING AND DECISION FEEDBACK [J].
EYUBOGLU, MV ;
QURESHI, SUH .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1988, 36 (01) :13-20
[7]   REDUCED-STATE SEQUENCE ESTIMATION FOR CODED MODULATION ON INTERSYMBOL INTERFERENCE CHANNELS [J].
EYUBOGLU, MV ;
QURESHI, SUH .
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 1989, 7 (06) :989-995
[9]   VITERBI ALGORITHM [J].
FORNEY, GD .
PROCEEDINGS OF THE IEEE, 1973, 61 (03) :268-278
[10]  
HAGENAUER J, 1989, NOV P GLOBECOM 89