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 $168$ symbols is transmitted using a channel code of rate $0.48$ bits/channel use, over a block-fading channel with block size equal to $8$ symbols, PAT requires an additional $1.2$ dB of energy per information bit to achieve a packet error probability of $10^{-3}$ 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 ($1$ dB gap at $10^{-3}$ 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

Diversity gain for DVB-H by using transmitter/receiver cyclic delay diversity

The objective of this paper is to investigate different diversity techniques for broadcast networks that will minimize the complexity and improve received SNR of broadcast systems. Resultant digital broadcast networks would require fewer transmitter sites and thus be more cost-effective and have less environmental impact. The techniques can be applied to DVB-T, DVB-H and DAB systems that use Orthogonal Frequency Division Multplexing (OFDM). These are key radio broadcast network technologies, which are expected to complement emerging technologies such as WiMAX and future 4G networks for delivery of broadband content. Transmitter and receiver diversity technologies can increase the frequency and time selectivity of the resulting channel transfer function at the receiver. Diversity exploits the statistical nature of fading due to multipath and reduces the likelihood of deep fading by providing a diversity of transmission signals. Multiple signals are transmitted in such a way as to ensure that several signals reach the receiver each with uncorrelated fading. Transmit diversity is more practical than receive diversity due to the difficulty of locating two receive antennas far enough apart in a small mobile device. The schemes examined here comply with existing DVB standards and can be incorporated into existing systems without change. The diversity techniques introduced in this paper are applied to the DVB-H system. Bit error performance investigations were conducted by simulation for different DVB-H and diversity parameters

Low-Latency Short-Packet Transmissions: Fixed Length or HARQ?

We study short-packet communications, subject to latency and reliability constraints, under the premises of limited frequency diversity and no time diversity. The question addressed is whether, and when, hybrid automatic repeat request (HARQ) outperforms fixed-blocklength schemes with no feedback (FBL-NF) in such a setting. We derive an achievability bound for HARQ, under the assumption of a limited number of transmissions. The bound relies on pilot-assisted transmission to estimate the fading channel and scaled nearest-neighbor decoding at the receiver. We compare our achievability bound for HARQ to stateof-the-art achievability bounds for FBL-NF communications and show that for a given latency, reliability, number of information bits, and number of diversity branches, HARQ may significantly outperform FBL-NF. For example, for an average latency of 1 ms, a target error probability of 10^-3, 30 information bits, and 3 diversity branches, the gain in energy per bit is about 4 dB.Comment: 6 pages, 5 figures, accepted to GLOBECOM 201

Impact of Spatial Correlation on the Finite-SNR Diversity-Multiplexing Tradeoff

The impact of spatial correlation on the performance limits of multielement antenna (MEA) channels is analyzed in terms of the diversity-multiplexing tradeoff (DMT) at finite signal-to-noise ratio (SNR) values. A lower bound on the outage probability is first derived. Using this bound accurate finite-SNR estimate of the DMT is then derived. This estimate allows to gain insight on the impact of spatial correlation on the DMT at finite SNR. As expected, the DMT is severely degraded as the spatial correlation increases. Moreover, using asymptotic analysis, we show that our framework encompasses well-known results concerning the asymptotic behavior of the DMT.Comment: Accepted for publication to IEEE Transaction on Wireless Communication on June 4th 200

Noncoherent Space-Time Coding: An Algebraic Perspective

Cataloged from PDF version of article.The design of space–time signals for noncoherent block-fading channels where the channel state information is not known a priori at the transmitter and the receiver is considered. In particular, a new algebraic formulation for the diversity advantage design criterion is developed. The new criterion encompasses, as a special case, the well-known diversity advantage for unitary space–time signals and, more importantly, applies to arbitrary signaling schemes and arbitrary channel distributions. This criterion is used to establish the optimal diversity-versus-rate tradeoff for training based schemes in block-fading channels. Our results are then specialized to the class of affine space–time signals which allows for a low complexity decoder. Within this class, space–time constellations based on the threaded algebraic space–time (TAST) architecture are considered. These constellations achieve the optimal diversity-versus-rate tradeoff over noncoherent block-fading channels and outperform previously proposed codes in the considered scenarios as demonstrated by the numerical results. Using the analytical and numerical results developed in this paper, nonunitary space–time codes are argued to offer certain advantages in block-fading channels where the appropriate use of coherent space–time codes is shown to offer a very efficient solution to the noncoherent space–time communication paradigm