Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes

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.

Authors

Institutions

Publication Details

Published
2025-08-18
DOI
https://doi.org/10.1109/istc65386.2025.11154639
Primary Topic
Error Correcting Code Techniques
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes

Richard D. Wesel, Thomas Wiegart, Diego Lentner
Error Correcting Code Techniques
article

Efficient Probabilistic Parity Shaping for Irregular Repeat-Accumulate LDPC Codes

Richard D. Wesel, Thomas Wiegart, Diego Lentner
article en

Abstract

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.

University of California, Los Angeles (US), Technical University of Munich (DE)
Openalex Percentile: Top 71%
Error Correcting Code Techniques
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.