Results 131 to 140 of about 1,161 (180)

Layered HARQ Design for LDPC-Based Multi-Level Coded Modulation. [PDF]

Entropy (Basel)
Wei Y, Chen Y, Chen C, Xia B, Wang L.
europepmc   +1 more source

High-Efficiency Lossy Source Coding Based on Multi-Layer Perceptron Neural Network. [PDF]

Entropy (Basel)
Wang Y, Chen W, Song L, Xu Z, Song D, Wang L.   +5 more
europepmc   +1 more source

DNA StairLoop: enabling high-fidelity data recovery and robust error correction in DNA-based data storage. [PDF]

Nat Commun
Yan Z, Qu G, Chen X, Zheng G, Wu H.
europepmc   +1 more source

Efficient FPGA implementation of polar codes-based information reconciliation for quantum key distribution. [PDF]

Sci Rep
Liao L, Wu X, Chen Y, Fan X, Tian Z, Huang J, Mu T, Guo J, Liu M, Liu B, Sun S.   +10 more
europepmc   +1 more source

Designand Implementation of a Novel Wideband HF Communication System Based on NC-OFDM and Probabilistic Shaping. [PDF]

Sensors (Basel)
Yang R, Bai Y, Hu Z.
europepmc   +1 more source

Advanced channel estimation in OTFS and NOMA using deep bayesian gaussian processes and compressive sensing. [PDF]

Sci Rep
Anilkumar N, Sengan S.
europepmc   +1 more source

Real-Time Decoder Architecture for LDPC-CPM. [PDF]

Entropy (Basel)
Perrins E.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Irregular LDPC codes as concatenation of regular LDPC codes

IEEE Communications Letters, 2005
In this letter, the construction of irregular LDPC codes obtained by concatenating regular ones is considered. These codes are analyzed for the binary symmetric channel (BSC). It is shown via proper distribution evolution that such concatenated codes have in general a threshold value weaker (but not necessarily much different) than their unconstrained ...
Marc P. C. Fossorier, Nenad Miladinovic
openaire   +1 more source

Overview of LDPC Codes

7th IEEE International Conference on Computer and Information Technology (CIT 2007), 2007
In light of the history of LDPC codes and relevant research advances in recent years, this paper probes into the encoding and decoding techniques related to this capacity-approaching error-correction technology. Besides the general expression as an equation, LDPC codes can also be examined with a Tanner graph.
Zongjie Tu, Shiyong Zhang
openaire   +1 more source

The rate of regular LDPC codes

IEEE International Symposium on Information Theory, 2003. Proceedings., 2003
Summary: We find the rate of a typical code from the regular low-density parity-check (LDPC) ensemble. We then show that the rate of a code from the ensemble converges to the design rate in quadratic mean and almost surely.
G. Miller, Gérard D. Cohen
openaire   +2 more sources