TY - JOUR
T1 - Gradient estimation for stochastic optimization of optical code-division multiple-access systems
T2 - Part II-adaptive detection
AU - Mandayam, Narayan B.
AU - Aazhang, B.
N1 - Funding Information:
Manuscript received May 5, 1996; revised October 25, 1996. This paper was supported by the Advanced Technology Program of the Texas Higher Education Coordinating Board under Grant 003604-018. This paper was presented in part at the 1994 Conference on Information Sciences and Systems, Princeton University, Princeton, NJ, March 1994.
PY - 1997/5
Y1 - 1997/5
N2 - In this sequel, 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 biterror 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 here 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.
AB - In this sequel, 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 biterror 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 here 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.
KW - Infinitesimal perturbation analysis
KW - Linear detectors
KW - Minimum probability of error detection
KW - Stochastic gradient algorithms
KW - Threshold detectors
UR - http://www.scopus.com/inward/record.url?scp=0031140383&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=0031140383&partnerID=8YFLogxK
U2 - 10.1109/49.585784
DO - 10.1109/49.585784
M3 - Article
AN - SCOPUS:0031140383
SN - 0733-8716
VL - 15
SP - 742
EP - 750
JO - IEEE Journal on Selected Areas in Communications
JF - IEEE Journal on Selected Areas in Communications
IS - 4
ER -