design of capacity approaching irregular low density parity check codes we design low density parity check ldpc codes that perform at rates extremely close to the shannon capacity the codes are built from highly irregular bipartite graphs with carefully chosen degree patterns on both sides our theoretical analysis of the codes is based on the work of richardson and urbanke see ibid vol 47 no 2 p 599 618 2000 assuming that the underlying communication channel is symmetric we prove that the probability densities at the message nodes of the graph possess a certain symmetry using this symmetry property we then show that under the assumption of no cycles the message densities always converge as the number of iterations tends to infinity furthermore we prove a stability condition which implies an upper bound on the fraction of errors that a belief propagation decoder can correct when applied to a code induced from a bipartite graph with a given degree distribution our codes are found by optimizing the degree structure of the underlying graphs we develop several strategies to perform this optimization we also present some simulation results for the codes found which show that the performance of the codes is very close to the asymptotic theoretical bounds

adaptive unstructured volume remeshing ii application to two and three dimensional level set simulations of multiphase flow in part i adaptive unstructured volume remeshing i the method j comput phys in press we presented an adaptive remeshing algorithm that automatically adjusts the size of the elements of meshes of unstructured triangles 2d and unstructured tetrahedra 3d with time and position in the computational domain in order to efficiently resolve the relevant physical scales here we illustrate the performance of an implementation of the algorithm in finite element level set simulations of deformable droplet and fluid fluid interface interactions breakup and coalescence in multiphase flows the wide range of length scales characterizing the dynamics are accurately resolved as demonstrated by comparison to experiments and to theoretical and sharp interface boundary integral numerical results the computational cost is found to be competitive even with respect to boundary integral methods for the first time using an interface capturing level set method we successfully simulate the inertia driven impact and rebound of a liquid droplet from a liquid interface and find agreement with recent experimental results

an efficient algorithm to find all small size stopping sets of low density parity check matrices in this work we introduce an efficient algorithm to find all stopping sets of size less than some threshold of a fixed low density parity check ldpc matrix the solution is inspired by the algorithm proposed by rosnes and ytrehus in 2005 to find an exhaustive list of all small size turbo stopping sets in a turbo code the efficiency of the proposed algorithm is demonstrated by several numerical examples for instance we have applied the algorithm to the well known 3 5 regular 155 64 tanner code and found all stopping sets of size at most 18 in about 1 min on a standard desktop computer also we have verified that the minimum stopping set size of the 4896 2474 ramanujan margulis code is indeed 24 and that the corresponding multiplicity is exactly 204 furthermore we have applied the algorithm to the ieee 802 16e ldpc codes and determined the minimum stopping set size and the corresponding multiplicity exactly for these codes finally as an application we present a greedy algorithm to find a small number of redundant parity checks to add to the original parity check matrix in order to remove all stopping sets in the corresponding tanner graph of size less than the minimum distance an extensive case study of the 155 64 tanner code illustrates the usefulness of the algorithm and we present a 110 times 155 redundant parity check matrix for this code with no stopping sets of size less than the minimum distance simulation results of iterative decoding on the binary erasure channel show performance improvements for low to medium erasure probabilities when this redundant parity check matrix is used for decoding

algebraic construction of sparse matrices with large girth in this correspondence we present a method for constructing sparse matrices that have a compact description and whose associated bipartite graphs have large girth based on an arbitrary seed matrix of nonnegative integers a new matrix is constructed which replaces each entry of the seed matrix with a sum of permutation matrices algebraic conditions that lead to short cycles in the associated bipartite graph are analyzed and methods to achieve large girth in two special cases are presented in one all the permutation matrices are circulants in the other they are all affine permutation matrices when used to define a low density parity check ldpc code the compact description should lead to efficient implementation and the large girth to good error correction performance the method is adaptable to a variety of rates and a variety of row and column degrees

ldpc codes over the bec bounds and decoding algorithms the performance of maximum likelihood ml decoding on the binary erasure channel for finite length low density parity check ldpc codes from two random ensembles is studied a tightened union type upper bound on the ml decoding error probability based on the precise coefficients of the average weight spectrum is presented for ldpc codes from the gallager ensemble and the richardson urbanke ensemble new upper bounds on the ml decoding performance based on computing the rank of submatrices of the code parity check matrix are derived a new lower bound on the ml decoding threshold followed from the latter error probability bound is obtained an improved lower bound on the error probability for codes with a known estimate on the minimum distance is presented as well a new low complexity near ml decoding algorithm for quasi cyclic ldpc codes is proposed and simulated its performance is compared to the simulated belief propagation and ml decoding performance and simulated performance of the best known improved iterative decoding techniques as well as with the derived upper bounds on the ml decoding performance and with decoding thresholds obtained by the density evolution technique

the trapping redundancy of linear block codes we generalize the notion of the stopping redundancy in order to study the smallest size of a trapping set in tanner graphs of linear block codes in this context we introduce the notion of the trapping redundancy of a code which quantifies the relationship between the number of redundant rows in any parity check matrix of a given code and the size of its smallest trapping set trapping sets with certain parameter sizes are known to cause error floors in the performance curves of iterative belief propagation bp decoders and it is therefore important to identify decoding matrices that avoid such sets bounds on the trapping redundancy are obtained using probabilistic and constructive methods and the analysis covers both general and elementary trapping sets numerical values for these bounds are computed for the 2640 1320 margulis code and the class of projective geometry codes and compared with some new code specific trapping set size estimates

