A symbol-by-symbol MAP decoding rule for linear codes over rings using the dual code

被引：6

作者：

Berkmann, J ^{[1
]}

机构：

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

来源：

1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS | 1998年

关键词：

D O I：

10.1109/ISIT.1998.708676

中图分类号：

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

学科分类号：

0808 ; 0809 ;

摘要：

A symbol-by-symbol maximum a posteriori (MAP) decoding rule for codes over integer rings is presented which uses the dual code. This rule results in lower complexity decoding for high-rate codes and generalizes earlier results for the field case to codes over integer rings. The suitability of the decoding rule is demonstrated by applying it to an iterative 'turbo'-(de)coding scheme employing convolutional codes over Z(M) in conjunction with M-PSK.

引用

页码：90 / 90

页数：1