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

Adaptive algorithms for a two-channel structure employing allpass filters, with applications to polarization mode dispersion compensation

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

1 Author(s)
Morgan, D.R. ; Bell Labs., Murray Hill, NJ, USA

A two-channel structure consisting of multiple cascades of allpass filters and directional couplers has certain desirable attributes. This paper considers adaptive algorithms for adjusting the parameters of such systems. The exemplary algorithms are motivated by an application to the compensation of polarization mode dispersion, which is a key problem in fiber optic systems. Gradient algorithms are shown to exhibit extremely slow convergence. This problem is solved by deriving a Newton-type algorithm. However, possible convergence to a local minimum emerges as a more fundamental problem. One of the conditions for local minima is specifically identified in terms of problematic parameter states.

Published in:

Circuits and Systems I: Regular Papers, IEEE Transactions on  (Volume:51 ,  Issue: 9 )

Date of Publication:

Sept. 2004

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.