Achieving general points in the 2-user Gaussian MAC without time-sharing or rate-splitting by means of iterative coding

被引：38

作者：

Amraoui, A ^{[1
]}

Dusad, S ^{[1
]}

Urbanke, R ^{[1
]}

机构：

[1] Ecole Polytech Fed Lausanne, Swiss Fed Inst Technol, Commun Theory Lab, CH-1015 Lausanne, Switzerland

来源：

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

关键词：

D O I：

10.1109/ISIT.2002.1023606

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this paper, we analyze iterative coding for the frame-asynchronous binary-input discrete-time Gaussian multiple access channel. Using the method of density evolution, we optimize degree distributions to exhibit code ensembles whose iterative decoding thresholds are only few tenths of dB away from the Shannon limit.

引用

页码：334 / 334

页数：1

共 5 条

[1]

Chayat N., 1999, Proceedings of the 1999 IEEE Information Theory and Communications Workshop (Cat. No. 99EX253), P9, DOI 10.1109/ITCOM.1999.781391

[2]

Cover T. M., 2005, ELEM INF THEORY, DOI 10.1002/047174882X

[3] Factor graphs and the sum-product algorithm [J].

Kschischang, FR ;

Frey, BJ ;

Loeliger, HA .

IEEE TRANSACTIONS ON INFORMATION THEORY, 2001, 47 (02) :498-519

[4]

PALANKI R, 2001, P 39 ALL C COMM CONT

[5] A rate-splitting approach to the Gaussian multiple-access channel [J].

Rimoldi, B ;

Urbanke, R .

IEEE TRANSACTIONS ON INFORMATION THEORY, 1996, 42 (02) :364-375

← 1 →