32,225 research outputs found
Spatially-Coupled Random Access on Graphs
In this paper we investigate the effect of spatial coupling applied to the
recently-proposed coded slotted ALOHA (CSA) random access protocol. Thanks to
the bridge between the graphical model describing the iterative interference
cancelation process of CSA over the random access frame and the erasure
recovery process of low-density parity-check (LDPC) codes over the binary
erasure channel (BEC), we propose an access protocol which is inspired by the
convolutional LDPC code construction. The proposed protocol exploits the
terminations of its graphical model to achieve the spatial coupling effect,
attaining performance close to the theoretical limits of CSA. As for the
convolutional LDPC code case, large iterative decoding thresholds are obtained
by simply increasing the density of the graph. We show that the threshold
saturation effect takes place by defining a suitable counterpart of the
maximum-a-posteriori decoding threshold of spatially-coupled LDPC code
ensembles. In the asymptotic setting, the proposed scheme allows sustaining a
traffic close to 1 [packets/slot].Comment: To be presented at IEEE ISIT 2012, Bosto
Spatially Coupled LDPC Codes Constructed from Protographs
In this paper, we construct protograph-based spatially coupled low-density
parity-check (SC-LDPC) codes by coupling together a series of L disjoint, or
uncoupled, LDPC code Tanner graphs into a single coupled chain. By varying L,
we obtain a flexible family of code ensembles with varying rates and frame
lengths that can share the same encoding and decoding architecture for
arbitrary L. We demonstrate that the resulting codes combine the best features
of optimized irregular and regular codes in one design: capacity approaching
iterative belief propagation (BP) decoding thresholds and linear growth of
minimum distance with block length. In particular, we show that, for
sufficiently large L, the BP thresholds on both the binary erasure channel
(BEC) and the binary-input additive white Gaussian noise channel (AWGNC)
saturate to a particular value significantly better than the BP decoding
threshold and numerically indistinguishable from the optimal maximum
a-posteriori (MAP) decoding threshold of the uncoupled LDPC code. When all
variable nodes in the coupled chain have degree greater than two,
asymptotically the error probability converges at least doubly exponentially
with decoding iterations and we obtain sequences of asymptotically good LDPC
codes with fast convergence rates and BP thresholds close to the Shannon limit.
Further, the gap to capacity decreases as the density of the graph increases,
opening up a new way to construct capacity achieving codes on memoryless
binary-input symmetric-output (MBS) channels with low-complexity BP decoding.Comment: Submitted to the IEEE Transactions on Information Theor
The Space of Solutions of Coupled XORSAT Formulae
The XOR-satisfiability (XORSAT) problem deals with a system of Boolean
variables and clauses. Each clause is a linear Boolean equation (XOR) of a
subset of the variables. A -clause is a clause involving distinct
variables. In the random -XORSAT problem a formula is created by choosing
-clauses uniformly at random from the set of all possible clauses on
variables. The set of solutions of a random formula exhibits various
geometrical transitions as the ratio varies.
We consider a {\em coupled} -XORSAT ensemble, consisting of a chain of
random XORSAT models that are spatially coupled across a finite window along
the chain direction. We observe that the threshold saturation phenomenon takes
place for this ensemble and we characterize various properties of the space of
solutions of such coupled formulae.Comment: Submitted to ISIT 201
Thresholds of Spatially Coupled Systems via Lyapunov's Method
The threshold, or saturation phenomenon of spatially coupled systems is
revisited in the light of Lyapunov's theory of dynamical systems. It is shown
that an application of Lyapunov's direct method can be used to quantitatively
describe the threshold phenomenon, prove convergence, and compute threshold
values. This provides a general proof methodology for the various systems
recently studied. Examples of spatially coupled systems are given and their
thresholds are computed.Comment: 6 page
Asymptotic and Finite Frame Length Analysis of Frame Asynchronous Coded Slotted ALOHA
We consider a frame-asynchronous coded slotted ALOHA (FA-CSA) system where
users become active according to a Poisson random process. In contrast to
standard frame-synchronous CSA (FS-CSA), users transmit a first replica of
their message in the slot following their activation and other replicas
uniformly at random in a number of subsequent slots. We derive the
(approximate) density evolution that characterizes the asymptotic performance
of FA-CSA when the frame length goes to infinity. We show that, if users can
monitor the system before they start transmitting, a boundary-effect similar to
that of spatially-coupled codes occurs, which greatly improves the decoding
threshold as compared to FS-CSA. We also derive analytical approximations of
the error floor (EF) in the finite frame length regime. We show that FA-CSA
yields in general lower EF, better performance in the waterfall region, and
lower average delay, as compared to FS-CSA.Comment: 5 pages, 6 figures. Updated notation, terminology, and typo
- …