Turbo source coding: A noise-robust approach to data compression

被引：27

作者：

Mitran, P ^{[1
]}

Bajcsy, J ^{[1
]}

机构：

[1] McGill Univ, Dept Elect & Comp Engn, Montreal, PQ H3A 2A7, Canada

来源：

DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS | 2002年

关键词：

Additive white noise; Arithmetic; AWGN; Concatenated codes; Data compression; Gaussian noise; Huffman coding; Iterative algorithms; Noise robustness; Source coding;

D O I：

10.1109/DCC.2002.1000008

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

Summary form only given. All traditional data compression techniques, such as Huffman coding, the Lempel-Ziv algorithm, run-length limited coding, Tunstall coding and arithmetic coding are highly susceptible to residual channel errors and noise. We have previously proposed the use of parallel concatenated codes and iterative decoding for fixed-length to fixed-length source coding, i.e., turbo coding for data compression purposes. The work presented here extends these results and also considers the case when decompression must be done from compressed data corrupted by additive white Gaussian noise (AWGN). © 2002 IEEE.

引用

页码：465 / 465

页数：1