A greedy algorithm for deriving Optical Orthogonal Codes using rejected delays reuse Conference Paper

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. 2005 IEEE.

name of conference

• GLOBECOM '05. IEEE Global Telecommunications Conference, 2005.

authors

• Alnuweiri, Hussein

published proceedings

• GLOBECOM '05: IEEE Global Telecommunications Conference, Vols 1-6

author list (cited authors)

• Khattab, T., & Alnuweiri, H.

citation count

• 1

complete list of authors

• Khattab, T||Alnuweiri, H

publication date

• January 2005

publisher

• Institute of Electrical and Electronics Engineers (IEEE)  Publisher

Digital Object Identifier (DOI)

• 10.1109/glocom.2005.1578005

International Standard Book Number (ISBN) 10

• 0-7803-9414-3

International Standard Book Number (ISBN) 13

• 9780780394148

start page

• 1942

end page

• 1946

volume

• 4

URL

• http%3A%2F%2Fdx.doi.org%2F10.1109%2Fglocom.2005.1578005