on the stopping redundancy of reed muller codes the stopping redundancy of the code is an important parameter which arises from analyzing the performance of a linear code under iterative decoding on a binary erasure channel in this paper we will consider the stopping redundancy of reed muller codes and related codes let r lscr m be the reed muller code of length 2m and order lscr schwartz and vardy gave a recursive construction of parity check matrices for the reed muller codes and asked whether the number of rows in those parity check matrices is the stopping redundancy of the codes we prove that the stopping redundancy of r m 2 m which is also the extended hamming code of length 2m is 2m 1 and thus show that the recursive bound is tight in this case we prove that the stopping redundancy of the simplex code equals its redundancy several constructions of codes for which the stopping redundancy equals the redundancy are discussed we prove an upper bound on the stopping redundancy of r 1 m this bound is better than the known recursive bound and thus gives a negative answer to the question of schwartz and vardy

moving mesh methods in multiple dimensions based on harmonic maps in practice there are three types of adaptive methods using the finite element approach namely the h method p method and r method in the h method the overall method contains two parts a solution algorithm and a mesh selection algorithm these two parts are independent of each other in the sense that the change of the pdes will affect the first part only however in some of the existing versions of the r method also known as the moving mesh method these two parts are strongly associated with each other and as a result any change of the pdes will result in the rewriting of the whole code in this work we will propose a moving mesh method which also contains two parts a solution algorithm and a mesh redistribution algorithm our efforts are to keep the advantages of the r method e g keep the number of nodes unchanged and of the h method e g the two parts in the code are independent a framework for adaptive meshes based on the hamilton schoen yau theory was proposed by dvinsky in this work we will extend dvinsky s method to provide an efficient solver for the mesh redistribution algorithm the key idea is to construct the harmonic map between the physical space and a parameter space by an iteration procedure each iteration step is to move the mesh closer to the harmonic map this procedure is simple and easy to program and also enables us to keep the map harmonic even after long times of numerical integration the numerical schemes are applied to a number of test problems in two dimensions it is observed that the mesh redistribution strategy based on the harmonic maps adapts the mesh extremely well to the solution without producing skew elements for multi dimensional computations

performance analysis of ldpc coded diversity combining on rayleigh fading channels with impulsive noise spatial diversity is an effective method to mitigate the effects of fading and when used in conjunction with low density parity check ldpc codes it can achieve excellent error correcting performance noise added at each branch of the diversity combiner is generally assumed to be additive white gaussian noise but there are many applications where the received signal is impaired by noise with a non gaussian distribution in this paper we derive the exact bit error probability of different linear combining techniques on rayleigh fading channels with impulsive noise which is modeled using symmetric alpha stable distributions the relationship for the signal to noise ratios of these linear combiners is derived and then different non linear detectors are presented a detector based on the bi parameter cauchy gaussian mixture model is used and shows near optimal performance with a significant reduction in complexity when compared with the optimal detector furthermore the threshold signal to noise ratio of ldpc codes for different combining techniques on these channels is derived using density evolution and an estimation of the waterfall performance of ldpc codes is derived that reduces the gap between simulated and asymptotic performance

solvability of strongly nonlinear boundary value problems for second order differential inclusions abstract in this paper we study a problem for a second order differential inclusion with dirichlet neumann and mixed boundary conditions the equation is driven by a nonlinear not necessarily homogeneous differential operator satisfying certain conditions and containing as a particular case the p laplacian operator we prove the existence of solutions both for the case in which the multivalued nonlinearity has convex values and for the case in which it has not convex values the presence of a maximal monotone operator in the equation make the results applicable to gradient systems with non smooth time invariant convex potential and differential variational inequalities

reversible low density parity check codes low density parity check ldpc codes may be decoded using a circuit implementation of the sum product algorithm which maps the factor graph of the code by reusing the decoder for encoding both tasks can be performed using the same circuit thus reducing area and verification requirements motivated by this iterative encoding techniques based upon the graphical representation of the code are proposed code design constraints which ensure encoder convergence are presented and then used to design iteratively encodable codes while also preventing 4 cycle creation we show how the jacobi method for iterative matrix inversion can be applied to finite field matrices viewed as message passing and employed as the core of an iterative encoder we present an algebraic construction of 4 cycle free iteratively encodable codes using circulant matrices analysis of these codes identifies a weakness in their structure due to a repetitive pattern in the factor graph the graph supports pseudo codewords of low pseudo weight in order to remove the repetitive pattern in the graph we propose a recursive technique for generating iteratively encodable codes the new codes offer flexibility in the choice of code length and rate and performance that compares well to randomly generated quasi cyclic and extended euclidean geometry codes

