303 research outputs found
Recommended from our members
MIMO block-fading channels with mismatched CSI
YesWe study transmission over multiple-input multiple-output (MIMO) block-fading channels with
imperfect channel state information (CSI) at both the transmitter and receiver. Specifically, based on
mismatched decoding theory for a fixed channel realization, we investigate the largest achievable rates
with independent and identically distributed inputs and a nearest neighbor decoder. We then study the
corresponding information outage probability in the high signal-to-noise ratio (SNR) regime and analyze
the interplay between estimation error variances at the transmitter and at the receiver to determine
the optimal outage exponent, defined as the high-SNR slope of the outage probability plotted in a
logarithmic-logarithmic scale against the SNR. We demonstrate that despite operating with imperfect
CSI, power adaptation can offer substantial gains in terms of outage exponent.A. T. Asyhari was supported in part by the Yousef Jameel Scholarship, University of Cambridge, Cambridge, U.K., and the National Science Council of Taiwan under grant NSC 102-2218-E-009-001. A. Guillén i Fà bregas was supported in part by the European Research Council under ERC grant agreement 259663 and the Spanish Ministry of Economy and Competitiveness under grant TEC2012-38800-C03-03
MIMO-OFDM Optimal Decoding and Achievable Information Rates Under Imperfect Channel Estimation
Optimal decoding of bit interleaved coded modulation (BICM) MIMO-OFDM where
an imperfect channel estimate is available at the receiver is investigated.
First, by using a Bayesian approach involving the channel a posteriori density,
we derive a practical decoding metric for general memoryless channels that is
robust to the presence of channel estimation errors. Then, we evaluate the
outage rates achieved by a decoder that uses our proposed metric. The
performance of the proposed decoder is compared to the classical mismatched
decoder and a theoretical decoder defined as the best decoder in the presence
of imperfect channel estimation. Numerical results over Rayleigh block fading
MIMO-OFDM channels show that the proposed decoder outperforms mismatched
decoding in terms of bit error rate and outage capacity without introducing any
additional complexity
Short Packets over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?
We present nonasymptotic upper and lower bounds on the maximum coding rate
achievable when transmitting short packets over a Rician memoryless
block-fading channel for a given requirement on the packet error probability.
We focus on the practically relevant scenario in which there is no \emph{a
priori} channel state information available at the transmitter and at the
receiver. An upper bound built upon the min-max converse is compared to two
lower bounds: the first one relies on a noncoherent transmission strategy in
which the fading channel is not estimated explicitly at the receiver; the
second one employs pilot-assisted transmission (PAT) followed by
maximum-likelihood channel estimation and scaled mismatched nearest-neighbor
decoding at the receiver. Our bounds are tight enough to unveil the optimum
number of diversity branches that a packet should span so that the energy per
bit required to achieve a target packet error probability is minimized, for a
given constraint on the code rate and the packet size. Furthermore, the bounds
reveal that noncoherent transmission is more energy efficient than PAT, even
when the number of pilot symbols and their power is optimized. For example, for
the case when a coded packet of symbols is transmitted using a channel
code of rate bits/channel use, over a block-fading channel with block
size equal to symbols, PAT requires an additional dB of energy per
information bit to achieve a packet error probability of compared to
a suitably designed noncoherent transmission scheme. Finally, we devise a PAT
scheme based on punctured tail-biting quasi-cyclic codes and ordered statistics
decoding, whose performance are close ( dB gap at packet error
probability) to the ones predicted by our PAT lower bound. This shows that the
PAT lower bound provides useful guidelines on the design of actual PAT schemes.Comment: 30 pages, 5 figures, journa
- …