Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group
Conferences > OFC > 2024 > W4C > W4C.8

Iteration-Dependent Scaled Min-Sum Decoding for Low-Complexity Key Reconciliation in CV-QKD

Erdem Eray Cil and Laurent Schmalen

Not Accessible

Your library or personal account may give you access

Abstract

We introduce an iteration-dependent scaled min-sum decoding for low-rate LDPC codes in CV-QKD, achieving near-sum product algorithm performance with reduced complexity, and facilitating CV-QKD hardware implementation.

© 2024 The Author(s)

PDF Article
More Like This
Reducing the Error Floor of the Sign-Preserving Min-Sum LDPC Decoder via Message Weighting of Low-Degree Variable Nodes

Lotte Paulissen, Alex Alvarado, Kaiquan Wu, and Alexios Balatsoukas-Stimming
Mo3D.1 European Conference and Exhibition on Optical Communication (ECOC) 2022

Hierarchical Min-Sum Algorithm Based on Dynamic Scaling Factor for LDPC Decoding

Ruotong Wang, Qinghua Tian, Zexuan Jing, Dong Guo, Feng Tian, Leijing Yang, and Xiangju Xin
T4A.39 Asia Communications and Photonics Conference (ACP) 2021

On the Reduced-Complexity of LDPC Decoders for Beyond 400 Gb/s Serial Optical Transmission

Ivan B. Djordjevic, Lei Xu, and Ting Wang
79881G Asia Communications and Photonics Conference and Exhibition (ACP) 2010

View More...
Select as filters
Select Topics Cancel
Top
       
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.
Privacy | Terms of Use