BAYESIAN DECISION-FEEDBACK TECHNIQUES FOR DECONVOLUTION

被引:16
作者
LEE, GK [1 ]
GELFAND, SB [1 ]
FITZ, MP [1 ]
机构
[1] PURDUE UNIV,SCH ELECT ENGN,W LAFAYETTE,IN 47907
关键词
D O I
10.1109/49.363136
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
Recently, there has been interest in reduced complexity suboptimal MAP symbol-by-symbol estimation for digital communications. In the known channel case, the MAP estimator can be simplified using decision feedback [1], resulting in a family of Bayesian decision feedback estimators (BDFE's); in the unknown channel case, recursive channel estimation can be combined with the BDFE, yielding an algorithm [8] that clearly outperforms blind linear equalizers. However, these algorithms can only be used with estimation lags less than the equivalent channel length and have a complexity that is exponential in the estimation lag. In this paper we propose a new suboptimal estimator suitable for both known and unknown channels. In the known channel case, the MAP estimator is simplified using a form of conditional decision feedback, resulting in a family of Bayesian conditional decision feedback estimators (BCDFE's); in the unknown channel case, recursive channel estimation is combined with the BCDFE. The BCDFE's are indexed by two parameters: a ''chip'' length and an estimation lag. These algorithms can be used with estimation lags greater than the equivalent channel length and have a complexity exponential in the chip length but only linear in the estimation lag. The BCDFE's are derived from simple assumptions in a model-based setting that takes into account discrete signaling and channel noise. Extensive simulations characterize the performance of the BDFE and BCDFE for uncoded linear modulations over both known and unknown (nonminimum phase) channel with severe ISI. The results clearly demonstrate the significant advantages of the proposed BCDFE over the BDFE in achieving a desirable performance/complexity tradeoff. Also, a simple adaptive complexity reduction scheme can be combined with the BCDFE resulting in further substantial reductions in complexity, especially for large constellations. Using this scheme, we demonstrate the feasibility of blind 16QAM demodulation with 10(-4) bit error probability at E(b)/N-o approximate to 18.5 dB on a channel with a deep spectral null.
引用
收藏
页码:155 / 166
页数:12
相关论文
共 22 条
[1]   STATISTICAL DETECTION FOR COMMUNICATION CHANNELS WITH INTERSYMBOL INTERFERENCE [J].
ABEND, K ;
FRITCHMA.BD .
PROCEEDINGS OF THE INSTITUTE OF ELECTRICAL AND ELECTRONICS ENGINEERS, 1970, 58 (05) :779-+
[2]   ROBUST IDENTIFICATION OF A NON-MINIMUM PHASE SYSTEM - BLIND ADJUSTMENT OF A LINEAR EQUALIZER IN DATA COMMUNICATIONS [J].
BENVENISTE, A ;
GOURSAT, M ;
RUGET, G .
IEEE TRANSACTIONS ON AUTOMATIC CONTROL, 1980, 25 (03) :385-399
[3]   BLIND EQUALIZERS [J].
BENVENISTE, A ;
GOURSAT, M .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1984, 32 (08) :871-883
[4]   DELAYED DECISION-FEEDBACK SEQUENCE ESTIMATION [J].
DUELHALLEN, A ;
HEEGARD, C .
IEEE TRANSACTIONS ON COMMUNICATIONS, 1989, 37 (05) :428-436
[5]   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]   MAXIMUM-LIKELIHOOD BLIND EQUALIZATION [J].
GHOSH, M ;
WEBER, CL .
OPTICAL ENGINEERING, 1992, 31 (06) :1224-1228
[8]   Photoacoustic spectroscopy for remote detection of liquid contamination [J].
Harris, M ;
Perrett, B ;
Benton, DM ;
Willetts, DV .
OPTICALLY BASED BIOLOGICAL AND CHEMICAL SENSING FOR DEFENCE, 2004, 5617 :136-144
[9]  
GIRIDHAR K, 1992, IEEE C SIGNALS SYST, P339