MAP detection for impairment compensation in coherent WDM systems

We propose a novel recursive-algorithm based maximum a posteriori probability (MAP) detector in spectrally-efficient coherent wavelength division multiplexing (CoWDM) systems, and investigate its performance in a 1-bit/s/Hz on-off keyed (OOK) system limited by optical-signal-to-noise ratio. The proposed method decodes each sub-channel using the signal levels not only of the particular sub-channel but also of its adjacent sub-channels, and therefore can effectively compensate deterministic inter-sub-channel crosstalk as well as inter-symbol interference arising from narrow-band filtering and chromatic dispersion (CD). Numerical simulation of a five-channel OOK-based CoWDM system with 10Gbit/s per channel using either direct or coherent detection shows that the MAP decoder can eliminate the need for phase control of each optical carrier (which is necessarily required in a conventional CoWDM system), and greatly relaxes the spectral design of the demultiplexing filter at the receiver. It also significantly improves back-to-back sensitivity and CD tolerance of the system.

Demonstrating doubly-differential quadrature phase shift keying in the optical domain

We report for the first time the experimental demonstration of doubly differential quadrature phase shift keying (DDQPSK) using optical coherent detection. This method is more robust against high frequency offsets (FO) than conventional single differential quadrature phase shift keying (SDQPSK) with offset compensation. DDQPSK is shown to be able to compensate large FOs (up to the baud rate) and has lower computational requirements than other FO compensation methods. DDQPSK is a simple algorithm to implement in a real-time decoder for optical burst switched network scenarios. Simulation results are also provided, which show good agreement with the experimental results for both SDQPSK and DDQPSK transmissions. © 1989-2012 IEEE.

A new fast generalized sphere decoding algorithm in MIMO systems

A new generalized sphere decoding algorithm is proposed for underdetermined MIMO systems with fewer receive antennas N than transmit antennas M. The proposed algorithm is significantly faster than the existing generalized sphere decoding algorithms. The basic idea is to partition the transmitted signal vector into two subvectors x and x with N - 1 and M - N + 1 elements respectively. After some simple transformations, an outer layer Sphere Decoder (SD) can be used to choose proper x and then use an inner layer SD to decide x, thus the whole transmitted signal vector is obtained. Simulation results show that Double Layer Sphere Decoding (DLSD) has far less complexity than the existing Generalized Sphere Decoding (GSDs).