bounds for periodic solutions of vector second order nonlinear differential equations upper bounds for the amplitudes and lower bounds for the periods of periodic solutions of coupled second order nonlinear differential equations are found the results are expressed in a solution of a positive operator equation which is associated with the considered system cases are indicated for which the obtained bounds are precise and surprising behavior of the amplitude and periods of such systems under insertion of certain terms is revealed the results are illustrated by examples

turbo decoding on the binary erasure channel finite length analysis and turbo stopping sets this paper is devoted to the finite length analysis of turbo decoding over the binary erasure channel bec the performance of iterative belief propagation decoding of low density parity check ldpc codes over the bec can be characterized in terms of stopping sets we describe turbo decoding on the bec which is simpler than turbo decoding on other channels we then adapt the concept of stopping sets to turbo decoding and state an exact condition for decoding failure apply turbo decoding until the transmitted codeword has been recovered or the decoder fails to progress further then the set of erased positions that will remain when the decoder stops is equal to the unique maximum size turbo stopping set which is also a subset of the set of erased positions furthermore we present some improvements of the basic turbo decoding algorithm on the bec the proposed improved turbo decoding algorithm has substantially better error performance as illustrated by the given simulation results finally we give an expression for the turbo stopping set size enumerating function under the uniform interleaver assumption and an efficient enumeration algorithm of small size turbo stopping sets for a particular interleaver the solution is based on the algorithm proposed by garello et al in 2001 to compute an exhaustive list of all low weight codewords in a turbo code

equidistribution schemes poisson generators and adaptive grids equidistribution of a weight function over a mesh is the main concept employed in the recent development of adaptive grid schemes this idea is reviewed in this paper and several examples of grids produced using equidistribution are presented the shortcomings of this approach are identified and its usefulness is evaluated next the traditional poisson grid generators are written as nonlinear equidistribution schemes in this form the relationship between the numerical solution of a physical problem the source terms in the grid generation equations and the weight functions in equidistribution schemes are identified examples are given illustrating the case of providing a useful adaptive grid with this approach

adaptive mesh redistribution method for domains with complex boundaries an adaptive structured mesh redistribution method asmrm that permits smooth transition from non uniformly distributed boundary points to solution adaptive interior points and enables the resolution of complex flow in the complex boundary region as well as away from the boundary is proposed it is a variant of the traditional variational technique it involves a combination of static and dynamic monitor functions the former for mesh distribution in the vicinity of a complex boundary and the latter for mesh adaption with the evolving solution elsewhere its effectiveness is demonstrated on some example problems and it is then applied to a chevron nozzle the proposed method is shown to be capable of generating a mesh with a good balance of orthogonality and smoothness in the entire domain

iterative decoding of one step majority logic deductible codes based on belief propagation previously the belief propagation bp algorithm has received a lot of attention in the coding community mostly due to its near optimum decoding for low density parity check ldpc codes and its connection to turbo decoding in this paper we investigate the performance achieved by the bp algorithm for decoding one step majority logic decodable osmld codes the bp algorithm is expressed in terms of likelihood ratios rather than probabilities as conventionally presented the proposed algorithm fits better the decoding of osmld codes with respect to its numerical stability due to the fact that the weights of their check sums are often much higher than that of the corresponding ldpc codes although it has been believed that osmld codes are far inferior to ldpc codes we show that for medium code lengths say between 200 1000 bits the bp decoding of osmld codes can significantly outperform bp decoding of their equivalent ldpc codes the reasons for this behavior are elaborated

multiresolution schemes for the reactive euler equations we present multiresolution mr schemes for the efficient numerical solution of the one dimensional system of the reactive euler equations which has possibly stiff source terms the original version of the method was developed by a harten 1995 comm pure appl math 48 12 1305 for homogeneous hyperbolic conservation laws by computing the cell average mr representation of the solution we obtain much information about the solution s regularity this description of smoothness is then used to reduce the number of direct flux computations as well as the expensive high order eno essentially nonoscillatory reconstruction both of which are now performed only near discontinuities thereby the numerical solution procedure becomes considerably more efficient in the present case of the reactive euler equations the average efficiency factor measured by counting the number of actual flux computations ranges from about 5 to 12 this is on the same order of and in some cases comes reasonably close to actual speed up factors obtained by code timings which were between 3 to 5 the mr overhead rate was about 10 for the eno and 36 for tvd schemes respectively the quality of the solution is shown to be the same as that of the finest grid detailed numerical and performance results are shown for up to fourth order accuracy for source terms ranging from moderate to extremely stiff

homotopy perturbation method a new nonlinear analytical technique in this paper a new perturbation method is proposed in contrast to the traditional perturbation methods this technique does not require a small parameter in an equation in this method according to the homotopy technique a homotopy with an imbedding parameter email protected 0 1 is constructed and the imbedding parameter is considered as a small parameter so the method is called the homotopy perturbation method which can take the full advantages of the traditional perturbation methods and homotopy techniques to illustrate its effectiveness and its convenience a duffing equation with high order of nonlinearity is used the result reveals that its first order of approximation obtained by the proposed method is valid uniformly even for very large parameter and is more accurate than the perturbation solutions

