Cramér-Rao Bounds for Beam Tracking With Photon Counting Detector Arrays in Free-Space Optical Communications
KAUST DepartmentComputer, Electrical and Mathematical Sciences and Engineering (CEMSE) Division
King Abdullah University of Science and Technology (KAUST), Thuwal 23955-6900, Kingdom of Saudi Arabia.
Electrical Engineering Program
Permanent link to this recordhttp://hdl.handle.net/10754/669156
MetadataShow full item record
AbstractOptical beam center position on an array of detectors is an important parameter that is essential for estimating the angle-of-arrival of the incoming signal beam. In this paper, we have examined the beam position estimation problem for photon-counting detector arrays, and to this end, we have derived and analyzed the Cramir-Rao lower bounds on the mean-square error of unbiased estimators of beam position. Furthermore, we have also derived the Cramir-Rao lower bounds of other system parameters such as signal peak intensity, and dark current noise power, on the array. In this sense, we have considered robust estimation of beam position in which none of the parameters are assumed to be known beforehand. Additionally, we have derived the Cramir-Rao lower bounds of beam and noise parameters for observations based on both pilot and data symbols of a pulse position modulation (PPM) scheme. Finally, we have considered a two-step estimation problem in which the signal peak and dark current noise intensities are estimated using a method of moments estimator, and the beam center position is estimated with the help of a maximum likelihood estimato.
CitationBashir, M. S., Tsai, M.-C., & Alouini, M.-S. (2021). Cramér-Rao Bounds for Beam Tracking With Photon Counting Detector Arrays in Free-Space Optical Communications. IEEE Open Journal of the Communications Society, 1–1. doi:10.1109/ojcoms.2021.3078091
SponsorsThis work is supported by Office of Sponsored Research (OSR) at King Abdullah University of Science and Technology (KAUST).
Except where otherwise noted, this item's license is described as This work is licensed under a Creative Commons Attribution 4.0 License.