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

Tamer Khattab, Hussein Alnuweiri

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

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.

Original languageEnglish
Title of host publicationGLOBECOM'05
Subtitle of host publicationIEEE Global Telecommunications Conference, 2005
Pages1942-1946
Number of pages5
Volume4
DOIs
Publication statusPublished - 1 Dec 2005
Externally publishedYes
EventGLOBECOM'05: IEEE Global Telecommunications Conference, 2005 - St. Louis, MO, United States
Duration: 28 Nov 20052 Dec 2005

Other

OtherGLOBECOM'05: IEEE Global Telecommunications Conference, 2005
CountryUnited States
CitySt. Louis, MO
Period28/11/052/12/05

Fingerprint

Multiplexing
Wavelength

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Khattab, T., & Alnuweiri, H. (2005). A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005 (Vol. 4, pp. 1942-1946). [1578005] https://doi.org/10.1109/GLOCOM.2005.1578005

A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse. / Khattab, Tamer; Alnuweiri, Hussein.

GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 4 2005. p. 1942-1946 1578005.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Khattab, T & Alnuweiri, H 2005, A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse. in GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. vol. 4, 1578005, pp. 1942-1946, GLOBECOM'05: IEEE Global Telecommunications Conference, 2005, St. Louis, MO, United States, 28/11/05. https://doi.org/10.1109/GLOCOM.2005.1578005
Khattab T, Alnuweiri H. A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse. In GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 4. 2005. p. 1942-1946. 1578005 https://doi.org/10.1109/GLOCOM.2005.1578005
Khattab, Tamer ; Alnuweiri, Hussein. / A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse. GLOBECOM'05: IEEE Global Telecommunications Conference, 2005. Vol. 4 2005. pp. 1942-1946
@inproceedings{9f0e74769fda49da9e7dce5f2fa48f4f,
title = "A greedy algorithm for deriving optical orthogonal codes using rejected delays reuse",
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.",
author = "Tamer Khattab and Hussein Alnuweiri",
year = "2005",
month = "12",
day = "1",
doi = "10.1109/GLOCOM.2005.1578005",
language = "English",
isbn = "0780394143",
volume = "4",
pages = "1942--1946",
booktitle = "GLOBECOM'05",

}

TY - GEN

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

AU - Khattab, Tamer

AU - Alnuweiri, Hussein

PY - 2005/12/1

Y1 - 2005/12/1

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=33846641202&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=33846641202&partnerID=8YFLogxK

U2 - 10.1109/GLOCOM.2005.1578005

DO - 10.1109/GLOCOM.2005.1578005

M3 - Conference contribution

AN - SCOPUS:33846641202

SN - 0780394143

SN - 9780780394148

VL - 4

SP - 1942

EP - 1946

BT - GLOBECOM'05

ER -