Network packet

Algorithm

Fading

Telecommunications

Computer science

Rician fading

Computer network

Decoding methods

Upper and lower bounds

Mathematics

Channel state information

Rayleigh fading

Mathematical analysis

Transmission (telecommunications)

Channel (broadcasting)

Wireless

Code rate

IEEE Transactions on Communications

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 a priori channel state information available at the transmitter or at the receiver. An upper bound built upon the min-max converse is compared with two lower bounds: the first one relies on a noncoherent transmission strategy in which the fading channel is not estimated explicitly at the receiver and 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, in Rayleigh fading, 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 eight symbols, PAT requires an additional 1.2 dB of energy per information bit to achieve a packet error probability of 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-3</sup> compared with 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 is close (1-dB gap at 10 <sup xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">-3</sup> 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.

Short Packets Over Block-Memoryless Fading Channels: Pilot-Assisted or Noncoherent Transmission?