Cart (Loading....) | Create Account
Close category search window

Low complexity non decision directed blind carrier phase recovery algorithm for 16-QAM optical coherent receiver

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

7 Author(s)
Khalil, M.I. ; Dept. of Electr. Eng. & Comput. Sci., North South Univ., Dhaka, Bangladesh ; Adib, M.M.H. ; Chowdhury, A.M. ; Faruk, M.S.
more authors

We propose and demonstrate a low complexity non decision directed blind carrier recovery algorithm (NDD-CRA) for 16-QAM optical coherent receivers. Through optimization of step size parameter (μ), we obtained similar performance compared to decision-directed phase estimation algorithm, however, our propose scheme has less complexity compared to the decision directed carrier recovery algorithm (DD-CRA) as the proposed scheme does not require any decision feedback module. From simulation, it is observed that the proposed scheme has less than 1.7 dB OSNR penalty at 10-3 BER and up to 200-kHz linewidth laser compared with the theoretical performance.

Published in:

Photonics (ICP), 2012 IEEE 3rd International Conference on

Date of Conference:

1-3 Oct. 2012

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.