Results 11 to 20 of about 24,946 (192)

Deriving Good LDPC Convolutional Codes from LDPC Block Codes [PDF]

open access: yesIEEE Transactions on Information Theory, 2011
Low-density parity-check (LDPC) convolutional codes are capable of achieving excellent performance with low encoding and decoding complexity. In this paper we discuss several graph-cover-based methods for deriving families of time-invariant and time-varying LDPC convolutional codes from LDPC block codes and show how earlier proposed LDPC convolutional ...
Pusane, Ali E.   +3 more
openaire   +3 more sources

Decoder-in-the-Loop: Genetic Optimization-Based LDPC Code Design [PDF]

open access: yesIEEE Access, 2019
LDPC code design tools typically rely on asymptotic code behavior and are affected by an unavoidable performance degradation due to model imperfections in the short length regime.
Ahmed Elkelesh   +4 more
doaj   +4 more sources

Efficient Design of Read Voltages and LDPC Codes in NAND Flash Memory Using Density Evolution

open access: yesIEEE Access, 2023
Low-density parity-check (LDPC) codes play an important role in the reliability enhancement of commercial NAND flash memory. Unfortunately, due to the requirement of the reading speed of NAND flash memory, the LDPC decoder will not obtain precise soft ...
Chatuporn Duangthong   +2 more
doaj   +1 more source

LDPC codes [PDF]

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

Asymmetric quantum LDPC codes [PDF]

open access: yes2008 IEEE International Symposium on Information Theory, 2008
5 pages, 1 figure, 1 table, to appear in the Proceedings of the 2008 IEEE International Symposium on Information ...
Sarvepalli, Pradeep Kiran   +2 more
openaire   +2 more sources

Analysis and Optimization of a General Linking Matrix for JSCC Scheme Based on Double LDPC Codes

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

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

ON THE CLASS OF ARRAY-BASED APM-LDPC CODES [PDF]

open access: yesJournal of Algebraic Systems, 2021
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

Simplified variable-scaled min sum LDPC decoder for irregular LDPC codes [PDF]

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

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

Home - About - Disclaimer - Privacy