2,128 research outputs found
Low-Complexity Iterative Detection for Orthogonal Time Frequency Space Modulation
We elaborate on the recently proposed orthogonal time frequency space (OTFS)
modulation technique, which provides significant advantages over orthogonal
frequency division multiplexing (OFDM) in Doppler channels. We first derive the
input--output relation describing OTFS modulation and demodulation (mod/demod)
for delay--Doppler channels with arbitrary number of paths, with given delay
and Doppler values. We then propose a low-complexity message passing (MP)
detection algorithm, which is suitable for large-scale OTFS taking advantage of
the inherent channel sparsity. Since the fractional Doppler paths (i.e., not
exactly aligned with the Doppler taps) produce the inter Doppler interference
(IDI), we adapt the MP detection algorithm to compensate for the effect of IDI
in order to further improve performance. Simulations results illustrate the
superior performance gains of OTFS over OFDM under various channel conditions.Comment: 6 pages, 7 figure
Multipath Parameter Estimation from OFDM Signals in Mobile Channels
We study multipath parameter estimation from orthogonal frequency division
multiplex signals transmitted over doubly dispersive mobile radio channels. We
are interested in cases where the transmission is long enough to suffer time
selectivity, but short enough such that the time variation can be accurately
modeled as depending only on per-tap linear phase variations due to Doppler
effects. We therefore concentrate on the estimation of the complex gain, delay
and Doppler offset of each tap of the multipath channel impulse response. We
show that the frequency domain channel coefficients for an entire packet can be
expressed as the superimposition of two-dimensional complex sinusoids. The
maximum likelihood estimate requires solution of a multidimensional non-linear
least squares problem, which is computationally infeasible in practice. We
therefore propose a low complexity suboptimal solution based on iterative
successive and parallel cancellation. First, initial delay/Doppler estimates
are obtained via successive cancellation. These estimates are then refined
using an iterative parallel cancellation procedure. We demonstrate via Monte
Carlo simulations that the root mean squared error statistics of our estimator
are very close to the Cramer-Rao lower bound of a single two-dimensional
sinusoid in Gaussian noise.Comment: Submitted to IEEE Transactions on Wireless Communications (26 pages,
9 figures and 3 tables
Coded DS-CDMA Systems with Iterative Channel Estimation and no Pilot Symbols
In this paper, we describe direct-sequence code-division multiple-access
(DS-CDMA) systems with quadriphase-shift keying in which channel estimation,
coherent demodulation, and decoding are iteratively performed without the use
of any training or pilot symbols. An expectation-maximization
channel-estimation algorithm for the fading amplitude, phase, and the
interference power spectral density (PSD) due to the combined interference and
thermal noise is proposed for DS-CDMA systems with irregular repeat-accumulate
codes. After initial estimates of the fading amplitude, phase, and interference
PSD are obtained from the received symbols, subsequent values of these
parameters are iteratively updated by using the soft feedback from the channel
decoder. The updated estimates are combined with the received symbols and
iteratively passed to the decoder. The elimination of pilot symbols simplifies
the system design and allows either an enhanced information throughput, an
improved bit error rate, or greater spectral efficiency. The interference-PSD
estimation enables DS-CDMA systems to significantly suppress interference.Comment: To appear, IEEE Transactions on Wireless Communication
Compressive Random Access Using A Common Overloaded Control Channel
We introduce a "one shot" random access procedure where users can send a
message without a priori synchronizing with the network. In this procedure a
common overloaded control channel is used to jointly detect sparse user
activity and sparse channel profiles. The detected information is subsequently
used to demodulate the data in dedicated frequency slots. We analyze the system
theoretically and provide a link between achievable rates and standard
compressing sensing estimates in terms of explicit expressions and scaling
laws. Finally, we support our findings with simulations in an LTE-A-like
setting allowing "one shot" sparse random access of 100 users in 1ms.Comment: 6 pages, 3 figures, published at Globecom 201
- …