resolving the shock induced combustion by an adaptive mesh redistribution method an adaptive mesh method is presented for numerical simulation of shock induced combustion the method is composed of two independent ingredients a flow solver and a mesh redistribution algorithm the flow solver is a finite volume based second order upwind tvd scheme together with a lower upper symmetric gauss seidel relaxation scheme for solving the multispecies navier stokes equations with finite rate chemistry the adaptive mesh is determined by a grid generation method based on solving poisson equations with the monitor function carefully designed to resolve both sharp fronts and the induction zone between them numerically it is found that the resolution of the induction zone is particularly critical to the combustion problems and an under resolved numerical method may cause excessive energy release and spurious runaway reactions the monitor function proposed in this paper which is based on the relative rate of change of mass fraction covered this issue satisfactorily numerical simulations of supersonic flows past an axisymmetric projectile in a premixed hydrogen oxygen or air mixture are carried out the results show that the spurious runaway chemical reactions appearing on coarse grids can be eliminated by using adaptive meshes without invoking any ad hoc treatment for reaction rates the adaptive mesh approach is more effective than the fixed mesh one in obtaining grid independent results finally discrepancies between the numerical and benchmark experimental results and difficulties in simulating the detonation waves are delineated which appeal for further investigation

stopping sets of algebraic geometry codes stopping sets and stopping set distribution of a linear code play an important role in the performance analysis of iterative decoding for this linear code let c be an n k linear code over fq with parity check matrix h where the rows of h may be dependent let n 1 2 n denote the set of column indices of h a stopping set s of c with parity check matrix h is a subset of n such that the restriction of h to s does not contain a row of weight 1 the stopping set distribution ti h i 0n enumerates the number of stopping sets with size i of c with parity check matrix h denote h the parity check matrix consisting of all the nonzero codewords in the dual code c in this paper we study stopping sets and stopping set distributions of some residue algebraic geometry ag codes with parity check matrix h first we give two descriptions of stopping sets of residue ag codes for the simplest ag codes i e the generalized reed solomon codes it is easy to determine all the stopping sets then we consider the ag codes from elliptic curves we use the group structure of rational points of elliptic curves to present a complete characterization of stopping sets then the stopping sets the stopping set distribution and the stopping distance of the ag code from an elliptic curve are reduced to the search counting and decision versions of the subset sum problem in the group of rational points of the elliptic curve respectively finally for some special cases we determine the stopping set distributions of the ag codes from elliptic curves

efficient encoding of low density parity check codes low density parity check ldpc codes can be considered serious competitors to turbo codes in terms of performance and complexity and they are based on a similar philosophy constrained random code ensembles and iterative decoding algorithms we consider the encoding problem for ldpc codes more generally we consider the encoding problem for codes specified by sparse parity check matrices we show how to exploit the sparseness of the parity check matrix to obtain efficient encoders for the 3 6 regular ldpc code for example the complexity of encoding is essentially quadratic in the block length however we show that the associated coefficient can be made quite small so that encoding codes even of length n spl sime 100000 is still quite practical more importantly we show that optimized codes actually admit linear time encoding

variational iteration method new development and applications variational iteration method has been favourably applied to various kinds of nonlinear problems the main property of the method is in its flexibility and ability to solve nonlinear equations accurately and conveniently in this paper recent trends and developments in the use of the method are reviewed major applications to nonlinear wave equation nonlinear fractional differential equations nonlinear oscillations and nonlinear problems arising in various engineering applications are surveyed the confluence of modern mathematics and symbol computation has posed a challenge to developing technologies capable of handling strongly nonlinear equations which cannot be successfully dealt with by classical methods variational iteration method is uniquely qualified to address this challenge the flexibility and adaptation provided by the method have made the method a strong candidate for approximate analytical solutions this paper outlines the basic conceptual framework of variational iteration technique with application to nonlinear problems both achievements and limitations are discussed with direct reference to approximate solutions for nonlinear equations a new iteration formulation is suggested to overcome the shortcoming a very useful formulation for determining approximately the period of a nonlinear oscillator is suggested examples are given to illustrate the solution procedure

asymptotic enumeration methods for analyzing ldpc codes we show how asymptotic estimates of powers of polynomials with nonnegative coefficients can be used in the analysis of low density parity check ldpc codes in particular we show how these estimates can be used to derive the asymptotic distance spectrum of both regular and irregular ldpc code ensembles we then consider the binary erasure channel bec using these estimates we derive lower bounds on the error exponent under iterative decoding of ldpc codes used over the bec both regular and irregular code structures are considered these bounds are compared to the corresponding bounds when optimal maximum likelihood ml decoding is applied

enumerators for protograph based ensembles of ldpc and generalized ldpc codes protograph based ldpc and generalized ldpc g ldpc codes have the advantages of a simple design procedure and highly structured encoders and decoders the design of such protograph based codes relies on what is effectively a computer based search as such following gallager it is prudent to restrict the search to a good ensemble for example an ensemble whose minimum distance grows linearly with codeword length a good ensemble can also mean one with good stopping set trapping set or pseudocodeword properties in this paper ensemble codeword weight enumerators for finite length ldpc and g ldpc codes based on protographs were derived and then the asymptotic case was considered the asymptotic results allow us to determine whether or not the typical relative minimum distance in the ensemble grows linearly with codeword length then the codeword weight enumerator technique is adapted to yield ensemble stopping set trapping set and pseudocodeword enumerators for protograph ldpc and g ldpc codes in this case the asymptotic results allow us to determine whether or not the typical relative smallest stopping set size trapping set size and pseudoweight grows linearly with codeword length trapping set enumerators for g ldpc code ensembles represent a more complex problem which we do not consider here

