Compression of binary memoryless sources using punctured turbo codes

被引：57

作者：

Garcia-Frias, J ^{[1
]}

Zhao, Y ^{[1
]}

机构：

[1] Univ Delaware, Dept Elect & Comp Engn, Newark, DE 19716 USA

来源：

IEEE COMMUNICATIONS LETTERS | 2002年 / 6卷 / 09期

关键词：

data compression; joint source-channel coding; punctured turbo codes; source coding;

D O I：

10.1109/LCOMM.2002.803484

中图分类号：

TN [电子技术、通信技术];

学科分类号：

0809 ;

摘要：

In this letter, we propose the use of punctured turbo codes to perform near-lossless compression and joint source-channel coding of binary memoryless sources. Compression is achieved by puncturing the turbo code to the desired rate. No information about the source distribution is required in the encoding process. Moreover, the source parameters do not need to be known in the decoder, since they can be estimated jointly with the iterative decoding process.

引用

页码：394 / 396

页数：3

共 12 条

[1]

[Anonymous], 1993, PROC IEEE INT C COMM, DOI 10.1109/ICC.1993.397441

[2]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[3]

DIVSALAR D, 1995, P IEEE INT C COMM SE, P54

[4] Compression of correlated binary sources using turbo codes [J].

Garcia-Frias, J ;

Zhao, Y .

IEEE COMMUNICATIONS LETTERS, 2001, 5 (10) :417-419

[5] Joint source-channel decoding of correlated sources over noisy channels [J].

Garcia-Frias, J .

DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2001, :283-292

[6] Combining Hidden Markov Source Models and Parallel Concatenated Codes [J].

Garcia-Frias, Javier ;

Villasenor, John D. .

IEEE COMMUNICATIONS LETTERS, 1997, 1 (04) :111-113

[7]

GARCIAFRIAS J, 2001, P ALL 2001 OCT

[8] SOURCE-CONTROLLED CHANNEL DECODING [J].

HAGENAUER, J .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1995, 43 (09) :2449-2457

[9] Turbo source coding: A noise-robust approach to data compression [J].

Mitran, P ;

Bajcsy, J .

DCC 2002: DATA COMPRESSION CONFERENCE, PROCEEDINGS, 2002, :465-465

[10] Turbo codes for nonuniform memoryless sources over noisy channels [J].

Zhu, GC ;

Alajaji, F .

IEEE COMMUNICATIONS LETTERS, 2002, 6 (02) :64-66

← 1 2 →