Results 101 to 110 of about 826 (159)
Knot theory and error-correcting codes. [PDF]
Des Codes CryptogrKılıç AB +3 more
europepmc +1 more source
New quantum LDPC codes based on projective geometry. [PDF]
Sci RepTang C, Bai C, Feng Y.
europepmc +1 more source
Efficient iterative decoding algorithms for turbo and low-density parity-check (LDPC) codes.
, 2013 openaire +2 more sources
Some of the next articles are maybe not open access.
Related searches:
Related searches:
IEEE Transactions on Communications, 2006
Conventional iterative decoding with flooding or parallel schedule can be formulated as a fixed-point problem solved iteratively by a successive substitution (SS) method. In this paper, we investigate the dynamics of a continuous-time (asynchronous) analog implementation of iterative decoding, and show that it can be approximated as the application of ...
Saied Hemati, Amir H. Banihashemi
exaly +2 more sources
Conventional iterative decoding with flooding or parallel schedule can be formulated as a fixed-point problem solved iteratively by a successive substitution (SS) method. In this paper, we investigate the dynamics of a continuous-time (asynchronous) analog implementation of iterative decoding, and show that it can be approximated as the application of ...
Saied Hemati, Amir H. Banihashemi
exaly +2 more sources
IEEE Transactions on Communications, 2005
The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover,
Jianguang Zhao +2 more
exaly +2 more sources
The effects of clipping and quantization on the performance of the min-sum algorithm for the decoding of low-density parity-check (LDPC) codes at short and intermediate block lengths are studied. It is shown that in many cases, only four quantization bits suffice to obtain close to ideal performance over a wide range of signal-to-noise ratios. Moreover,
Jianguang Zhao +2 more
exaly +2 more sources
Journal of Shanghai Jiaotong University (Science), 2016
In this paper, a family of rate-compatible (RC) low-density parity-check (LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method. The resulted RC-LDPC convolutional codes, which are derived by permuting the matrices of the corresponding RC-LDPC block codes, are systematic and have maximum encoding memory ...
Liwei Mu, Guojun Han, Zhiyong Liu
exaly +2 more sources
In this paper, a family of rate-compatible (RC) low-density parity-check (LDPC) convolutional codes can be obtained from RC-LDPC block codes by graph extension method. The resulted RC-LDPC convolutional codes, which are derived by permuting the matrices of the corresponding RC-LDPC block codes, are systematic and have maximum encoding memory ...
Liwei Mu, Guojun Han, Zhiyong Liu
exaly +2 more sources
Low-density parity-check (LDPC) coded OFDM systems
IEEE 54th Vehicular Technology Conference. VTC Fall 2001. Proceedings (Cat. No.01CH37211), 2002Orthogonal frequency division multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in a multipath fading environment that causes intersymbol interference (ISI). There are many error-correcting codes applied to OFDM, convolutional codes, Reed-Solomon codes, turbo codes, and so on.
Hisashi Futaki, Tomoaki Ohtsuki
openaire +1 more source
Performance of low-density parity-check (LDPC) coded OFDM systems
2002 IEEE International Conference on Communications. Conference Proceedings. ICC 2002 (Cat. No.02CH37333), 2003Orthogonal frequency division multiplexing (OFDM) is a very attractive technique for high-bit-rate data transmission in multipath environments. Many error-correcting codes have been applied to OFDM. Recently, LDPC codes have attracted much attention. The performance of LDPC codes is very close to the Shannon limit, with practical decoding complexity ...
Hisashi Futaki, Tomoaki Ohtsuki
openaire +1 more source
Low-density parity-check code (LDPC) schemes with BICM
International Conference on Communication Technology Proceedings, 2003. ICCT 2003., 2004LDPC codes are serious opponent of turbo codes. This paper presents LDPC schemes using bit-interleaving coded modulation (BICM), which can increase the spectral efficiency two or three times with little loss of power efficiency. And the decoding complexity is also addressed in this paper.
null Hai-Gang Zhang +3 more
openaire +1 more source
Design of low-density parity-check (LDPC) codes for high order constellations
IEEE Global Telecommunications Conference, 2004. GLOBECOM '04., 2005In this paper, we propose a simple design of LDPC codes which combines the good properties of multilevel coding (MLC) and bit-interleaved coded modulation (BICM) schemes with Gray-mapped PAM constellations and one-shot demodulation. Through simulations, we show that it performs better than MLC/parallel independent decoding for short-medium lengths ...
Hari Sankar +2 more
openaire +1 more source