Blind Identification of LDPC Codes Based on Decoding

Wang, Weinian; Peng, Hua; Ji, Luying

doi:10.1109/icctec.2017.00220

Cited by 4 publications

(19 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In the following, the comparisons among our algorithm and other approaches described in [17] [18] and [19] which are based on Gauss elimination method about computational complexity are presented. We also show the recognition probability of these algorithms and our work for different kinds of linear block codes in simulation results.…”

Section: The Computational Complexity and Simulation Analysismentioning

confidence: 99%

“…At first, let us make a brief description of the algorithm in [17], [18], and [19]. In [17], a dual code method is used to recover the parameters of the encoder and acquire parity-checks.…”

Section: Computational Complexity Analysismentioning

confidence: 99%

“…Algorithm in [19] is similar to the scheme in [18] except for introducing a decoding step to accelerate the process of parity-check matrix reconstruction. Therefore, on the basis of the computation of [18],…”

Section: Computational Complexity Analysismentioning

confidence: 99%

“…In [18], the work applied Gauss-Jordan elimination through pivoting (GJETP) to transform the noisy codewords matrix to an echelon one, and then proposed the "almost rank ratio criterion" to find dependent columns and derive the parameters and parity-checks of the encoder at the same time. The method proposed in [19] introduced a decoding technique approach to speed up the process of acquiring parity-checks based on the work in [18]. For the reconstruction of the parity-check matrices of LDPC codes, an algorithm [20] was proposed.…”

Section: Introductionmentioning

confidence: 99%

“…For the reconstruction of the parity-check matrices of LDPC codes, an algorithm [20] was proposed. Which needed much less iterations compared with [19] for using a technique BGCE (Bidirectional Gaussian Column Elimination). Most of the existing works based on Gaussian column elimination perform well when the bit error rate (BER) is low.…”

Section: Introductionmentioning

confidence: 99%

See 4 more Smart Citations

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

Liu¹,

Zhang²,

Yu³

et al. 2021

KSII TIIS

View full text Add to dashboard Cite

Existing methods for blind identification of linear block codes without a candidate set are mainly built on the Gauss elimination process. However, the fault tolerance will fall short when the intercepted bit error rate (BER) is too high. To address this issue, we apply the reverse algebra approach and propose a novel "two-step-screening" algorithm by solving the linear error equations on the binary Galois field, or GF(2). In the first step, a recursive matrix partition is implemented to solve the system linear error equations where the coefficient matrix is constructed by the full codewords which come from the intercepted noisy bitstream. This process is repeated to derive all those possible parity-checks. In the second step, a check matrix constructed by the intercepted codewords is applied to find the correct parity-checks out of all possible parity-checks solutions. This novel "two-step-screening" algorithm can be used in different codes like Hamming codes, BCH codes, LDPC codes, and quasi-cyclic LDPC codes. The simulation results have shown that it can highly improve the fault tolerance ability compared to the existing Gauss elimination process-based algorithms.

show abstract

Section: The Computational Complexity and Simulation Analysismentioning

confidence: 99%

“…At first, let us make a brief description of the algorithm in [17], [18], and [19]. In [17], a dual code method is used to recover the parameters of the encoder and acquire parity-checks.…”

Section: Computational Complexity Analysismentioning

confidence: 99%

Section: Computational Complexity Analysismentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

See 3 more Smart Citations

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

Liu¹,

Zhang²,

Yu³

et al. 2021

KSII TIIS

View full text Add to dashboard Cite

show abstract

A fast reconstruction of the parity-check matrices of LDPC codes in a noisy environment

Liu

Zhang

Gao-feng

et al. 2021

Computer Communications

View full text Add to dashboard Cite

Blind recognition of sparse parity‐check matrices of low‐density parity‐check codes in the presence of noise

2022

View full text Add to dashboard Cite

This paper studies the blind recognition method of the sparse parity‐check matrices of low‐density parity‐check codes in noncooperative communication, which is critical to the reverse analysis of communication protocols using LDPC codes. In this paper, two improvements are made to the algorithm of Liu Qian et al. (2021) for this problem. Firstly, a Gaussian elimination method based on random column exchange and soft information is proposed to enhance the fault tolerance of the elimination process. Secondly, according to the sparse property of the parity‐check matrices of LDPC codes, a random extraction method is proposed to further improve the fault tolerance of the algorithm, and it is verified theoretically. Finally, simulations verify the superior performance of the algorithm proposed in this paper.

show abstract

Blind Identification of LDPC Codes Based on Decoding

Cited by 4 publications

References 4 publications

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

A Two-Step Screening Algorithm to Solve Linear Error Equations for Blind Identification of Block Codes Based on Binary Galois Field

A fast reconstruction of the parity-check matrices of LDPC codes in a noisy environment

Blind recognition of sparse parity‐check matrices of low‐density parity‐check codes in the presence of noise

Contact Info

Product

Resources

About