### Abstract

Using a mathematical proof, the authors establish that in element-by-element greedy algorithms based on extended set representation of optical orthogonal codes (OOCs), smaller delay elements rejected during a construction step can be accepted in later steps. They design a novel algorithm that exploits this property and call it the rejected delays reuse (RDR) greedy algorithm. They show that employing the RDR method leads to code lengths that are 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. They then define a quantitative measure (factor) for OOCs efficiency based on its ability to expand subwavelength-switching capacity. They call this factor the expansion efficiency factor. They use this factor to show that reducing the code length, for the same code constraints, enhances the capacity of subwavelength optical code switched networks.

Original language | English |
---|---|

Pages (from-to) | 3280-3287 |

Number of pages | 8 |

Journal | Journal of Lightwave Technology |

Volume | 24 |

Issue number | 9 |

DOIs | |

Publication status | Published - 1 Sep 2006 |

### Fingerprint

### Keywords

- Code design
- Optical code-division multiple access (OCDMA)
- Optical orthogonal code (OOC)
- Subwavelength switching

### ASJC Scopus subject areas

- Atomic and Molecular Physics, and Optics