977 research outputs found
Efficient joint maximum-likelihood channel estimation and signal detection
In wireless communication systems, channel state information is often assumed to be available at the receiver. Traditionally, a training sequence is used to obtain the estimate of the channel. Alternatively, the channel can be identified using known properties of the transmitted signal. However, the computational effort required to find the joint ML solution to the symbol detection and channel estimation problem increases exponentially with the dimension of the problem. To significantly reduce this computational effort, we formulate the joint ML estimation and detection as an integer least-squares problem, and show that for a wide range of signal-to-noise ratios (SNR) and problem dimensions it can be solved via sphere decoding with expected complexity comparable to the complexity of heuristic
techniques
Adaptive channel selection for DOA estimation in MIMO radar
We present adaptive strategies for antenna selection for Direction of Arrival
(DoA) estimation of a far-field source using TDM MIMO radar with linear arrays.
Our treatment is formulated within a general adaptive sensing framework that
uses one-step ahead predictions of the Bayesian MSE using a parametric family
of Weiss-Weinstein bounds that depend on previous measurements. We compare in
simulations our strategy with adaptive policies that optimize the Bobrovsky-
Zaka{\i} bound and the Expected Cram\'er-Rao bound, and show the performance
for different levels of measurement noise.Comment: Submitted to the 25th European Signal Processing Conference
(EUSIPCO), 201
Out-sphere decoder for non-coherent ML SIMO detection and its expected complexity
In multi-antenna communication systems, channel information
is often not known at the receiver. To fully exploit
the bandwidth resources of the system and ensure the practical
feasibility of the receiver, the channel parameters are
often estimated and then employed in the design of signal
detection algorithms. However, sometimes communication
can occur in an environment where learning the channel coefficients
becomes infeasible. In this paper we consider the
problem of maximum-likelihood (ML)-detection in singleinput
multiple-output (SIMO) systems when the channel information
is completely unavailable at the receiver and when
the employed signalling at the transmitter is q-PSK. It is
well known that finding the solution to this optimization requires
solving an integer maximization of a quadratic form
and is, in general, an NP hard problem. To solve it, we propose
an exact algorithm based on the combination of branch
and bound tree search and semi-definite program (SDP) relaxation.
The algorithm resembles the standard sphere decoder
except that, since we are maximizing we need to construct
an upper bound at each level of the tree search. We
derive an analytical upper bound on the expected complexity
of the proposed algorithm
Joint data detection and channel estimation for OFDM systems
We develop new blind and semi-blind data detectors and channel estimators for orthogonal frequency-division multiplexing (OFDM) systems. Our data detectors require minimizing a complex, integer quadratic form in the data vector. The semi-blind detector uses both channel correlation and noise variance. The quadratic for the blind detector suffers from rank deficiency; for this, we give a low-complexity solution. Avoiding a computationally prohibitive exhaustive search, we solve our data detectors using sphere decoding (SD) and V-BLAST and provide simple adaptations of the SD algorithm. We consider how the blind detector performs under mismatch, generalize the basic data detectors to nonunitary constellations, and extend them to systems with pilots and virtual carriers. Simulations show that our data detectors perform well
A Summative Comparison of Blind Channel Estimation Techniques for Orthogonal Frequency Division Multiplexing Systems
The OFDM techniquei.e. Orthogonal frequency division multiplexing has become prominent in wireless communication since its instruction in 1950’s due to its feature of combating the multipath fading and other losses. In an OFDM system, a large number of orthogonal, overlapping, narrow band subchannels or subcarriers, transmitted in parallel, divide the available transmission bandwidth. The separation of the subcarriers is theoretically optimal such that there is a very compact spectral utilization. This paper reviewed the possible approaches for blind channel estimation in the light of the improved performance in terms of speed of convergence and complexity. There were various researches which adopted the ways for channel estimation for Blind, Semi Blind and trained channel estimators and detectors. Various ways of channel estimation such as Subspace, iteration based, LMSE or MSE based (using statistical methods), SDR, Maximum likelihood approach, cyclostationarity, Redundancy and Cyclic prefix based. The paper reviewed all the above approaches in order to summarize the outcomes of approaches aimed at optimum performance for channel estimation in OFDM system
Massive MIMO-based Localization and Mapping Exploiting Phase Information of Multipath Components
In this paper, we present a robust multipath-based localization and mapping
framework that exploits the phases of specular multipath components (MPCs)
using a massive multiple-input multiple-output (MIMO) array at the base
station. Utilizing the phase information related to the propagation distances
of the MPCs enables the possibility of localization with extraordinary accuracy
even with limited bandwidth. The specular MPC parameters along with the
parameters of the noise and the dense multipath component (DMC) are tracked
using an extended Kalman filter (EKF), which enables to preserve the
distance-related phase changes of the MPC complex amplitudes. The DMC comprises
all non-resolvable MPCs, which occur due to finite measurement aperture. The
estimation of the DMC parameters enhances the estimation quality of the
specular MPCs and therefore also the quality of localization and mapping. The
estimated MPC propagation distances are subsequently used as input to a
distance-based localization and mapping algorithm. This algorithm does not need
prior knowledge about the surrounding environment and base station position.
The performance is demonstrated with real radio-channel measurements using an
antenna array with 128 ports at the base station side and a standard cellular
signal bandwidth of 40 MHz. The results show that high accuracy localization is
possible even with such a low bandwidth.Comment: 14 pages (two columns), 13 figures. This work has been submitted to
the IEEE Transaction on Wireless Communications for possible publication.
Copyright may be transferred without notice, after which this version may no
longer be accessibl
- …