Minimum probability of error for asynchronous Gaussian multiple-access channels

IEEE Transactions on Information Theory - Tập 32 Số 1 - Trang 85-96 - 1986
Sergio Verdú1
1Department of Electrical Engineering, Princeton University, Princeton, NJ, USA

Tóm tắt

Từ khóa


Tài liệu tham khảo

omura, 0, Performance bounds for Viterbi algorithms, 1981 IEEE Int Commun Conf Rec, 2.21

papadimitrou, 1982, Combinatorial Optimization Algorithms and Complexity

poor, 1980, Signal detection in multiple access channels

proakis, 1983, Digital Communications

10.1109/TCOM.1982.1095553

10.1109/TIT.1974.1055163

10.1109/TAES.1979.308816

10.1109/TCOM.1974.1092267

10.1109/TCOM.1976.1093265

verd�, 1983, Optimum sequence detection of asynchronous multiple-access communications, Abstracts of Papers IEEE 1983 Int Symp Inform Theory

10.1109/PROC.1973.9030

10.1109/TIT.1972.1054829

10.1109/MCOM.1984.1092045

10.1109/TIT.1975.1055333

10.1109/TCOM.1982.1095552

10.1049/el:19800537

10.1109/TCOM.1972.1091101

10.1109/TIT.1981.1056301

10.1109/TCOM.1975.1092796

10.1109/MILCOM.1983.4794684

verd�, 1984, Optimum multi-user signal detection

10.1109/CDC.1984.272179

verd�, 1985, New bound on the error probability of maximum likelihood sequence detection of signals subject to intersymbol interference, Proc 1985 Conf Inform Sci Svst, 413

viterbi, 1979, Principles of Digital Communication and Coding