Robust equalization of multichannel acoustic systems

In most real-world acoustical scenarios, speech signals captured by distant microphones from a source are reverberated due to multipath propagation, and the reverberation may impair speech intelligibility. Speech dereverberation can be achieved by equalizing the channels from the source to microphones. Equalization systems can be computed using estimates of multichannel acoustic impulse responses. However, the estimates obtained from system identification always include errors; the fact that an equalization system is able to equalize the estimated multichannel acoustic system does not mean that it is able to equalize the true system. The objective of this thesis is to propose and investigate robust equalization methods for multichannel acoustic systems in the presence of system identification errors. Equalization systems can be computed using the multiple-input/output inverse theorem or multichannel least-squares method. However, equalization systems obtained from these methods are very sensitive to system identification errors. A study of the multichannel least-squares method with respect to two classes of characteristic channel zeros is conducted. Accordingly, a relaxed multichannel least- squares method is proposed. Channel shortening in connection with the multiple- input/output inverse theorem and the relaxed multichannel least-squares method is discussed. Two algorithms taking into account the system identification errors are developed. Firstly, an optimally-stopped weighted conjugate gradient algorithm is proposed. A conjugate gradient iterative method is employed to compute the equalization system. The iteration process is stopped optimally with respect to system identification errors. Secondly, a system-identification-error-robust equalization method exploring the use of error models is presented, which incorporates system identification error models in the weighted multichannel least-squares formulation

Blind MultiChannel Identification and Equalization for Dereverberation and Noise Reduction based on Convolutive Transfer Function

This paper addresses the problems of blind channel identification and multichannel equalization for speech dereverberation and noise reduction. The time-domain cross-relation method is not suitable for blind room impulse response identification, due to the near-common zeros of the long impulse responses. We extend the cross-relation method to the short-time Fourier transform (STFT) domain, in which the time-domain impulse responses are approximately represented by the convolutive transfer functions (CTFs) with much less coefficients. The CTFs suffer from the common zeros caused by the oversampled STFT. We propose to identify CTFs based on the STFT with the oversampled signals and the critical sampled CTFs, which is a good compromise between the frequency aliasing of the signals and the common zeros problem of CTFs. In addition, a normalization of the CTFs is proposed to remove the gain ambiguity across sub-bands. In the STFT domain, the identified CTFs is used for multichannel equalization, in which the sparsity of speech signals is exploited. We propose to perform inverse filtering by minimizing the $\ell_1$-norm of the source signal with the relaxed $\ell_2$-norm fitting error between the micophone signals and the convolution of the estimated source signal and the CTFs used as a constraint. This method is advantageous in that the noise can be reduced by relaxing the $\ell_2$-norm to a tolerance corresponding to the noise power, and the tolerance can be automatically set. The experiments confirm the efficiency of the proposed method even under conditions with high reverberation levels and intense noise.Comment: 13 pages, 5 figures, 5 table

Diversity in mobile communications for blind detection of block-coded modulations

