Results 21 to 30 of about 1,996 (184)
Construction of multiple-rate QC-LDPC codes using hierarchical row-splitting [PDF]
, 2016 In this letter, we propose an improved method called hierarchical row-splitting with edge variation for designing multiple-rate quasi-cyclic low-density parity-check (QC-LDPC) codes, which constructs lower-rate codes from a high-rate mother code by row ...
Wang, Qi, Wang, Zhaocheng, Zhao, Peiyao
core +1 more source
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel [PDF]
, 2010 In this paper, we show that Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding over the binary erasure channel. We demonstrate that the quasi-cyclic structure of the parity-check matrix can be advantageously used in ...
Cunche, Mathieu +2 more
core +3 more sources
Girth-Eight Reed-Solomon Based QC-LDPC Codes [PDF]
2018 IEEE 10th International Symposium on Turbo Codes & Iterative Information Processing (ISTC), 2018 This paper presents a class of regular quasi-cyclic (QC) LDPC codes whose Tanner graphs have girth at least eight. These codes are constructed based on the conventional parity-check matrices of Reed-Solomon (RS) codes with minimum distance 5. Masking their parity-check matrices significantly reduces the numbers of short cycles in their Tanner graphs ...
Xin Xiao +4 more
openaire +1 more source
A High Throughput Implementation of QC-LDPC Codes for 5G NR
IEEE Access, 2019 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 +1 more source
A Note on the Girth of (3, 19)-Regular Tanner’s Quasi-Cyclic LDPC Codes
IEEE Access, 2021 In this article, we study the cycle structure of (3, 19)-regular Tanner’s quasi-cyclic (QC) LDPC codes with code length $19p$ , where $p$ is a prime and $p\equiv 1~(\bmod ~57)$ , and transform the conditions for the existence of cycles of ...
Manjie Zhou +4 more
doaj +1 more source
Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]
, 2010 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 ...
Ali E. Pusane +4 more
core +1 more source
Encoding of QC-LDPC Codes of Rank Deficient Parity Matrix
Journal of Engineering, 2016 the encoding of long low density parity check (LDPC) codes presents a challenge compared to its decoding. The Quasi Cyclic (QC) LDPC codes offer the advantage for reducing the complexity for both encoding and decoding due to its QC structure.
Mohammed Kasim Mohammed Al-Haddad
doaj +2 more sources
An Efficient Construction Method for Quasi-Cyclic Low Density Parity Check Codes
IEEE Access, 2017 In this paper, we propose an optimized belief propagation (OBP) based progressive edge-growth (PEG) method for constructing quasi-cyclic low density parity check (QC-LDPC) codes. In this proposed method, Tanner graphs are built by progressively appending
Yiming Lei, Mingke Dong
doaj +1 more source
, 2011 Quasi-cyclic (QC) low-density parity-check (LDPC) codes are an important instance of proto-graph-based LDPC codes. In this paper we present upper bounds on the minimum Hamming distance of QC LDPC codes and study how these upper bounds depend on graph ...
Smarandache, Roxana, Vontobel, Pascal O.
core +1 more source