Results 11 - 20
of
30
Multistage compute-and-forward with multilevel lattice codes based on product constructions
- in Proc. IEEE ISIT
, 2014
"... ar ..."
(Show Context)
Properties of spatial coupling in compressed sensing
, 2014
"... In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which the proofs of the so-called threshold saturation work. We ..."
Abstract
-
Cited by 1 (0 self)
- Add to MetaCart
In this paper we address a series of open questions about the construction of spatially coupled measurement matrices in compressed sensing. For hardware implementations one is forced to depart from the limiting regime of parameters in which the proofs of the so-called threshold saturation work. We investigate quantitatively the behavior under finite coupling range, the dependence on the shape of the coupling interaction, and optimization of the so-called seed to minimize distance from optimality. Our analysis explains some of the properties observed empirically in previous works and provides new insight on spatially coupled compressed sensing.
Threshold Saturation for Spatially-Coupled LDPC and LDGM Codes on BMS Channels
"... ar ..."
(Show Context)
Approaching the Rate-Distortion Limit with Spatial Coupling, Belief propagation and Decimation
, 2013
"... We investigate an encoding scheme for lossy com-pression of a binary symmetric source based on simple spatially coupled Low-Density Generator-Matrix codes. The degree of the check nodes is regular and the one of code-bits is Poisson distributed with an average depending on the compression rate. The ..."
Abstract
- Add to MetaCart
We investigate an encoding scheme for lossy com-pression of a binary symmetric source based on simple spatially coupled Low-Density Generator-Matrix codes. The degree of the check nodes is regular and the one of code-bits is Poisson distributed with an average depending on the compression rate. The performance of a low complexity Belief Propagation Guided Decimation algorithm is excellent. The algorithmic rate-distortion curve approaches the optimal curve of the ensemble as the width of the coupling window grows. Moreover, as the check degree grows both curves approach the ultimate Shannon rate-distortion limit. The Belief Propagation Guided Decimation encoder is based on the posterior measure of a binary symmetric test-channel. This measure can be interpreted as a random Gibbs measure at a “temperature ” directly related to the “noise level of the test-channel”. We investigate the links between the algorith-mic performance of the Belief Propagation Guided Decimation encoder and the phase diagram of this Gibbs measure. The phase diagram is investigated thanks to the cavity method of spin glass theory which predicts a number of phase transition thresholds. In particular the dynamical and condensation “phase transition temperatures” (equivalently test-channel noise thresholds) are computed. We observe that: (i) the dynamical temperature of the spatially coupled construction saturates towards the condensation temperature; (ii) for large degrees the condensation temper-ature approaches the temperature (i.e. noise level) related to the information theoretic Shannon test-channel noise parameter of rate-distortion theory. This provides heuristic insight into the excellent performance of the Belief Propagation Guided Decimation algorithm. The paper contains an introduction to the cavity method.
Braided Convolutional Codes: A New Class of Turbo-Like Codes
- IEEE TRANSACTIONS ON INFORMATION THEORY, ACCEPTED FOR PUBLICATION
, 2009
"... We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a sta ..."
Abstract
- Add to MetaCart
We present a new class of iteratively decodable turbo-like codes, called braided convolutional codes. Constructions and encoding procedures for tightly and sparsely braided convolutional codes are introduced. Sparsely braided codes exhibit good convergence behavior with iterative decoding, and a statistical analysis using Markov permutors shows that the free distance of these codes grows linearly with constraint length, i.e., they are asymptotically good.
Coded Random Access with Distributed Power Control and Multiple-Packet Reception
"... Abstract—In this letter, a spatially-coupled low-density parity-check (SC-LDPC) coded ALOHA system with multiuser detec-tion (MUD)-based multiple packet reception (MPR) is studied. A distributed power control scheme based on multiple power levels is proposed for medium and high rate applications. Nu ..."
Abstract
- Add to MetaCart
(Show Context)
Abstract—In this letter, a spatially-coupled low-density parity-check (SC-LDPC) coded ALOHA system with multiuser detec-tion (MUD)-based multiple packet reception (MPR) is studied. A distributed power control scheme based on multiple power levels is proposed for medium and high rate applications. Numerical results show that the proposed scheme can provide noticeable throughput improvement. This improvement is more significant in the cases of fading channels. Index Terms—LDPC, multiple reception, multiuser detection, power control, spatial coupling. I.