2,175 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
New Blind Block Synchronization for Transceivers Using Redundant Precoders
This paper studies the blind block synchronization problem in block transmission systems using linear redundant precoders (LRP). Two commonly used LRP systems, namely, zero padding (ZP) and cyclic prefix (CP) systems, are considered in this paper. In particular, the block synchronization problem in CP systems is a broader version of timing synchronization problem in the popular orthogonal frequency division multiplexing (OFDM) systems. The proposed algorithms exploit the rank deficiency property of the matrix composed of received blocks when the block synchronization is perfect and use a parameter called repetition index which can be chosen as any positive integer. Theoretical results suggest advantages in blind block synchronization performances when using a large repetition index. Furthermore, unlike previously reported algorithms, which require a large amount of received data, the proposed methods, with properly chosen repetition indices, guarantee correct block synchronization in absence of noise using only two received blocks in ZP systems and three in CP systems. Computer simulations are conducted to evaluate the performances of the proposed algorithms and compare them with previously reported algorithms. Simulation results not only verify the capability of the proposed algorithms to work with limited received data but also show significant improvements in the block synchronization error rate performance of the proposed algorithms over previously reported algorithms
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
Estimation of Sparse MIMO Channels with Common Support
We consider the problem of estimating sparse communication channels in the
MIMO context. In small to medium bandwidth communications, as in the current
standards for OFDM and CDMA communication systems (with bandwidth up to 20
MHz), such channels are individually sparse and at the same time share a common
support set. Since the underlying physical channels are inherently
continuous-time, we propose a parametric sparse estimation technique based on
finite rate of innovation (FRI) principles. Parametric estimation is especially
relevant to MIMO communications as it allows for a robust estimation and
concise description of the channels. The core of the algorithm is a
generalization of conventional spectral estimation methods to multiple input
signals with common support. We show the application of our technique for
channel estimation in OFDM (uniformly/contiguous DFT pilots) and CDMA downlink
(Walsh-Hadamard coded schemes). In the presence of additive white Gaussian
noise, theoretical lower bounds on the estimation of SCS channel parameters in
Rayleigh fading conditions are derived. Finally, an analytical spatial channel
model is derived, and simulations on this model in the OFDM setting show the
symbol error rate (SER) is reduced by a factor 2 (0 dB of SNR) to 5 (high SNR)
compared to standard non-parametric methods - e.g. lowpass interpolation.Comment: 12 pages / 7 figures. Submitted to IEEE Transactions on Communicatio
Random Access in Massive MIMO by Exploiting Timing Offsets and Excess Antennas
Massive MIMO systems, where base stations are equipped with hundreds of
antennas, are an attractive way to handle the rapid growth of data traffic. As
the number of user equipments (UEs) increases, the initial access and handover
in contemporary networks will be flooded by user collisions. In this paper, a
random access protocol is proposed that resolves collisions and performs timing
estimation by simply utilizing the large number of antennas envisioned in
Massive MIMO networks. UEs entering the network perform spreading in both time
and frequency domains, and their timing offsets are estimated at the base
station in closed-form using a subspace decomposition approach. This
information is used to compute channel estimates that are subsequently employed
by the base station to communicate with the detected UEs. The favorable
propagation conditions of Massive MIMO suppress interference among UEs whereas
the inherent timing misalignments improve the detection capabilities of the
protocol. Numerical results are used to validate the performance of the
proposed procedure in cellular networks under uncorrelated and correlated
fading channels. With UEs that may simultaneously become active
with probability 1\% and a total of frequency-time codes (in a given
random access block), it turns out that, with antennas, the proposed
procedure successfully detects a given UE with probability 75\% while providing
reliable timing estimates.Comment: 30 pages, 6 figures, 1 table, submitted to Transactions on
Communication
Diversity techniques for blind channel equalization in mobile communications
A blind algorithm for channel distortion compensation is presented which can be employed in spatial or temporal diversity receivers. The proposed technique can be used in frequency selective and frequency flat fading mobile channels, using burst transmission schemes in the first case and OFDM modulation in the second one. The algorithm is base on a deterministic criteria and is suited for estimation when short sets of data are available.Peer ReviewedPostprint (published version
Preprint: Using RF-DNA Fingerprints To Classify OFDM Transmitters Under Rayleigh Fading Conditions
The Internet of Things (IoT) is a collection of Internet connected devices
capable of interacting with the physical world and computer systems. It is
estimated that the IoT will consist of approximately fifty billion devices by
the year 2020. In addition to the sheer numbers, the need for IoT security is
exacerbated by the fact that many of the edge devices employ weak to no
encryption of the communication link. It has been estimated that almost 70% of
IoT devices use no form of encryption. Previous research has suggested the use
of Specific Emitter Identification (SEI), a physical layer technique, as a
means of augmenting bit-level security mechanism such as encryption. The work
presented here integrates a Nelder-Mead based approach for estimating the
Rayleigh fading channel coefficients prior to the SEI approach known as RF-DNA
fingerprinting. The performance of this estimator is assessed for degrading
signal-to-noise ratio and compared with least square and minimum mean squared
error channel estimators. Additionally, this work presents classification
results using RF-DNA fingerprints that were extracted from received signals
that have undergone Rayleigh fading channel correction using Minimum Mean
Squared Error (MMSE) equalization. This work also performs radio discrimination
using RF-DNA fingerprints generated from the normalized magnitude-squared and
phase response of Gabor coefficients as well as two classifiers. Discrimination
of four 802.11a Wi-Fi radios achieves an average percent correct classification
of 90% or better for signal-to-noise ratios of 18 and 21 dB or greater using a
Rayleigh fading channel comprised of two and five paths, respectively.Comment: 13 pages, 14 total figures/images, Currently under review by the IEEE
Transactions on Information Forensics and Securit
- …