On variable length codes for iterative source/channel decoding

被引：81

作者：

Bauer, R ^{[1
]}

Hagenauer, J ^{[1
]}

机构：

[1] Munich Univ Technol, Inst Commun Engn, D-80290 Munich, Germany

来源：

DCC 2001: DATA COMPRESSION CONFERENCE, PROCEEDINGS | 2001年

关键词：

D O I：

10.1109/DCC.2001.917158

中图分类号：

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

学科分类号：

0812 ;

摘要：

We focus on a trellis-based decoding technique for variable length codes (VLCs) which does not require any additional side information besides the number of bits in the coded sequence. A bit-level soft-in/soft-out decoder based on this trellis is used as an outer component decoder in an iterative decoding scheme for a serially concatenated source/channel coding system. In contrast to previous approaches using this kind of trellis we do not consider the received sequence as a concatenation of variable length codewords, but as one long code word of a (weak) binary channel code which can be soft-in/soft-out decoded. By evaluating the distance properties of selected variable length codes we show that some codes are more suitable for trellis-based decoding than others. Finally we present simulation results which show the performance of the iterative decoding approach.

引用

页码：273 / 282

页数：10

共 16 条

[1] OPTIMAL DECODING OF LINEAR CODES FOR MINIMIZING SYMBOL ERROR RATE [J].

BAHL, LR ;

COCKE, J ;

JELINEK, F ;

RAVIV, J .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1974, 20 (02) :284-287

[2]

Balakirsky V. B., 1997, Proceeding. 1997 IEEE International Symposium on Information Theory (Cat. No.97CH36074), DOI 10.1109/ISIT.1997.613356

[3]

Bauer R., 2000, Proceedings DCC 2000. Data Compression Conference, P93, DOI 10.1109/DCC.2000.838149

[4]

Bernard M., 1988, ARS COMBINATORIA, V25, P181

[5]

BUTTIGIEG V, 1995, CODES CYPHERS CRYPTO, V4, P103

[6]

Buttigieg V., 1995, THESIS U MANCHESTER

[7]

DEMIR N, 1998, P IEEE DAT COMPR C S

[8]

HAGENAUER J, 1997, P INT S TURB COD REL, P1

[9]

LAKOVIC K, 1999, P IEEE VEH TECHN C

[10]

MURAD AH, 1999, P IEEE WIR COMM NETW

← 1 2 →