Distributed compression of binary sources using conventional parallel and serial concatenated convolutional codes
Conference Paper
-
- Overview
-
- Identity
-
- Additional Document Info
-
- Other
-
- View All
-
Overview
abstract
-
© 2003 IEEE. It is shown how conventional parallel (turbo) and serial concatenated convolutional codes can be used to compress close to the Slepian-Wolf limit for the correlated binary sources. Conventional refers to codes already used in channel coding. Focusing on the asymmetric case of compression of an equipolarable memoryless binary source with side information at the decoder, the approach is based on modeling the correlation as a channel and using syndromes. The encoding and decoding procedures are explained in detail. The performance achieved is seen to be better than the recently published results using nonconventional turbo codes and close to the Slepian-Wolf limit.
name of conference
-
Data Compression Conference
published proceedings
-
Data Compression Conference, 2003. Proceedings. DCC 2003
author list (cited authors)
-
Liveris, A. D., Zixiang Xiong, .., & Georghiades, C. N
citation count
complete list of authors
-
Liveris, AD||Georghiades, CN
publication date
publisher
published in
Identity
Digital Object Identifier (DOI)
International Standard Book Number (ISBN) 10
Additional Document Info
start page
end page
volume
Other
URL
-
http://ieeexplore.ieee.org/xpl/mostRecentIssue.jsp?punumber=8491