A clique-based online algorithm for constructing optical orthogonal codes

作     者：Zhang, Yuan Peng, Mao Yang, Shengxiang 

作者机构：Nanjing Univ Informat Sci & Technol Sch Math & Stat Nanjing 210044 Jiangsu Peoples R China De Montfort Univ Sch Comp Sci & Informat CCI Leicester LE1 9BH Leics England 

出 版 物：《APPLIED SOFT COMPUTING》 (应用软计算)

年 卷 期：2016年第47卷第0期

页      面：21-32页

核心收录：

学科分类：08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：National Natural Science Foundation of China (NSFC) [11401317, 11126291] Nanjing University of Information Science and Technology [2012x021] Engineering and Physical Sciences Research Council (EPSRC) of U. K. [EP/K001310/1] EPSRC [EP/K001310/1] Funding Source: UKRI 

主　　题：Optical orthogonal codes Evolutionary algorithm Maximum clique problem Online algorithm 

摘      要：An optical orthogonal code (OOC) is a family of binary sequences with good auto- and cross-correlation properties. In the literature, various mathematical tools have been used to construct OOCs with specific parameters. But, to find a complete solution for constructing OOCs with an arbitrary setting of parameters is still difficult at the moment. In this paper, a clique-based online algorithm is proposed to construct OOCs of relatively large sizes. In the proposed algorithm, the construction of OOCs is reduced to the maximum clique problem based on specially generated graphs, where vertices represent the codewords of an OOC and edges represent the cross-correlation relationships between codeword pairs. In order to overcome the limitation of computer memory for storing large graphs, part of the graph vertices are supposed to arrive sequentially to be fed into the proposed algorithm, and a specially designed evolutionary algorithm is used to find the maximum clique of the current graph when new vertices arrive. The proposed algorithm does not use parameter-specific techniques and hence can be used for different code weight and correlation constraints. Experiments show that the proposed algorithm outperforms an offline evolutionary algorithm with guided mutation on constructing OOCs. (C) 2016 Elsevier B.V. All rights reserved.