Results 181 to 190 of about 8,172 (227)
Efficient FPGA implementation of polar codes-based information reconciliation for quantum key distribution. [PDF]
Liao L +10 more
europepmc +1 more source
Advanced channel estimation in OTFS and NOMA using deep bayesian gaussian processes and compressive sensing. [PDF]
Anilkumar N, Sengan S.
europepmc +1 more source
Designand Implementation of a Novel Wideband HF Communication System Based on NC-OFDM and Probabilistic Shaping. [PDF]
Yang R, Bai Y, Hu Z.
europepmc +1 more source
Real-Time Decoder Architecture for LDPC-CPM. [PDF]
Perrins E.
europepmc +1 more source
Quasi-cyclic generalized ldpc codes with low error floors
In this paper, a novel methodology for designing structured generalized LDPC (G-LDPC) codes is presented. The proposed design results in quasi-cyclic G-LDPC codes for which efficient encoding is feasible through shift-register-based circuits.
Gianluigi Liva +2 more
exaly +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Irregular LDPC codes as concatenation of regular LDPC codes
IEEE Communications Letters, 2005In 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
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
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., 2003Summary: 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
An Improvement on LDPC Coded Queued Codes
IEEE GLOBECOM 2008 - 2008 IEEE Global Telecommunications Conference, 2008The queued-code based on low-density parity-check (LDPC) codes, which exploit both the near Shannon-limit performance LDPC codes and the instantaneous channel state information (CSI), can provide excellent performance in the block fading channels. The existing work utilized the conventional random puncturing and repetition operation, which may lead to ...
Ming Jiang 0012 +3 more
openaire +1 more source

