ALGEBRAIC ANALOG DECODING OF LINEAR BINARY CODES

被引：18

作者：

RUDOLPH, LD

HARTMANN, CRP

HWANG, TY

DUC, NQ

机构：

[1] MINIST COMMUN,TELECOMMUN LABS,CHUNG 320,TAIWAN

[2] TELECOM AUSTRALIA RES LABS,CLAYTON N 3168,VICTORIA,AUSTRALIA

来源：

IEEE TRANSACTIONS ON INFORMATION THEORY | 1979年 / 25卷 / 04期

关键词：

D O I：

10.1109/TIT.1979.1056073

中图分类号：

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

学科分类号：

0812 ;

摘要：

Bit-by-bit soft-decision decoding of binary cyclic codes is considered. A significant reduction in decoder complexity can be achieved by requiring only that the decoder correct all analog error patterns which fall within a Euclidean sphere whose radius is equal to half the minimum Euclidean distance of the code. Such a “maximum-radius” decoding scheme is asymptotically optimum for the additive white Gaussian noise (AWGN) channel. An iterative extension of the basic algebraic analog decoding scheme is discussed, and performance curves are given for the (17,9), (21,11), and (73,45) codes on the AWGN channel. © 1979 IEEE

引用

页码：430 / 440

页数：11

共 9 条

[1]

FELLER W, 1965, INTRO PROBABILITY TH, V1, P166

[2]

FORNEY GD, 1966, CONCATENATED CODES, P52

[3] ASYMPTOTIC PERFORMANCE OF OPTIMUM BIT-BY-BIT DECODING FOR WHITE GAUSSIAN CHANNEL [J].