Scheduled System Maintenance:
On May 6th, single article purchases and IEEE account management will be unavailable from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). We apologize for the inconvenience.
By Topic

Construction of 2n prime-sequence codes for optical code division multiple access

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $31
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Kwong, W.C. ; Dept. of Eng., Hofstra Univ., Hempstead, NY, USA ; Yang, G.-C.

The construction of a special family of 2n codes, so-called `2n prime-sequence' codes, for optical code division multiple access (CDMA) has recently been investigated. Since the codes pose the algebraic properties of the prime-sequence and 2n codes, those optical coding architectures, which are especially designed for either of the two codes, can be jointly employed to optimally cope with various constraints (e.g. power budget and cost) imposed by the systems using optical CDMA. As a result, an optical coding architecture, which is particularly attractive for ultrafast optical signal processing and waveguide implementation for the future, high capacity all-optical CDMA networks with potentially 3 dB ideal power ideal, has been proposed. However, the cardinality of the codes is very limited and shown to approach zero when the code weight is sufficiently large. A generalised family of 2n prime-sequence codes, which has the same cardinality as the original prime-sequence codes, is constructed and supported with complete mathematical proofs

Published in:

Communications, IEE Proceedings-  (Volume:142 ,  Issue: 3 )