Spatial, temporal, and frequency diversity structures are analyzed to address the blind equalization problem in the presence of time-variant frequency selective channels. The aim of the paper is to present equalization schemes useful in front of fast changing channel responses. The best solution is a deterministic blind criterion that allows direct channel equalization and symbol detection. The main contribution of this paper is to present deterministic blind equalization schemes in CDMA systems (frequency diversity) to reduce the impact of the time-variant frequency selective channel.Peer ReviewedPostprint (published version

Blind equalization of DS-CDMA and MC-CDMA modulations in time-variant frequency selective channels

The paper addresses the blind equalization problem of spread spectrum modulations in the presence of fast time-variant frequency-selective channels. The basic assumption of the paper is that the channel response exhibits fast changes. A second goal of the paper is to force the definition of a universal CDMA blind equalization scheme that is capable of performing for DS-CDMA or multi-carrier CDMA signal modulations without any modification in the equalizer. The formulation of the equalization scheme allows the consideration of temporal and/or spatial diversity front-end receivers. The result is a high-performance system that uses a deterministic blind criterion to equalize the channel, avoiding the use of stochastic methods. The proposed technique performs direct channel equalization without previous channel estimation. Although the proposed equalizer in this work performs equalization at chip rate, this paper suggests a solution to achieve equalization at lower rates.Peer ReviewedPostprint (published version

Semiblind Channel Estimation and Data Detection for OFDM Systems With Optimal Pilot Design

This paper considers semiblind channel estimation and data detection for orthogonal frequency-division multiplexing (OFDM) over frequency-selective fading channels. We show that the samples of an OFDM symbol are jointly complex Gaussian distributed, where the mean and covariance are determined by the locations and values of fixed pilot symbols. We exploit this distribution to derive a novel maximum-likelihood (ML) semiblind gradient-descent channel estimator. By exploiting the channel impulse response (CIR) statistics, we also derive a semiblind data detector for both Rayleigh and Ricean fading channels. Furthermore, we develop an enhanced data detector, which uses the estimator error statistics to mitigate the effect of channel estimation errors. Efficient implementation of both the semiblind and the improved data detectors is provided via sphere decoding and nulling-canceling detection. We also derive the Cramér-Rao bound (CRB) and design optimal pilots by minimizing the CRB. Our proposed channel estimator and data detector exhibit high bandwidth efficiency (requiring only a few pilot symbols), achieve the CRB, and also nearly reach the performance of an ideal reference receiver

Blind Receiver Design for OFDM Systems Over Doubly Selective Channels

We develop blind data detectors for orthogonal frequency-division multiplexing (OFDM) systems over doubly selective channels by exploiting both frequency-domain and time-domain correlations of the received signal. We thus derive two blind data detectors: a time-domain data detector and a frequency-domain data detector. We also contribute a reduced complexity, suboptimal version of a time-domain data detector that performs robustly when the normalized Doppler rate is less than 3%. Our frequency-domain data detector and suboptimal time-domain data detector both result in integer least-squares (LS) problems. We propose the use of the V-BLAST detector and the sphere decoder. The time-domain data detector is not limited to the Doppler rates less than 3%, but cannot be posed as an integer LS problem. Our solution is to develop an iterative algorithm that starts from the suboptimal time-domain data detector output. We also propose channel estimation and prediction algorithms using a polynomial expansion model, and these estimators work with data detectors (decision-directed mode) to reduce the complexity. The estimators for the channel statistics and the noise variance are derived using the likelihood function for the data. Our blind data detectors are fairly robust against the parameter mismatch

SGD Frequency-Domain Space-Frequency Semiblind Multiuser Receiver with an Adaptive Optimal Mixing Parameter

A novel stochastic gradient descent frequency-domain (FD) space-frequency (SF) semiblind multiuser receiver with an adaptive optimal mixing parameter is proposed to improve performance of FD semiblind multiuser receivers with a fixed mixing parameters and reduces computational complexity of suboptimal FD semiblind multiuser receivers in SFBC downlink MIMO MC-CDMA systems where various numbers of users exist. The receiver exploits an adaptive mixing parameter to mix information ratio between the training-based mode and the blind-based mode. Analytical results prove that the optimal mixing parameter value relies on power and number of active loaded users existing in the system. Computer simulation results show that when the mixing parameter is adapted closely to the optimal mixing parameter value, the performance of the receiver outperforms existing FD SF adaptive step-size (AS) LMS semiblind based with a fixed mixing parameter and conventional FD SF AS-LMS training-based multiuser receivers in the MSE, SER and signal to interference plus noise ratio in both static and dynamic environments

Application of hidden markov models to blind channel estimation and data detection in a gsm environment

In this paper, we present an algorithm based on the Hidden Markov Models (HMM) theory to solve the problem of blind channel estimation and sequence detection in mobile digital communications. The environment in which the algorithm is tested is the Paneuropean Mobile Radio System, also known as GSM. In this system, a large part in each burst is devoted to allocate a training sequence used to obtain a channel estimate. The algorithm presented would not require this sequence, and that would imply an increase of the system capacity. Performance, evaluated for standard test channels, is close to that of non-blind algorithms.Peer ReviewedPostprint (published version