Low-density parity-check (LDPC) codes have been shown to deliver capacity approaching performance; however, problematic graphical structures (e.g. trapping sets) in the Tanner graph of some LDPC codes can cause high error floors in bit-errorratio (BER) performance under conventional sum-product algorithm (SPA). This paper presents a serial concatenation scheme to avoid the trapping sets and to ...

............................................................................................................... i Acknowledgement ............................................................................................. vi Content .............................................................................................................. vii Figure List ......................................

Due to the speed limitation of the conventional bit-chosen strategy in the existing weighted bit flipping algorithms, a high-speed LDPC decoder cannot be realized. To solve this problem, we propose a fast weighted bit flipping (FWBF) algorithm. Specifically, based on the stochastic error bitmap of the received vector, a partially parallel bit-choose strategy is adopted to lower the delay of cho...

In the above paper [1], the second paragraph of the introduction was accidentally omitted. This paragraph and corresponding citations should appear as follows. As for iterative decoding of LDPC codes, there are two main scheduling approaches, probabilistic approaches and deterministic approaches. Although both scheduling approaches provide better complexity/performance tradeoff than their stand...

In this article, new regular incidence structures are presented. They arise from sets of conics in the affine plane blown–up at its rational points. The LDPC codes given by these incidence matrices are studied. These sparse incidence matrices turn out to be redundant, which means that their number of rows exceeds their rank. Such a feature is absent from random LDPC codes and is in general inte...

Semi-Parallel Architectures For Real-Time LDPC Coding

In this paper we propose the construction of an efficient cryptographic system, based on the combination of the ElGamal Elliptic Curve Algorithm and Low Density Parity Check (LDPC) codes for mobile communication. When using elliptic curves and codes for cryptography it is necessary to construct elliptic curves with a given or known number of points over a given finite field, in order to represe...

Absnmt-Tubo deeding oflowdenrily pllityshrek (LDPC) and geme m b e d lowdensity (GLO) coda and the corresponding deeodor amhitoeh m s are mnridrred. A regular (c,r)-LDF'C code of length n is viewed s the interseetion of c intedrrvrd supersods where each smper.de is the dlred sum of n/r indepodent single pa.rity-cheek w b d l s E*dons e GLD coda dmply utilize mom pwellul subsoder. The turbo d d ...

In this paper, we discuss the reduction of errortrellises for tail-biting convolutional codes. In the case where some column of a parity-check matrix has a monomial factor D, we show that the associated tail-biting error-trellis can be reduced by cyclically shifting the corresponding error-subsequence by l (i.e., the power of D) time units. We see that the resulting reduced error-trellis is aga...