Proposal for One Dimensional Optical Orthogonal Codes: Design, Analysis, & Algorithm

R. Chauhan, Ratenesh Kumar, M. Shukla, Ashutosh Kumar Sigh, G. Bagaria
{"title":"Proposal for One Dimensional Optical Orthogonal Codes: Design, Analysis, & Algorithm","authors":"R. Chauhan, Ratenesh Kumar, M. Shukla, Ashutosh Kumar Sigh, G. Bagaria","doi":"10.1109/CSNT.2011.110","DOIUrl":null,"url":null,"abstract":"In this paper, an algorithm is proposed to design maximum possible sets of one dimensional orthogonal codes of given code length 'n', code weight 'w', auto-correlation constraint a λ_a and cross-correlation constraint c λ_c. Each set consists of number of unipolar orthogonal codes up to maximum limit given by Johnson bounds. Here, each of the designed sets of unipolar orthogonal codes is independent of other sets of unipolar orthogonal codes of same length, same weight, and with same or different number of codes. The results of the proposed algorithm are being compared with other one dimensional optical orthogonal code generation schemes presented in literatures. The unipolar orthogonal codes of any of the designed sets can be utilized for generation of optical signature sequences for assignment to users of Incoherent Optical Code Division Multiple Access (OCDMA) system for the purpose of spread spectrum communication over optical fiber.","PeriodicalId":294850,"journal":{"name":"2011 International Conference on Communication Systems and Network Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Communication Systems and Network Technologies","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CSNT.2011.110","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

In this paper, an algorithm is proposed to design maximum possible sets of one dimensional orthogonal codes of given code length 'n', code weight 'w', auto-correlation constraint a λ_a and cross-correlation constraint c λ_c. Each set consists of number of unipolar orthogonal codes up to maximum limit given by Johnson bounds. Here, each of the designed sets of unipolar orthogonal codes is independent of other sets of unipolar orthogonal codes of same length, same weight, and with same or different number of codes. The results of the proposed algorithm are being compared with other one dimensional optical orthogonal code generation schemes presented in literatures. The unipolar orthogonal codes of any of the designed sets can be utilized for generation of optical signature sequences for assignment to users of Incoherent Optical Code Division Multiple Access (OCDMA) system for the purpose of spread spectrum communication over optical fiber.
一维光正交码的设计、分析与算法
给出了给定码长n、码权w、自相关约束a λ_a和互相关约束c λ_c的一维正交码的最大可能集的设计算法。每一集合由若干个单极性正交码组成,这些码的最大极限由Johnson界给出。在这里,每一组设计的单极正交码与其他相同长度、相同权值、相同或不同码数的单极正交码是独立的。将该算法的结果与文献中提出的其他一维光正交码生成方案进行了比较。任一设计集的单极正交码均可用于生成光签名序列,分配给光纤扩频通信的非相干光码分多址(OCDMA)系统的用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信