%AWesel, R.%AAntonini, A.%AWang, L.%ASui, W.%ATowell, B.%AGrissett, H.%D2023%IIEEE
%KExpurgation; Tail-biting Convolutional Codes; Convolutional Codes; Cyclic Redundancy Code; List Viterbi Decoding; List Decoding
%MOSTI ID: 10468061
%PMedium: X
%TELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code
%XAn expurgating linear function (ELF) is an outer code that disallows low-weight codewords of the inner code. ELFs can be designed either to maximize the minimum distance or to minimize the codeword error rate (CER) of the expurgated code. A list-decoding sieve can efficiently identify ELFs that maximize the minimum distance of the expurgated code. For convolutional inner codes, this paper provides analytical distance spectrum union (DSU) bounds on the CER of the concatenated code.
For short codeword lengths, ELFs transform a good inner code into a great concatenated code. For a constant message size of K = 64 bits or constant codeword blocklength of N = 152 bits, an ELF can reduce the gap at CER 10−6 between the DSU and the random-coding union (RCU) bounds from over 1 dB for the inner code alone to 0.23 dB for the concatenated code. The DSU bounds can also characterize puncturing that mitigates the rate overhead of the ELF while maintaining the DSU-to-RCU gap. List Viterbi decoding guided by the ELF achieves maximum likelihood (ML) decoding of the concatenated code with a sufficiently large list size. The rate-K/(K+m) ELF outer code reduces rate and list decoding increases decoder complexity. As SNR increases, the average list size converges to 1 and average complexity is similar to Viterbi decoding on the trellis of the inner code. For rare large-magnitude noise events, which occur less often than the FER of the inner code, a deep search in the list finds the ML codeword.
Country unknown/Code not availablehttps://doi.org/10.1109/ISTC57237.2023.10273535OSTI-MSA