The problem of optimal symbol detection in the presence of laser phase noise is studied, for uncoded polarization-multiplexed fiber-optic transmission. To this end, the maximum a posteriori (MAP) symbol detector is presented. Specifically, it is emphasized that obtaining phase-noise point estimates, and treating them as the true values of the phase noise, is in general suboptimal. Furthermore, a pilot-based algorithm that approximates the MAP symbol detector is developed, using approaches adopted from the wireless literature. The algorithm performs joint-polarization phase-noise estimation and symbol detection, for arbitrary modulation formats. Through Monte Carlo simulations, the algorithm is compared to existing solutions from the optical communications literature. It is demonstrated that joint-polarization processing can significantly improve upon the single-polarization case, with respect to linewidth tolerance. Finally, it is shown that with less than 3% pilot overhead the algorithm can be used with lasers having up to 6 times larger linewidths than the most well-performing blind algorithms can tolerate.

Skapa referens, olika format (klipp och klistra)

BibTeX @article{Alfredsson2016,author={Alfredsson, Arni and Krishnan, R. and Agrell, Erik},title={Joint-Polarization Phase-Noise Estimation and Symbol Detection for Optical Coherent Receivers},journal={Journal of Lightwave Technology},issn={0733-8724},volume={34},issue={18},pages={4394-4405},abstract={The problem of optimal symbol detection in the presence of laser phase noise is studied, for uncoded polarization-multiplexed fiber-optic transmission. To this end, the maximum a posteriori (MAP) symbol detector is presented. Specifically, it is emphasized that obtaining phase-noise point estimates, and treating them as the true values of the phase noise, is in general suboptimal. Furthermore, a pilot-based algorithm that approximates the MAP symbol detector is developed, using approaches adopted from the wireless literature. The algorithm performs joint-polarization phase-noise estimation and symbol detection, for arbitrary modulation formats. Through Monte Carlo simulations, the algorithm is compared to existing solutions from the optical communications literature. It is demonstrated that joint-polarization processing can significantly improve upon the single-polarization case, with respect to linewidth tolerance. Finally, it is shown that with less than 3% pilot overhead the algorithm can be used with lasers having up to 6 times larger linewidths than the most well-performing blind algorithms can tolerate.},year={2016},keywords={Coherent detection; digital signal processing; optical fiber communication; phase noise},}

RefWorks RT Journal ArticleSR ElectronicID 243997A1 Alfredsson, ArniA1 Krishnan, R.A1 Agrell, ErikT1 Joint-Polarization Phase-Noise Estimation and Symbol Detection for Optical Coherent ReceiversYR 2016JF Journal of Lightwave TechnologySN 0733-8724VO 34IS 18SP 4394OP 4405AB The problem of optimal symbol detection in the presence of laser phase noise is studied, for uncoded polarization-multiplexed fiber-optic transmission. To this end, the maximum a posteriori (MAP) symbol detector is presented. Specifically, it is emphasized that obtaining phase-noise point estimates, and treating them as the true values of the phase noise, is in general suboptimal. Furthermore, a pilot-based algorithm that approximates the MAP symbol detector is developed, using approaches adopted from the wireless literature. The algorithm performs joint-polarization phase-noise estimation and symbol detection, for arbitrary modulation formats. Through Monte Carlo simulations, the algorithm is compared to existing solutions from the optical communications literature. It is demonstrated that joint-polarization processing can significantly improve upon the single-polarization case, with respect to linewidth tolerance. Finally, it is shown that with less than 3% pilot overhead the algorithm can be used with lasers having up to 6 times larger linewidths than the most well-performing blind algorithms can tolerate.LA engDO 10.1109/jlt.2016.2593981LK http://dx.doi.org/10.1109/jlt.2016.2593981OL 30