Adaptive MLSE equalizers with parametric tracking for multipathfast-fading channels

We use the parametric channel identification algorithm proposed by Chen and Paulraj (see Proc. IEEE Vehicular Technology Conf., p.710-14, 1997) and by Chen, Kim and Liang (see IEEE Trans. Veh. Technol., p.1923-35, 1999) to adaptively track the fast-fading channels for the multichannel maximum likelihood sequence estimation (MLSE) equalizer using multiple antennas. Several commonly-used channel tracking schemes, decision-directed recursive least square (DD/RLS), per-survivor processing recursive least square (PSP/RLS) and other reduced-complexity MLSE algorithms are considered. An analytic lower bound for the multichannel MLSE equalizer with no channel mismatch in the time-varying specular multipath Rayleigh-fading channels is derived. Simulation results that illustrate the performance of the proposed algorithms working with various channel tracking schemes are presented, and then these results are compared with the analytic bit error rate (BER) lower bound and with the conventional MLSE equalizers directly tracking the finite impulse response (FIR) channel tap coefficients. We found that the proposed algorithm always performs better than the conventional adaptive MLSE algorithm, no matter what channel tracking scheme is used. However, which is the best tracking scheme to use depends on the scenario of the system     

Cluster-based blind nonlinear-channel estimation

A cluster-based maximum-likelihood sequence estimator (MLSE) for nonlinear channels was described, which consists of a clustering network and an MLSE implemented by the Viterbi algorithm. The cluster-based MLSE can be used for digital communication through nonlinear finite-length channels because channel mapping estimation is used instead of channel estimation in the conventional MLSE. The clustering network of the cluster-based MLSE, which estimates the channel mapping between the signal input vectors and the noiseless channel outputs, is a supervised network and requires a training sequence. We propose a blind channel mapping estimator to estimate the channel mapping without using the training sequence. The blind channel mapping estimator has a clustering block and a mapping block. The clustering block estimates the channel outputs, which represent the channel mapping, subject to an unknown permutation operation because no training sequence is utilized. That permutation operation is resolved by the mapping block, and therefore, the channel mapping is obtained. Introducing the blind channel mapping estimator into the cluster-based MLSE, a blind cluster-based MLSE for nonlinear channels can be done. Computer simulations of the blind channel mapping estimator and the blind MLSE for nonlinear channels are presented     

Adaptive maximum-likelihood sequence estimation by means ofcombined equalization and decoding in fading environments

This paper proposes an adaptive maximum-likelihood sequence estimation (MLSE) by means of combined equalization and decoding, i.e., adaptive combined MLSE, which employs separate channel estimation for respective states in the Viterbi algorithm. First, an approximate metric including channel estimation is derived analytically for this proposed adaptive combined MLSE. Secondly, procedures to accomplish blind equalization are investigated for the proposed MLSE. Finally, its excellent BER performance on fast time-varying fading channels is confirmed by computer simulation, when the proposed MLSE operates as a blind equalizer     

一种短波信道自适应均衡算法的研究

基于逐幸存路径处理(PSP)的思想,研究了一种减少状态序列估计(RSSE)的短波信道自适应均衡算法.该算法首先通过训练序列估计信道的参数,然后利用RLS算法对信道参数和输入数据的估计值同时进行逐幸存路径地更新.数值仿真表明,在短波信道环境下,RSSE-PSP算法在减小计算复杂度的同时最大限度地保持了性能增益,其性能明显优于其他均衡算法.     

一种用于无线信道的逐幸存处理均衡器

提出了一种适用于无线时变信道的逐幸存处理均衡器。通过训练序列得到信道参数的初始估计值,此后在Viterbi算法进行网格搜索的过程中,使得每一条幸存路径维持各自的信道参数,并在确定幸存分支后利用历史幸存序列对信道参数值进行更新,实现了信道参数的无时延估计。仿真结果表明,在无线时变信道环境下,逐幸存处理均衡器的性能明显优于其他传统均衡器。     

