DocumentCode
3044174
Title
Asynchronous Slepian-Wolf coding via source-splitting
Author
Rimoldi, B. ; Urbanke, R.
Author_Institution
Washington Univ., St. Louis, MO, USA
fYear
1997
fDate
29 Jun-4 Jul 1997
Firstpage
271
Abstract
The Slepian-Wolf coding problem for two sources is considered. It is known that vertices of the Slepian-Wolf region can be achieved with a complexity which is significantly lower than that of a general point and do not require that encoders are synchronized. It is shown that by splitting a source into two virtual sources one can reduce the problem of coding an arbitrary point to that of coding a vertex of a three-dimensional Slepian Wolf region. This approach generalizes to arbitrary number of sources
Keywords
channel capacity; computational complexity; decoding; source coding; 3D Slepian Wolf region; achievable rate region; asynchronous Slepian-Wolf coding; complexity; decoder; encoders; source coding; source-splitting; vertices; virtual sources; Codes; Decoding; Time sharing computer systems;
fLanguage
English
Publisher
ieee
Conference_Titel
Information Theory. 1997. Proceedings., 1997 IEEE International Symposium on
Conference_Location
Ulm
Print_ISBN
0-7803-3956-8
Type
conf
DOI
10.1109/ISIT.1997.613189
Filename
613189
Link To Document