481 research outputs found
Low Complexity Blind Equalization for OFDM Systems with General Constellations
This paper proposes a low-complexity algorithm for blind equalization of data
in OFDM-based wireless systems with general constellations. The proposed
algorithm is able to recover data even when the channel changes on a
symbol-by-symbol basis, making it suitable for fast fading channels. The
proposed algorithm does not require any statistical information of the channel
and thus does not suffer from latency normally associated with blind methods.
We also demonstrate how to reduce the complexity of the algorithm, which
becomes especially low at high SNR. Specifically, we show that in the high SNR
regime, the number of operations is of the order O(LN), where L is the cyclic
prefix length and N is the total number of subcarriers. Simulation results
confirm the favorable performance of our algorithm
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
-norm of the source signal with the relaxed -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 -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
Underdetermined-order recursive least-squares adaptive filtering: The concept and algorithms
Published versio
Space-time processing for wireless mobile communications
Intersymbol interference (ISI) and co-channel interference (CCI) are two major
obstacles to high speed data transmission in wireless cellular communications
systems. Unlike thermal noise, their effects cannot be removed by
increasing the signal power and are time-varying due to the relative motion
between the transmitters and receivers. Space-time processing offers a signal
processing framework to optimally integrate the spatial and temporal properties
of the signal for maximal signal reception and at the same time, mitigate
the ISI and CCI impairments. In this thesis, we focus on the development of
this emerging technology to combat the undesirable effects of ISI and CCL
We first develop a convenient mathematical model to parameterize the
space-time multipath channel based on signal path power, directions and
times of arrival. Starting from the continuous time-domain, we derive compact
expressions of the vector space-time channel model that lead to the
notion of block space-time manifold, Under certain identifiability conditions,
the noiseless vector-channel outputs will lie on a subspace constructed from
a set. of basis belonging to the block space-time manifold. This is an important
observation as many high resolution array processing algorithms Can be
applied directly to estimate the multi path channel parameters.
Next we focus on the development of semi-blind channel identification
and equalization algorithms for fast time-varying multi path channels. Specifically.
we develop space-time processing algorithms for wireless TDMA networks that use short burst data formats with extremely short training data.
sequences. Due to the latter, the estimated channel parameters are extremely
unreliable for equalization with conventional adaptive methods. We approach
the channel acquisition, tracking and equalization problems jointly, and exploit
the richness of the inherent structural relationship between the channel
parameters and the data sequence by repeated use of available data through a forward- backward optimization procedure. This enables the fuller exploitation
of the available data. Our simulation studies show that significant performance
gains are achieved over conventional methods.
In the final part of this thesis, we address the problem identifying and
equalizing multi path communication channels in the presence of strong CCl.
By considering CCI as stochasic processes, we find that temporal diversity
can be gained by observing the channel outputs from a tapped delay line. Together with the assertion that the finite alphabet property of the information
sequences can offer additional information about the channel parameters and
the noise-plus-covariance matrix, we develop a spatial temporal algorithm,
iterative reweighting alternating minimization, to estimate the channel parameters
and information sequence in a weighted least squares framework.
The proposed algorithm is robust as it does not require knowledge of the
number of CCI nor their structural information. Simulation studies demonstrate
its efficacy over many reported methods
Sparse Nonlinear MIMO Filtering and Identification
In this chapter system identification algorithms for sparse nonlinear multi input multi output (MIMO) systems are developed. These algorithms are potentially useful in a variety of application areas including digital transmission systems incorporating power amplifier(s) along with multiple antennas, cognitive processing, adaptive control of nonlinear multivariable systems, and multivariable biological systems. Sparsity is a key constraint imposed on the model. The presence of sparsity is often dictated by physical considerations as in wireless fading channel-estimation. In other cases it appears as a pragmatic modelling approach that seeks to cope with the curse of dimensionality, particularly acute in nonlinear systems like Volterra type series. Three dentification approaches are discussed: conventional identification based on both input and output samples, semi–blind identification placing emphasis on minimal input resources and blind identification whereby only output samples are available plus a–priori information on input characteristics. Based on this taxonomy a variety of algorithms, existing and new, are studied and evaluated by simulation
A channel subspace post-filtering approach to adaptive equalization
Submitted in partial fulfillment of the requirements for the degree of Master of Science at the Massachusetts Institute of Technology and the Woods Hole Oceanographic Institution February 2002One of the major problems in wireless communications is compensating for the time-varying
intersymbol interference (ISI) due to multipath. Underwater acoustic communications
is one such type of wireless communications in which the channel is
highly dynamic and the amount of ISI due to multipath is relatively large. In the
underwater acoustic channel, associated with each of the deterministic propagation
paths are macro-multipath fluctuations which depend on large scale environmental
features and geometry, and micro-multipath fluctuations which are dependent on
small scale environmental inhomogeneities. For arrivals which are unsaturated or
partially saturated, the fluctuations in ISI are dominated by the macro-multipath
fluctuations resulting in correlated fluctuations between different taps of the sampled
channel impulse response. Traditional recursive least squares (RLS) algorithms used
for adapting channel equalizers do not exploit this structure. A channel subspace
post-filtering algorithm that treats the least squares channel estimate as a noisy time
series and exploits the channel correlation structure to reduce the channel estimation
error is presented. The improvement in performance of the algorithm with respect to
traditional least squares algorithms is predicted theoretically, and demonstrated using
both simulation and experimental data. An adaptive equalizer structure that explicitly
uses this improved estimate of the channel impulse response is discussed. The
improvement in performance of such an equalizer due to the use of the post-filtered
estimate is also predicted theoretically, and demonstrated using both simulation and
experimental data.This research was supported by an ONR Graduate Traineeship Award Grant #N00014-00-10049
- …