Gradient estimation for stochastic optimization of optical code-division multiple-access systems. II. Adaptive detection

For pt.I see ibid., vol.15, no.4, p.731-41 (1997). We develop infinitesimal perturbation analysis (IPA)-based stochastic gradient algorithms for deriving optimum detectors with the average probability of bit error being the objective function that is minimized. Specifically, we develop both a class...

Full description

Saved in:
Bibliographic Details
Published in:IEEE journal on selected areas in communications Vol. 15; no. 4; pp. 742 - 750
Main Authors: Mandayam, N.B., Aazhang, B.
Format: Journal Article
Language:English
Published: IEEE 01.05.1997
Subjects:
ISSN:0733-8716
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:For pt.I see ibid., vol.15, no.4, p.731-41 (1997). We develop infinitesimal perturbation analysis (IPA)-based stochastic gradient algorithms for deriving optimum detectors with the average probability of bit error being the objective function that is minimized. Specifically, we develop both a class of linear as well as nonlinear (threshold) detectors. In the linear scheme, the receiver despreads the received optical signal with a sequence that minimizes the average bit-error rate. In the case of the threshold detector, the detection threshold for the photoelectron count is optimized to achieved minimum average bit-error rate. These algorithms use maximum likelihood estimates of the multiple access interference based on observations of the photoelectron counts during each bit interval, and alleviate the disadvantage of previously proposed schemes that require explicit knowledge of the interference statistics. Computer-aided implementations of the detectors derived are shown to outperform the correlation detector. Sequential implementations of the adaptive detectors that require no preamble are also developed, and make them very viable detectors for systems subject to temporal variations.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
ISSN:0733-8716
DOI:10.1109/49.585784