Results 21 to 30 of about 1,161 (180)
Algebra-Assisted Construction of Quasi-Cyclic LDPC Codes for 5G New Radio
Quasi-cyclic LDPC (QC-LDPC) codes have been accepted as the standard codes of 5G enhanced mobile broadband data channel. These standard codes are designed to support multiple lifting sizes and possess rate-compatible property, which can help adapt ...
Huaan Li +4 more
doaj +1 more source
This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding.
Yan Zhang, Feng-fan Yang, Weijun Song
doaj +1 more source
Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs [PDF]
With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly used. However, the time taken to evaluate LDPC codes with very good error performance is excessive. In this paper,
Yue Zhao 0011, Francis Chung-Ming Lau
openaire +3 more sources
New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj +1 more source
On Sparse Regression LDPC Codes
Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces sparse regression LDPC codes and their decoding.
Jamison R. Ebert +2 more
openaire +2 more sources
Augmented decoders for LDPC codes [PDF]
Abstract The performance of a belief propagation decoder for low-density parity-check codes is limited by the presence of trapping sets in the code’s graph. This leads to an error floor at higher signal-to-noise ratios. We propose the use of an augmented decoder which operates by iteratively decoding on a set of graphs which have a subset of repeated ...
Alex R. Rigby +4 more
openaire +3 more sources
On the Stopping Distance of SA-LDPC Codes by Transversal Designs
In this paper, we analyze the size of the smallest stopping set (called the stopping distance) for the parity-check matrix of a superposed array low-density parity-check (SA-LDPC) code for column weights 3 and 4 by using the transversal design (TD ...
Zahra Ferdosi +2 more
doaj +1 more source
Tanner
Girth plays an important role in the design of low-density parity-check (LDPC) codes. Motivated by the works on the girth of some classes of Tanner quasi-cyclic (QC) LDPC codes, e.g., Tanner (3, 5), (3, 7), (3, 11), and (5, 7) codes, we, in this paper ...
Hengzhou Xu +4 more
doaj +1 more source
ANALYSIS OF CORRECTIVE PROPERTIES OF ULTRA-LONG LDPC CODES
The ultra-long LPDC codes are examined. The errors correction by ultra-long LDPC codes is analyzed. The error-correcting capability research method for ultra-long LDPC codes is described in details. The main results in table and graph representations are
Leonid Uryvskyi, Serhii Osypchuk
doaj +1 more source
Qudit low-density parity-check codes [PDF]
Qudits offer significant advantages over qubit-based architectures, including more efficient gate compilation, reduced resource requirements, improved error-correction primitives, and enhanced capabilities for quantum communication and cryptography. Yet,
Daniel J. Spencer +4 more
doaj +1 more source

