Results 31 to 40 of about 58,265 (286)
Randomly Punctured LDPC Codes [PDF]
IEEE Journal on Selected Areas in Communications, 2016 In this paper, we present a random puncturing analysis of low-density parity-check (LDPC) code ensembles. We derive a simple analytic expression for the iterative belief propagation (BP) decoding threshold of a randomly punctured LDPC code ensemble on the binary erasure channel (BEC) and show that, with respect to the BP threshold, the strength and ...
Mitchell, David G. M. +3 more
openaire +3 more sources
Analysis and Optimization of a General Linking Matrix for JSCC Scheme Based on Double LDPC Codes
Entropy, 2023 A key component of the joint source-channel coding (JSCC) scheme based on double low-density parity-check (D-LDPC) codes is the introduction of a linking matrix between the source LDPC code and channel LDPC code, by which the decoding information ...
Qiwang Chen +3 more
doaj +1 more source
Low-Complexity High-Throughput QC-LDPC Decoder for 5G New Radio Wireless Communication
Electronics, 2021 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 ...
Tram Thi Bao Nguyen +2 more
semanticscholar +1 more source
LDPC Hardware Acceleration in 5G Open Radio Access Network Platforms
IEEE Access, 2021 The Open Radio Access Network (RAN) concept has been gaining wide acceptance in recent network architectures, including 5G New Radio (NR) network deployments.
E. Papatheofanous +2 more
semanticscholar +1 more source
Binary Wyner-Ziv and CEO Problem Coding Under the Hamming Distortion Criterion [PDF]
International Journal of Industrial Electronics, Control and OptimizationIn this paper, we present a practical encoding and decoding scheme for the binary Wyner-Ziv problem based on graph-based codes. Our proposed scheme uses low-density generator-matrix (LDGM) codes in lossy source coding part and low-density parity-check ...
Mahdi Nangir
doaj +1 more source
A Time Sharing Hybrid Probabilistic Shaping Scheme for Nonbinary LDPC Codes
IEEE Access, 2020 A time sharing (TS) hybrid probabilistic shaping (HPS) scheme for nonbinary (NB) LDPC codes is proposed. For the conventional probabilistic shaping (CPS) scheme, the demodulator uses bit-metric decoding (BMD) for binary LDPC codes and NB LDPC codes ...
Zhanji Wu, Weimin Kang
doaj +1 more source
Simplified variable-scaled min sum LDPC decoder for irregular LDPC codes [PDF]
2014 IEEE 11th Consumer Communications and Networking Conference (CCNC), 2014 Min-Sum decoding is widely used for decoding LDPC codes in many modern digital video broadcasting decoding due to its relative low complexity and robustness against quantization error. However, the suboptimal performance of the Min-Sum affects the integrated performance of wireless receivers.
Emran, Ahmed A., Elsabrouty, Maha
openaire +2 more sources
Trapping Sets of Quantum LDPC Codes [PDF]
Quantum, 2020 Iterative decoders for finite length quantum low-density parity-check (QLDPC) codes are attractive because their hardware complexity scales only linearly with the number of physical qubits.
Nithin Raveendran, Bane Vasi'c
semanticscholar +1 more source
Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]
, 2005 We present a tree-based construction of LDPC codes that have minimum pseudocodeword weight equal to or almost equal to the minimum distance, and perform well with iterative decoding.
Kelley, Christine +2 more
core +4 more sources
On the Minimum Distance of Generalized Spatially Coupled LDPC Codes [PDF]
, 2013 Families of generalized spatially-coupled low-density parity-check (GSC-LDPC) code ensembles can be formed by terminating protograph-based generalized LDPC convolutional (GLDPCC) codes.
Costello Jr, Daniel J. +2 more
core +2 more sources