Results 131 to 140 of about 2,457,220 (279)
Finite-Length Analysis for Spatially Coupled LDPC Codes Based on Base Matrix. [PDF]
Entropy (Basel), 2023 Liu Y, Sun S, Zhang Y, Wang B.
europepmc +1 more source
Repeat Accumulate Based Designs for LDPC Codes on Fading Channels [PDF]
arXiv, 2014 Irregular repeat-accumulate Root-Check LDPC codes based on Progressive Edge Growth (PEG) techniques for block-fading channels are proposed. The proposed Root-Check LDPC codes are {both suitable for channels under $F = 2, 3$ independent fadings per codeword and} for fast fading channels.
arxiv
Performance analysis of LDPC codes for time-selective complex fading channels [PDF]
, 2004 Kaiann Fu, Achilleas Anastasopoulos
openalex +1 more source
Protograph Designing of P-LDPC Codes via M3 Method. [PDF]
Entropy (Basel), 2023 Song D, Miao M, Wang L.
europepmc +1 more source
A Joint Optimization Technique for Multi-Edge Type LDPC Codes [PDF]
arXiv, 2016 This paper considers the optimization of multi-edge type low-density parity-check (METLDPC) codes to maximize the decoding threshold. We propose an algorithm to jointly optimize the node degree distribution and the multi-edge structure of MET-LDPC codes for given values of the maximum number of edge-types and maximum node degrees.
arxiv
LDPC Block and Convolutional Codes Based on Circulant Matrices [PDF]
, 2004 R. Michael Tanner +4 more
openalex +1 more source
Lossy P-LDPC Codes for Compressing General Sources Using Neural Networks. [PDF]
Entropy (Basel), 2023 Ren J, Song D, Wu H, Wang L.
europepmc +1 more source
Performance of Spatially-Coupled LDPC Codes and Threshold Saturation over BICM Channels [PDF]
arXiv, 2013 We study the performance of binary spatially-coupled low-density parity-check codes (SC-LDPC) when used with bit-interleaved coded-modulation (BICM) schemes. This paper considers the cases when transmission takes place over additive white Gaussian noise (AWGN)channels and Rayleigh fast-fading channels.
arxiv
IEEE Transactions on Information TheoryThis work has been submitted to the IEEE for possible publication.
Jamison R. Ebert +2 more
openaire +2 more sources