2,438 research outputs found
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
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 Semi-Blind Pilot-Assisted Channel Estimation Algorithm in OFDM Systems
In this paper we study a new semi-blind channel estimation algorithm in orthogonal frequency division multiplexing (OFDM) systems. The proposed scheme is an extension of a recently reported subspace-based blind channel estimation algorithm in cyclic prefix systems which requires very few received blocks. The semi-blind estimation algorithm is devised by using the information obtained both from the blind channel estimation method and a pure pilot-assisted method. The proposed algorithm uses a small amount of received data and can be applied to any types of communication constellations. Simulation results show that, with the same number of pilot samples, the semi-blind algorithm has a clear improvement in system performance over the pure pilot-assisted method. To achieve the same bit- error-rate performance, the proposed semi-blind algorithm uses fewer pilot samples
On the Persistency of Excitation for Blind Channel Estimation in Cyclic Prefix Systems
Recently, a new subspace-based blind channel estimation
algorithm in cyclic prefix (CP) system was reported.
A persistency of excitation (PE) property of the input signal is
required for the algorithm to work. In this paper, the probability
of fulfilling the PE property under different situations is studied.
Four factors in the algorithm affect the PE property of the input
signal: 1) signal constellation used; 2) precoder coefficients; 3)
number of consecutive blocks; 4) a number called the repetition
index. Theoretical derivations as well as numerical simulations
are given to demonstrate the main points of this paper. Important
conclusions are 1) that the probability of fulfilling the PE
property increases and converges to unity when the number
of received blocks increases but is always upper-bounded by
a value less than unity when the repetition index increases;
2) that the probability of fulfilling the PE property is smaller
when the algorithm is applied in orthogonal frequency division
multiplexing (OFDM) systems than in single-carrier-cyclic-prefix
(SC-CP) systems
Vandermonde-subspace Frequency Division Multiplexing for Two-Tiered Cognitive Radio Networks
Vandermonde-subspace frequency division multiplexing (VFDM) is an overlay
spectrum sharing technique for cognitive radio. VFDM makes use of a precoder
based on a Vandermonde structure to transmit information over a secondary
system, while keeping an orthogonal frequency division multiplexing
(OFDM)-based primary system interference-free. To do so, VFDM exploits
frequency selectivity and the use of cyclic prefixes by the primary system.
Herein, a global view of VFDM is presented, including also practical aspects
such as linear receivers and the impact of channel estimation. We show that
VFDM provides a spectral efficiency increase of up to 1 bps/Hz over cognitive
radio systems based on unused band detection. We also present some key design
parameters for its future implementation and a feasible channel estimation
protocol. Finally we show that, even when some of the theoretical assumptions
are relaxed, VFDM provides non-negligible rates while protecting the primary
system.Comment: 9 pages, accepted for publication in IEEE Transactions on
Communication
- âŠ