3,613 research outputs found
Multichannel receivers from ofdm and tdma in mobile communications
This paper addresses the use of multichannel receivers for blind equalization in TDMA under frequency selective channels and OFDM systems in frequency flat fading channels. A new criteria is proposed for blind equalization of finite length mobile channels.Peer ReviewedPostprint (published version
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
MIMO signal processing in offset-QAM based filter bank multicarrier systems
Next-generation communication systems have to comply with very strict requirements for increased flexibility in heterogeneous environments, high spectral efficiency, and agility of carrier aggregation. This fact motivates research in advanced multicarrier modulation (MCM) schemes, such as filter bank-based multicarrier (FBMC) modulation. This paper focuses on the offset quadrature amplitude modulation (OQAM)-based FBMC variant, known as FBMC/OQAM, which presents outstanding spectral efficiency and confinement in a number of channels and applications. Its special nature, however, generates a number of new signal processing challenges that are not present in other MCM schemes, notably, in orthogonal-frequency-division multiplexing (OFDM). In multiple-input multiple-output (MIMO) architectures, which are expected to play a primary role in future communication systems, these challenges are intensified, creating new interesting research problems and calling for new ideas and methods that are adapted to the particularities of the MIMO-FBMC/OQAM system. The goal of this paper is to focus on these signal processing problems and provide a concise yet comprehensive overview of the recent advances in this area. Open problems and associated directions for future research are also discussed.Peer ReviewedPostprint (author's final draft
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
Subspace-Based Blind Channel Identification for Cyclic Prefix Systems Using Few Received Blocks
In this paper, a novel generalization of subspace-based blind channel identification methods in cyclic prefix (CP) systems is proposed. For the generalization, a new system parameter called repetition index is introduced whose value is unity for previously reported special cases. By choosing a repetition index larger than unity, the number of received blocks needed for blind identification is significantly reduced compared to all previously reported methods. This feature makes the method more realistic especially in wireless environments where the channel state is usually fast-varying. Given the number of received blocks available, the minimum value of repetition index is derived. Theoretical limit allows the proposed method to perform blind identification using only three received blocks in absence of noise. In practice, the number of received blocks needed to yield a satisfactory bit-error-rate (BER) performance is usually on the order of half the block size. Simulation results not only demonstrate the capability of the algorithm to perform blind identification using fewer received blocks, but also show that in some cases system performance can be improved by choosing a repetition index larger than needed. Simulation of the proposed method over time-varying channels clearly demonstrates the improvement over previously reported methods
Hybrid solutions to instantaneous MIMO blind separation and decoding: narrowband, QAM and square cases
Future wireless communication systems are desired to support high data rates and high quality transmission when considering the growing multimedia applications. Increasing the channel throughput leads to the multiple input and multiple output and blind equalization techniques in recent years. Thereby blind MIMO equalization has attracted a great interest.Both system performance and computational complexities play important roles in real time communications. Reducing the computational load and providing accurate performances are the main challenges in present systems. In this thesis, a hybrid method which can provide an affordable complexity with good performance for Blind Equalization in large constellation MIMO systems is proposed first. Saving computational cost happens both in the signal sep- aration part and in signal detection part. First, based on Quadrature amplitude modulation signal characteristics, an efficient and simple nonlinear function for the Independent Compo- nent Analysis is introduced. Second, using the idea of the sphere decoding, we choose the soft information of channels in a sphere, and overcome the so- called curse of dimensionality of the Expectation Maximization (EM) algorithm and enhance the final results simultaneously. Mathematically, we demonstrate in the digital communication cases, the EM algorithm shows Newton -like convergence.Despite the widespread use of forward -error coding (FEC), most multiple input multiple output (MIMO) blind channel estimation techniques ignore its presence, and instead make the sim- plifying assumption that the transmitted symbols are uncoded. However, FEC induces code structure in the transmitted sequence that can be exploited to improve blind MIMO channel estimates. In final part of this work, we exploit the iterative channel estimation and decoding performance for blind MIMO equalization. Experiments show the improvements achievable by exploiting the existence of coding structures and that it can access the performance of a BCJR equalizer with perfect channel information in a reasonable SNR range. All results are confirmed experimentally for the example of blind equalization in block fading MIMO systems
- âŠ