自适应减少复杂度的盲最大似然序列估计

 基于逐幸存路径处理原理和自适应选择幸存路径的思想,本文提出了一种自适应减少计算复杂度的盲最大似然序列估计新算法.通过分析和推导,给出了一种近似估计网格图最小欧式距离的方法,并利用该估计值对幸存路径进行取舍,在网格搜索中仅保留少数幸存路径来进行信道参数和发送符号序列的联合盲估计.理论分析和计算机仿真结果表明,对严重符号干扰信道,在较高信噪比条件下,本文提出的新算法具有较理想的误符号率性能和较低的计算复杂度.     

A continuously adaptive MLSE receiver for mobile communications:algorithm and performance

The paper presents a Euclidean distance maximum likelihood sequence estimation (MLSE) receiver, based on the Viterbi algorithm (VA), suitable for fading and noisy communications channels, as that specified by the Group Special Mobiles (GSM). In a mobile cellular system, the fast varying channel characteristics, due to the fading and Doppler effects, require adaptive methods to update the channel coefficients to the MLSE receiver. The proposed technique continuously estimates the channel characteristics directly within the metric calculation of the VA. At each step of the VA, the sequence associated to the path with the best metric value (minimum-survivor method) among the survivor paths is used to update the channel estimate (employing conventional adaptive algorithms) throughout the entire informative sequence. However, the detection of the transmitted data sequence is performed by the VA only at the end of each burst. The proposed technique allows simpler receiver implementation and the simulation results show a good performance of this adaptive MLSE receiver in typical GSM environments     

Analysis of LMS-adaptive MLSE equalization on multipath fadingchannels

We consider a practical maximum-likelihood sequence estimation (MLSE) equalizer on multipath fading channels in conjunction with an adaptive channel estimator consisting of a least mean square (LMS) estimator and a linear channel predictor, instead of assuming perfect channel estimates. A new LMS estimator model is proposed which can accurately characterize the statistical behavior of the LMS estimator over multipath fading channels. Based on this model, a new upper-bound on block error rate is derived under the consideration of imperfect channel estimates. Computer simulations verify that our analytical results can correctly predict the real system performance and are applicable over a wide range of the step size parameter of the LMS estimator     

Multichannel MLSE equalizer with parametric FIR channelidentification

We propose a parametric finite impulse response (FIR) channel identification algorithm, apply the algorithm to a multichannel maximum likelihood sequential estimation (MLSE) equalizer using multiple antennas, and investigate the improvement in the overall bit error rate (BER) performance. By exploring the structure of the specular multipath channels, we are able to reduce the number of channel parameters to provide a better channel estimate for the MLSE equalizer. The analytic BER lower bounds of the proposed algorithm as well as those of several other conventional MLSE algorithms in the specular multipath Rayleigh-fading channels are derived. In the derivation, we consider the channel mismatch caused by the additive Gaussian noise and the finite-length channel approximation error. A handy-to-use simplified BER lower bound is also derived. Simulation results that illustrate the BER performance of the proposed algorithm in the global system for mobile communications (GSM) system are presented and compared to the analytic lower bounds     

Simplified per-survivor Kalman processing in fastfrequency-selective fading channels

Per-survivor processing (PSP) is now seen as an attractive approach to performing maximum-likelihood sequence estimation (MLSE) over mobile radio channels that are rapidly time varying. An optimal PSP strategy incorporates statistical channel modeling and Kalman filtering. For severely time-dispersive channels, this approach becomes prohibitively complex. A novel filtering algorithm is presented to approximate Kalman PSP. MLSE with the new scheme offers a large reduction in computational complexity, and achieves performance close to the optimal Kalman approach and superior to existing PSP schemes in rapidly fading channels. The exact expressions presented for the pairwise error probability of MLSE with Kalman PSP may be used to predict the detector performance without resorting to lengthly simulations     

