Spectral classification and multiplicative partitioning of constant-weight sequences based on circulant matrix representation of optical orthogonal codes

  • Authors:

  • Mohammad M. Alem-Karladani;Jawad A. Salehi

  • Affiliations:

  • Optical Networks Research Laboratory, Advanced Communications Research Institute, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran;Optical Networks Research Laboratory, Advanced Communications Research Institute, Electrical Engineering Department, Sharif University of Technology, Tehran, Iran

  • Venue:
  • IEEE Transactions on Information Theory
  • Year:
  • 2010

Quantified Score

Hi-index 754.84

Visualization

Abstract

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, λa, λc)-OOC.