By Topic

Random optical codes used in optical networks

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

3 Author(s)
Martin-Gonzalez, J.A. ; Dept. of Photonics Technol., Univ. Politec. de Madrid, Madrid ; Poves, E. ; Lopez-Hernandez, F.J.

An analysis of a simple way to design generalised optical orthogonal codes to be used in optical code-division multiple-access systems is presented. They are random optical codes (ROCs). This novel family is especially suitable for optical networks with a large number of channels, low bit rate requirements, energy limitations and packed data. For example, sensor networks need these requirements. An application in an intra-spacecraft telecommand and telemeasurement (TC/TM) optical wireless network is also described. ROCs are selected randomly from all possible rearrangements. However, its probability of error is adequate in many useful parameter ranges. Moreover, ROCs present features not found in other families of codes such as huge cardinality and parameter adaptation to the system necessities. Here, the main contribution is to present a method to optimise the values of the parameters. Furthermore, the optimal weight of the codes is found, given two out of the other set of parameters, that is, the length, the number of users and the probability of error. In addition, a comparison between the length and the power consumption of ROCs and prime codes is also developed.

Published in:

Communications, IET  (Volume:3 ,  Issue: 8 )