Search

A class of generalized optical orthogonal codes (OOCs), namely, frame time-hopping (FTH) patterns with an extremely large cardinality, are studied for implementing multirate and multiservice (MR/MS) optical CDMA (OCDMA) networks. Conventional MR/MS methods, namely variable spreading rate and parallel mapping, are considered. Using FTH patterns, the problem of low OOC code cardinality in conventional MR/MS schemes is removed. Moreover, several new multicode methods, using subcode concatenation scheme, are proposed for MR/MS OCDMA. The proposed multicode schemes present flexibility for supporting MR/MS applications such as lower implementation complexity and cost, less need for service synchronization, and finally lower link power budget. Multiple-access performances of the systems are evaluated using saddle-point approximation methods considering photodetector shot-noise, dark current, and circuit thermal noise. The results show that the conventional parallel mapping outperforms the other schemes in high received powers, and the proposed multicode method, using Walsh subcode along with difference modulation, presents the best performance in low received powers for the cases considered. Index Terms--Frame time-hopping (FTH), multicode, multirate (MR), multiservice (MS), optical CDMA, optical orthogonal codes (OOCs), parallel mapping, subcode concatenation, variable spreading rate, Walsh code.

In this paper, a new spreading technique for intensity modulation direct detection fiber-optic code-division multiple-access (FO-CDMA) communication systems is proposed. This new spreading technique is based on generalized optical orthogonal codes (OOC) with large cardinality and minimal degradation in performance when compared with a more optimum system, namely, an optical CDMA system using OOC with autocorrelation and cross-correlation value bounded by one, i.e., OOC ([lambda] = 1). To obtain the performance of such systems, we use a recently introduced communication scheme, namely, frame time-hopping (FTH)-CDMA with random coding. It is discussed that systems with generalized OOC patterns and random time-hopping coding are close in structure and performance. Furthermore, the performance of such systems is near the performance of optical CDMA with optimum but low cardinality OOC ([lambda] = 1), which further renders the practicality of the proposed technique with very large cardinality. Two new receiver structures for FO-CDMA, namely, chip-level detector with optimum comparator threshold and correlation receiver with an electrical hard limiter, are also proposed. Performance analysis for a binary pulse position FTH-FO-CDMA network is considered for the correlation receiver, chip-level detector, correlation receiver with an optical hard limiter, optimum receiver, and the two newly proposed receiver structures. The results also show that a chip-level detector with optimum comparator threshold is superior to a chip-level detector for received low signal powers, and predict that the performance of the correlation receiver with an electrical hard limiter is superior to all other considered receiver structures, e.g., requiring one third of transmission power to achieve a desired bit error rate when compared with other receiver structures. Index Terms--Chip.level detector, frame time-hopping (FTH), optical code-division multiple access (CDMA), optical hard limiter, optical orthogonal codes (OOC).

Line selection (LS), tone selection (TS), and joint tone-line selection (JTLS) partial crosstalk cancellers have been proposed to reduce the online computational complexity of far-end crosstalk (FEXT) cancellers in digital subscriber lines (DSL). However, when the crosstalk profile changes rapidly over time, there is an additional requirement that the partial crosstalk cancellers, particularly the LS and JTLS schemes, should also provide a low preprocessing complexity. This is in contrast to the case for perfect crosstalk cancellers. In this paper, we propose two novel channel matrix inversion methods, the approximate inverse (AI) and reduced inverse (RI) schemes, which reduce the recurrent complexity of the LS and JTLS schemes. Moreover, we propose two new classes of JTLS algorithms, the subsort and Lagrange JTLS algorithms, with significantly lower computational complexity than the recently proposed optimal greedy JTLS scheme. The computational complexity analysis of our algorithms shows that they provide much lower recurrent complexities than the greedy JTLS algorithm, allowing them to work efficiently in very fast time-varying crosstalk environments. Moreover, the analytical and simulation results demonstrate that our techniques are close to the optimal solution from the crosstalk cancellation point of view. The results also reveal that partial crosstalk cancellation is more beneficial in upstream DSL, particularly for short loops.