Results 31 to 40 of about 50,935 (205)
A Time Sharing Hybrid Probabilistic Shaping Scheme for Nonbinary LDPC Codes
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
ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]
We construct an explicit class of affine permutation matrix low-density parity-check (APM-LDPC) codes based on the array parity-check matrix by using two affine maps f (x) = x-1 and g(x) = 2x-1 on Z_m, where m is an odd prime number, with girth 6 and ...
A. Nassaj, A. R. Naghipour
doaj +1 more source
On the Minimum Distance of Generalized Spatially Coupled LDPC Codes [PDF]
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
OpenCL/CUDA Algorithms for Parallel Decoding of any Irregular LDPC Code using GPU
This article provides a scalable parallel approach of an iterative LDPC decoder. The proposed approach can be implemented in applications supporting massive parallel computing. The proposed mapping is suitable for decoding any irregular LDPC code without
J. Broulim+3 more
doaj +1 more source
Nonbinary Spatially-Coupled LDPC Codes on the Binary Erasure Channel [PDF]
We analyze the asymptotic performance of nonbinary spatially-coupled low-density parity-check (SC-LDPC) codes built on the general linear group, when the transmission takes place over the binary erasure channel.
Amat, Alexandre Graell i+2 more
core +2 more sources
Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes
The error-rate floor of low-density parity-check (LDPC) codes is attributed to the trapping sets of their Tanner graphs. Among them, fully absorbing sets dominantly affect the error-rate performance, especially for short blocklengths.
Woncheol Cho+3 more
doaj +1 more source
Binary Wyner-Ziv and CEO Problem Coding Under the Hamming Distortion Criterion [PDF]
In 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
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes
As a special case of a quasi-cyclic (QC) low-density parity-check (LDPC) code, a full-length row-multiplier (FLRM) QC-LDPC code is described by a compact exponent matrix based on two sequences of integers.
Juhua Wang+3 more
doaj +1 more source
4-CYCLE FREE APM LDPC CODES WITH AN EXPLICIT CONSTRUCTION [PDF]
Recently, a class of low-density parity-check codes based on affine permutation matrices, called APM-LDPC codes, have been considered which have some advantages than quasi-cyclic (QC) LDPC codes in terms of minimum-distance, cycle distribution, and error-
Z. Gholami, M. Gholami
doaj +1 more source
Beyond 100 Gbit/s Pipeline Decoders for Spatially Coupled LDPC Codes
Low-density parity-check (LDPC) codes are a well-established class of forward error correction codes that provide excellent error correction performance for large code block sizes.
Matthias Herrmann, Norbert Wehn
doaj +1 more source