By Topic

Code design for lossless multiterminal networks

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Stankovic, V. ; Dept. of Electr. Eng., Texas A&M Univ., College Station, TX, USA ; Liveris, A.D. ; Zixiang Xiong ; Georghiades, C.N.

This paper considers a general multiterminal (MT) system, which consists of L encoders and P decoders. Let X1,..., XL be memoryless, uniform, correlated random binary vectors of length n, and let x1,..., xL denote their realizations. Let further Σ = {1,...,L}. The i-th encoder compresses Xi independently from other encoders. The j-th decoder receives the bitstreams from a set of encoders Σj⊆ Σ and jointly decodes them. It should reconstruct the received source messages with arbitrarily small probability of error. To construct a practical coding scheme for this network, we exploit the fact that such a network can be split into P subnetworks, each being regarded as a Slepian-Wolf (SW) coding system with multiple sources. This SW subnetwork consists of a decoder which receives encodings of all Xk's such that k∈Σsw⊆Σ and attempts to reconstruct them perfectly. Based on (V. Stankovic et al. 2004), we first provide a code design for this setting, and then extend it to the general case.

Published in:

Information Theory, 2004. ISIT 2004. Proceedings. International Symposium on

Date of Conference:

27 June-2 July 2004