adaptive mesh methods for one and two dimensional hyperbolic conservation laws we develop efficient moving mesh algorithms for one and two dimensional hyperbolic systems of conservation laws the algorithms are formed by two independent parts pde evolution and mesh redistribution the first part can be any appropriate high resolution scheme and the second part is based on an iterative procedure in each iteration meshes are first redistributed by an equidistribution principle and then on the resulting new grids the underlying numerical solutions are updated by a conservative interpolation formula proposed in this work the iteration for the mesh redistribution at a given time step is complete when the meshes governed by a nonlinear equation reach the equilibrium state the main idea of the proposed method is to keep the mass conservation of the underlying numerical solution at each redistribution step in one dimension we can show that the underlying numerical approximation obtained in the mesh redistribution part satisfies the desired tvd property which guarantees that the numerical solution at any time level is tvd provided that the pde solver in the first part satisfies such a property several test problems in one and two dimensions are computed using the proposed moving mesh algorithm the computations demonstrate that our methods are efficient for solving problems with shock discontinuities obtaining the same resolution with a much smaller number of grid points than the uniform mesh approach

a moving mesh finite element algorithm for singular problems in two and three space dimensions a framework for adaptive meshes based on the hamilton schoen yau theory was proposed by dvinsky in a recent work 2001 j comput phys 170 562 588 we extended dvinsky s method to provide an efficient moving mesh algorithm which compared favorably with the previously proposed schemes in terms of simplicity and reliability in this work we will further extend the moving mesh methods based on harmonic maps to deal with mesh adaptation in three space dimensions in obtaining the variational mesh we will solve an optimization problem with some appropriate constraints which is in contrast to the traditional method of solving the euler lagrange equation directly the key idea of this approach is to update the interior and boundary grids simultaneously rather than considering them separately application of the proposed moving mesh scheme is illustrated with some two and three dimensional problems with large solution gradients the numerical experiments show that our methods can accurately resolve detail features of singular problems in 3d

design of regular 2 d sub c ldpc codes over gf q using their binary images in this paper a method to design regular 2 dc ldpc codes over gf q with both good waterfall and error floor properties is presented based on the algebraic properties of their binary image first the algebraic properties of rows of the parity check matrix h associated with a code are characterized and optimized to improve the waterfall then the algebraic properties of cycles and stopping sets associated with the underlying tanner graph are studied and linked to the global binary minimum distance of the code finally simulations are presented to illustrate the excellent performance of the designed codes

constructing short length irregular ldpc codes with low error floor trapping sets tss are known to cause error floors in regular and irregular low density parity check ldpc codes by avoiding major error contributing tss during the code construction process codes with low error floors can effectively be built in it has been shown that tss labeled as w u are considered as being equivalent under the automorphism of the graph and are therefore contributing equally to the error floor however tss with the same label w u are not identical in general particularly for the case of irregular ldpc codes in this paper we introduce a parameter e that can identify the number of distinguishable cycles in the connected subgraph induced by an elementary trapping set further we propose a code construction algorithm namely the progressive edge growth approximate minimum cycle set extrinsic message degree peg acse method that aims to avoid small elementary trapping sets etss particularly detrimental etss we also develop theorems evaluating the minimum possible etss formed by peg construction algorithms in general we compare the characteristics of the codes built using the proposed method and those built using peg only or peg approximate minimum cycle extrinsic message degree peg ace methods results from simulations show that the codes constructed using the proposed peg acse method produce lower error rates particularly at the high signal to noise snr region compared with codes constructed using other peg based algorithms

non trivial periodic solutions of a non linear hill s equation with positively homogeneous term th ee xistence of non trivial periodic solutions of a general family of second order differential equations whose main model is a hill s equation with a cubic nonlinear term arising in different physical applications is proved c

new classes of partial geometries and their associated ldpc codes the use of partial geometries to construct parity check matrices for binary low density parity check ldpc codes has resulted in the design of successful codes with a probability of error on the awgn channel close to the shannon capacity at bit error rate down to 10 15 such considerations have motivated this further investigation a new and simple construction of a type of partial geometries with a quasi cyclic qc structure is given and their properties are investigated two new classes of this type of partial geometries one based on prime fields and the other based on cyclic subgroups of prime orders of finite fields are constructed qc ldpc codes with good error performances are constructed based on these two new classes of partial geometries the trapping sets of the partial geometry codes were previously considered using the geometric aspects of the underlying structure to derive information on the size of allowable trapping sets this topic is further considered here finally there is a natural relationship between partial geometries and strongly regular graphs the eigenvalues of the adjacency matrices of such graphs are well known and it is of interest to determine if any of the tanner graphs derived from the partial geometries are good expanders for certain parameter sets since it can be argued that codes with good geometric and expansion properties might perform well on the awgn channel under message passing decoding

