RWRichard D. Wesel

Richard D. Wesel

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Richard D. Wesel has a total of 80 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes

    by Diego Lentner, Thomas Wiegart, Richard D. Wesel

    Algorithms are presented that efficiently shape the parity bits of systematic irregular repeat-accumulate (IRA) low-density parity-check (LDPC) codes by following the sequential encoding order of the accumulator. Simulations over additive white Gaussian noise (AWGN) channels with on-off keying show a gain of up to 0.9 dB over uniform signaling.

  • Open Access

    Channel-Prediction-Driven Rate Control for LDPC Coding in a Fading FSO Channel With Delayed Feedback

    by Semira Galijasevic, Jingchao Luo, Dariush Divsalar, Richard Wesel

    Rate-adaptive coding enables reliable communication while efficiently utilizing the available channel mutual information in free-space optical (FSO) communication. While adaptive coding has been explored in numerous articles, the effect of feedback delay is often overlooked. To adapt the code rate to current channel conditions, the transmitter must sense the channel or rely on receiver feedback. FSO channel state information (CSI) cannot be reliably estimated at the transmitter because optical scintillation caused by atmospheric turbulence may differ for signals traveling in opposite directions. In real-world FSO systems, feedback from the receiver provides CSI. Even if the receiver sends accurate CSI, the channel conditions might change by the time the feedback reaches the transmitter and the new signal travels to the receiver. To mitigate throughput performance degradation caused by feedback delay, this paper applies linear and quadratic prediction to estimate future CSI and dynamically select the appropriate low-density parity check (LDPC) code rate. Protograph-based Raptor-like (PBRL) LDPC codes supporting a wide range of rates are designed, facilitating convenient rate switching. When CSI is known without delay, dynamically selecting LDPC code rate appropriately maximizes throughput. This work explores how such prediction behaves as the feedback delay is increased from no delay to a delay equal to the coherence time of a fading channel. Optical channels with coherence times of 5 ms and 10 ms are explored, where 10 ms channel is meant to model the optical channel of a Low Earth Orbit (LEO) satellite.


  • Open Access

    Feedback Communication Over the BSC with Sparse Feedback times and Causal Encoding

    by Amaael Antonini, Rita Gimelshein, Richard D. Wesel

    Posterior matching uses variable-length encoding of the message controlled by noiseless feedback of the received symbols to achieve high rates for short average blocklengths. Traditionally, the feedback of a received symbol occurs before the next symbol is transmitted. The transmitter optimizes the next symbol transmission with full knowledge of every past received symbol. To move posterior matching closer to practical communication, this paper seeks to constrain how often feedback can be sent back to the transmitter. We focus on reducing the frequency of the feedback while still maintaining the high rates that posterior matching achieves with feedback after every symbol. As it turns out, the frequency of the feedback can be reduced significantly with no noticeable reduction in rate.

  • LDPC Decoding With Degree-Specific Neural Message Weights and RCQ Decoding

    by Linfang Wang, Caleb Terrill, Dariush Divsalar, Richard D. Wesel

    Recently, neural networks have improved MinSum message-passing decoders for low-density parity-check (LDPC) codes by multiplying or adding weights to the messages, where the weights are determined by a neural network. The neural network complexity to determine distinct weights for each edge is high, often limiting the application to relatively short LDPC codes. Furthermore, storing separate weights for every edge and every iteration can be a burden for hardware implementations. To reduce neural network complexity and storage requirements, this paper proposes a family of weight-sharing schemes that use the same weight for edges that have the same check node degree and/or variable node degree. Our simulation results show that node-degree-based weight-sharing can deliver the same performance requiring distinct weights for each node. This paper also combines these degree-specific neural weights with a reconstruction-computation-quantization (RCQ) decoder to produce a weighted RCQ (W-RCQ) decoder. The W-RCQ decoder with node-degree-based weight sharing has a reduced hardware requirement compared with the original RCQ decoder. As an additional contribution, this paper identifies and resolves a gradient explosion issue that can arise when training neural LDPC decoders.


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

    by Wenhui Sui, Brendan Towell, Ava Asmani, Hengjie Yang, Holden Grissett, Richard D. Wesel

    Recently, rate-1/ n zero-terminated (ZT) and tail-biting (TB) convolutional codes (CCs) with cyclic redundancy check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short blocklengths. This paper designs CRC polynomials for rate-( n - 1)/ n ZT and TB CCs with short blocklengths. This paper considers both standard rate-( n -1)/ n CC polynomials and rate-( n - 1)/ n designs resulting from puncturing a rate-1/2 code. The CRC polynomials are chosen to maximize the minimum distance d min and minimize the number of nearest neighbors A dmin . For the standard rate-( n - 1)/ n codes, utilization of the dual trellis proposed by Yamada et al . lowers the complexity of CRC-aided serial list Viterbi decoding (SLVD). CRC-aided SLVD of the TBCCs closely approaches the RCU bound at a blocklength of 128. This paper compares the FER performance (gap to the RCU bound) and complexity of the CRC-aided standard and punctured ZTCCs and TBCCs. This paper also explores the complexity-performance trade-off for three TBCC decoders: a single-trellis approach, a multi-trellis approach, and a modified single-trellis approach with pre-processing using the wrap around Viterbi algorithm.


  • Open Access

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

    by Wenhui Sui, Brendan Towell, Ava Asmani, Hengjie Yang, Holden Grissett, Richard D. Wesel

    Recently, rate-1/n zero-terminated (ZT) and tail-biting (TB) convolutional codes (CCs) with cyclic redundancy check (CRC)-aided list decoding have been shown to closely approach the random-coding union (RCU) bound for short blocklengths. This paper designs CRC polynomials for rate- (n-1)/n ZT and TB CCs with short blocklengths. This paper considers both standard rate-(n-1)/n CC polynomials and rate- (n-1)/n designs resulting from puncturing a rate-1/2 code. The CRC polynomials are chosen to maximize the minimum distance d_min and minimize the number of nearest neighbors A_(d_min) . For the standard rate-(n-1)/n codes, utilization of the dual trellis proposed by Yamada et al. lowers the complexity of CRC-aided serial list Viterbi decoding (SLVD). CRC-aided SLVD of the TBCCs closely approaches the RCU bound at a blocklength of 128. This paper compares the FER performance (gap to the RCU bound) and complexity of the CRC-aided standard and punctured ZTCCs and TBCCs. This paper also explores the complexity-performance trade-off for three TBCC decoders: a single-trellis approach, a multi-trellis approach, and a modified single-trellis approach with pre-processing using the wrap around Viterbi algorithm.

  • Achievable Rates for Low-Complexity Posterior Matching Over the Binary Symmetric Channel

    by Amaael Antonini, Rita Gimelshein, Richard D. Wesel

    Horstein, Burnashev, Shayevitz and Feder, Naghshvar et al. and others have studied sequential transmission of a k-bit message over the binary symmetric channel (BSC) with full, noiseless feedback using posterior matching. Yang et al. provide an improved lower bound on the achievable rate using martingale analysis that relies on the small-enough difference (SED) partitioning introduced by Naghshvar et al. SED requires a relatively complex encoder and decoder. To reduce complexity, this paper replaces SED with relaxed constraints that admit the small enough absolute difference (SEAD) partitioning rule. The main analytical results show that achievable-rate bounds higher than those found by Yang et al. (2021) are possible even under the new constraints, which are less restrictive than SED. The new analysis does not use martingale theory for the confirmation phase and applies a surrogate channel technique to tighten the results. An initial systematic transmission further increases the achievable rate bound. The simplified encoder associated with SEAD has a complexity below order $O(K^{2})$ and allows simulations for message sizes of at least 1000 bits. For example, simulations achieve 99% of of the channel’s 0.50-bit capacity with an average block size of 200 bits for a target codeword error rate of $10^{-3}$ .


  • Open Access

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

    by Richard Wesel, Amaael Antonini, Linfang Wang, Wenhui Sui, Brendan Towell, Holden Grissett

    An expurgating linear function (ELF) is a linear outer code that disallows the 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 of the inner code starting from the noiseless all-zeros codeword is an efficient way to identify ELFs that maximize the minimum distance of the expurgated code. For convolutional inner codes, this paper provides distance spectrum union (DSU) upper 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. The reduction in DSU-to-RCU gap comes with a minimal increase in average complexity at desired CER operating points. List Viterbi decoding guided by the ELF approaches maximum likelihood (ML) decoding of the concatenated code, and average list size converges to 1 as SNR increases. Thus, average complexity is similar to Viterbi decoding on the trellis of the inner code at high SNR. 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.

  • Open Access

    Systematic Transmission With Fountain Parity Checks for Erasure Channels With Stop Feedback

    by Hengjie Yang, Richard D. Wesel

    In this paper, we present new achievability bounds on the maximal achievable rate of variable-length stop-feedback (VLSF) codes operating over a binary erasure channel (BEC) at a fixed message size $M = 2^k$. We provide new bounds for VLSF codes with zero error, infinite decoding times and with nonzero error, finite decoding times. Both new achievability bounds are proved by constructing a new VLSF code that employs systematic transmission of the first $k$ bits followed by random linear fountain parity bits decoded with a rank decoder. For VLSF codes with infinite decoding times, our new bound outperforms the state-of-the-art result for BEC by Devassy \emph{et al.} in 2016. We also give a negative answer to the open question Devassy \emph{et al.} put forward on whether the $23.4\%$ backoff to capacity at $k = 3$ is fundamental. For VLSF codes with finite decoding times, numerical evaluations show that the achievable rate for VLSF codes with a moderate number of decoding times closely approaches that for VLSF codes with infinite decoding times.

  • Open Access

    Probabilistic Shaping for Asymmetric Channels and Low-Density Parity-Check Codes

    by Thomas Wiegart, Linfang Wang, Diego Lentner, Richard D. Wesel

    An algorithm is proposed to encode low-density parity-check (LDPC) codes into codewords with a non-uniform distribution. This enables power-efficient signalling for asymmetric channels. We show gains of 0.9 dB for additive white Gaussian noise (AWGN) channels with on-off keying modulation using 5G LDPC codes.