Fixed-lag blind equalization and sequence estimation in digital communications systems using sequential importance sampling

We present methods for fixed-lag smoothing using Sequential Importance sampling (SIS) on a discrete non-linear, non-Gaussian state space system with unknown parameters. Our particular application is in the field of digital communication systems. Each input data point is taken from a finite set of symbols. We represent transmission media as a fixed filter with a finite impulse response (FIR), hence a discrete state-space system is formed. Conventional Markov chain Monte Carlo (MCMC) techniques such as the Gibbs sampler are unsuitable for this task because they can only perform processing on a batch of data. Data arrives sequentially, so it would seem sensible to process it in this way. In addition, many communication systems are interactive, so there is a maximum level of latency that can be tolerated before a symbol is decoded. We will demonstrate this method by simulation and compare its performance to existing techniques.

Blind equalization and sequence estimation using Markov chain Monte Carlo methods

This paper discusses the problem of restoring a digital input signal that has been degraded by an unknown FIR filter in noise, using the Gibbs sampler. A method for drawing a random sample of a sequence of bits is presented; this is shown to have faster convergence than a scheme by Chen and Li, which draws bits independently. ©1998 IEEE.

A new blind equalization algorithm based on convex combination

The convex combination is a mathematic approach to keep the advantages of its component algorithms for better performance. In this paper, we employ convex combination in the blind equalization to achieve better blind equalization. By combining the blind constant modulus algorithm (CMA) and decision directed algorithm, the combinative blind equalization (CBE) algorithm can retain the advantages from both. Furthermore, the convergence speed of the CBE algorithm is faster than both of its component equalizers. Simulation results are also given to verify the proposed algorithm.

Blind equalization of nonminimum phase channels: higher order cumulant based algorithm

Higher order cumulant analysis is applied to the blind equalization of linear time-invariant (LTI) nonminimum-phase channels. The channel model is moving-average based. To identify the moving average parameters of channels, a higher-order cumulant fitting approach is adopted in which a novel relay algorithm is proposed to obtain the global solution. In addition, the technique incorporates model order determination. The transmitted data are considered as independently identically distributed random variables over some discrete finite set (e.g., set {±1, ±3}). A transformation scheme is suggested so that third-order cumulant analysis can be applied to this type of data. Simulation examples verify the feasibility and potential of the algorithm. Performance is compared with that of the noncumulant-based Sato scheme in terms of the steady state MSE and convergence rate.

Blind equalization of nonirreducible systems using the CM criterion

We address the blind equalization of finite-impulse-response (FIR) and multiple-input multiple-output (MIMO) channel systems excited by constant modulus (CM) signals. It is known that the algorithms based on the CM criterion can equalize an FIR MIMO system that is irreducible. The irreducible condition is restrictive as it requires all source signals to be received at sensors simultaneously. In this paper, we further show that the CM property of signals can be exploited to construct a zero-forcing equalizer for a system that is nonirreducible. Simulation examples demonstrate the proposed result.

A modified CM algorithm for blind equalization of MPSK signals

A new blind equalization algorithm for application to wireless communication employing MPSK signals is proposed in this paper.  Since the new cost function exploits the amplitude and phase information simultaneously, the proposed algorithm can provide a superior performance than the conventional constant modulus algorithm (CMA) which only use the amplitude knowledge in its cost function.  Theoretical analysis and numerical simulations both demonstrate that the steady-state mean square error (MSE) for the proposed algorithm is less than that of the CMA.

Blind equalization of non-irreducible and non-column-reduced channels driven by constant modulus signals

We address the blind equalization of finite-impulse-response (FIR), multiple-input multiple-output (MIMO) channels excited by constant modulus (CM) signals. It is known that the algorithms based on the constant modulus (CM) criterion can equalize an FIR MIMO channel that is irreducible and column-reduced. We show in this paper that the CM property of signals can be exploited to construct a zero-forcing equalizer for a non-irreducible and non-column-reduced channel. We also give a lower bound for the order of the equalizer. Simulation examples demonstrate the proposed result.

Blind equalization of non-irreducible channels driven by MPSK signals

