A Class of Group-Structured LDPC Codes
|
|
- Priscilla Chambers
- 6 years ago
- Views:
Transcription
1 A Class of Group-Structured LDPC Codes R. Michael Tanner Deepak Sridhara and Tom Fuja 1 Computer Science Department Dept. of Electrical Engineering University of California, Santa Cruz, CA Univ. of Notre Dame, Notre Dame, IN U.S.A. tanner@soe.ucsc.edu tfuja@nd.edu, dsridhar@nd.edu Abstract A class of graphs is designed using subgroups of the multiplicative group of a prime field GF(p). Instances where (p-1) is divisible by 3 and 5 are used to construct quasi-cyclic LDPC codes with bit degree 3 and parity degree 5, among them a [155,64,20] code. While the girth of a graph in this class cannot be greater than twelve, for many practical lengths the graphs have a relatively large girth and a lowdensity of short cycles. Simulation studies show that at short to moderate lengths these codes performance meets or surpasses that of randomly generated regular (3,5) LDPC codes when used with sum-product algorithm decoders. I. Introduction LDPC codes with sparse code constraint (Tanner) graphs with graph message-passing algorithms are now known both theoretically and empirically to achieve decoding near the Shannon limit [1] [2] [3]. The principal method for designing such codes is to generate a random low-density parity check matrix from a suitable ensemble [4]. Such random codes pose implementation challenges due to the unavoidable entropy of the constraint graph connections. Furthermore, any given code must be extensively tested to assure performance, particularly for short to moderate block lengths. In the Recent Results session of the 2000 International symposium on Information Theory, Tanner presented a [155,64,20] groupstructured quasi-cyclic (3,5) LDPC code. The code s parity check matrix is composed of cyclically shifted identity matrices chosen to create a code constraint graph with a large girth, g=8, for the graph s parameters. Despite the extreme sparseness of the graph, the minimum distance of the code is very respectable. The best code presently known has parameters [155,64,28] [5]. This paper investigates a class of LDPC block codes that generalize this code construction to larger lengths. The girth of code graphs generated with this prescription can be no greater than twelve. This implies that the graphs will fail to show the logarithmic relationship between girth and block length that is known to be achievable, and, for sufficiently long lengths, random graphs would be expected to outperform these codes. In simulation studies given here, the groupstructured (3,5) LDPC codes tested are as good or better than comparable random codes for lengths up to 1,055. Table 1 lists some codes in this class and gives important parameters for each code and its associated constraint graph. Both improved performance and simplicity of implementation make these group-structured codes and graphs attractive for moderate block length systems. II. Code Construction A code in this class is specified by its parity check matrix, H, which is a block matrix of circulant matrices. Specifically, H consists of a j k array of p p circulant permutation matrices, H s,t, 1 s j, 1 t k, where p is a prime. Let a and b, a b, be non-zero integers from the field GF(p) with orders k and j, respectively. Thus k and j must be divisors of (p-1). The (s,t) permutation matrix is an identity matrix with its rows left cyclically shifted (modulo p) by a number of positions P s,t = b (s-1) a (t-1), 1 s j, 1 t k. The [l,m]th entry of H s,t is H s,t [l,m] = 1 for l- P s,t =m mod p, H s,t [l,m] = 0 elsewhere. With this definition, H is a jp kp parity check matrix. Each row contains exactly k ones, and each column exactly j ones, and the code is a regular (j,k) LDPC code. III. Code Rate If all the equations of H were linearly independent, the rate of the code would be R = 1 This work was supported by NSF grant
2 1 (j/k), and this will be called the design rate of the code. The sum of all the p rows in any one of the blocks is the all ones vector, and it is immediately apparent that at least (j-1) equations are linearly dependent. Thus in general R 1 (j/k); in most instances, the rate is only slightly higher than the design rate. For codes with practical block lengths, the rank of the parity check matrix over GF(2) can be computed directly. Theoretical analysis of rate can be carried out using transforms [6]. Let GF(2 x ) be the smallest extension field of GF(2) containing a primitive pth root of unity, and let be such a root. An p p Fourier transform matrix F based on this root has ith row f i = [ 1,, i 2i,..., i(p-1) ], 0 i p-1, and f i is an eigenvector for any circulant matrix. In particular, f i H s,t = i s,t = ip, P= P s,t ; i s,t is the ith eigenvalue of the (s,t) block. The rank of the parity check matrix can be determined by finding the rank r i of the j k matrix i with (s,t) entry i s,t, for each i, and summing over all 0 i p-1. Furthermore, it is possible to show that the ranks satisfy a conjugacy condition, r i = r 2i, so one need only find the rank for one i in each conjugacy class modulo p. Then R = 1 (( r i )/pk). The rate equals the design rate if and only if r i =j for all i. The linear dependency noted above is manifest in 0, which for these codes is a matrix with ones in all positions. It has rank one, not j, so the rate will always be higher than the design rate. In general, there may be other i for which r i < j, increasing the rate further. IV. Graph Automorphisms: One transitivity The prescription for the codes exploits subgroups of the field GF(p), both the additive shift group visible in the quasi-cyclic form, and the two multiplicative subgroups. By design, the code graph inherits an automorphism group incorporating these subgroups. (The automorphism group for a graph is the group of permutations that map vertices to vertices, edges to edges, and preserve edge-vertex connections.) To describe these permutations, a convenient indexing for the vertices is needed. The H matrix consists of j blocks of p parity equations. Let the vertex for the x s th parity, 0 x s p-1, from the sth block, 1 s j, be indexed by a j-tuple that has an integer x s in the sth position, and in all other positions: [,,...,, x s,,..., ]. A bit is checked by one parity from each of the j blocks, and a bit vertex can be indexed by a j-tuple indicating the parity vertex in each of the j blocks to which it is connected. Bit vertex [x 1, x 2,..., x j ] is connected to parity vertexes [x 1,,..., ], [, x 2,..., ],, and [,...,, x j ]. Correspondingly, a parity vertex [,,...,, x s,,..., ] is connected to all bits [x 1, x 2,..., x j ] with x s in the sth position. An edge in the graph is defined by a bit-parity pair of connected vertexes, e.g., [x 1, x 2,..., x s,..., x j ] [,,...,, x s,,..., ]. Defining the code as quasi-cyclic mod p forces the graph to have a shift automorphism σ that acts additively on all the j-tuples, mapping parity vertexes to parity vertexes, σ([,,...,, x s,,..., ])=[,,...,, x s +1,,..., ], and bit vertexes to bit vertexes, σ( [x 1, x 2,..., x j ]) = [x 1 +1, x 2 +1,..., x j +1], all indexes computed mod p. This is nothing more than the statement that the H matrix consists of circulants. A second automorphism π arises from the factor a that appears in the cyclic shifts of the identity matrices in a row of the block matrix H. Specifically, π( [,,...,, x s,,..., ]) = [,,...,, ax s,,..., ], and π( [x 1, x 2,..., x j ]) = [ax 1, ax 2,..., ax j ], all indexes computed mod p. Because the number of positions cyclically shifted, P s,t = b (s-1) a (t-1), in the successive bit blocks of H are given by orbits of the multiplicative subgroup generated by a, this automorphism π preserves vertices and edges of the graph. The first column of H defines a bit [1, b, b 2,..., b j-1 ] that is checked by parities [1,,..., ], [, b,..., ],, and [,...,, b j-1 ]. Automorphism π maps this bit to the first bit of the second block, namely, [a, ab, ab 2,..., ab j-1 ]. Then t repeated applications of π map this first bit to [a t, a t b, a t b 2,..., a t b j-1 ], the first bit of the (t+1)th block, 0 t k-1. Observe that π( σ[x 1, x 2,..., x j ]) = π([x 1 +1, x 2 +1,..., x j +1]) = ([ax 1 +a, ax 2 +a,..., ax j +a])=σ a ( π[x 1, x 2,..., x j ]). Thus π maps all bits in a block to the next block, and it clearly preserve edges. Using both σ and π, any bit vertex can be mapped to any other bit vertex, and the automorphism group of the graph is transitive on bit vertexes. The definition of H is analogous to the definition of its transpose if b is substituted for a and vice versa, and the direction of the shifts of the circulants is reversed. It should come as
3 no surprise that a third automorphism that is the dual of π maps a block of parities to the next block of parities. With the indexing as given, the third automorphism, ρ, is defined as follows: ρ([,,...,, x s,,..., ]) = [,,...,, bx s,,..., ], with the bx s component in the s+1th position, cyclically right-shifted in the j-tuple by one position, and ρ( [x 1, x 2,..., x j ]) = [bx j, bx 1, bx 2,..., bx j-1 ], all indexes computed mod p. To see that ρ preserves edges, observe that the bit of the first column, [1, b, b 2,..., b j-1 ], is fixed by ρ, and ρ simply permutes the parities checking this bit in an orbit of size j. Furthermore, ρ( σ[x 1, x 2,..., x j ]) = ρ( [x 1 +1, x 2 +1,..., x j +1]) = ( [bx j +b, bx 1 +b, bx 2 +b,..., bx j-1 +b]) = σ b ( ρ[x 1, x 2,..., x j ]), and it behaves similarly in mapping the parity vertexes, thereby preserving edges. Using both ρ and σ, any parity can be mapped to any other parity. Moreover, we note that ρ( π[x 1, x 2,..., x j ]) = ρ( [ax 1, ax 2,..., ax j ]) = ( [bax j, bax 1, bax 2,..., bax j-1 ]) = π(ρ[x 1, x 2,..., x j ]), and similarly for the parities. With these three automorphisms, the automorphism group is transitive on edges. The proof is straightforward. Given any edge, the bit vertex of the edge can be permuted to the [1, b, b 2,..., b j-1 ] bit of the first column using σ and π. Then the edge can be permuted to the edge [1, b, b 2,..., b j-1 ] [1,,..., ] by repeated application of ρ. Since this is true of any edge, the inverse of this permutation for a second edge can be applied to the permutation for the first edge to map the first edge to the second, which means that any edge can be mapped to any other edge and the automorphism group is transitive on edges. V. Graph Girth and Diameter The transitivity of the automorphism group implies that these graphs are highly symmetric, but this alone says little about likely performance of the code when the graph G constitutes an iterative graph message-passing sum-product decoder. Two graph parameters that are relevant to performance are the graph girth, g G, the length of the shortest cycle, and the graph diameter, d G, the maximum over all pairs of vertexes of the length of the shortest path between them. The underlying assumption of the sum-product algorithm is that the information gathered by the graph message-passing computations is statistically independent. This assumption will be valid for a number of iterations equal to (g G -1) /4; one iteration, consisting of a parity computation and a bit computation, propagates information along a path of length two in the graph. For the first (g G -1) /4 iterations, the information cannot have been propagated around the shortest cycle in the graph, and information arriving at any node will indeed be statistically independent. For this reason, it is advantageous for G to have a large girth. It has been observed in empirical studies that the statistical dependence does not greatly impair performance if there is only a low density of short cycles. Similarly, in d G /2 iterations information from any one vertex will have reached any other vertex. The diameter of the graph must satisfy d G (g G -1) /2, since all vertexes on the path around the minimum cycle cannot be reached in fewer steps. If the diameter is large compared to (g G -1) /2, it means that there are vertexes that are remote from one another, and statistically dependent information will be flowing around the shortest cycles well before all the potentially useful received information has been propagated across the graph. These considerations motivate the design of code graphs with large girth and small diameter for the degrees of the vertexes. The prescription given here is very effective in this regard for graphs that are not too large, but the very form of the H matrix puts an upper limit on the size of the girth. VI. Girth g G 12 For any j 2 and k 3, a graph in this class cannot have a girth greater than twelve, due to the presence of cycles that arise from a commutativity in the connections. Due to the quasi-cyclic shift-invariance, two paths of length six must meet to form a cycle of length twelve. Let X = [x 1, x 2,...], Y = [y 1, y 2,...], and Z = [z 1, z 2,...] be three bit vertexes, one from each of three different blocks, with edges to the two blocks of parities. Let x 2 x 1 = x, y 2 y 1 = y, and z 2 z 1 = z. For the class of graphs under consideration, these differences are all distinct by the choice of a and b in GF(p): x = a t-1 (b 1 b 0 ) for some 1 t k; y = a t -1 (b 1 b 0 ), t t. Since a is an element of order k and b is an element of order j from GF(p), x y, and by the same reasoning z must be distinct as well.
4 (Otherwise the graph would have a cycle of length four.) x y z Parity Node Fig. 1 Cycle of length 12 Bit Node The shift permutation can be applied to these bits to form a path in the graph of length six as follows (see Fig. 1): [0,,..., ] [0, x,...] [, x,..., ] [ x - y, x,...] [ x - y,,..., ] [ x - y, x - y + z,...] [, x - y + z,..., ]. The path goes from the first parity block to the second via a shift of X, then back to the first parity block via a shift of Y, then to the second parity block via a shift of Z. A second path of length six meets this at both ends: [0,,..., ] [0, z,...] [, z,..., ] [ z - y, z...] [ z - y,,..., ] [ z - y, z - y + x,...] [, z - y + x,..., ]. The second path goes via a shift of Z, then back via a shift of Y, then again via a shift of X; the order of the Z and X links has been interchanged. Together these constitute a cycle of length twelve. Clearly many cycles of this mathematical provenance will exist, since any pair of parity blocks and any three blocks of bits give rise to multiple cycles of this form. This girth limitation eventually becomes a serious handicap for very long codes. Our class of codes is attractive nonetheless for short to moderate length codes. A projective plane code, for example, has a girth of only six, but projective plane codes are known to perform remarkably well, despite the higher density of their parity check matrices [7]. The question not yet answered is for what parameters j, k, and p, if any, the graphs actually achieve girth twelve. Providing a general answer to that question appears to involve detailed investigation of numbertheoretic properties. For short codes, simple counting bounds can be used to prove that the girth must be less than twelve. Evidence that the multiplicative group automorphisms gives a large number of good graphs is provided in the next section. VII. Table of R, p, g G, and d G values for j=3, k=5 In this table we present a sequence of codes with design rate 2/5. In each instance the prime p is chosen so that (p-1) is divisible by both 3 and 5. The Magma computational algebra software package [8] was used to generate the graph according to our algebraic prescription, find their girths and diameters, and convert them to codes. Length N; N=5p Prime p Rate R Girth g G Diam. d G NA NA Table 1: Graph and code parameters This sequence of graphs for (3,5) regular LDPC codes illustrates nicely the behavior of girth and diameter as the size of the prime p increases. First, for many the diameter is three-fourths the girth, greater than the ideal lower limit of one half. As the prime increases, the girths do attain the maximum of twelve. Thereafter the diameter of the graph increases with no increase in girth. The increase in diameter is not monotonic, depending on the subtle qualities of the primes. The graph quality heuristic of diameter compared to girth points to the 905 code as being stronger than the 305 code. The N=755, p=151 code exhibits interesting atypical behavior in a several respects. First, the code equations are redundant; the code rate is ten percent higher than the design rate. For this quasi-cyclic parity check matrix, there exists a i, i 0,that does not have full rank. Second, the diameter of the graph has increased from the next smaller graph, with no increase girth. Third, a quick test using Magma identified a code word of weight 14, and a graph tree argument gives a lower bound of 10 for the minimum distance. Thus the code s minimum distance is poor by comparison with the minimum distance of the
5 shorter [155,64,20] code. With the exception of this one case, girth and diameter measures of these (3,5) codes augur well for sumproduct codes for lengths of at least The computation of girth and diameter for the 11,555 code was too slow on our machine. VIII. Simulations Results Figure 2 gives simulation results for six of the codes from Table 1, assuming a BPSKmodulated additive white gaussian noise channel [8] and for comparable randomly generated regular (3,5) LDPC codes. In our tests, the new codes perform as well as (or slightly better than) the randomly generated codes. For the code with blocklength 11,555, the performance of the new code is inferior to that of the best randomly generated code. To obtain a BER of 10-5, the new code requires E b /N db, while there exists a randomly generated regular code requiring only E b /N db. IX. Conclusion These quasi-cyclic group-structured regular LDPC codes have graphs that are highly symmetric and have a relatively simple algebraic description. When the length of the basic cycle p is sufficiently large, the graphs appear to have a relatively large girth for the graph size and vertex degrees, attaining the maximum girth of twelve for many of the (3,5) codes tested. Preliminary simulation studies show that the graph quality is manifest in excellent perfor-mance of the sum-product decoder. The new codes tested perform as well or better than randomly generated (3,5) LDPC codes for lengths of 1055 or less. The group-structure should be advantageous for implementation compared to randomly generated LDPC codes. Figure 2 Simulation Curves References [1] R. G. Gallager, Low Density Parity Check Codes, MIT Press, Cambridge, MA,1963. [2] D. J. C. MacKay, ``Good error correcting codes based on very sparse matrices," IEEE Trans. on Information Theory, vol. 45, no. 2, March 1999, pp [3] N. Wiberg, Codes and Decoding on General Graphs, Linkoeping Studies in Science and Technology, No. 440, [4] T. Richardson, A. Shokrollahi, and R. Urbanke, ``Design of capacity-approaching irregular low-density parity check codes," IEEE Trans. on Information Theory, vol. IT- 47, no. 2, Feb. 2001, pp [5] A.E. Brouwer and T. Verhoeff, An updated table of minimum-distance bounds for binary linear codes, IEEE Trans. on Information Theory, vol. IT-39, no. 2, Mar. 1993, pp [6] R. M. Tanner, A Transform Theory for a Class of Group-Invariant Codes, IEEE Trans. on Information Theory, vol. 34, no. 4, pp , July [7] Y. Kuo, S. Lin, and M. Fossorier, ``Low Density Parity Check Codes Based on Finite Geometries: A Rediscovery and More," submitted to IEEE Trans. on Information Theory, [8] The Magma Computational Algebra System, University of Sydney, Australia ( [9] D. Sridhara, T. Fuja, and R. M. Tanner, Low Density Parity Check Codes from Permutation Matrices, 2001 Conf. on Info. Sci. & Systems, Johns Hopkins University, March, 2001.
LOW-DENSITY PARITY-CHECK (LDPC) codes [1] can
208 IEEE TRANSACTIONS ON MAGNETICS, VOL 42, NO 2, FEBRUARY 2006 Structured LDPC Codes for High-Density Recording: Large Girth and Low Error Floor J Lu and J M F Moura Department of Electrical and Computer
More informationLOW-density parity-check (LDPC) codes have attracted
2966 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 12, DECEMBER 2004 LDPC Block and Convolutional Codes Based on Circulant Matrices R. Michael Tanner, Fellow, IEEE, Deepak Sridhara, Arvind Sridharan,
More informationTHE DESIGN OF STRUCTURED REGULAR LDPC CODES WITH LARGE GIRTH. Haotian Zhang and José M. F. Moura
THE DESIGN OF STRUCTURED REGULAR LDPC CODES WITH LARGE GIRTH Haotian Zhang and José M. F. Moura Department of Electrical and Computer Engineering Carnegie Mellon University, Pittsburgh, PA 523 {haotian,
More informationNew Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 1
New Message-Passing Decoding Algorithm of LDPC Codes by Partitioning Check Nodes 1 Sunghwan Kim* O, Min-Ho Jang*, Jong-Seon No*, Song-Nam Hong, and Dong-Joon Shin *School of Electrical Engineering and
More informationLOW-density parity-check (LDPC) codes are widely
1460 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 53, NO 4, APRIL 2007 Tree-Based Construction of LDPC Codes Having Good Pseudocodeword Weights Christine A Kelley, Member, IEEE, Deepak Sridhara, Member,
More informationPerformance Analysis of Gray Code based Structured Regular Column-Weight Two LDPC Codes
IOSR Journal of Electronics and Communication Engineering (IOSR-JECE) e-issn: 2278-2834,p- ISSN: 2278-8735.Volume 11, Issue 4, Ver. III (Jul.-Aug.2016), PP 06-10 www.iosrjournals.org Performance Analysis
More informationFPGA Implementation of Binary Quasi Cyclic LDPC Code with Rate 2/5
FPGA Implementation of Binary Quasi Cyclic LDPC Code with Rate 2/5 Arulmozhi M. 1, Nandini G. Iyer 2, Anitha M. 3 Assistant Professor, Department of EEE, Rajalakshmi Engineering College, Chennai, India
More informationError Floors of LDPC Codes
Error Floors of LDPC Codes Tom Richardson Flarion Technologies Bedminster, NJ 07921 tjr@flarion.com Abstract We introduce a computational technique that accurately predicts performance for a given LDPC
More informationOverlapped Scheduling for Folded LDPC Decoding Based on Matrix Permutation
Overlapped Scheduling for Folded LDPC Decoding Based on Matrix Permutation In-Cheol Park and Se-Hyeon Kang Department of Electrical Engineering and Computer Science, KAIST {icpark, shkang}@ics.kaist.ac.kr
More informationCheck-hybrid GLDPC Codes Without Small Trapping Sets
Check-hybrid GLDPC Codes Without Small Trapping Sets Vida Ravanmehr Department of Electrical and Computer Engineering University of Arizona Tucson, AZ, 8572 Email: vravanmehr@ece.arizona.edu David Declercq
More informationOptimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes
Optimal Overlapped Message Passing Decoding of Quasi-Cyclic LDPC Codes Yongmei Dai and Zhiyuan Yan Department of Electrical and Computer Engineering Lehigh University, PA 18015, USA E-mails: {yod304, yan}@lehigh.edu
More informationA REVIEW OF CONSTRUCTION METHODS FOR REGULAR LDPC CODES
A REVIEW OF CONSTRUCTION METHODS FOR REGULAR LDPC CODES Rutuja Shedsale Department of Electrical Engineering, Veermata Jijabai Technological Institute (V.J.T.I.)Mumbai, India. E-mail: rutuja_shedsale@yahoo.co.in
More informationOn the construction of Tanner graphs
On the construction of Tanner graphs Jesús Martínez Mateo Universidad Politécnica de Madrid Outline Introduction Low-density parity-check (LDPC) codes LDPC decoding Belief propagation based algorithms
More informationITERATIVE COLLISION RESOLUTION IN WIRELESS NETWORKS
ITERATIVE COLLISION RESOLUTION IN WIRELESS NETWORKS An Undergraduate Research Scholars Thesis by KATHERINE CHRISTINE STUCKMAN Submitted to Honors and Undergraduate Research Texas A&M University in partial
More informationRandomized Progressive Edge-Growth (RandPEG)
Randomized Progressive Edge-Growth (Rand) Auguste Venkiah, David Declercq, Charly Poulliat ETIS, CNRS, ENSEA, Univ Cergy-Pontoise F-95000 Cergy-Pontoise email:{venkiah,declercq,poulliat}@ensea.fr Abstract
More informationON THE STRONGLY REGULAR GRAPH OF PARAMETERS
ON THE STRONGLY REGULAR GRAPH OF PARAMETERS (99, 14, 1, 2) SUZY LOU AND MAX MURIN Abstract. In an attempt to find a strongly regular graph of parameters (99, 14, 1, 2) or to disprove its existence, we
More informationISSN (Print) Research Article. *Corresponding author Akilambigai P
Scholars Journal of Engineering and Technology (SJET) Sch. J. Eng. Tech., 2016; 4(5):223-227 Scholars Academic and Scientific Publisher (An International Publisher for Academic and Scientific Resources)
More informationITERATIVE decoders have gained widespread attention
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 53, NO. 11, NOVEMBER 2007 4013 Pseudocodewords of Tanner Graphs Christine A. Kelley, Member, IEEE, and Deepak Sridhara, Member, IEEE Abstract This paper presents
More informationThe Hoffman-Singleton Graph and its Automorphisms
Journal of Algebraic Combinatorics, 8, 7, 00 c 00 Kluwer Academic Publishers. Manufactured in The Netherlands. The Hoffman-Singleton Graph and its Automorphisms PAUL R. HAFNER Department of Mathematics,
More informationLowering the Error Floors of Irregular High-Rate LDPC Codes by Graph Conditioning
Lowering the Error Floors of Irregular High- LDPC Codes by Graph Conditioning Wen-Yen Weng, Aditya Ramamoorthy and Richard D. Wesel Electrical Engineering Department, UCLA, Los Angeles, CA, 90095-594.
More informationThe Performance of LDPC codes with Large Girth
This work was supported, in part, by grants from the National Science Foundation numbered CAREER-0093166, ANR-013911, CHE-031368, and CHE 016563, the San Diego Supercomputer Center, and by Hewlett-Packard.
More informationFinding Small Stopping Sets in the Tanner Graphs of LDPC Codes
Finding Small Stopping Sets in the Tanner Graphs of LDPC Codes Gerd Richter University of Ulm, Department of TAIT Albert-Einstein-Allee 43, D-89081 Ulm, Germany gerd.richter@uni-ulm.de Abstract The performance
More informationDesign of Cages with a Randomized Progressive Edge-Growth Algorithm
1 Design of Cages with a Randomized Progressive Edge-Growth Algorithm Auguste Venkiah, David Declercq and Charly Poulliat ETIS - CNRS UMR 8051 - ENSEA - University of Cergy-Pontoise Abstract The progressive
More informationComplexity-Optimized Low-Density Parity-Check Codes
Complexity-Optimized Low-Density Parity-Check Codes Masoud Ardakani Department of Electrical & Computer Engineering University of Alberta, ardakani@ece.ualberta.ca Benjamin Smith, Wei Yu, Frank R. Kschischang
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 11 Coding Strategies and Introduction to Huffman Coding The Fundamental
More informationQuasi-Cyclic Low-Density Parity-Check (QC-LDPC) Codes for Deep Space and High Data Rate Applications
Quasi-Cyclic Low-Density Parity-Check (QC-LDPC) Codes for Deep Space and High Data Rate Applications Nikoleta Andreadou, Fotini-Niovi Pavlidou Dept. of Electrical & Computer Engineering Aristotle University
More informationCOMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES
COMPARISON OF SIMPLIFIED GRADIENT DESCENT ALGORITHMS FOR DECODING LDPC CODES Boorle Ashok Kumar 1, G Y. Padma Sree 2 1 PG Scholar, Al-Ameer College Of Engineering & Information Technology, Anandapuram,
More informationDesign of Cages with a Randomized Progressive Edge-Growth Algorithm
1 Design of Cages with a Randomized Progressive Edge-Growth Algorithm Auguste Venkiah, David Declercq and Charly Poulliat ETIS - CNRS UMR 8051 - ENSEA - University of Cergy-Pontoise Abstract The Progressive
More informationAdaptive Linear Programming Decoding of Polar Codes
Adaptive Linear Programming Decoding of Polar Codes Veeresh Taranalli and Paul H. Siegel University of California, San Diego, La Jolla, CA 92093, USA Email: {vtaranalli, psiegel}@ucsd.edu Abstract Polar
More informationAnalyzing the Peeling Decoder
Analyzing the Peeling Decoder Supplemental Material for Advanced Channel Coding Henry D. Pfister January 5th, 01 1 Introduction The simplest example of iterative decoding is the peeling decoder introduced
More informationGirth of the Tanner Graph and Error Correction Capability of LDPC Codes
1 Girth of the Tanner Graph and Error Correction Capability of LDPC Codes Shashi Kiran Chilappagari, Student Member, IEEE, Dung Viet Nguyen, Student Member, IEEE, Bane Vasic, Senior Member, IEEE, and Michael
More informationarxiv:cs/ v1 [cs.it] 8 Feb 2007
Permutation Decoding and the Stopping Redundancy Hierarchy of Linear Block Codes Thorsten Hehn, Olgica Milenkovic, Stefan Laendner, Johannes B. Huber Institute for Information Transmission, University
More informationLDPC Codes a brief Tutorial
LDPC Codes a brief Tutorial Bernhard M.J. Leiner, Stud.ID.: 53418L bleiner@gmail.com April 8, 2005 1 Introduction Low-density parity-check (LDPC) codes are a class of linear block LDPC codes. The name
More information< Irregular Repeat-Accumulate LDPC Code Proposal Technology Overview
Project IEEE 802.20 Working Group on Mobile Broadband Wireless Access Title Irregular Repeat-Accumulate LDPC Code Proposal Technology Overview Date Submitted Source(s):
More informationMultiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku
Multiple Constraint Satisfaction by Belief Propagation: An Example Using Sudoku Todd K. Moon and Jacob H. Gunther Utah State University Abstract The popular Sudoku puzzle bears structural resemblance to
More informationFormally Self-Dual Codes Related to Type II Codes
Formally Self-Dual Codes Related to Type II Codes Koichi Betsumiya Graduate School of Mathematics Nagoya University Nagoya 464 8602, Japan and Masaaki Harada Department of Mathematical Sciences Yamagata
More informationQuantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes
Quantized Iterative Message Passing Decoders with Low Error Floor for LDPC Codes Xiaojie Zhang and Paul H. Siegel University of California, San Diego 1. Introduction Low-density parity-check (LDPC) codes
More informationOn combining chase-2 and sum-product algorithms for LDPC codes
University of Wollongong Research Online Faculty of Engineering and Information Sciences - Papers: Part A Faculty of Engineering and Information Sciences 2012 On combining chase-2 and sum-product algorithms
More informationError correction guarantees
Error correction guarantees Drawback of asymptotic analyses Valid only as long as the incoming messages are independent. (independence assumption) The messages are independent for l iterations only if
More informationCode Design in the Short Block Length Regime
October 8, 2014 Code Design in the Short Block Length Regime Gianluigi Liva, gianluigi.liva@dlr.de Institute for Communications and Navigation German Aerospace Center, DLR Outline 1 Introduction 2 Overview:
More informationThe Encoding Complexity of Network Coding
The Encoding Complexity of Network Coding Michael Langberg Alexander Sprintson Jehoshua Bruck California Institute of Technology Email: mikel,spalex,bruck @caltech.edu Abstract In the multicast network
More informationMT5821 Advanced Combinatorics
MT5821 Advanced Combinatorics 4 Graph colouring and symmetry There are two colourings of a 4-cycle with two colours (red and blue): one pair of opposite vertices should be red, the other pair blue. There
More informationCHAPTER 1 INTRODUCTION
1 CHAPTER 1 INTRODUCTION 1.1 Advance Encryption Standard (AES) Rijndael algorithm is symmetric block cipher that can process data blocks of 128 bits, using cipher keys with lengths of 128, 192, and 256
More informationMirrors of reflections of regular maps
ISSN 1855-3966 (printed edn), ISSN 1855-3974 (electronic edn) ARS MATHEMATICA CONTEMPORANEA 15 (018) 347 354 https://doiorg/106493/1855-3974145911d (Also available at http://amc-journaleu) Mirrors of reflections
More information2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006
2386 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 52, NO. 6, JUNE 2006 The Encoding Complexity of Network Coding Michael Langberg, Member, IEEE, Alexander Sprintson, Member, IEEE, and Jehoshua Bruck,
More informationAlgebraic Graph Theory- Adjacency Matrix and Spectrum
Algebraic Graph Theory- Adjacency Matrix and Spectrum Michael Levet December 24, 2013 Introduction This tutorial will introduce the adjacency matrix, as well as spectral graph theory. For those familiar
More informationOptimized Min-Sum Decoding Algorithm for Low Density PC Codes
Optimized Min-Sum Decoding Algorithm for Low Density PC Codes Dewan Siam Shafiullah, Mohammad Rakibul Islam, Mohammad Mostafa Amir Faisal, Imran Rahman, Dept. of Electrical and Electronic Engineering,
More informationTURBO codes, [1], [2], have attracted much interest due
800 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 47, NO. 2, FEBRUARY 2001 Zigzag Codes and Concatenated Zigzag Codes Li Ping, Member, IEEE, Xiaoling Huang, and Nam Phamdo, Senior Member, IEEE Abstract
More informationA GRAPHICAL MODEL AND SEARCH ALGORITHM BASED QUASI-CYCLIC LOW-DENSITY PARITY-CHECK CODES SCHEME. Received December 2011; revised July 2012
International Journal of Innovative Computing, Information and Control ICIC International c 2013 ISSN 1349-4198 Volume 9, Number 4, April 2013 pp. 1617 1625 A GRAPHICAL MODEL AND SEARCH ALGORITHM BASED
More informationIs there a McLaughlin geometry?
Is there a McLaughlin geometry? Leonard H. Soicher School of Mathematical Sciences Queen Mary, University of London Mile End Road, London E1 4NS, UK email: L.H.Soicher@qmul.ac.uk February 9, 2006 Dedicated
More informationInterlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes
Interlaced Column-Row Message-Passing Schedule for Decoding LDPC Codes Saleh Usman, Mohammad M. Mansour, Ali Chehab Department of Electrical and Computer Engineering American University of Beirut Beirut
More informationOn the Performance Evaluation of Quasi-Cyclic LDPC Codes with Arbitrary Puncturing
On the Performance Evaluation of Quasi-Cyclic LDPC Codes with Arbitrary Puncturing Ying Xu, and Yueun Wei Department of Wireless Research Huawei Technologies Co., Ltd, Shanghai, 6, China Email: {eaglexu,
More informationGuessing Facets: Polytope Structure and Improved LP Decoder
Appeared in: International Symposium on Information Theory Seattle, WA; July 2006 Guessing Facets: Polytope Structure and Improved LP Decoder Alexandros G. Dimakis 1 and Martin J. Wainwright 1,2 1 Department
More informationA New Non-Iterative Decoding Algorithm for the Erasure Channel : Comparisons with Enhanced Iterative Methods
SUBMITTED TO ISIT 2005 ON 31 JANUARY 2005 1 arxiv:cs/0503006v1 [cs.it] 2 Mar 2005 A New Non-Iterative Decoding Algorithm for the Erasure Channel : Comparisons with Enhanced Iterative Methods J. Cai, C.
More informationMultidimensional Decoding Networks for Trapping Set Analysis
Multidimensional Decoding Networks for Trapping Set Analysis Allison Beemer* and Christine A. Kelley University of Nebraska-Lincoln, Lincoln, NE, U.S.A. allison.beemer@huskers.unl.edu Abstract. We present
More informationThe Simplex Algorithm
The Simplex Algorithm Uri Feige November 2011 1 The simplex algorithm The simplex algorithm was designed by Danzig in 1947. This write-up presents the main ideas involved. It is a slight update (mostly
More informationGraphBLAS Mathematics - Provisional Release 1.0 -
GraphBLAS Mathematics - Provisional Release 1.0 - Jeremy Kepner Generated on April 26, 2017 Contents 1 Introduction: Graphs as Matrices........................... 1 1.1 Adjacency Matrix: Undirected Graphs,
More informationMatrices. Chapter Matrix A Mathematical Definition Matrix Dimensions and Notation
Chapter 7 Introduction to Matrices This chapter introduces the theory and application of matrices. It is divided into two main sections. Section 7.1 discusses some of the basic properties and operations
More informationREGULAR GRAPHS OF GIVEN GIRTH. Contents
REGULAR GRAPHS OF GIVEN GIRTH BROOKE ULLERY Contents 1. Introduction This paper gives an introduction to the area of graph theory dealing with properties of regular graphs of given girth. A large portion
More informationDiscrete Mathematics Lecture 4. Harper Langston New York University
Discrete Mathematics Lecture 4 Harper Langston New York University Sequences Sequence is a set of (usually infinite number of) ordered elements: a 1, a 2,, a n, Each individual element a k is called a
More informationC LDPC Coding Proposal for LBC. This contribution provides an LDPC coding proposal for LBC
C3-27315-3 Title: Abstract: Source: Contact: LDPC Coding Proposal for LBC This contribution provides an LDPC coding proposal for LBC Alcatel-Lucent, Huawei, LG Electronics, QUALCOMM Incorporated, RITT,
More informationPerformance of the Sum-Product Decoding Algorithm on Factor Graphs With Short Cycles
Performance of the Sum-Product Decoding Algorithm on Factor Graphs With Short Cycles Kevin Jacobson Abstract Originally invented by R. G. Gallager in 962, lowdensity parity-check (LDPC) codes have reemerged
More informationDefinition. Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class.
Resolvable BIBDs Definition Given a (v,k,λ)- BIBD, (X,B), a set of disjoint blocks of B which partition X is called a parallel class. A partition of B into parallel classes (there must be r of them) is
More informationOptimized Graph-Based Codes For Modern Flash Memories
Optimized Graph-Based Codes For Modern Flash Memories Homa Esfahanizadeh Joint work with Ahmed Hareedy and Lara Dolecek LORIS Lab Electrical Engineering Department, UCLA 10/08/2016 Presentation Outline
More informationGeometric Mean Algorithms Based on Harmonic and Arithmetic Iterations
Geometric Mean Algorithms Based on Harmonic and Arithmetic Iterations Ben Jeuris and Raf Vandebril KU Leuven, Dept. of Computer Science, 3001 Leuven(Heverlee), Belgium {ben.jeuris,raf.vandebril}@cs.kuleuven.be
More information2280 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012
2280 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 58, NO 4, APRIL 2012 On the Construction of Structured LDPC Codes Free of Small Trapping Sets Dung Viet Nguyen, Student Member, IEEE, Shashi Kiran Chilappagari,
More informationChapter 18 out of 37 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal.
Chapter 8 out of 7 from Discrete Mathematics for Neophytes: Number Theory, Probability, Algorithms, and Other Stuff by J. M. Cargal 8 Matrices Definitions and Basic Operations Matrix algebra is also known
More informationDesign and Implementation of Low Density Parity Check Codes
IOSR Journal of Engineering (IOSRJEN) ISSN (e): 2250-3021, ISSN (p): 2278-8719 Vol. 04, Issue 09 (September. 2014), V2 PP 21-25 www.iosrjen.org Design and Implementation of Low Density Parity Check Codes
More informationTwo-graphs revisited. Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014
Two-graphs revisited Peter J. Cameron University of St Andrews Modern Trends in Algebraic Graph Theory Villanova, June 2014 History The icosahedron has six diagonals, any two making the same angle (arccos(1/
More informationTrapping Set Ontology
Trapping Set Ontology Bane Vasić, Shashi Kiran Chilappagari, Dung Viet Nguyen and Shiva Kumar Planjery Department of Electrical and Computer Engineering University of Arizona Tucson, AZ 85721, USA Email:
More informationError Control Coding for MLC Flash Memories
Error Control Coding for MLC Flash Memories Ying Y. Tai, Ph.D. Cadence Design Systems, Inc. ytai@cadence.com August 19, 2010 Santa Clara, CA 1 Outline The Challenges on Error Control Coding (ECC) for MLC
More informationVERTEX MAPS FOR TREES: ALGEBRA AND PERIODS OF PERIODIC ORBITS. Chris Bernhardt
VERTEX MAPS FOR TREES: ALGEBRA AND PERIODS OF PERIODIC ORBITS CHRIS BERNHARDT Abstract. Let T be a tree with n vertices. Let f : T T be continuous and suppose that the n vertices form a periodic orbit
More informationUse of the LDPC codes Over the Binary Erasure Multiple Access Channel
Use of the LDPC codes Over the Binary Erasure Multiple Access Channel Sareh Majidi Ivari A Thesis In the Department of Electrical and Computer Engineering Presented in Partial Fulfillment of the Requirements
More informationUnit 7 Number System and Bases. 7.1 Number System. 7.2 Binary Numbers. 7.3 Adding and Subtracting Binary Numbers. 7.4 Multiplying Binary Numbers
Contents STRAND B: Number Theory Unit 7 Number System and Bases Student Text Contents Section 7. Number System 7.2 Binary Numbers 7.3 Adding and Subtracting Binary Numbers 7.4 Multiplying Binary Numbers
More informationPortraits of Groups on Bordered Surfaces
Bridges Finland Conference Proceedings Portraits of Groups on Bordered Surfaces Jay Zimmerman Mathematics Department Towson University 8000 York Road Towson, MD 21252, USA E-mail: jzimmerman@towson.edu
More informationPerformance comparison of Decoding Algorithm for LDPC codes in DVBS2
Performance comparison of Decoding Algorithm for LDPC codes in DVBS2 Ronakben P Patel 1, Prof. Pooja Thakar 2 1M.TEC student, Dept. of EC, SALTIER, Ahmedabad-380060, Gujarat, India 2 Assistant Professor,
More informationConstrained Types and their Expressiveness
Constrained Types and their Expressiveness JENS PALSBERG Massachusetts Institute of Technology and SCOTT SMITH Johns Hopkins University A constrained type consists of both a standard type and a constraint
More informationDESIGN OF FAULT SECURE ENCODER FOR MEMORY APPLICATIONS IN SOC TECHNOLOGY
DESIGN OF FAULT SECURE ENCODER FOR MEMORY APPLICATIONS IN SOC TECHNOLOGY K.Maheshwari M.Tech VLSI, Aurora scientific technological and research academy, Bandlaguda, Hyderabad. k.sandeep kumar Asst.prof,
More informationFountain Codes Based on Zigzag Decodable Coding
Fountain Codes Based on Zigzag Decodable Coding Takayuki Nozaki Kanagawa University, JAPAN Email: nozaki@kanagawa-u.ac.jp Abstract Fountain codes based on non-binary low-density parity-check (LDPC) codes
More informationBase size and separation number
Base size and separation number Peter J. Cameron CSG notes, April 2005 Brief history The concept of a base for a permutation group was introduced by Sims in the 1960s in connection with computational group
More informationPACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS
PACKING DIGRAPHS WITH DIRECTED CLOSED TRAILS PAUL BALISTER Abstract It has been shown [Balister, 2001] that if n is odd and m 1,, m t are integers with m i 3 and t i=1 m i = E(K n) then K n can be decomposed
More informationCapacity-Approaching Low-Density Parity- Check Codes: Recent Developments and Applications
Capacity-Approaching Low-Density Parity- Check Codes: Recent Developments and Applications Shu Lin Department of Electrical and Computer Engineering University of California, Davis Davis, CA 95616, U.S.A.
More informationPOLYHEDRAL GEOMETRY. Convex functions and sets. Mathematical Programming Niels Lauritzen Recall that a subset C R n is convex if
POLYHEDRAL GEOMETRY Mathematical Programming Niels Lauritzen 7.9.2007 Convex functions and sets Recall that a subset C R n is convex if {λx + (1 λ)y 0 λ 1} C for every x, y C and 0 λ 1. A function f :
More informationInteger Programming Theory
Integer Programming Theory Laura Galli October 24, 2016 In the following we assume all functions are linear, hence we often drop the term linear. In discrete optimization, we seek to find a solution x
More informationResearch Article Improved Design of Unequal Error Protection LDPC Codes
Hindawi Publishing Corporation EURASIP Journal on Wireless Communications and Networking Volume 2010, Article ID 423989, 8 pages doi:10.1155/2010/423989 Research Article Improved Design of Unequal Error
More informationCyclic and Quasi-Cyclic LDPC Codes: New Developments
1 Cyclic and Quasi-Cyclic LDPC Codes: New Developments Qin Huang, Qiuju Diao, Shu Lin and Khaled Abdel-Ghaffar Email: {qinhuang,qdiao, shulin, ghaffar}@ucdavisedu Department of Electrical and Computer
More informationA Hybrid Recursive Multi-Way Number Partitioning Algorithm
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence A Hybrid Recursive Multi-Way Number Partitioning Algorithm Richard E. Korf Computer Science Department University
More informationThe Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007
The Gewirtz Graph Morgan J. Rodgers Design Theory Fall 2007 The Gewirtz Graph is the unique strongly regular graph having parameters (56, 10, 0, 2). We will call this graph Γ. This graph was actually discovered
More informationModern Communications Chapter 5. Low-Density Parity-Check Codes
1/14 Modern Communications Chapter 5. Low-Density Parity-Check Codes Husheng Li Min Kao Department of Electrical Engineering and Computer Science University of Tennessee, Knoxville Spring, 2017 2/14 History
More informationPoint groups in solid state physics I: point group O h
American Journal of Modern Physics 2013; 2(2): 81-87 Published online March 10, 2013 (http://www.sciencepublishinggroup.com/j/ajmp) doi: 10.11648/j.ajmp.20130202.19 Point groups in solid state physics
More informationMaximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube
Maximal Monochromatic Geodesics in an Antipodal Coloring of Hypercube Kavish Gandhi April 4, 2015 Abstract A geodesic in the hypercube is the shortest possible path between two vertices. Leader and Long
More informationA TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3
A TESSELLATION FOR ALGEBRAIC SURFACES IN CP 3 ANDREW J. HANSON AND JI-PING SHA In this paper we present a systematic and explicit algorithm for tessellating the algebraic surfaces (real 4-manifolds) F
More informationError-Correcting Codes
Error-Correcting Codes Michael Mo 10770518 6 February 2016 Abstract An introduction to error-correcting codes will be given by discussing a class of error-correcting codes, called linear block codes. The
More informationON SWELL COLORED COMPLETE GRAPHS
Acta Math. Univ. Comenianae Vol. LXIII, (1994), pp. 303 308 303 ON SWELL COLORED COMPLETE GRAPHS C. WARD and S. SZABÓ Abstract. An edge-colored graph is said to be swell-colored if each triangle contains
More informationEDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m
EDGE-COLOURED GRAPHS AND SWITCHING WITH S m, A m AND D m GARY MACGILLIVRAY BEN TREMBLAY Abstract. We consider homomorphisms and vertex colourings of m-edge-coloured graphs that have a switching operation
More informationarxiv: v4 [math.gr] 16 Apr 2015
On Jones subgroup of R. Thompson group F arxiv:1501.0074v4 [math.gr] 16 Apr 015 Gili Golan, Mark Sapir April 17, 015 Abstract Recently Vaughan Jones showed that the R. Thompson group F encodes in a natural
More informationOn the maximum rank of completions of entry pattern matrices
Linear Algebra and its Applications 525 (2017) 1 19 Contents lists available at ScienceDirect Linear Algebra and its Applications wwwelseviercom/locate/laa On the maximum rank of completions of entry pattern
More informationSearch for Improvements in Low Density Parity Check Codes for WiMAX (802.16e) Applications
POLITECNICO DI TORINO III Facoltà di Ingegneria Ingegneria delle Telecomunicazioni Search for Improvements in Low Density Parity Check Codes for WiMAX (802.6e) Applications Author: Carlos Dirube García
More informationA Connection between Network Coding and. Convolutional Codes
A Connection between Network Coding and 1 Convolutional Codes Christina Fragouli, Emina Soljanin christina.fragouli@epfl.ch, emina@lucent.com Abstract The min-cut, max-flow theorem states that a source
More informationNovel Low-Density Signature Structure for Synchronous DS-CDMA Systems
Novel Low-Density Signature Structure for Synchronous DS-CDMA Systems Reza Hoshyar Email: R.Hoshyar@surrey.ac.uk Ferry P. Wathan Email: F.Wathan@surrey.ac.uk Rahim Tafazolli Email: R.Tafazolli@surrey.ac.uk
More information