algebraic construction of quasi cyclic ldpc codes for the awgn and erasure channels this paper is concerned with construction of quasi cyclic qc low density parity check ldpc codes for three different types of channels the additive white gaussian noise the binary random erasure and the binary burst erasure channels two algebraic methods for systematic construction of qc ldpc codes are presented codes constructed perform well over all three types of channels

computing the stopping distance of a tanner graph is np hard two decision problems related to the computation f stopping sets in tanner graphs are shown to be np complete it follows as a consequence that there exists no polynomial time algorithm for computing the stopping distance of a tanner graph unless p np

the homotopy perturbation method applied for solving complex valued differential equations with strong cubic nonlinearity abstract in this paper the homotopy perturbation method is adopted for solving a complex valued second order strongly nonlinear differential equation homotopy with an imbedding parameter p 0 1 is constructed the perturbation procedure with parameter p transforms the strongly nonlinear differential equation into a system of linear complex valued differential equations whose solutions give the approximate solution of the initial differential equation to illustrate the effectiveness and convenience of the suggested procedure a duffing equation with strong cubic nonlinearity is considered the periodic solution in the first approximation is obtained the solution is compared with the exact one and shows good agreement

an error indicator monitor function for an r adaptive finite element method an r adaptive finite element method based on moving mesh partial differential equations pdes and an error indicator is presented the error indicator is obtained by applying a technique developed by bank and weiser to elliptic equations which result in this case from temporal discretization of the underlying physical pdes on moving meshes the construction of the monitor function based on the error indicator is discussed numerical results obtained with the current method and the commonly used method based on solution gradients are presented and analyzed for several examples c 2001 academic press

new nonasymptotic channel coding theorems for structured codes new nonasymptotic random coding theorems with error probability epsilon and finite block length n based on gallager parity check ensemble and general parity check ensembles are derived in this paper the resulting nonasymptotic achievability bounds when combined with nonasymptotic equipartition properties developed in this paper can be easily computed analytically these nonasymptotic achievability bounds are shown to be asymptotically tight up to the second order of the coding rate as n goes to infinity with either constant or subexponentially decreasing epsilon in the case of gallager parity check ensemble and to imply that low density parity check ldpc codes be capacity achieving in the case of ldpc ensembles numerically they are also compared favorably for finite n and epsilon of practical interest with existing nonasymptotic achievability bounds in the literature

finite length analysis of low density parity check codes on the binary erasure channel in this paper we are concerned with the finite length analysis of low density parity check ldpc codes when used over the binary erasure channel bec the main result is an expression for the exact average bit and block erasure probability for a given regular ensemble of ldpc codes when decoded iteratively we also give expressions for upper bounds on the average bit and block erasure probability for regular ldpc ensembles and the standard random ensemble under maximum likelihood ml decoding finally we present what we consider to be the most important open problems in this area

design of repeat accumulate codes for iterative detection and decoding extrinsic information transfer exit charts are used to design systematic and nonsystematic repeat accumulate ra codes for iterative detection and decoding the convergence problems of nonsystematic ra codes are solved by introducing a biregular or doped layer of check nodes as examples such nonsystematic codes are designed for multi input multi output mimo fading channels and are shown to operate close to capacity

minimum distance bounds by graph analysis the parity check matrix of a linear code is used to define a bipartite code constraint tanner graph in which bit nodes are connected to parity check nodes the connectivity properties of this graph are analyzed using both local connectivity and the eigenvalues of the associated adjacency matrix a simple lower bound on the minimum distance of the code is expressed in terms of the two largest eigenvalues for a more powerful bound local properties of the subgraph corresponding to a minimum weight word in the code are used to create an optimization problem whose solution is a lower bound on the code s minimum distance linear programming gives one bound the technique is illustrated by applying it to sparse block codes with parameters 7 3 4 and 42 23 6

the homotopy perturbation method for nonlinear oscillators with discontinuities in the paper the homotopy perturbation method is applied to the nonlinear oscillators with discontinuities only one iteration leads to high accuracy of the solutions

on generic erasure correcting sets and related problems motivated by iterative decoding techniques for the binary erasure channel hollmann and tolhuizen introduced and studied the notion of generic erasure correcting sets for linear codes a generic r s erasure correcting set generates for all codes of codimension r a parity check matrix that allows iterative decoding of all correctable erasure patterns of size s or less the problem is to derive bounds on the minimum size f r s of generic erasure correcting sets and to find constructions for such sets in this paper we continue the study of these sets we derive better lower and upper bounds hollmann and tolhuizen also introduced the stronger notion of r s sets and derived bounds for their minimum size g r s here also we improve these bounds we observe that these two conceps are closely related to so called s wise intersecting codes an area in which g r s has been studied primarily with respect to ratewise performance we derive connections finally we observed that hypergraph covering can be used for both problems to derive good upper bounds

