2021
DOI: 10.1109/tvlsi.2020.3034046
|View full text |Cite
|
Sign up to set email alerts
|

A Multirate Fully Parallel LDPC Encoder for the IEEE 802.11n/ac/ax QC-LDPC Codes Based on Reduced Complexity XOR Trees

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
13
0

Year Published

2021
2021
2024
2024

Publication Types

Select...
4
4

Relationship

0
8

Authors

Journals

citations
Cited by 19 publications
(13 citation statements)
references
References 36 publications
0
13
0
Order By: Relevance
“…However, the matrix H −1 2 is dense and therefore leads to significantly high hardware cost in terms of computational complexity and memory requirements. Nevertheless, when properly exploiting the matrix structure, it is possible to achieve significant hardware cost reduction for certain codes [17][18][19].…”
Section: Partitioned Pcm Two-step Encodingmentioning
confidence: 99%
See 1 more Smart Citation
“…However, the matrix H −1 2 is dense and therefore leads to significantly high hardware cost in terms of computational complexity and memory requirements. Nevertheless, when properly exploiting the matrix structure, it is possible to achieve significant hardware cost reduction for certain codes [17][18][19].…”
Section: Partitioned Pcm Two-step Encodingmentioning
confidence: 99%
“…Such a method is computationally very expensive since, in general, the generator matrix is not sparse. Reduction of complexity can be obtained for systematic codes if the PCM is divided into two parts [17][18][19]. This way, the encoding can be performed by multiplication with two smaller matrices of which the first one is sparse, but the second one is dense.…”
Section: Introductionmentioning
confidence: 99%
“…In this paper, the calculation of AS T and CS T is parallelized, and the maximum parallel structures are designed according to the number of columns of A matrix and the number of rows of C matrix respectively. In the process of obtaining P 1 , in order to avoid the complexity of matrix inversion, traversing each two B submatrices of H BG1 and H BG2 , (8)(9)(10)(11) shows the four structures of the B matrix, where −1 represents the 0 matrix of Z × Z, 1 and 105 represent the Z × Z unit matrix that is right cyclic shift once and 105 times, and 0 represents the Z × Z unit matrix. Under the principle of GF(2) operations, the process of solving ( 5) can be converted to (12-15), P (α) i,j means the right barrel shift of α bits.…”
Section: Qc-ldpc High-parallel Encoding Algorithmmentioning
confidence: 99%
“…Meanwhile, a parallel matrix vector multiplication structure and storage compression are used to increase the encoding speed and significantly reduce the number of storage bits required. In [ 11 ], a fully parallel QC-LDPC encoder based on a reduced complexity XOR tree designed specifically for the IEEE 802.11n standard was proposed. In [ 12 ], a pipeline architecture for QC-LDPC encoder was proposed.…”
Section: Introductionmentioning
confidence: 99%
“…The design can realize the requirements for different encoding parameters. Reference [28] proposes a fully parallel LDPC encoder based on reduced complexity XOR trees; it is designed for the IEEE 802.11n standards. Reference [29] introduces a method to improve hardware multiplication based on constant matrices in GF (2); it tries to apply the method to the QC-LDPC encoding algorithm.…”
Section: Introductionmentioning
confidence: 99%