Abstract
The study of Optical orthogonal code (OOC) is motivated by an application in FO-CDMA communication systems. We propose in this paper to utilize not the position difference but the number of digits between any pair of '1's to denote the OOC. A new combinatorial model describing the process of generating optimal (n, w, 1) OOC is proposed. It is very convenient to be used to construct the OOC with low correlation. Utilizing this model, an alternate proof of Johnson upper bound is derived. A novel search algorithm developed here for finding (n, w, 1) OOC is shown to require much less memory and computing time.
| Original language | English |
|---|---|
| Pages (from-to) | 120-122 |
| Number of pages | 3 |
| Journal | Chinese Journal of Electronics |
| Volume | 15 |
| Issue number | 1 |
| Publication status | Published - Jan 2006 |
| Externally published | Yes |
Keywords
- Autocorrelation
- Combinatorial design
- Cross-correlation
- Johnson upper bound
- Optical orthogonal code