CRC-Aided Short Convolutional Codes and RCU Bounds for Orthogonal Signaling

09/30/2022
by   Jacob King, et al.
0

We extend earlier work on the design of convolutional code-specific CRC codes to Q-ary alphabets, with an eye toward Q-ary orthogonal signaling. Starting with distance-spectrum optimal, zero-terminated, Q-ary convolutional codes, we design Q-ary CRC codes so that the CRC/convolutional concatenation is distance-spectrum optimal. The Q-ary code symbols are mapped to a Q-ary orthogonal signal set and sent over an AWGN channel with noncoherent reception. We focus on Q = 4, rate-1/2 convolutional codes in our designs. The random coding union bound and normal approximation are used in earlier works as benchmarks for performance for distance-spectrum optimal convolutional codes. We derive a saddlepoint approximation of the random coding union bound for the coded noncoherent signaling channel, as well as a normal approximation for this channel, and compare the performance of our codes to these limits. Our best design is within 0.6 dB of the RCU bound at a frame error rate of 10^-4.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/15/2021

High-Rate Convolutional Codes with CRC-Aided List Decoding for Short Blocklengths

Recently, rate-1/ω zero-terminated and tail-biting convolutional codes (...
research
12/08/2022

On CRC-Aided, Dual-Trellis, List Decoding for High-Rate Convolutional Codes with Short Blocklengths

Recently, rate-1/n zero-terminated and tail-biting convolutional codes (...
research
11/19/2022

Upper and Lower Bounds on Bit-Error Rate for Convolutional Codes

In this paper, we provide a new approach to the analytical estimation of...
research
11/29/2018

Joint Design of Convolutional Code and CRC under Serial List Viterbi Decoding

This paper studies the joint design of optimal convolutional codes (CCs)...
research
11/06/2020

On Systematic Polarization-Adjusted Convolutional (PAC) Codes

Polarization-adjusted convolutional (PAC) codes were recently proposed a...
research
06/12/2023

ELF Codes: Concatenated Codes with an Expurgating Linear Function as the Outer Code

An expurgating linear function (ELF) is a linear outer code that disallo...
research
01/16/2020

An Efficient Algorithm for Designing Optimal CRCs for Tail-Biting Convolutional Codes

This paper proposes an efficient algorithm for designing the distance-sp...

Please sign up or login with your details

Forgot password? Click here to reset