Word error probability estimation by means of a modified Viterbi decoder

被引：9

作者：

Fricke, Justus Ch. ^{[1
]}

Hoeher, Peter A. ^{[1
]}

机构：

[1] Univ Kiel, Fac Engn, Informat & Coding Theory Lab, D-24143 Kiel, Germany

来源：

2007 IEEE 66TH VEHICULAR TECHNOLOGY CONFERENCE, VOLS 1-5 | 2007年

关键词：

modified Viterbi algorithm; word error probability; HARQ;

D O I：

10.1109/VETECF.2007.241

中图分类号：

T [工业技术];

学科分类号：

08 [工学];

摘要：

In this paper, we introduce a new method for calculating word error probabilities by means of a modified Viterbi decoder. The proposed method can be seen as an approximation of the reliability output Viterbi algorithm (ROVA). The results provided by the proposed algorithm are only slightly worse than that of the ROVA, given a significantly lower computational complexity especially for codes with large memory lengths. As a potential application, both algorithms are compared in reliability-based HARQ.

引用

页码：1113 / 1116

页数：4

共 8 条

[1]

[Anonymous], P IEEE GLOB TEL C 19

[2]

An algorithm for detecting unreliable code sequence segments and its applications [J].

Freudenberger, J ;

Slender, B .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2004, 52 (11) :1833-1839

[3]

FRICKE JC, 2006, P NEWCOM ACORN JOINT

[4]

A reliability output Viterbi algorithm with applications to hybrid ARQ [J].

Raghavan, AR ;

Baum, CW .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1998, 44 (03) :1214-1216

[5]

LIST VITERBI DECODING ALGORITHMS WITH APPLICATIONS [J].

SESHADRI, N ;

SUNDBERG, CEW .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1994, 42 (2-4) :313-323

[6]

TRIPATHI V, 2003, P IEEE INT C COMM IC

[7]

Reliability-based incremental redundancy with convolutional codes [J].

Visotsky, E ;

Sun, YK ;

Tripathi, V ;

Honig, ML ;

Peterson, R .

IEEE TRANSACTIONS ON COMMUNICATIONS, 2005, 53 (06) :987-997

[8]

VITERBI DECODING ALGORITHM FOR CONVOLUTIONAL-CODES WITH REPEAT REQUEST [J].

YAMAMOTO, H ;

ITOH, K .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1980, 26 (05) :540-547

← 1 →