Topologically Driven Methods for Construction Of Multi-Edge Type (Multigraph with nodes puncturing) Quasi-Cyclic Low-density Parity-check Codes for Wireless Channel, WDM Long-H

In this Phd thesis discusses modern methods for constructing MET QC-LDPC codes with a given error correction ("waterfall, error-floor") and complexity (parallelism level according circulant size plus scheduler orthogonality of checks) profiles: 1. weight enumerators optimization, protograph construction using Density Evolution, MI (P/Exit-chart) and it approximation: Gaussian Approximation, Reciprocal-channel approximation and etc; 2. Covariance evolution and it approximation; 3. Lifting methods for QC codes construction:PEG, Guest-and-Test, Hill-Climbing with girth, EMD, ACE optimization; 4. Upper and lower bounds on code distance estimation and its parallel implementation using CPU/GPU; 5. Brouwer-Zimmerman and Number Geometry code distance estimation methods; 6. Importance Sampling for error-floor estimation; 7. Length and rate adaption methods for QC codes based on cyclic group decomposition; 8. Methods for interaction screening which allow to improve performance (decorrelate variables) under BP and it's approximation. We proposed several state-of-the-art methods: Simulated Annealing lifting for MET QC-LDPC codes construction; fast EMD and code distance estimation; floor scale modular lifting for lenght adaption; fast finite-length covariance evolution rate penalty from threshold for code construction and it hardware friendly compression for fast decoder's LLRs unbiasing due SNR's estimation error. We found topology reason's of efficient of such methods using topology thickening (homotopy of continuous and discrete curvature) under matched metric space which allow to generalize this idea to a class of nonlinear codes for Signal Processing and Machine Learning. Using the proposed algorithms several generations of WDM Long-Haul error-correction codes were built. It was applied for "5G eMBB" 3GPP TS38.212 and other applications like Flash storage, Compressed sensing measurement matrix.

READ FULL TEXT

page 12

page 13

page 15

page 16

page 19

page 20

page 21

research
03/17/2021

Moderate Density Parity-Check Codes from Projective Bundles

A new construction for moderate density parity-check (MDPC) codes using ...
research
11/25/2022

McEliece cryptosystem based on Plotkin construction with QC-MDPC and QC-LDPC codes

In this paper, we propose a new variant of the McEliece cryptosystem usi...
research
03/17/2023

Rate-Adaptive Protograph MacKay-Neal Codes

A class of rate-adaptive protograph MacKay-Neal (MN) codes is introduced...
research
01/23/2018

Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems

In this paper, ensembles of quasi-cyclic moderate-density parity-check (...
research
07/13/2021

Low Rate Protograph-Based LDPC Codes for Continuous Variable Quantum Key Distribution

Error correction plays a major role in the reconciliation of continuous ...
research
08/27/2022

Parity-Check Matrix Partitioning for Efficient Layered Decoding of QC-LDPC Codes

In this paper, we consider how to partition the parity-check matrices (P...
research
08/11/2022

An Modified Cole's Importance Sampling Method For Low Error Floor QC-LDPC Codes Construction

We modified Cole's Importance Sampling (IS) method for enumerating of Tr...

Please sign up or login with your details

Forgot password? Click here to reset