Results 11 to 20 of about 18,127 (206)

Optimizing quasi-cyclic spatially coupled LDPC codes by eliminating harmful objects

open access: yesEURASIP Journal on Wireless Communications and Networking, 2023
It is well known that some harmful objects in the Tanner graph of low-density parity-check (LDPC) codes have a negative impact on their error correction performance under iterative message-passing decoding.
Massimo Battaglioni   +4 more
doaj   +1 more source

Connectivity constrains quantum codes [PDF]

open access: yesQuantum, 2022
Quantum low-density parity-check (LDPC) codes are an important class of quantum error correcting codes. In such codes, each qubit only affects a constant number of syndrome bits, and each syndrome bit only relies on some constant number of qubits ...
Nouédyn Baspin, Anirudh Krishna
doaj   +1 more source

Randomly Punctured LDPC Codes [PDF]

open access: yesIEEE 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

LDPC codes [PDF]

open access: yes, 2021
Στα ψηφιακά συστήματα, η πληροφορία κωδικοποιείται σε ακολουθίες από 0και 1, που αντιστοιχούν στις δύο δυνατές καταστάσεις των τρανζίστορ, on - off, τα οποία λειτουργούν ως διακόπτες. Το πλεονέκτημα αυτό έχει επιφέρει σημαντικέςαλλαγές στον τρόπο επεξεργασίας της πληροφορίας.
openaire   +1 more source

Effective identification of dominant fully absorbing sets for Raptor-like LDPC codes

open access: yesETRI Journal, 2023
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

A Time Sharing Hybrid Probabilistic Shaping Scheme for Nonbinary LDPC Codes

open access: yesIEEE 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

Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights [PDF]

open access: yes, 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

High performance short-block binary regular LDPC codes

open access: yesAlexandria Engineering Journal, 2018
LDPC code shows a good performance with long-block codes. However, certain channels are constrained to use short-block codes due to latency. Therefore, concatenated LDPC codes with iterative decoding is a good choice to get a good performance ...
Latifa Mostari, Abdelmalik Taleb-Ahmed
doaj   +1 more source

INCREASING THE WIRELESS SYSTEMS INFORMATION EFFICIENCY USING LDPC CODING

open access: yesInformation and Telecommunication Sciences, 2019
Background. LDPC codes research is performed in the paper. The influence of LDPC codes on channel information efficiency is studied in scope of MCS and the benefit of using LDPC codes is specified in digits as a result of research. Objective. The purpose
Leonid Uryvsky   +2 more
doaj   +1 more source

Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes

open access: yesIEEE Access, 2023
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

Home - About - Disclaimer - Privacy