2018 IEEE 10th International Symposium on Turbo Codes &Amp; Iterative Information Processing (ISTC) 2018
DOI: 10.1109/istc.2018.8625376
|View full text |Cite
|
Sign up to set email alerts
|

Construction D′ Lattices from Quasi-Cyclic Low-Density Parity-Check Codes

Abstract: Recently, Branco da Silva and Silva described an efficient encoding and decoding algorithm for Construction D lattices. Using their algorithm, we propose a Construction D lattice based on binary quasi-cyclic low-density parity-check (QC-LPDC) codes and single parity-check product codes. The underlying codes designed by the balanced-distances rule contribute in a balanced manner to the squared minimum distance of the constructed lattice, which results in a high lattice coding gain. The proposed lattice based on… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
4
0

Year Published

2021
2021
2022
2022

Publication Types

Select...
2
1

Relationship

2
1

Authors

Journals

citations
Cited by 3 publications
(4 citation statements)
references
References 11 publications
(37 reference statements)
0
4
0
Order By: Relevance
“…Motivated by [13], we construct quasi-cyclic (QC)-LDPC codes to form Construction D' lattices (termed LDPC Construction D' lattices), because QC-LDPC codes are widely used in recent wireless communication standards. We give a design of parity-check matrices for nested QC-LDPC codes that can be easily triangularized and thus efficient encoding and indexing is allowed.…”
Section: B Contributionsmentioning
confidence: 99%
See 1 more Smart Citation
“…Motivated by [13], we construct quasi-cyclic (QC)-LDPC codes to form Construction D' lattices (termed LDPC Construction D' lattices), because QC-LDPC codes are widely used in recent wireless communication standards. We give a design of parity-check matrices for nested QC-LDPC codes that can be easily triangularized and thus efficient encoding and indexing is allowed.…”
Section: B Contributionsmentioning
confidence: 99%
“…In this section, we consider two-level Construction D' lattices. One approach of lattice construction can employ QC-LDPC codes and single parity-check product codes [13]. The first level code parity-check matrix consists of a top matrix that is modified from a QC-LDPC code [28, Table I] and bottom rows which contribute to parity checks for the product code.…”
Section: Qc-ldpc Construction D' Latticesmentioning
confidence: 99%
“…The first level component code C 0 has an M -by-N prototype parity-check matrix while the second level component code C 1 is a 2-by-N prototype paritycheck matrix. The code C 0 has a design rate 1 ´M {N , and C 1 is a high-rate code-a column weight 2, row weight N parity-check matrix is sufficient; column weight 2 was also used in [13]. The code C 0 is a subcode of C 1 thus the prototype matrix of C 1 is a matrix obtained from linear combinations of a C 0 prototype submatrix.…”
Section: A Construction D' Lattices Formed By Qc-ldpc Codesmentioning
confidence: 99%
“…Motivated by [13], we also construct QC-LDPC codes to form Construction D' lattices (termed LDPC code lattices), because QC-LDPC codes are widely used in recent wireless communication standards. A design of QC-LDPC code C 0 with a parity-check matrix H 0 is presented, where the position of non-zero blocks is found by binary linear programming.…”
Section: Introductionmentioning
confidence: 99%