List Decoding of Short Codes for Communication over Unknown Fading Channels

Abstract

In this paper, the advantages of list decoding for short packet transmission over fading channels with an unknown state are illustrated. The principle is applied to polar codes (under successive cancellation list decoding) and to general short binary linear block codes (under ordered-statistics decoding). The proposed decoders assume neither a-priori knowledge of the channel coefficients, nor of their statistics. The scheme relies on short pilot fields that are used only to derive an initial channel estimate. The channel estimate is required to be accurate enough to enable a good list construction, i.e., the construction of a list that contains, with high probability, the transmitted codeword. The final decision on the message is obtained by applying a non-coherent decoding metric to the codewords composing the list. This allows one to use very few pilots, thus reducing the channel estimation overhead. Numerical results are provided for the Rayleigh block-fading channel and compared to finite-length performance bounds. The proposed technique provides (in the short block length regime) gains of 1 dB with respect to a traditional pilot-aided transmission scheme.

Link Budget Analysis for Backscatter-Based Passive IoT

“…However, tags computational load can be reduced by shifting some operations (e.g., encoding) to the reader side [157]. Moreover, because CSI acquisition is difficult for BackCom systems, decoding algorithms that can operate with limited or no CSI are of great importance [169], [170]. Moreover, decoding decoding delays may limit the potential number of tags served by a single reader [171].…”

Machine type communications: key drivers and enablers towards the 6G era

“…However, none of these schemes are directly suitable for mMTC services, and require to be substantially adapted. The main challenges in this case are: (1) constructing efficient codes for short packet sizes ( ∼ 100 − 1000 bits); (2) achieving significant error detection capability at low overheads [64]; and (3) designing decoding algorithms that can operate with limited/outdated or no CSI [65]. Hence, moving towards 6G, there is a need to introduce codes specifically tailored for mMTC services that addresses the emerging challenges.…”

Successive cancellation decoding of single parity-check product codes

“…G (m) . We are interested in I min 1 − max for a given BEC( ch ), with ch ∈ [0, 1), which can be calculated recursively via (26). This recursion is illustrated in Figure 2 for the case m = 10 and ch = 0.37 as an example.…”

“…Other examples for the important advantages of list decoding are to reduce the number of pilots for channel estimation when communicating over fading channels with unknown channel state[26] and to mitigate the performance degradation for coarsely quantized decoders[27].…”