Reduced complexity decoding algorithms for linear block codes

被引：0

作者：

Ponnampalam, V ^{[1
]}

Evans, J ^{[1
]}

Vucetic, B ^{[1
]}

机构：

[1] Univ Sydney, Sch Elect & Informat Engn, Sydney, NSW 2006, Australia

来源：

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS | 2002年

关键词：

D O I：

10.1109/ISIT.2002.1023586

中图分类号：

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

学科分类号：

0812 ;

摘要：

We present an efficient soft decision maximum likelihood decoding algorithm for linear binary block codes. As in the Chase algorithms, test error patterns are generated, added to the received sequence and decoded, using a hard decision decoder. However, the set of test error sequences is adaptively chosen. This significantly reduces decoding complexity. Furthermore a sub-optimal decoding algorithm is developed by introducing constraints on the set of test error patterns used.

引用

页码：314 / 314

页数：1

共 50 条

[11] Optimal threshold sequential decoding algorithms for linear block codes [J].

Chen, J ;

Sun, R ;

Wang, XM .

2000 IEEE 51ST VEHICULAR TECHNOLOGY CONFERENCE, PROCEEDINGS, VOLS 1-3, 2000, :605-607

[12] Near optimal reduced-complexity decoding algorithms for LDPC codes [J].

Chen, J ;

Dholakia, A ;

Eleftheriou, E ;

Fossorier, M ;

Hu, XY .

ISIT: 2002 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2002, :455-455

[13] Reduced complexity sliding window BCJR decoding algorithms for turbo codes [J].

Gwak, J ;

Shin, SK ;

Kim, HM .

CRYPTOGRAPHY AND CODING, 1999, 1746 :179-184

[14] LOW-COMPLEXITY TRELLIS DECODING OF LINEAR BLOCK-CODES [J].

HONARY, B ;

MARKARIAN, G ;

DARNELL, M .

IEE PROCEEDINGS-COMMUNICATIONS, 1995, 142 (04) :201-209

[15] Genetic Algorithms for Soft-Decision Decoding of Linear Block Codes [J].

Maini, Harpal ;

Mehrotra, Kishan ;

Mohan, Chilukuri ;

Ranka, Sanjay .

EVOLUTIONARY COMPUTATION, 1994, 2 (02) :145-164

[16] REDUCED-COMPLEXITY DECODING ALGORITHMS FOR UNITARY SPACE-TIME CODES [J].

Su Xin Yi Kechu Tian Bin Sun Yongjun State Key Laboratory of Integrated Service NetworksXidian UniversityXian China System Standard DeptDatang Mobile Telecommunications Equipment Co LtdBeijing China .

Journal of Electronics(China), 2007, (01) :112-115

[17] COMPLEXITY OF DECODING FOR LINEAR CODES. [J].

Evseev, G.S. .

1600, (19)

[18] Reduced-Complexity Linear Programming Decoding Based on ADMM for LDPC Codes [J].

Wei, Haoyuan ;

Jiao, Xiaopeng ;

Mu, Jianjun .

IEEE COMMUNICATIONS LETTERS, 2015, 19 (06) :909-912

[19] Trellis decoding of linear block codes [J].

Büttner, WH ;

Staphorst, L ;

Linde, LP .

PROCEEDINGS OF THE 1998 SOUTH AFRICAN SYMPOSIUM ON COMMUNICATIONS AND SIGNAL PROCESSING: COMSIG '98, 1998, :171-174

[20] Trellis decoding of linear block codes [J].

Univ of Pretoria, Pretoria, South Africa .

Proc S Afr Symp Commun Signal Process, (171-174)

← 1 2 3 4 5 →