Abstract
Optical code division multiple access (OCDMA) has wide applications in the next optical access network. One of its key techniques is construction of address code. Aiming at the facts that most of constructing algorithm of optical orthogonal code (OOC) are based on inner-product representation of OOC, they can only construct certain parameters OOC, and the cardinality of (F, K, 1) OOC is small. It can not meet the requirement of optical networks. In this paper, an algorithm of constructing (F, K, λa, 1) OOC based on outer-product matrix is presented and simulated; some groups of (F, K, λa, 1) OOC are obtained. The results show that the algorithm can construct arbitrary code length, code weight and auto-correlation λa (F, K, λa, 1) OOC codes with cardinality closer to the Johnson upper bound, it can construct (F, K, λa, 1) OOC effectively. It is feasible.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
