Results 81 to 90 of about 48,269 (185)
COMPARATIVE ANALYSIS OF LDPC AND BCH CODES ERROR-CORRECTING CAPABILITIES
Information and Telecommunication Sciences, 2014 The error-correcting capabilities of regular LDPC (Low Density Parity Check) codes and BCH (Bose-Chaudhuri-Hocquenguem) codes are examined. The qualitative analysis and the quantitative assessment of error-correcting abilities are performed for LDPC ...
Leonid O. Uryvsky, Serhii O. Osypchuk
doaj +1 more source
, 2016 In this paper, we propose a new approach to construct a class of check-hybrid generalized low-density parity-check (CH-GLDPC) codes which are free of small trapping sets.
Chilappagari +6 more
core +3 more sources
New decoding scheme for LDPC codes based on simple product code structure
, 2012 In this paper, a new decoding scheme for low-density parity-check (LDPC) codes using the concept of simple product code structure is proposed based on combining two independently received soft-decision data for the same codeword.
Hong, Seokbeom +4 more
core +1 more source
ETRI JournalA hardware architecture is presented to decode (N, K) polar codes based on a low-density parity-check code-like decoding method. By applying suitable pruning techniques to the dense graph of the polar code, the decoder architectures are optimized using ...
Dinesh Kumar Devadoss +1 more
doaj +1 more source
Reversible Low-Density Parity-Check Codes
IEEE Transactions on Information Theory, 2009 Low-density parity-check (LDPC) codes may be decoded using a circuit implementation of the sum-product algorithm which maps the factor graph of the code. By reusing the decoder for encoding, both tasks can be performed using the same circuit, thus reducing area and verification requirements.
David Haley, Alex Grant
openaire +3 more sources
Codeword Structure Analysis for LDPC Convolutional Codes
Information, 2015 The codewords of a low-density parity-check (LDPC) convolutional code (LDPC-CC) are characterised into structured and non-structured. The number of the structured codewords is dominated by the size of the polynomial syndrome former matrix
Hua Zhou +3 more
doaj +1 more source
Fast Node Polar Decoding Method Based on Hybrid Parity Check and CRC
IEEE AccessIn the case of short code, polar code demonstrates superior performance compared with Low Density Parity Check (LDPC) code. Particularly in low coding rate scenario, the complexity of Polar code encoding and decoding is significantly lower than that of ...
Zongmiao He +5 more
doaj +1 more source
Novel construction of QC-LDPC codes with modified 2-D GRS codes
Tongxin xuebao, 2015 The construction method for QC-LDPC (quasi-cyclic low density parity-check) code with modified two-dimensional generalized reed-solomon (2-D GRS) code is proposed using the generator polynomial of GRS code,so thus the constructed code can have better ...
Ming ZHAO, Xiao-lin ZHANG
doaj +2 more sources
EURASIP Journal on Wireless Communications and Networking, 2010 A recently developed theory suggests that network coding is a generalization of source coding and channel coding and thus yields a significant performance improvement in terms of throughput and spatial diversity.
Bing Du, Jun Zhang
doaj +1 more source
Generalized low-density parity-check codes
, 2006 An evolution of Gallager's Low-Density Parity-Check (LDPC) codes was first introduced by Tanner in 1981, namely Generalized Low-Density Parity-Check (GLDPC) codes, and then further developed by Boutros et at. as well as by Lentmaier and Zigangirov. It has been shown that Hamming-code based GLDPC codes are asymptotically good in the sense of minimum ...
openaire +2 more sources