A construction for girth‐8 QC‐LDPC codes using Golomb rulers
In this paper, an algebraic construction of regular QC‐LDPC codes by using the modular multiplication table mod P and Golomb rulers are proposed. It is proved that the proposed QC‐LDPC codes based on a Golomb ruler of length L have girth at least 8 if P ...
Inseon Kim, Hong‐Yeop Song
doaj +3 more sources
A High Throughput Implementation of QC-LDPC Codes for 5G NR [PDF]
Quasi-cyclic low-density parity-check (QC-LDPC) codes are the choice for data channels in the fifth generation (5G) new radio (NR). At the transmitter side, code bits from the QC-LDPC encoder are delivered to the rate matcher.
Hao Wu, Huayong Wang
doaj +3 more sources
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes
As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers.
Juhua Wang +3 more
doaj +2 more sources
Hierarchical and High-Girth QC LDPC Codes [PDF]
We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation.
Draper, Stark C. +2 more
core +3 more sources
Constructing LDPC Codes with Any Desired Girth [PDF]
In wireless sensor networks, the reliability of communication can be greatly improved by applying low-density parity-check (LDPC) codes. Algorithms based on progressive-edge-growth (PEG) pattern and quasi-cyclic (QC) pattern are the mainstream approaches
Chaohui Gao +3 more
doaj +2 more sources
Optimized Design of Distributed Quasi-Cyclic LDPC Coded Spatial Modulation [PDF]
We propose a distributed quasi-cyclic low-density parity-check (QC-LDPC) coded spatial modulation (D-QC-LDPCC-SM) scheme with source, relay and destination nodes. At the source and relay, two distinct QC-LDPC codes are used.
Chunli Zhao +4 more
doaj +2 more sources
Constructing Grith Eight GC-LDPC Codes Based on the GCD FLRM Matrix with a New Lower Bound [PDF]
By connecting multiple short, local low-density parity-check (LDPC) codes with a global parity check, the globally coupled (GC) LDPC code can attain high performances with low complexities.
Kun Zhu, Hongwen Yang
doaj +2 more sources
High Efficiency Continuous-Variable Quantum Key Distribution Based on ATSC 3.0 LDPC Codes [PDF]
Due to the rapid development of quantum computing technology, encryption systems based on computational complexity are facing serious threats. Based on the fundamental theorem of quantum mechanics, continuous-variable quantum key distribution (CVQKD) has
Kun Zhang +4 more
doaj +2 more sources
On a class of column‐weight 3 decomposable LDPC codes with the analysis of elementary trapping sets
A column‐weight k LDPC code with the parity‐check matrix H is called decomposable if there exists a permutation π on the rows of H, such that π(H) can be decomposed into k column‐weight one matrix.
G. Raeisi, M. Gholami
doaj +2 more sources
The design of structured LDPC codes with algorithmic graph construction [PDF]
Low-Density Parity-Check (LDPC) codes are among the most effective modern error-correcting codes due to their excellent correction performance and highly parallel decoding scheme.
Wojciech Sułek
doaj +1 more source

