Differential phase-shift keying (DPSK) has been widely implemented and developed in high-speed optical communication systems. The low error rate detection at high access rate is one of the considerable issues in practical engineering application. Balanced detection based on fiber Mach-Zehnder delay interferometer (MZDI) is the typical optical DPSK signal detecting method. It requires that the free spectrum range (FSR) of the MZDI equals the reciprocal of symbol period of the DPSK signal. For the reasons of ambient temperature variation and nonlinear phase noise, a dynamic frequency offset always exists between the FSR and the reciprocal of symbol period. That may introduce some optical signal-to-noise ratio (OSNR) costs and fault detections. Therefore, it is significant to inhibit the frequency offset on DPSK detection. In this paper, firstly, we discuss the effects of frequency offset on DPSK detection, and realize the conclusion that frequency offset is virtually equivalent to an additional phase difference between adjacent symbols. Secondly, through simulation, we analyze the feasibility of DPSK detection in the presence of a definite range of frequency offset, and present the quantitative computation of effective coverage, duty cycle, and optimal sampling time of symbol interference. Some issues which should be considered in practical implementation are also discussed. Finally, according to the relationship among phase difference, temperature and voltage, we propose a phase difference compensation scheme which can automatically adjust the voltage for optimal detections, and dynamically track the changing of ambient temperature and nonlinear phase noise. Furthermore, we ascertain the performance of the voltage requested for implementing the scheme. The scheme can be also developed to quadrature phase-shift keying (QPSK) and differential QPSK (DQPSK) modulation situations.
Image registration is an important step of many practical problems, such as image fusion, image analysis and image
inlaying. This paper proposes and implements an automatic image registration algorithm with high precision based on
character points as well as its corresponding parallel algorithm. The algorithm applies Forstner arithmetic operator to
pick up character points and for the first time uses local normalized mutual information to search their matching points.
The normalized mutual information is computed using highly precise Parzen window method. Then single-point least
square method is employed to search the matching points precisely, which are used together with the character points to
compute the transformation parameters. Then the algorithm uses quadratic polynomial transformation to register the
images. Based on the analysis of performance of the serial algorithm, the paper proposes and implements its
corresponding parallel algorithm. The algorithm parallelizes each step according to its characteristic and gives the
strategy of data distribution. The experimental results show that the parallel algorithm gets high efficiency and thus has
good scalability and applicability.
Access to the requested content is limited to institutions that have purchased or subscribe to SPIE eBooks.
You are receiving this notice because your organization may not have SPIE eBooks access.*
*Shibboleth/Open Athens users─please
sign in
to access your institution's subscriptions.
To obtain this item, you may purchase the complete book in print or electronic format on
SPIE.org.
INSTITUTIONAL Select your institution to access the SPIE Digital Library.
PERSONAL Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.