Performance of sequence estimation scheme of narrowband digital FMsignals with limiter-discriminator detection

A communication scheme using binary FM with noncoherent limiter-discriminator detection has been well known. Up to now, the improvement of bit error rate at the receiver side has been carried out through the bandwidth optimization of the IF filter, the decision feedback equalization (DFE), or simple two-state maximum likelihood sequence estimator (MLSE). This channel is inherently the intersymbol interference (ISI) channel due to the premodulation baseband filtering as well as the narrowband IF filtering. So the sequence estimation scheme using the Viterbi algorithm can be applied successfully, although the channel is not additive white Gaussian and maximum likelihood in the strict sense. In this paper, through computer simulations, we examine the actual BER improvement of the sequence estimation scheme with multiple-state trellis especially for MSK and GMSK signals. We mainly consider static AWGN and frequency nonselective Rician fading channels. Consequently, by adjusting the IF filter bandwidth, very large estimation gains are obtained compared to the conventional DFE or MLSE detector for AWGN and Rician fading channels. This scheme does not produce large demodulation delay and is implemented only by adding the signal processing part to the final stage of the receiver. This scheme seems to be very useful for any applications including satellite mobile channels     

Sequence detection and channel state estimation over finite stateMarkov channels

A useful model for general time-varying channels is a finite state Markov chain. In this paper, maximum likelihood sequence estimation (MLSE) for signals over finite state Markov channels (FSMCs) is studied. Also studied is the maximum a posteriori (MAP) channel state estimation. When coded signals with interleaving are transmitted, the channel estimates can be used to make soft-decision decoding. The error performance of the proposed sequence and channel state estimation schemes are evaluated through computer simulations. The effect of channel modeling error is also discussed     

A channel estimation using sliding window approach and tuningalgorithm for MLSE

A simultaneous sliding window channel estimation and timing adjustment method is proposed for adaptive maximum-likelihood sequence equalizer (MLSE) in the global system for mobile communication (GSM) system, and also a tuning scheme based on least mean squared (LMS) algorithm is presented in order to improve the performance of equalizer. Simulation results show that the proposed channel estimation technique is effective for channel estimation of the adaptive equalizer     

瑞利信道下的自适应MLSE算法

由于在数字移动通信中要考虑多径和多普勒频移的影响,建立了瑞利时变衰落信道模型,并使用最大似然序列检测算法实现均衡.它的基本思想是在MLSE算法中插入信道估计算法,不断跟踪实时信道变化并及时更新.为降低复杂度,研究了传统的自适应MLSE算法和运幸存MLSE两种经典算法,仿真表明,当多普勒频移较小时,两种算法有相近的性能,...     

A new adaptive equalizer with channel estimator for mobile radiocommunication

For unknown mobile radio channels with severe intersymbol interference (ISI), a maximum likelihood sequence estimator, such as a decision feedback equalizer (DFE) having both feedforward and feedback filters, needs to handle both precursors and postcursors. Consequently, such an equalizer is too complex to be practical. This paper presents a new reduced-state, soft decision feedback Viterbi equalizer (RSSDFVE) with a channel estimator and predictor. The RSSDFVE uses maximum likelihood sequence estimation (MLSE) to handle the precursors and truncates the overall postcursors with the soft decision of the MLSE to reduce the implementation complexity. A multiray fading channel model with a Doppler frequency shift is used in the simulation. For fast convergence, a channel estimator with fast start-up is proposed. The channel estimator obtains the sampled channel impulse response (CIR) from the training sequence and updates the RSSDFVE during the bursts in order to track changes of the fading channel. Simulation results show the RSSDFVE has nearly the same performance as the MLSE for time-invariant multipath fading channels and better performance than the DFE for time-variant multipath fading channels with less implementation complexity than the MLSE. The fast start-up (FS) channel estimator gives faster convergence than a Kalman channel estimator. The proposed RSSDFVE retains the MLSE structure to obtain good performance and only uses soft decisions to subtract the postcursor interference. It provides the best tradeoff between complexity and performance of any Viterbi equalizers     

