Performance Investigation of 2-D Optical Orthogonal Codes for OCDMA

Abstract In this paper, comparative analysis of code performance of dissimilar optical 2-D codes from Optical Orthogonal code family has been studied. Optical 2-D codes considered from OOC family are (n,w,1,2) OOC, SPS/OOC, OCFHC/OOC, EPC/OCS and VWOOC. By utilizing hard limiting error probability (HEP) equations and combinatorial method, code performance of each considered code is evaluated in detail. On the basis of detailed comparative performance analysis, EPC/OCS is concluded as best performing codes among all other optical codes under consideration. EPC/OCS possesses much better correlation properties, along with lower hit probability values which are responsible for its supremacy in performance characteristics to the other OOCs considered.

Download Full-text

Construction and Analysis of Novel 2-D Optical Orthogonal Codes Based on Extended Quadratic Congruence Codes and Modified One-Coincidence Sequence

Journal of Optical Communications ◽

10.1515/joc-2015-0050 ◽

2016 ◽

Vol 37 (2) ◽

Author(s):

Jianhua Ji ◽

Wenjun Li ◽

Hongxia Zheng

Keyword(s):

Prime Number ◽

Two Dimensional ◽

Optical Orthogonal Code ◽

Optical Orthogonal Codes ◽

Orthogonal Codes ◽

Quadratic Congruence ◽

Orthogonal Code

AbstractA new two-dimensional optical orthogonal code (OOC) named EQC/MOCS is constructed, using Extended Quadratic Congruence (EQC) code for time spreading and modified one-coincidence sequence (MOCS) for wavelength hopping. Compared with EQC/Prime code (PC), the number of wavelengths for EQC/MOCS is not limited to a prime number. Compared with EQC/OCS, the length of MOCS need not be expanded to the same length of EQC. EQC/MOCS can be constructed flexibly, and also has larger code cardinality.

Download Full-text

Discussion on Construction of OCDMA PON Address Code-(F,K,2) Optical Orthogonal Codes

Advanced Materials Research ◽

10.4028/www.scientific.net/amr.216.804 ◽

2011 ◽

Vol 216 ◽

pp. 804-808

Author(s):

X.B. Li ◽

H.B. Huang ◽

L.C. Wang

Keyword(s):

Block Design ◽

Optical Network ◽

Access Network ◽

Passive Optical Network ◽

Optical Orthogonal Code ◽

Optical Orthogonal Codes ◽

Orthogonal Codes ◽

Code Division Multiple ◽

Key Techniques ◽

Orthogonal Code

Optical code division multiple access (OCDMA) passive optical network (PON) can find wide applications in the next optical access network. One of its key techniques of is construction of address code. Aiming at the facts that(F,K,1) optical orthogonal code (OOC) possesses good performance but capacity is small, and number of users in OCDMA PON is not very big thereafter OOC auto-correlation or cross-correlation may not be very strict,(F,K,2) OOC can be used as address codes for OCDMA PON. In this paper, the method of constructingOOC based on block design is discussed. The algorithm of construction (F,K,2) of OOC from block design is presented and simulated; several groups of(F,K,2) OOC are gained. The results show that the algorithm has good astringency and simplicity. It can construct(F,K,2) OOC effectively. It is feasible.

Download Full-text

Constructions of Optimal Optical Orthogonal Codes with Weights Set 5,7 via Cyclic Packing

Mathematical Problems in Engineering ◽

10.1155/2022/3368661 ◽

2022 ◽

Vol 2022 ◽

pp. 1-10

Author(s):

Bichang Huang ◽

Dan Luo ◽

Wenxing Zhu

Keyword(s):

Optical Networks ◽

Explicit Construction ◽

Optical Orthogonal Codes ◽

Orthogonal Codes ◽

Code Performance ◽

Variable Weight

Double-weight optical orthogonal codes are variable-weight optical orthogonal codes (OOCs), which have been widely applied in optical networks and systems. Some works have been devoted to optimal n , W , 1 , Q -OOCs with max w : w ∈ W ≤ 6 . So far, there is no explicit construction of optimal n , W , 1 , Q -OOCs with W = 5,7 . It is known that heavier-weight codewords have better code performance than lighter-weight codewords. So, in this paper, we use cyclic packing to construct two infinite classes of optimal OOCs with weights set 5,7 explicitly, for any prime p ≡ 3 mod 4 and p ≥ 7 . In addition, for 1 ≤ t < p − 1 / 2 , by breaking t blocks of size 7 into 3 of 31 p , 5,7 , 1 , 1 / 2 , 1 / 2 -OOCs and 41 p , 5,7 , 1 , 2 / 3 , 1 / 3 -OOCs, we obtain new infinite classes of optimal 31 p , 3,5,7 , 1 , 7 t / p − 1 + 6 t , p − 1 / 2 p − 1 + 6 t , p − 1 − 2 t / 2 p − 1 + 6 t -OOCs and 41 p , 3,5,7 , 1 , 14 t / 3 p − 1 + 4 t , 2 p − 1 / 3 p − 1 + 4 t , p − 1 − 2 t / 3 p − 1 + 4 t -OOCs, respectively.

Download Full-text