Wavelength/time multiple-pulses-per-row codes: construction and verification

2006 IFIP International Conference on Wireless and Optical Communications Networks Pub Date : 2006-08-07 DOI:10.1109/WOCN.2006.1666640
E. Shivaleela, T. Srinivas
{"title":"Wavelength/time multiple-pulses-per-row codes: construction and verification","authors":"E. Shivaleela, T. Srinivas","doi":"10.1109/WOCN.2006.1666640","DOIUrl":null,"url":null,"abstract":"Two dimensional optical orthogonal codes (OOCs) named wavelength/time multiple-pulses-per-row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in E.S. Shivaleela et al., (2005). In this paper, we report the construction of W/T MPR codes, using greedy algorithm (GA), with distinct 1-D OOCs as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab","PeriodicalId":275012,"journal":{"name":"2006 IFIP International Conference on Wireless and Optical Communications Networks","volume":"3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-08-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IFIP International Conference on Wireless and Optical Communications Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOCN.2006.1666640","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Two dimensional optical orthogonal codes (OOCs) named wavelength/time multiple-pulses-per-row (W/T MPR) codes suitable for use in incoherent fiber-optic code division multiple access (FO-CDMA) networks are reported in E.S. Shivaleela et al., (2005). In this paper, we report the construction of W/T MPR codes, using greedy algorithm (GA), with distinct 1-D OOCs as the row vectors. We present the W/T MPR codes obtained using the GA. Further, we verify the correlation properties of the generated W/T MPR codes using Matlab
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
波长/时间每行多脉冲码:构造和验证
E.S. Shivaleela等人(2005)报道了适用于非相干光纤码分多址(FO-CDMA)网络的二维光正交码(OOCs)，称为波长/时间每行多脉冲(W/T MPR)码。在本文中，我们报告了用贪婪算法(GA)构造以不同的1-D ooc作为行向量的W/T MPR码。本文给出了用遗传算法得到的W/T MPR码。进一步，我们使用Matlab验证了生成的W/T MPR代码的相关特性
本文章由计算机程序翻译，如有差异，请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
2006 IFIP International Conference on Wireless and Optical Communications Networks
2006 IFIP International Conference on Wireless and Optical Communications Networks
自引率
0.00%
发文量
0
期刊最新文献
Design and analysis of secure transmission of IP over DVB-S/RCS satellite systems Performance analysis of cross layer AODV for heterogeneously powered ad-hoc networks A circular layer location management scheme for mobile adhoc networks Lessons learned from long-term micro-browser software architecture evolution A simulation study on the stability-oriented routing protocols for mobile ad hoc networks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们：info@booksci.cn
Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1