A robust adaptive DFE receiver for DS-CDMA systems under multipathfading channels

This paper presents a novel receiver design from signal processing viewpoint for direct-sequence code-division multiple access (DS-CDMA) systems under multipath fading channels. A robust adaptive decision-feedback equalizer (DFE) is developed by using optimal filtering technique via minimizing the mean-square error (MSE). The multipath fading channels are modeled as tapped-delay-line filters, and the tap coefficients are described as Rayleigh distributions in order to imitate the frequency-selective fading channel. Then, a robust Kalman filtering algorithm is used to estimate the channel responses for the adaptation of the proposed DFE receiver under the situation of partially known channel statistics. The feedforward and feedback filters are designed by using not only the estimated channel responses but the uncertainties and error covariance of channel estimation as well. As shown in the computer simulations, the proposed adaptive DFE receiver is robust against the estimation errors and modeling dynamics of the channels. Hence, it is very suitable for receiver design in data transmissions through multipath fading channels encountered in most wireless communication systems     

Clustering-Based Adaptive Channel Estimator for Optical Fiber Communication Systems

In this letter, a new clustering-based adaptive channel estimator is proposed for optical fiber communication systems with the maximum-likelihood sequence estimation (MLSE) receiver. The estimator is very effective in estimating the key channel parameters needed by the Viterbi processor without assuming that the channel memory length is known a priori to the receiver. Moreover, the application of the proposed channel estimator can induce a complexity-reduced MLSE receiver.     

On MLSE algorithms for unknown fast time-varying channels

We consider maximum-likelihood sequence estimation (MLSE) algorithms for unknown, time-varying intersymbol interference communication channels. We assume a statistical channel model, and marginalize over model parameters to derive expectation-maximization (EM) algorithms for both time-independent Gaussian and Gauss-Markov models, and we contrast these with direct MLSE and computationally efficient per-survivor processing implementations. We identify a general concern associated with the convergence of EM-based discrete parameter (e.g., symbol) estimators.     

Per-survivor processing and tentative decisions: what is inbetween?

In per-survivor processing (PSP), the number of parameter estimators equals the number of retained hypothetical data sequences (survivors). The authors propose an algorithm which uses an arbitrary number of parameter estimators and compromises between the two extremes of tentative decisions (one parameter estimator) and PSP. Specific applications to reduced state sequence estimation (RSSE) and maximum likelihood sequence estimation (MLSE) with adaptive tracking of a fading channel are considered     

Fast adaptive equalization/diversity combining for time-varyingdispersive channels

We examine adaptive equalization and diversity combining methods for fast Rayleigh-fading frequency selective channels. We assume a block adaptive receiver in which the receiver coefficients are obtained from feedforward channel estimation. For the feedforward channel estimation, we propose a novel reduced dimension channel estimation procedure, where the number of unknown parameters are reduced using a priori information of the transmit shaping filter's impulse response. Fewer unknown parameters require a shorter training sequence. We obtain least-squares, maximum-likelihood, and maximum a posteriori (MAP) estimators for the reduced dimension channel estimation problem. For symbol detection, we propose the use of a matched filtered diversity combining decision feedback equalizer (DFE) instead of a straightforward diversity combining DFE. The matched filter form has lower computational complexity and provides a well-conditioned matrix inversion. To cope with fast time-varying channels, we introduce a new DFE coefficient computation algorithm which is obtained by incorporating the channel variation during the decision delay into the minimum mean square error (MMSE) criterion. We refer to this as the non-Toeplitz DFE (NT-DFE). We also show the feasibility of a suboptimal receiver which has a lower complexity than a recursive least squares adaptation, with performance close to the optimal NT-DFE