Tree-Structure Expectation Propagation for LDPC Decoding over the BEC

We present the tree-structure expectation propagation (Tree-EP) algorithm to decode low-density parity-check (LDPC) codes over discrete memoryless channels (DMCs). EP generalizes belief propagation (BP) in two ways. First, it can be used with any exponential family distribution over the cliques in the graph. Second, it can impose additional constraints on the marginal distributions. We use this second property to impose pair-wise marginal constraints over pairs of variables connected to a check node of the LDPC code's Tanner graph. Thanks to these additional constraints, the Tree-EP marginal estimates for each variable in the graph are more accurate than those provided by BP. We also reformulate the Tree-EP algorithm for the binary erasure channel (BEC) as a peeling-type algorithm (TEP) and we show that the algorithm has the same computational complexity as BP and it decodes a higher fraction of errors. We describe the TEP decoding process by a set of differential equations that represents the expected residual graph evolution as a function of the code parameters. The solution of these equations is used to predict the TEP decoder performance in both the asymptotic regime and the finite-length regime over the BEC. While the asymptotic threshold of the TEP decoder is the same as the BP decoder for regular and optimized codes, we propose a scaling law (SL) for finite-length LDPC codes, which accurately approximates the TEP improved performance and facilitates its optimization

Demonstrating Discreteness and Collision Error in Cosmological N-body Simulations of Dark Matter Gravitational Clustering

Two-body scattering and other discreteness effects are unimportant in cosmological gravitational clustering in most scenarios, since the dark matter has a small particle mass. The collective field should determine evolution: Two-body scattering in simulations violates the Poisson-Vlasov equations. We test this in PM, P$^3$M, Tree, and NGPM codes, noting that a collisionless code will preserve the one-dimensional character of plane wave collapse. We find collisionality vanishing as the softening parameter approaches the mean interparticle separation. Solutions for the problem are suggested, involving greater computer power, PM-based nested grid codes, and a more conservative approach to resolution claims.Comment: Final version accepted for ApJ Letters. Minor revisions, including due to bug fix in tree code. Uses aasms4.sty. 15 pages. Higher resolution figures available at ftp://kusmos.phsx.ukans.edu/preprints/discret

Error correcting code using tree-like multilayer perceptron

An error correcting code using a tree-like multilayer perceptron is proposed. An original message \mbi{s}^0 is encoded into a codeword \boldmath{y}_0 using a tree-like committee machine (committee tree) or a tree-like parity machine (parity tree). Based on these architectures, several schemes featuring monotonic or non-monotonic units are introduced. The codeword \mbi{y}_0 is then transmitted via a Binary Asymmetric Channel (BAC) where it is corrupted by noise. The analytical performance of these schemes is investigated using the replica method of statistical mechanics. Under some specific conditions, some of the proposed schemes are shown to saturate the Shannon bound at the infinite codeword length limit. The influence of the monotonicity of the units on the performance is also discussed.Comment: 23 pages, 3 figures, Content has been extended and revise

How to simulate the Universe in a Computer

In this contribution a broad overview of the methodologies of cosmological N-body simulations and a short introduction explaining the general idea behind such simulations is presented. After explaining how to set up the initial conditions using a set of N particles two (diverse) techniques are presented for evolving these particles forward in time under the influence of their self-gravity. One technique (tree codes) is solely based upon a sophistication of the direct particle-particle summation whereas the other method relies on the continuous (de-)construction of arbitrarily shaped grids and is realized in adaptive mesh refinement codes.Comment: 8 pages, 4 figures, accepted for publication in PASA (refereed proceedings contribution for the meeting "Gravity 2004" held in Sydney, April 15-16, 2004

Simulation techniques for cosmological simulations

Modern cosmological observations allow us to study in great detail the evolution and history of the large scale structure hierarchy. The fundamental problem of accurate constraints on the cosmological parameters, within a given cosmological model, requires precise modelling of the observed structure. In this paper we briefly review the current most effective techniques of large scale structure simulations, emphasising both their advantages and shortcomings. Starting with basics of the direct N-body simulations appropriate to modelling cold dark matter evolution, we then discuss the direct-sum technique GRAPE, particle-mesh (PM) and hybrid methods, combining the PM and the tree algorithms. Simulations of baryonic matter in the Universe often use hydrodynamic codes based on both particle methods that discretise mass, and grid-based methods. We briefly describe Eulerian grid methods, and also some variants of Lagrangian smoothed particle hydrodynamics (SPH) methods.Comment: 42 pages, 16 figures, accepted for publication in Space Science Reviews, special issue "Clusters of galaxies: beyond the thermal view", Editor J.S. Kaastra, Chapter 12; work done by an international team at the International Space Science Institute (ISSI), Bern, organised by J.S. Kaastra, A.M. Bykov, S. Schindler & J.A.M. Bleeke

N-body simulations of gravitational dynamics

We describe the astrophysical and numerical basis of N-body simulations, both of collisional stellar systems (dense star clusters and galactic centres) and collisionless stellar dynamics (galaxies and large-scale structure). We explain and discuss the state-of-the-art algorithms used for these quite different regimes, attempt to give a fair critique, and point out possible directions of future improvement and development. We briefly touch upon the history of N-body simulations and their most important results.Comment: invited review (28 pages), to appear in European Physics Journal Plu