A minor component analysis approach based on the generalized sidelobe canceler is presented to realize the blind suppression of multiple-access interference in multicarrier code division multiple access systems. With a rough user-code and timing estimations, this proposed method of less computation performs the same as minimum mean square error detectors and outperforms existing blind detectors. Simulation results illustrate the effectiveness of the blind multiuser detection.

This Letter proposes a way of resolving spreading code mismatch in blind multiuser detection with subspace-based technique. It has been shown that subspace-based (SSB) blind multiuser detectors demonstrate the advantages of fast convergence speed and less sensitivity to spreading code mismatch over constrained mean output energy (CMOE) detectors. With a corrected scheme of the desired user code, the proposed method offers more robust capabilities over existing SSB techniques. Numerical results show that the effectiveness of the proposed technique.

Two simple frequency offset estimators based on projection approaches for multicarrier code-division multiple access systems are proposed, without using specific training sequences. It is not only can estimate and correct frequency offset, but also has less computational load. Several computer simulations are provided for illustrating the effectiveness of the blind estimate approaches.

In this letter, we present a normalized least-mean-square algorithm of blind estimator for carrier frequency offset estimation of orthogonal frequency division multiplexing systems. In conjunction with the closed-loop estimate structure, the proposed efficient algorithm eliminates the inter-carrier interference for time varying carrier frequency offset. The proposed algorithm offers faster convergence speed and more accuracy to the carrier frequency offset estimate. Several computer simulation examples are presented for illustrating and effectiveness of the proposed algorithm.

This work proposes a distributed fault protection mechanism called the Dynamic-Shared Segment Protection (DSSP) algorithm for WDM (Wavelength Division Multiplexing) mesh networks. The objects are to assure high probability of path protection and efficient use of network resources. The proposed approach exploits the segment protection mode, which accommodates the characteristics of both path-based and link-based protections, for providing finer service granularities, to satisfy the versatile requirements of critical applications in the foreseeable future. To show that DSSP can improve performance efficiency, simulations are conducted using four networks (NSFNET, USANET, Mesh 66, Mesh 99) for a comparative study of the proposed DSSP versus ordinary shared protection schemes and SLSP (Short Leap Shared Protection). Simulation results reveal that the proposed DSSP method results in much lower blocking probability and has higher network utilization. Consequently, it is very useful for applications to a real-time WDM network, which changes status dynamically.