Related Experiment Video
Updated: Dec 10, 2025

07:45
Quasi-light Storage for Optical Data Packets
Published on: February 6, 2014
11.2K
High-throughput GPU layered decoder of quasi-cyclic multi-edge type low density parity check codes in
Yang Li1, Xiaofang Zhang2, Yong Li3
1Science and Technology on Security Communication Laboratory, Institute of Southwestern Communication, Chengdu, 610041, China.
Scientific Reports
|September 5, 2020
Summary
We developed a GPU-accelerated layered decoder for quasi-cyclic multi-edge type LDPC codes, significantly boosting decoding speeds in continuous-variable quantum key distribution (CV-QKD) systems.
Area of Science:
- Quantum Information Science
- Computer Engineering
- Applied Mathematics
Background:
- Decoding throughput is a critical bottleneck in continuous-variable quantum key distribution (CV-QKD) systems.
- Efficient decoding algorithms are essential for practical CV-QKD implementation.
Purpose of the Study:
- To propose a novel layered decoder architecture for quasi-cyclic multi-edge type LDPC (QC-MET-LDPC) codes.
- To accelerate the decoding process in CV-QKD systems using graphics processing units (GPUs).
Main Methods:
- Implementation of a layered decoder utilizing GPU parallel processing capabilities.
- Optimization of parity check matrix storage and merging of unrelated sub-matrices.
- Parallel decoding of multiple codewords on the GPU without early termination.
Main Results:
- Achieved average decoding speeds of up to 64.11 Mbits/s (0.1 code rate), 48.65 Mbits/s (0.05 code rate), and 39.51 Mbits/s (0.02 code rate).
- Demonstrated significant speed improvements by decoding 128 codewords simultaneously.
- Validated the effectiveness of the proposed GPU-based decoding approach.
Conclusions:
- The proposed layered decoder effectively addresses the decoding throughput bottleneck in CV-QKD.
- GPU acceleration provides a substantial performance enhancement for LDPC code decoding in QKD.
- This advancement paves the way for more practical and high-speed CV-QKD systems.
Related Concept Videos
Synthetic Disvision of Polynomials
60
Synthetic division is an efficient algorithmic approach for dividing a polynomial by a linear binomial of the form x - c, where c is a real number. This method is helpful due to its streamlined process, which avoids the more cumbersome steps involved in the traditional long division of polynomials. It simplifies computation and serves as a practical tool for evaluating polynomials and identifying their factors.To perform synthetic division, one begins by listing the coefficients of the...
60
Block Diagram Reduction
423
The process of deriving the transfer function of a control system often involves reducing its block diagram to a single block. This simplification can be achieved through a series of strategic operations, including relocating branch points and comparators. These operations preserve the overall function of the system while allowing for easier manipulation and combination of blocks.
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
The first step in this process is the identification and relocation of a branch point. A branch point, where a...
423
BIBO stability of continuous and discrete -time systems
796
System stability is a fundamental concept in signal processing, often assessed using convolution. For a system to be considered bounded-input bounded-output (BIBO) stable, any bounded input signal must produce a bounded output signal. A bounded input signal is one where the modulus does not exceed a certain constant at any point in time.
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
To determine the BIBO stability, the convolution integral is utilized when a bounded continuous-time input is applied to a Linear Time-Invariant (LTI) system....
796
The Buckingham Pi Theorem
1.4K
The Buckingham Pi theorem provides a structured method to simplify fluid dynamics problems by reducing complex systems of variables to dimensionless terms.
1.4K
Routh-Hurwitz Criterion II
710
In the application of the Routh-Hurwitz criterion, two specific scenarios can arise that complicate stability analysis.
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
The first scenario occurs when a singular zero appears in the first column of the Routh table. This situation creates a division by zero issues. To resolve this, a small positive or negative number, denoted as epsilon (∈), is substituted for the zero. The stability analysis proceeds by assuming a sign for ∈. If ∈ is positive, any sign change in the first...
710
Phasor Arithmetics
600
Phasors and their corresponding sinusoids are interrelated, offering unique insights into the behavior of alternating current (AC) circuits. One way to understand this relationship is through the operations of differentiation and integration in both the time and phasor domains.
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...
When the derivative of a sinusoid is taken in the time domain, it transforms into its corresponding phasor multiplied by j-omega (jω) in the phasor domain, where j is the imaginary unit, and ω is the angular...
600