an efficient instanton search algorithm for lp decoding of ldpc codes over the bsc we consider linear programming lp decoding of a fixed low density parity check ldpc code over the binary symmetric channel bsc the lp decoder fails when it outputs a pseudo codeword which is not equal to the transmitted codeword we design an efficient algorithm termed the instanton search algorithm isa which generates an error vector called the bsc instanton we prove that a the lp decoder fails for any error pattern with support that is a superset of the support of an instanton b for any input the isa outputs an instanton in the number of steps upper bounded by twice the number of errors in the input error vector we then find the number of unique instantons of different sizes for a given ldpc code by running the isa sufficient number of times

systematic design of low density parity check code ensembles for binary erasure channels we propose a systematic method to design irregular low density parity check ldpc codes for binary erasure channels bec compared to the existing methods which are based on the application of asymptotic analysis tools such as density evolution or extrinsic information transfer exit charts in an optimization process the proposed method is much simpler and faster through a number of examples we demonstrate that the codes designed by the proposed method perform very closely to the best codes designed by optimization an important property of the proposed designs is the flexibility to select the number of constituent variable node degrees p the proposed designs include existing systematic designs as a special case with p n 1 where n is the maximum variable node degree compared to the existing systematic designs for a given rate and a given 0 the designed ensembles can have a threshold in neighborhood of the capacity upper bound with smaller values of p and n they can also achieve the capacity of the bec as n and correspondingly p and the maximum check node degree tend to infinity

fixed initialization decoding of ldpc codes over a binary symmetric channel we introduce in this paper the concept of a correctable error set and a fixed initialization decoding by noticing that the sum product decoder with a given iteration number only depends on the initialized probability of error for a bsc although this value has been conventionally selected as the bsc crossover probability we show that other selections can provide better performance or faster convergence we also prove that for any fixed initialization i e any given correctable error set the word error rate can be represented as a polynomial of the bsc crossover probability this suggests that the word error rate can be analytically derived from the knowledge of the correctable error set

spectral shape of doubly generalized ldpc codes efficient and exact evaluation this paper analyzes the asymptotic exponent of the weight spectrum for irregular doubly generalized ldpc d gldpc codes in the process an efficient numerical technique for its evaluation is presented involving the solution of a 4 4 system of polynomial equations the expression is consistent with previous results including the case where the normalized weight or stopping set size tends to zero the spectral shape is shown to admit a particularly simple form in the special case where all variable nodes are repetition codes of the same degree a case which includes tanner codes for this case it is also shown how certain symmetry properties of the local weight distribution at the cns induce a symmetry in the overall weight spectral shape function finally using these new results weight and stopping set size spectral shapes are evaluated for some example generalized and doubly generalized ldpc code ensembles

second order godunov type scheme for reactive flow calculations on moving meshes the method of calculating the system of gas dynamics equations coupled with the chemical reaction equation is considered the flow parameters are updated in whole without splitting the system into a hydrodynamical part and an ode part the numerical algorithm is based on the godunov s scheme on deforming meshes with some modification to increase the scheme order in time and space the variational approach is applied to generate the moving adaptive mesh at every time step the functional of smoothness written on the graph of the control function is minimized the grid lines are condensed in the vicinity of the main solution singularities e g precursor shock fire zones intensive transverse shocks and slip lines which allows resolving a fine structure of the reaction domain the numerical examples relating to the chapman jouguet detonation and unstable overdriven detonation are considered in both one and two space dimensions

on the existence of solutions for strongly nonlinear differential equations the objectives of this paper are twofold firstly to prove the existence of an approximate solution in the mean for some nonlinear differential equations we also investigate the behavior of the class of solutions which may be associated with the differential equation secondly we aim to implement the homotopy perturbation method hpm to find analytic solutions for strongly nonlinear differential equations

on the hardness of approximating stopping and trapping sets we prove that approximating the size of stopping and trapping sets in tanner graphs of linear block codes and more restrictively the class of low density parity check ldpc codes is np hard the ramifications of our findings are that methods used for estimating the height of the error floor of moderate and long length ldpc codes based on stopping and trapping set enumeration cannot provide accurate worst case performance predictions for most codes

bounds on the expansion properties of tanner graphs this work focuses on the expansion properties of a tanner graph because they are known to be related to the performance of associated iterative message passing algorithms over various channels by analyzing the eigenvalues and corresponding eigenvectors of the normalized incidence matrix representing a tanner graph lower bounds on these expansion properties are derived specifically for the binary erasure channel these results lead to two lower bounds on stopping distance for any given binary linear code and an upper bound on stopping redundancy for the family of difference set codes type i 2 d projective geometry low density parity check ldpc codes

