Scheduled System Maintenance:
Some services will be unavailable Sunday, March 29th through Monday, March 30th. We apologize for the inconvenience.
By Topic

Spectral Classification and Multiplicative Partitioning of Constant-Weight Sequences Based on Circulant Matrix Representation of Optical Orthogonal Codes

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 $13
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)
Alem-Karladani, M.M. ; Electr. Eng. Dept., Sharif Univ. of Technol., Tehran, Iran ; Salehi, J.A.

Considering the space of constant-weight sequences as the reference set for every optical orthogonal code (OOC) design algorithm, we propose a classification method that preserves the correlation properties of sequences. First, we introduce the circulant matrix representation of optical orthogonal codes and, based on the spectrum of circulant matrices, we define the spectral classification of the set Sn,w of all (0, 1)-sequences with length n, weight w, and the first chip “1”. Then, as a method for spectrally classifying the set Sn,w, we discuss an algebraic structure called multiplicative group action. Using the above multiplicative group action, we define an equivalence relation on Sn,w in order to classify it into equivalence classes called multiplicative partitions which are the same as the spectral classes. The algebraic properties of the proposed partitioning such as the number of classes and the size of each class are investigated and in the case of prime n, a novel formula for the number of classes is derived. Finally, we present and prove the autocorrelation, intraclass and interclass cross-correlation properties of our proposed classification of the space Sn,w that decrease the computational complexity of search algorithms in designing and constructing (n, w, λac)-OOC.

Published in:

Information Theory, IEEE Transactions on  (Volume:56 ,  Issue: 9 )