Results 11 to 20 of about 58,265 (286)
Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]
IEEE Transactions on Information Theory, 2011 Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional ...
Pusane, Ali E. +3 more
openaire +3 more sources
Learning to Decode Protograph LDPC Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2021 The recent development of deep learning methods provides a new approach to optimize the belief propagation (BP) decoding of linear codes. However, the limitation of existing works is that the scale of neural networks increases rapidly with the codelength,
Jincheng Dai +6 more
semanticscholar +1 more source
Toward a Union-Find Decoder for Quantum LDPC Codes [PDF]
IEEE Transactions on Information Theory, 2021 Quantum LDPC codes are a promising direction for low overhead quantum computing. In this paper, we propose a generalization of the Union-Find decoder as a decoder for quantum LDPC codes.
Nicolas Delfosse, V. Londe, M. Beverland
semanticscholar +1 more source
Rate compatible reconciliation for continuous-variable quantum key distribution using Raptor-like LDPC codes [PDF]
Science China Physics Mechanics and Astronomy, 2021 In the practical continuous-variable quantum key distribution (CV-QKD) system, the postprocessing process, particularly the error correction part, significantly impacts the system performance. Multi-edge type low-density parity-check (MET-LDPC) codes are
Chao Zhou +5 more
semanticscholar +1 more source
Quantum LDPC Codes With Almost Linear Minimum Distance [PDF]
IEEE Transactions on Information Theory, 2020 We give a construction of quantum LDPC codes of dimension $\Theta (\log N)$ and distance $\Theta (N/\log N)$ as the code length $N\to \infty $ . Using a product of chain complexes this construction also provides a family of quantum LDPC codes of ...
Pavel Panteleev, G. Kalachev
semanticscholar +1 more source
LDPC Codes with Soft Interference Cancellation for Uncoordinated Unsourced Multiple Access [PDF]
ICC 2021 - IEEE International Conference on Communications, 2021 This article presents a novel enhancement to the random spreading based coding scheme developed by Pradhan et al. for the unsourced multiple access channel.
Asit Kumar Pradhan +3 more
semanticscholar +1 more source
Protection scheme of subcarrier index in OFDM with index modulation aided by LDPC coding
Xibei Gongye Daxue Xuebao, 2021 The receiver of OFDM with Index Modulation (OFDM-IM) usually adopts a Log Likelihood Ratio (LLR) detection algorithm based on the activation state of subcarriers.
doaj +1 more source
REDUCING LDPC DECODER COMPLEXITY BY USING FPGA BASED ON MIN SUM ALGORITHM
Mağallaẗ Al-kūfaẗ Al-handasiyyaẗ, 2022 Low-Density Parity-Check (LDPC) code approaches Shannon–limit execution for twofold field and long code lengths. The point of this work is to propose an LDPC calculation for Min Sum (MS) deciphering and playing out its equipment execution investigation
Butheena R. kadhim, Fatih Korkmaz
doaj +1 more source
A Survey on High-Throughput Non-Binary LDPC Decoders: ASIC, FPGA, and GPU Architectures
IEEE Communications Surveys and Tutorials, 2022 Non-binary low-density parity-check (NB-LDPC) codes show higher error-correcting performance than binary low-density parity-check (LDPC) codes when the codeword length is moderate and/or the channel has bursts of errors.
Oscar Ferraz +9 more
semanticscholar +1 more source
Degenerate Quantum LDPC Codes With Good Finite Length Performance [PDF]
Quantum, 2019 We study the performance of medium-length quantum LDPC (QLDPC) codes in the depolarizing channel. Only degenerate codes with the maximal stabilizer weight much smaller than their minimum distance are considered. It is shown that with the help of OSD-like
Pavel Panteleev, G. Kalachev
semanticscholar +1 more source