Pilot-aided carrier phase recovery for M-QAM using superscalar parallelization based PLL

In this paper, we present a carrier phase recovery (CPR) algorithm using a modified superscalar parallelization based phase locked loop (M-SSP-PLL) combined with a maximum-likelihood (ML) phase estimation. Compared to the original SSP-PLL, M-SSP-PLL + ML reduces the required buffer size using a nove...

Full description

Saved in:
Bibliographic Details
Published in:Optics express Vol. 20; no. 17; p. 19599
Main Authors: Zhuge, Qunbi, Morsy-Osman, Mohamed, Xu, Xian, Mousa-Pasandi, Mohammad E., Chagnon, Mathieu, El-Sahn, Ziad A., Plant, David V.
Format: Journal Article
Language:English
Published: United States 13.08.2012
Subjects:
Algorithms
Feedback
Optical Devices
Signal Processing, Computer-Assisted
Telecommunications
ISSN:1094-4087, 1094-4087
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:In this paper, we present a carrier phase recovery (CPR) algorithm using a modified superscalar parallelization based phase locked loop (M-SSP-PLL) combined with a maximum-likelihood (ML) phase estimation. Compared to the original SSP-PLL, M-SSP-PLL + ML reduces the required buffer size using a novel superscalar structure. In addition, by removing the differential coding/decoding and employing ML phase recovery it also improves the performance. In simulation, we show that the laser linewidth tolerance of M-SSP-PLL + ML is comparable to blind phase search (BPS) algorithm, which is known to be one of the best CPR algorithms in terms of performance for arbitrary QAM formats. In 28 Gbaud QPSK (112 Gb/s) and 16-QAM (224 Gb/s), and 7 Gbaud 64-QAM (84 Gb/s) experiments, it is also demonstrated that M-SSP-PLL + ML can increase the transmission distance by at least 12% compared to BPS for each of them. Finally, the computational complexity is discussed and a significant reduction is shown for our algorithm with respect to BPS.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1094-4087
1094-4087
DOI:10.1364/OE.20.019599