Reliability Ratio-Based Serial Algorithm of LDPC Decoder for Turbo Equalization Schemes

2021 ◽  
pp. 1-1
Author(s):  
Sirawit Khittiwitchayakul ◽  
Watid Phakphisut ◽  
Pornchai Supnithi
2005 ◽  
Vol 53 (10) ◽  
pp. 3847-3856 ◽  
Author(s):  
J.H. Gunther ◽  
M. Ankapura ◽  
T.K. Moon

IEEE Access ◽  
2021 ◽  
Vol 9 ◽  
pp. 47687-47697
Author(s):  
Shen-Shen Yang ◽  
Jian-Qiang Liu ◽  
Zhen-Guo Lu ◽  
Zeng-Liang Bai ◽  
Xu-Yang Wang ◽  
...  

2020 ◽  
pp. 1-1
Author(s):  
Xuan Zhou ◽  
Zheng Ma ◽  
Li Li ◽  
Ming Xiao
Keyword(s):  

Electronics ◽  
2021 ◽  
Vol 10 (4) ◽  
pp. 516
Author(s):  
Tram Thi Bao Nguyen ◽  
Tuy Nguyen Tan ◽  
Hanho Lee

This paper presents a pipelined layered quasi-cyclic low-density parity-check (QC-LDPC) decoder architecture targeting low-complexity, high-throughput, and efficient use of hardware resources compliant with the specifications of 5G new radio (NR) wireless communication standard. First, a combined min-sum (CMS) decoding algorithm, which is a combination of the offset min-sum and the original min-sum algorithm, is proposed. Then, a low-complexity and high-throughput pipelined layered QC-LDPC decoder architecture for enhanced mobile broadband specifications in 5G NR wireless standards based on CMS algorithm with pipeline layered scheduling is presented. Enhanced versions of check node-based processor architectures are proposed to improve the complexity of the LDPC decoders. An efficient minimum-finder for the check node unit architecture that reduces the hardware required for the computation of the first two minima is introduced. Moreover, a low complexity a posteriori information update unit architecture, which only requires one adder array for their operations, is presented. The proposed architecture shows significant improvements in terms of area and throughput compared to other QC-LDPC decoder architectures available in the literature.


2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Kadir Gümüş ◽  
Tobias A. Eriksson ◽  
Masahiro Takeoka ◽  
Mikio Fujiwara ◽  
Masahide Sasaki ◽  
...  

AbstractReconciliation is a key element of continuous-variable quantum key distribution (CV-QKD) protocols, affecting both the complexity and performance of the entire system. During the reconciliation protocol, error correction is typically performed using low-density parity-check (LDPC) codes with a single decoding attempt. In this paper, we propose a modification to a conventional reconciliation protocol used in four-state protocol CV-QKD systems called the multiple decoding attempts (MDA) protocol. MDA uses multiple decoding attempts with LDPC codes, each attempt having fewer decoding iteration than the conventional protocol. Between each decoding attempt we propose to reveal information bits, which effectively lowers the code rate. MDA is shown to outperform the conventional protocol in regards to the secret key rate (SKR). A 10% decrease in frame error rate and an 8.5% increase in SKR are reported in this paper. A simple early termination for the LDPC decoder is also proposed and implemented. With early termination, MDA has decoding complexity similar to the conventional protocol while having an improved SKR.


Sign in / Sign up

Export Citation Format

Share Document