Results 51 to 60 of about 2,457,151 (214)
Iterative Detection and Decoding Algorithms for MIMO Systems in Block-Fading Channels Using LDPC Codes [PDF]
IEEE Transactions on Vehicular Technology, 2015 We propose iterative detection and decoding (IDD) algorithms with low-density parity-check (LDPC) codes for multiple-input multiple-output (MIMO) systems operating in block-fading and fast Rayleigh fading channels.
A. G. Uchoa +2 more
semanticscholar +1 more source
Performance Comparison of LDPC Block and Spatially Coupled Codes over GF(q) [PDF]
arXiv, 2014 In this paper, we compare the finite-length performance of protograph-based spatially coupled low-density parity-check (SC-LDPC) codes and LDPC block codes (LDPC-BCs) over GF(q). In order to reduce computational complexity and latency, a sliding window decoder with a stopping rule based on a soft bit-error-rate (BER) estimate is used for the q-ary SC ...
arxiv
CONSTRUCTION OF REGULAR LDPC LIKE CODES BASED ON FULL RANK CODES AND THEIR ITERATIVE DECODING USING A PARITY CHECK TREE [PDF]
ICTACT Journal on Communication Technology, 2011 Low density parity check (LDPC) codes are capacity-approaching codes, which means that practical constructions exist that allow the noise threshold to be set very close to the theoretical Shannon limit for a memory less channel.
H. Prashantha Kumar +2 more
doaj
Design of rate-compatible LDPC codes based on uniform shortening distribution
Engineering and Applied Science Research, 2018 Information shortening is a methodology to construct rate-compatible codes. Recently, LDPC codes have been shown that uniform shortening distribution is a criterion to achieve excellent performance.
Arisa Wongsriwor +2 more
doaj +1 more source
Study of Structured Root-LDPC Codes and PEG Techniques for Block-Fading Channels [PDF]
arXiv, 2015 In this work, we propose structured Root-Low-Density Parity-Check (LDPC) codes and design techniques for block-fading channels. In particular, Quasi-Cyclic Root-LDPC codes, Irregular repeat-accumulate Root-LDPC codes and Controlled Doping Root-LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed.
arxiv
Hierarchical and High-Girth QC LDPC Codes [PDF]
, 2011 We present a general approach to designing capacity-approaching high-girth low-density parity-check (LDPC) codes that are friendly to hardware implementation. Our methodology starts by defining a new class of "hierarchical" quasi-cyclic (HQC) LDPC codes that generalizes the structure of quasi-cyclic (QC) LDPC codes. Whereas the parity check matrices of
arxiv +1 more source
On the Girth of Tanner (3, 13) Quasi-Cyclic LDPC Codes
IEEE Access, 2019 Girth is an important structural property of low-density parity-check (LDPC) codes. Motivated by the works on the girth of Tanner (3, 5), (3, 7), (3, 11), and (5, 7) quasi-cyclic (QC) LDPC codes, we, in this paper, study the girth of Tanner (3, 13) QC ...
Hengzhou Xu +4 more
doaj +1 more source
Design of LDPC Codes: A Survey and New Results
Journal of Communications Software and Systems, 2006 This survey paper provides fundamentals in the design of LDPC codes. To provide a target for the code designer, we first summarize the EXIT chart technique for determining(near-)optimal degree distributions for LDPC code ensembles.
Gianluigi Liva +5 more
doaj
Non binary LDPC codes over the binary erasure channel: density evolution analysis [PDF]
arXiv, 2008 In this paper we present a thorough analysis of non binary LDPC codes over the binary erasure channel. First, the decoding of non binary LDPC codes is investigated. The proposed algorithm performs on-the-fly decoding, i.e. it starts decoding as soon as the first symbols are received, which generalizes the erasure decoding of binary LDPC codes. Next, we
arxiv
Design of network-coding based multi-edge type LDPC codes for multi-source relaying systems [PDF]
arXiv, 2009 In this paper we investigate a multi-source LDPC scheme for a Gaussian relay system, where M sources communicate with the destination under the help of a single relay (M-1-1 system). Since various distributed LDPC schemes in the cooperative single-source system, e.g.
arxiv