A relaxed practical universal decoding algorithm for slepian-wolf system

Author

Xue, Guodong ; Zhang, Lin ; Liu, Yu

Author_Institution

Sch. of Inf. & Commun. Eng., Beijing Univ. of Posts & Telecommun., Beijing, China

fYear

2009

fDate

26-28 Aug. 2009

Firstpage

1

Lastpage

5

Abstract

In this paper, we will discuss universal decoding problem for Slepian-Wolf (SW) systems, as we know, for the first time. Based on former literature, we give a different interpretation for minimum entropy decoder and propose a relaxed linear programming decoding algorithm. With low computational complexity, the decoding algorithm can practically settle the universal decoding problems of SW systems.

Keywords

computational complexity; decoding; entropy codes; linear programming; minimum entropy methods; Slepian-wolf system; computational complexity; linear programming decoding algorithm; minimum entropy decoder; universal decoding algorithm; Channel coding; Computational complexity; Decoding; Entropy; H infinity control; Length measurement; Linear programming; Stability; Statistics; Wireless sensor networks; SW system; minimum entropy decoder; relaxed linear programming decoding algorithm; universal decoding;

fLanguage

English

Publisher

ieee

Conference_Titel

Communications and Networking in China, 2009. ChinaCOM 2009. Fourth International Conference on

Conference_Location

Xian

Print_ISBN

978-1-4244-4337-6

Electronic_ISBN

978-1-4244-4337-6

Type

conf

DOI

10.1109/CHINACOM.2009.5339957

Filename

5339957