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

  title={Low Rate Protograph-Based LDPC Codes for Continuous Variable Quantum Key Distribution},
  author={Kadir G{\"u}m{\"u}s and Laurent Schmalen},
  journal={2021 17th International Symposium on Wireless Communication Systems (ISWCS)},
  • Kadir Gümüs, L. Schmalen
  • Published 13 July 2021
  • Computer Science
  • 2021 17th International Symposium on Wireless Communication Systems (ISWCS)
Error correction plays a major role in the reconciliation of continuous variable quantum key distribution (CV-QKD) and greatly affects the performance of the system. CV- QKD requires error correction codes of extremely low rates and high reconciliation efficiencies. There are only very few code designs available in this ultra low rate regime. In this paper, we introduce a method for designing protograph-based ultra low rate LDPC codes using differential evolution. By proposing type-based… 

Figures from this paper


Key Reconciliation with Low-Density Parity-Check Codes for Long-Distance Quantum Cryptography
A quasi-cyclic code construction for multiedge LDPC codes that is highly suitable for hardware-accelerated decoding on a modern graphics processing unit (GPU) is introduced that shows that LDPC decoding is no longer the computational bottleneck in long-distance CV-QKD.
Low-rate LDPC codes with simple protograph structure
This paper provides a construction method for low-rate low density parity check codes and shows through some examples that low iterative decoding thresholds close to the channel capacity limits can be achieved, as the block size goes to infinity.
Construction of Protograph LDPC Codes with Linear Minimum Distance
A construction method for protograph-based LDPC codes that simultaneously achieve low iterative decoding threshold and linear minimum distance is proposed and a family of high- to low-rate codes with minimum distance linearly increasing in block size and with capacity-approaching performance thresholds is presented.
Design of non-precoded protograph-based LDPC codes
  • H. Uchikawa
  • Computer Science
    2014 IEEE International Symposium on Information Theory
  • 2014
A new family of protograph-based codes with no punctured variable nodes is presented. The codes are constructed by using differential evolution, partial brute force search, and the lengthening method
Protograph LDPC Codes Design Based on EXIT Analysis
  • G. Liva, M. Chiani
  • Computer Science
    IEEE GLOBECOM 2007 - IEEE Global Telecommunications Conference
  • 2007
The proposed EXIT analysis takes into account edge connections, permitting the decoding convergence evaluation for protograph-based and multi- edge type low-density parity-check codes, allowing the design of highly-structured capacity approaching LDPC codes.
Long Distance Continuous-Variable Quantum Key Distribution with a Gaussian Modulation
Improved reconciliation procedure considerably extends the secure range of a CVQKD with a Gaussian modulation, giving a secret key rate of about 10{sup -3} bit per pulse at a distance of 120 km for reasonable physical parameters.
Low-Density Parity-Check (LDPC) Codes Constructed from Protographs
We introduce a new class of low-density parity-check (LDPC) codes constructed from a template called a protograph. The protograph serves as a blueprint for constructing LDPC codes of arbitrary size
Continuous‐Variable Quantum Key Distribution with Gaussian Modulation—The Theory of Practical Implementations
The theoretical foundations of continuous‐variable quantum key distribution (CV‐QKD) with Gaussian modulation are reviewed and the essential relations from scratch in a pedagogical way and a set of new original noise models are presented to get an estimate of how well a given set of hardware will perform in practice.
Design of low-density parity-check codes for modulation and detection
A coding and modulation technique is studied where the coded bits of an irregular low-density parity-check (LDPC) code are passed directly to a modulator, and thereby outperforms a scheme employing a parallel concatenated (turbo) code by wide margins when there are more transmit than receive antennas.
Low-density parity-check codes
A simple but nonoptimum decoding scheme operating directly from the channel a posteriori probabilities is described and the probability of error using this decoder on a binary symmetric channel is shown to decrease at least exponentially with a root of the block length.