LDPC Codes Over the q -ary Multi-Bit Channel
From MaRDI portal
Publication:5224072
DOI10.1109/TIT.2019.2900894zbMATH Open1432.94199arXiv1706.09146OpenAlexW2962911078MaRDI QIDQ5224072FDOQ5224072
Netanel Raviv, Rami Cohen, Yuval Cassuto
Publication date: 19 July 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Abstract: In this paper, we introduce a new channel model we term the q-ary multi-bit channel (QMBC). This channel models a memory device, where q-ary symbols (q=2^s) are stored in the form of current/voltage levels. The symbols are read in a measurement process, which provides a symbol bit in each measurement step, starting from the most significant bit. An error event occurs when not all the symbol bits are known. To deal with such error events, we use GF(q) low-density parity-check (LDPC) codes and analyze their decoding performance. We start with iterative-decoding threshold analysis, and derive optimal edge-label distributions for maximizing the decoding threshold. We later move to finite-length iterative-decoding analysis and propose an edge-labeling algorithm for improved decoding performance. We then provide finite-length maximum-likelihood decoding analysis for both the standard non-binary random ensemble and LDPC ensembles. Finally, we demonstrate by simulations that the proposed edge-labeling algorithm improves finite-length decoding performance by orders of magnitude.
Full work available at URL: https://arxiv.org/abs/1706.09146
Recommendations
- Iterative Decoding of LDPC Codes Over the <inline-formula> <tex-math notation="LaTeX">$q$ </tex-math> </inline-formula>-Ary Partial Erasure Channel
- On the Application of LDPC Codes to Arbitrary Discrete-Memoryless Channels
- On the Encoding Complexity of Quasi-Cyclic LDPC Codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
- Hierarchical and High-Girth QC LDPC Codes
- On Achievable Rates and Complexity of LDPC Codes Over Parallel Channels: Bounds and Applications
- scientific article; zbMATH DE number 2127865
- LDPC code designs, constructions, and unification
- An Efficient Layered Decoding Architecture for Nonbinary QC-LDPC Codes
- Applied Algebra, Algebraic Algorithms and Error-Correcting Codes
Cited In (5)
- Performance analysis for cooperative communication system with QC-LDPC codes constructed with integer sequences
- Title not available (Why is that?)
- Multilevel LDPC Lattices With Efficient Encoding and Decoding and a Generalization of Construction $\text{D}'$
- Hierarchical erasure correction of linear codes
- On the multiple threshold decoding of LDPC codes over \(\mathrm{GF}(q)\)
This page was built for publication: LDPC Codes Over the $q$ -ary Multi-Bit Channel
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5224072)
