The reliability function of variable-rate Slepian-Wolf coding is linked to the reliability function of channel coding with constant composition codes, through which computable lower and upper bounds are derived. The bounds coincide at rates close to the Slepian-Wolf limit, yielding a complete characterization of the reliability function in that rate regime. It is shown that variable-rate Slepia...

We consider the Slepian-Wolf code design based on LDPC (low-density parity-check) coset codes. We derive the density evolution formula for the Slepian-Wolf coding, equipped with a concentration theorem. An intimate connection between the Slepian-Wolf coding and channel coding is established. Specifically we show that, under density evolution, each Slepian-Wolf source coding problem is equivalen...

ii 5.2 Periodogram with Rectangular window…………………………………….26 6. SIMULATION RESULTS AND ANALYSIS……………….………………………………………….27 6.1 WINNER phase II model…………………………………………………………….27 6.2 Simulation of the channel estimation of the WINNER II channel model, Slepian basis expansion and Fourier basis expansion…….32 6.2.1 Simulations of the channel estimation of the WINNER II model and the Slepian basis expan...

This paper is concerned with various aspects of the Slepian process (Bt+1 −Bt, t ≥ 0) derived from one-dimensional standard Brownian motion (Bt, t ≥ 0). In particular, we offer an analysis of the local structure of the Slepian zero set {t : Bt+1 = Bt}, including a path decomposition of the Slepian process for 0 ≤ t ≤ 1. We also establish the existence of a random time T ≥ 0 such that the proces...

In this paper, the redundancy of both variable and fixed rate Slepian–Wolf coding is considered. Given any jointly memoryless source-side information pair with finite alphabet, the redundancy of variable rate Slepian–Wolf coding of  with decoder only side information depends on both the block length and the decoding block error probability , and is defined as the difference between the minimum...

In this paper, it is shown that each Slepian–Wolf coding problem is related to a dual channel coding problem in the sense that the sphere packing exponents, random coding exponents, and correct decoding exponents in these two problems are mirror-symmetrical to each other. This mirror symmetry is interpreted as a manifestation of the linear codebook-level duality between Slepian–Wolf coding and ...

In this paper, we give a distributed joint source channel coding scheme for arbitrary correlated sources for arbitrary point in the Slepian-Wolf rate region, and arbitrary link capacities using LDPC codes. We consider the Slepian-Wolf setting of two sources and one destination, with one of the sources derived from the other source by some correlation model known at the decoder. Distributed enco...

232 © 2012 Guilford Publications, Inc. This research was supported in part by National Science Foundation Grant BCS-0435547 to Nalini Ambady and by a National Science Foundation Graduate Research Fellowship to M.L.S. Correspondence concerning this article should be addressed to Michael L. Slepian, Department of Psychology, 490 Boston Ave., Medford, MA 02155. E-mail: [email protected]. E...