MULTIPLE-ACCESS CHANNELS WITH POINT-PROCESS OBSERVATIONS: OPTIMUM DEMODULATION.

被引:0
|
作者
Verdu, Sergio [1 ]
机构
[1] Princeton Univ, NJ, USA, Princeton Univ, NJ, USA
来源
| 1600年 / IT-32期
关键词
DEMODULATORS - DIGITAL COMMUNICATION SYSTEMS - LIGHT - Modulators - PROBABILITY;
D O I
暂无
中图分类号
学科分类号
摘要
The derivation and analysis of optimum multiuser detectors for additive-rate and additive-light Poisson multiple-access channels are studied. The observed point process models the output of an ideal photodetector illuminated by several synchronous or asynchronous users who modulate coherent light of the same frequency. Dynamic-programming-based decision rules for the asynchronous multiple-access channel exhibit the same computational complexity as their synchronous counterparts and are shown to be optimum under the criteria of minimum error probability and maximum-likelihood sequence detection. Upper and lower bounds on the minimum uncoded bit error rate achievable with arbitrary signal constellations are obtained. A particular case, namely, the single-user finite-length intersymbol interference problem, solves the error rate analysis of optimum direct-detection systems for dispersive optical fibers, is presented.
引用
收藏
相关论文
共 50 条
  • [31] SEPARATION THEOREM FOR STOCHASTIC CONTROL PROBLEMS WITH POINT-PROCESS OBSERVATIONS
    SNYDER, DL
    RHODES, IB
    HOVERSTEN, EV
    AUTOMATICA, 1977, 13 (01) : 85 - 87
  • [32] Neural network approaches to implementation of optimum multiuser detectors in code-division multiple-access channels
    He, GQ
    Tang, PY
    Pang, XZ
    INTERNATIONAL JOURNAL OF ELECTRONICS, 1996, 80 (03) : 425 - 431
  • [33] Keyless Covert Communication over Multiple-Access Channels
    Arumugam, Keerthi Suria Kumar
    Bloch, Matthieu R.
    2016 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2016, : 2229 - 2233
  • [35] Cooperative Multiple-Access Channels With Distributed State Information
    Miretti, Lorenzo
    Kobayashi, Mari
    Gesbert, David
    De Kerret, Paul
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2021, 67 (08) : 5185 - 5199
  • [36] A coding theorem for multiple-access decorrelating channels.
    Medard, M
    1998 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 1998, : 215 - 215
  • [37] Achievable rates for multiple-access channels with correlated messages
    Pradhan, SS
    Choi, S
    Ramchandran, K
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 108 - 108
  • [38] A MODULO-LATTICE TRANSFORMATION FOR MULTIPLE-ACCESS CHANNELS
    Erez, Uri
    Zamir, Ram
    2008 IEEE 25TH CONVENTION OF ELECTRICAL AND ELECTRONICS ENGINEERS IN ISRAEL, VOLS 1 AND 2, 2008, : 816 - 820
  • [39] Fading Cognitive Multiple-Access Channels With Confidential Messages
    Liu, Ruoheng
    Liang, Yingbin
    Poor, H. Vincent
    2009 47TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, VOLS 1 AND 2, 2009, : 371 - +
  • [40] Resource allocation for the multiple-access relay channels and OFDMA
    Schedler, Stephan
    Kuehn, Volker
    EURASIP JOURNAL ON ADVANCES IN SIGNAL PROCESSING, 2013,