372 research outputs found
On the relaxed maximum-likelihood blind MIMO channel estimation for orthogonal space-time block codes
This paper concerns the maximum-likelihood channel estimation for MIMO
systems with orthogonal space-time block codes when the finite alphabet
constraint of the signal constellation is relaxed. We study the channel
coefficients estimation subspace generated by this method. We provide an
algebraic characterisation of this subspace which turns the optimization
problem into a purely algebraic one and more importantly, leads to several
interesting analytical proofs. We prove that with probability one, the
dimension of the estimation subspace for the channel coefficients is
deterministic and it decreases by increasing the number of receive antennas up
to a certain critical number of receive antennas, after which the dimension
remains constant. In fact, we show that beyond this critical number of receive
antennas, the estimation subspace for the channel coefficients is isometric to
a fixed deterministic invariant space which can be easily computed for every
specific OSTB code
Code combination for blind channel estimation in general MIMO-STBC systems
The problem of blind channel estimation under space-time block coded (STBC) transmissions is addressed. Firstly, a blind channel estimation criterion that generalizes previous works is proposed. The technique is solely based on second-order statistics (SOS) and if the channel is identifiable, the estimate is obtained as the main eigenvector of a generalized eigenvalue problem (GEV). Secondly, a new transmission technique is proposed to solve the indeterminacies associated to the blind channel estimation problem. The technique is based on the combination of different STBCs, and it can be reduced to a nonredundant precoding consisting in the rotation or permutation of the transmit antennas. Unlike other previous approaches, the proposed technique does not imply a penalty in the transmission rate or capacity of the STBC system, while it is able to avoid the ambiguities in many practical cases, which is illustrated by means of some simulation examples
A new subspace method for blind estimation of selective MIMO-STBC channels
In this paper, a new technique for the blind estimation of frequency and/or time-selective multiple-input multiple-output (MIMO) channels under space-time block coding (STBC) transmissions is presented. The proposed method relies on a basis expansion model (BEM) of the MIMO channel, which reduces the number of parameters to be estimated, and includes many practical STBC-based transmission scenarios, such as STBC-orthogonal frequency division multiplexing (OFDM), space-frequency block coding (SFBC), time-reversal STBC, and time-varying STBC encoded systems. Inspired by the unconstrained blind maximum likelihood (UML) decoder, the proposed criterion is a subspace method that efficiently exploits all the information provided by the STBC structure, as well as by the reduced-rank representation of the MIMO channel. The method, which is independent of the specific signal constellation, is able to blindly recover the MIMO channel within a small number of available blocks at the receiver side. In fact, for some particular cases of interest such as orthogonal STBC-OFDM schemes, the proposed technique blindly identifies the channel using just one data block. The complexity of the proposed approach reduces to the solution of a generalized eigenvalue (GEV) problem and its computational cost is linear in the number of sub-channels. An identifiability analysis and some numerical examples illustrating the performance of the proposed algorithm are also providedThis work was supported by the Spanish Government under projects TEC2007-68020-C04-02/TCM (MultiMIMO) and CONSOLIDER-INGENIO 2010 CSD2008-00010 (COMONSENS)
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
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
Blind Channel Estimation for STBC Systems Using Higher-Order Statistics
International audienceThis paper describes a new blind channel estimation algorithm for Space-Time Block Coded (STBC) systems. The proposed method exploits the statistical independence of sources before space-time encoding. The channel matrix is estimated by minimizing a kurtosis-based cost function after Zero-Forcing equalization. In contrast to subspace or Second-Order Statistics (SOS) approaches, the proposed method is more general since it can be employed for the general class of linear STBCs including Spatial Multiplexing, Orthogonal, quasi-Orthogonal and Non-Orthogonal STBCs. Furthermore, unlike other approaches, the method does not require any modification of the transmitter and, consequently, is well-suited for non-cooperative context. Numerical examples corroborate the performance of the proposed algorithm
- …