构造OCDMA系统中任意要求的所有码族的算法
An Algorithm for Constructing All Families of Codes of Arbitrary Requirement in an OCDMA System
摘要：
提出了一种新的码构造算法，用于在光码分多址（OCDMA）系统中寻找所有可能的码族进行码重构。该算法是通过搜索一个已构造图的所有完全子图来实现的。该算法灵活、实用，可用于构造任意要求的光正交码。仿真结果表明，为了在合理的代价下获得足够数量的码族进行码重构，需要选择合适的码长。
英文摘要：
A novel code construction algorithm is presented to find all the possible code families for code reconfiguration in an OCDMA system. The algorithm is developed through searching all the complete subgraphs of a constructed graph. The proposed algorithm is flexible and practical for constructing optical orthogonal codes (OOCs) of arbitrary requirement. Simulation results show that one should choose an appropriate code length in order to obtain sufficient number of code families for code reconfiguration with reasonable cost.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
