A Union Bound Analysis for Codes over Binary Asymmetric Channels

被引：0

作者：

Song, Guanghui ^{[1
]}

Cai, Kui ^{[1
]}

Cheng, Jun ^{[2
]}

机构：

[1] Singapore Univ Technol & Design, Singapore, Singapore

[2] Doshisha Univ, Kyoto, Japan

来源：

2017 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC) | 2017年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0809 ;

摘要：

A union bound analysis is given for codes over binary asymmetric channels. By considering a random mapping that modulates each coded bit equiprobably to the signal constellation point, an average union bound is derived explicitly as a function of the code's weight spectrum. The bound can be used for estimating the error floor performance of maximum-likelihood decoding or near optimal decodings.

引用

页数：5

共 10 条

[1]

[Anonymous], 2009, Channel Codes: Classical and Modern

[2]

Barbero A, 2006, IEEE ICC, P1200

[3] THEORY OF BINARY ASYMMETRIC ERROR CORRECTING CODES [J].

CONSTANTIN, SD ;

RAO, TRN .

INFORMATION AND CONTROL, 1979, 40 (01) :20-36

[4]

Divsalar D., 1998, P ALL C COMM CONTR C, V36, P201

[5]

Gabrys R., P ICNC 2012, P461

[6] Performance of Multilevel Flash Memories With Different Binary Labelings: A Multi-User Perspective [J].

Huang, Pengfei ;

Siegel, Paul H. ;

Yaakobi, Eitan .

IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2016, 34 (09) :2336-2353

[7]

Li Q., P IEEE ISIT 2016, P2262

[8]

Marina Y., P ICT 2008, P1

[9] CONVOLUTIONAL CODES AND THEIR PERFORMANCE IN COMMUNICATION SYSTEMS [J].

VITERBI, AJ .

IEEE TRANSACTIONS ON COMMUNICATION TECHNOLOGY, 1971, CO19 (05) :751-+

[10]

Yaakobi E., P IEEE ISIT 2011, P1021

← 1 →