searching for binary and nonbinary block and convolutional ldpc codes a unified approach to search for and optimize codes determined by their sparse parity check matrices is presented replacing the nonzero elements of a binary parity check matrix the base or parent matrix either by circulants or by companion matrices of elements from a finite field gf 2 m we obtain quasi cyclic low density parity check ldpc block codes and binary images of nonbinary ldpc block codes respectively by substituting monomials of a formal variable d we obtain the polynomial description of an ldpc convolutional code a set of performance measures applicable to different classes of ldpc codes is considered and a greedy algorithm for code performance optimization is presented the heart of the new optimization algorithm is a fast procedure for searching for ldpc codes with large girth of their tanner graphs for a few classes of ldpc codes examples of codes combining good error correcting performance with compact representation are obtained in particular we present optimized convolutional ldpc codes and conclude that the ldpc block codes are still superior to their convolutional counterparts if both decoding complexity and coding delay are considered moreover a specific channel model can easily be embedded into the optimization loop thereby the code can be optimized for a specific channel the efficiency of such an optimization is demonstrated via an example of faster than nyquist ftn signaling using ldpc codes the ftn strategy combined with a rate r 1 2 ldpc code of length 64 800 optimized for effective data rate r 3 4 gains more than 0 5 db compared with the standard ldpc codes of the same rate and length the obtained gain corresponds to transmission at the capacity of the binary input additive white gaussian noise channel in most numerical examples we consider codes with bidiagonal structure of the parity check matrix this restriction preserves low encoding complexity and allows fair comparison with codes selected for communication standards

sparse graph codes for quantum error correction sparse graph codes appropriate for use in quantum error correction are presented quantum error correcting codes based on sparse graphs are of interest for three reasons first the best codes currently known for classical channels are based on sparse graphs second sparse graph codes keep the number of quantum interactions associated with the quantum error correction process small a constant number per quantum bit independent of the block length third sparse graph codes often offer great flexibility with respect to block length and rate we believe some of the codes we present are unsurpassed by previously published quantum error correcting codes

error correction on a tree an instanton approach we introduce a method that allows analytical or semianalytical estimating of the post error correction bit error rate ber when a forward error correction is utilized for transmitting information through a noisy channel the generic method that applies to a variety of error correction schemes in the regimes where the ber is low is illustrated using the example of a finite size code approximated by a treelike structure exploring the statistical physics formulation of the problem we find that the ber decreases with the signal to noise ratio nonuniformly i e crossing over through a sequence of phases the higher the signal to noise ratio the lower the symmetry of the phase dominating ber the last 50 years have witnessed a tremendous increase in the amount of data transmitted through various communication systems this also leads to tightening of the conditions for error free data transfer in the presence of noise and other transmission related impairments the problem of dealing with errors in information flow has a fundamental importance and has been studied extensively in information and coding theory in 1948 shannon 1 proved that applying an error corrected code can result in an error free communication in the thermodynamic limit of an infinitely long message as long as the rate of transmitted information is kept below a certain value known as the channel capacity constructing well performing capacity approaching yet practical codes has been a challenge until the discovery that some classes of codes based on random construction 2 can achieve near optimum performance when used for transmission over white additive gaussian noise channels 3 in the past few years several codes have been designed with performances very close to this limit 4 generally these codes are referred to as codes on graphs and their prime examples are low density parity check ldpc codes and turbo codes a linear block code for which ldpc codes are an example can be represented as the set

finding the exhaustive list of small fully absorbing sets and designing the corresponding low error floor decoder this work provides an efficient exhaustive search algorithm for finding all small fully absorbing sets fass of any arbitrary low density parity check ldpc code the proposed algorithm is based on the branch bound principle for solving np complete problems in particular given any ldpc code the problem of finding all fass of size less than t is formulated as an integer programming problem for which a new branch bound algorithm is devised with new node selection and tree trimming mechanisms the resulting algorithm is capable of finding all fass of size 7 for ldpc codes of length 1000 when limiting the fass of interest to those with the number of violated parity check nodes 3 the proposed algorithm is capable of finding all such fass of size 14 for ldpc codes of lengths 1000 the resulting exhaustive list of small fass is then used to devise a new efficient post processing low error floor ldpc decoder the numerical results show that by exploiting the exhaustive list of small fass the proposed post processing decoder can significantly lower the error floor performance of a given ldpc code for various example codes of length 3000 the proposed post processing decoder lowers the error floor by a couple of orders of magnitude when compared to the standard belief propagation decoder and by an order of magnitude when compared to other existing low error floor decoders

low density parity check codes from transversal designs with improved stopping set distributions this paper examines the construction of low density parity check ldpc codes from transversal designs based on sets of mutually orthogonal latin squares mols by transferring the concept of configurations in combinatorial designs to the level of latin squares we thoroughly investigate the occurrence and avoidance of stopping sets for the arising codes stopping sets are known to determine the decoding performance over the binary erasure channel and should be avoided for small sizes based on large sets of simple structured mols we derive powerful constraints for the choice of suitable subsets leading to improved stopping set distributions for the corresponding codes we focus on ldpc codes with column weight 4 but the results are also applicable for the construction of codes with higher column weights finally we show that a subclass of the presented codes has quasi cyclic structure which allows low complexity encoding

on the minimum distance of array codes as ldpc codes for a prime q and an integer j spl les q the code c q j is a class of low density parity check ldpc codes from array codes which has a nice algebraic structure in this correspondence we investigate the minimum distance d q j of the code in an algebraic way we first prove that the code is invariant under a doubly transitive group of affine permutations then we show that d 5 4 8 d 7 4 8 and d q 4 spl ges 10 for any prime q 7 in addition we also analyze the codewords of weight 6 in the case of j 3 and the codewords of weight 8 in c 5 4 and c 7 4