This paper deals with the problem of blind equalization of finite-impulse-response (FIR) and multiple-input multiple-output (MIMO) channels excited by M-ary phase shift keying (MPSK) signals. It is known that the algorithms based on the constant modulus (CM) criterion can equalize an FIR MIMO channel that is irreducible. The irreducible condition is restrictive since it requires that all source signals arrive at the receiving antennas simultaneously. In this paper, we show that the CM criterion can also be used to construct a zero-forcing equalizer for a channel that is non-irreducible. We also derive a lower bound for the order of the equalizer. The proposed result is validated by numerical simulations.

A new blind-equalization algorithm for an FIR SIMO system driven by MPSK signal

We consider the problem of blind equalization of a finite impulse response and single-input multiple-output system driven by an M-ary phase-shift-keying signal. The existing single-mode algorithms for this problem include the constant modulus algorithm (CMA) and the multimodulus algorithm (MMA). It has been shown that the MMA outperforms the CMA when the input signal has no more than four constellation points, i.e., Mles4. In this brief, we present a new adaptive equalization algorithm that jointly exploits the amplitude and phase information of the input signal. Theoretical analysis shows that the proposed algorithm has less mean square error, i.e., better equalization performance, at steady state than the CMA regardless of the value of M. The superior performance of our algorithm to the CMA and the MMA is validated by simulation examples

CM-based blind equalization of time-varying SIMO-FIR channel with single pulsation estimation

It is known that the constant modulus (CM) property of the source signal can be exploited to blindly equalize time-invariant single-inputmultiple-output (SIMO) and finite-impulse-response (FIR) channels. However, the time-invariance assumption about the channel cannot be satisfied in several practical applications, e.g., mobile communication. In this paper, we show that, under some mild conditions, the CM criterion can be extended to the blind equalization of a time-varying channel that is described by the complex exponential basis expansion model (CE-BEM). Although several existing blind equalization methods that are based on the CE-BEM have to employ higher order statistics to estimate all nonzero channel pulsations, the CM-based method only needs to estimate one pulsation using second-order statistics, which yields better estimation results. It also relaxes the restriction on the source signal and is applicable to some classes of signals with which the existing methods cannot deal.

A second-order blind equalization method robust to ill-conditioned SIMO FIR channels

This paper deals with blind equalization of single-input-multiple-output (SIMO) finite-impulse-response (FIR) channels driven by i.i.d. signal, by exploiting the second-order statistics (SOS) of the channel outputs. Usually, SOS-based blind equalization is carried out via two stages. In Stage 1, the SIMO FIR channel is estimated using a blind identification method, such as the recently developed truncated transfer matrix (TTM) method. In Stage 2, an equalizer is derived from the estimate of the channel to recover the source signal. However, this type of two-stage approach does not give satisfactory blind equalization result if the channel is ill-conditioned, which is often encountered in practical applications. In this paper, we first show that the TTM method does not work in some situations. Then, we propose a novel SOS-based blind equalization method which can directly estimate the equalizer without knowing the channel impulse responses. The proposed method can obtain the desired equalizer even in the case that the channel is ill-conditioned. The performance of our method is illustrated by numerical simulations and compared with four benchmark methods. © 2014 Elsevier Inc.

A regional multirnodulus algorithm for blind equalization of QAM signals: Introduction and steady-state analysis

It is well known that constant-modulus-based algorithms present a large mean-square error for high-order quadrature amplitude modulation (QAM) signals, which may damage the switching to decision-directed-based algorithms. In this paper, we introduce a regional multimodulus algorithm for blind equalization of QAM signals that performs similar to the supervised normalized least-mean-squares (NLMS) algorithm, independently of the QAM order. We find a theoretical relation between the coefficient vector of the proposed algorithm and the Wiener solution and also provide theoretical models for the steady-state excess mean-square error in a nonstationary environment. The proposed algorithm in conjunction with strategies to speed up its convergence and to avoid divergence can bypass the switching mechanism between the blind mode and the decision-directed mode. (c) 2012 Elsevier B.V. All rights reserved.