Referenced Items are not available for this document.
Optical orthogonal codes (OOCs) are commonly used as signature codes for optical code-division multiple-access (OCDMA) communication systems. Many OOCs have been proposed and investigated. Asynchronous OCDMA systems using conventional OOCs have a very limited number of subscribers and few simultaneous users. Recently, we reported a new code family with large code size by relaxing the crosscorrelation constraint to 2. In this paper, by further loosening the crosscorrelation constraint, we adopt the random greedy algorithm to construct a code family which has larger code size and more simultaneous users. We also derive an upper bound of the number of simultaneous users for a given code length, code weight, and bit error rate. The study shows that it is possible to have codes approaching this bound.
Published in:
Lightwave Technology, Journal of
(Volume:21
,
Issue:
3
)
Date of Publication: March 2003
- Page(s):
- 735 - 742
- ISSN :
- 0733-8724
- INSPEC Accession Number:
- 7616943
- Digital Object Identifier :
- 10.1109/JLT.2003.809547
- Product Type:
- Journals & Magazines
- Date of Current Version :
- 07 May 2003
- Issue Date :
- March 2003
- Sponsored by :
- IEEE Aerospace and Electronic Systems Society
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
