Results 21 to 30 of about 8,172 (227)
Full-Length Row-Multiplier QC-LDPC Codes With Girth Eight and Short Circulant Sizes
IEEE 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
High-Speed Reconciliation for CVQKD Based on Spatially Coupled LDPC Codes
IEEE Photonics Journal, 2018 The speed of continuous variable quantum key distribution is limited by the reconciliation efficiency and the reconciliation frame error rate (FER) in the reconciliation phase.
Xue-Qin Jiang +3 more
doaj +1 more source
Algebra-Assisted Construction of Quasi-Cyclic LDPC Codes for 5G New Radio
IEEE Access, 2018 Quasi-cyclic LDPC (QC-LDPC) codes have been accepted as the standard codes of 5G enhanced mobile broadband data channel. These standard codes are designed to support multiple lifting sizes and possess rate-compatible property, which can help adapt ...
Huaan Li +4 more
doaj +1 more source
Discrete Dynamics in Nature and Society, 2015 This paper presents four different integer sequences to construct quasi-cyclic low-density parity-check (QC-LDPC) codes with mathematical theory. The paper introduces the procedure of the coding principle and coding.
Yan Zhang, Feng-fan Yang, Weijun Song
doaj +1 more source
Implementation of Decoders for LDPC Block Codes and LDPC Convolutional Codes Based on GPUs [PDF]
IEEE Transactions on Parallel and Distributed Systems, 2014 With the use of belief propagation (BP) decoding algorithm, low-density parity-check (LDPC) codes can achieve near-Shannon limit performance. In order to evaluate the error performance of LDPC codes, simulators running on CPUs are commonly used. However, the time taken to evaluate LDPC codes with very good error performance is excessive. In this paper,
Yue Zhao 0011, Francis Chung-Ming Lau
openaire +3 more sources
On Sparse Regression LDPC Codes
2023 IEEE International Symposium on Information Theory (ISIT), 2023 Belief propagation applied to iterative decoding and sparse recovery through approximate message passing (AMP) are two research areas that have seen monumental progress in recent decades. Inspired by these advances, this article introduces sparse regression LDPC codes and their decoding.
Jamison R. Ebert +2 more
openaire +2 more sources
Multilevel structured low-density parity-check codes [PDF]
, 2008 Low-Density Parity-Check (LDPC) codes are typically characterized by a relatively high-complexity description, since a considerable amount of memory is required in order to store their code description, which can be represented either by the connections ...
S. Chen +5 more
core +1 more source
Augmented decoders for LDPC codes [PDF]
EURASIP Journal on Wireless Communications and Networking, 2018 Abstract The performance of a belief propagation decoder for low-density parity-check codes is limited by the presence of trapping sets in the code’s graph. This leads to an error floor at higher signal-to-noise ratios. We propose the use of an augmented decoder which operates by iteratively decoding on a set of graphs which have a subset of repeated ...
Alex R. Rigby +4 more
openaire +3 more sources
VLSI implementation of a multi-mode turbo/LDPC decoder architecture [PDF]
, 2013 Flexible and reconfigurable architectures have gained wide popularity in the communications field. In particular, reconfigurable architectures for the physical layer are an attractive solution not only to switch among different coding modes but also to ...
Maurizio Martina +3 more
core +1 more source
New Construction of Low-Density Parity-Check Codes Based on Vector Space Over Finite Fields
IEEE Access, 2020 Low-Density Parity-Check (LDPC) codes have low linear decoding complexity, which is a kind of good codes with excellent performance. Therefore, LDPC codes have great research value.
Xuemei Liu, Lihua Jia
doaj +1 more source