A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse

TitleA greedy algorithm for deriving optical orthogonal codes using rejected delays reuse
Publication TypeConference Paper
Year of Publication2005
AuthorsKhattab, T., and H. Alnuweiri
Conference NameGlobal Telecommunications Conference, 2005. GLOBECOM '05. IEEE
Pagination1942 -1946
Date Publisheddec.
Keywordscodes, greedy algorithm, greedy algorithms, multiplexing, optical communication, optical orthogonal codes, rejected delays reuse, subwavelength multiplexing
Abstract

This paper proposes a novel algorithm for constructing optical orthogonal codes (OOC). The proposed algorithm is a modified element-by-element greedy algorithm based on the extended set representation of optical orthogonal codes. The algorithm employs a technique that reuses previously rejected delay elements during the construction process. We call this method the rejected delays reuse (RDR) greedy algorithm. We show that employing the RDR method leads to code lengths that are significantly shorter than those achieved for OOCs constructed using the classical greedy algorithm for the same code weight and the same number of simultaneous codes constraints. To quantify the effect of the reduction in the code length on sub-wavelength multiplexing, we introduce a factor called the expansion efficiency factor and use it to show that the RDR generated codes have higher efficiency

URLhttp://dx.doi.org/10.1109/GLOCOM.2005.1578005
DOI10.1109/GLOCOM.2005.1578005

a place of mind, The University of British Columbia

Electrical and Computer Engineering
2332 Main Mall
Vancouver, BC Canada V6T 1Z4
Tel +1.604.822.2872
Fax +1.604.822.5949
Email:

Emergency Procedures | Accessibility | Contact UBC | © Copyright 2021 The University of British Columbia