arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1309.0193cs.ITmath.IT
收藏

最小相关、最大团一维单极性(光)正交码集合的设计

Design of Minimum Correlated, Maximal Clique Sets of One-Dimensional Uni-polar (Optical) Orthogonal Codes

Ram Chandra Singh Chauhan, Yatindra Nath Singh, Rachna Asthana

AI总结:

本文提出一种搜索最小相关一维单极性光正交码多集合的算法,每个集合基数达上界且形成最大团,适用于非相干光CDMA系统频谱扩展。

摘要:

本文提出了一种算法,用于搜索一族具有固定及可变码参数的最小相关一维单极性(光)正交码(1-DUOC)或光正交码(OOC)的多集合。每个集合的基数等于上界。对于码长、码重、自相关约束和互相关约束的一般值,可以搜索集合内的码。每个集合在给定的相关特性范围内形成码的最大团。这些一维单极性正交码可作为非相干光码分多址(CDMA)系统中用于频谱扩展的签名序列。

英文摘要:

This paper proposes an algorithm to search a family of multiple sets of minimum correlated one dimensional uni-polar (optical) orthogonal codes (1-DUOC) or optical orthogonal codes (OOC) with fixed as well as variable code parameters. The cardinality of each set is equal to upper bound. The codes within a set can be searched for general values of code length, code weight, auto-correlation constraint and cross-correlation constraint. Each set forms a maximal clique of the codes within given range of correlation properties . These one-dimensional uni-polar orthogonal codes can find their application as signature sequences for spectral spreading purpose in incoherent optical code division multiple access (CDMA) systems.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