Modified Synchronous Square Prime Code for SAC-OCDMA Systems Using New Partial Balanced Detection Technique

Pengfei Tan, Ye Lu, Huili Zhou, Yao Peng, Fan Gao, Chuanqi Li
{"title":"Modified Synchronous Square Prime Code for SAC-OCDMA Systems Using New Partial Balanced Detection Technique","authors":"Pengfei Tan, Ye Lu, Huili Zhou, Yao Peng, Fan Gao, Chuanqi Li","doi":"10.1109/ICSENG.2018.8638172","DOIUrl":null,"url":null,"abstract":"In this paper, we have proposed a new code families for spectral amplitude coding optical code division multiple access (SAC-OCDMA) systems. It is referred as modified synchronous square prime code (MSSPC).The proposed new code with ideal in-phase cross-correlation (IPCC) is obtained by modifying the former code. the proposed new partial balanced detection technique utilizing MSSPC can eliminate multiple access interference (MAI) and inhibit phase induced intensity noise (PIIN).Our results show that the code length required by MSSPC is the shortest compared to multi-diagonal (MD) code, zero cross-correlation (ZCC) code, enhanced multi diagonal (EMD) code and generalized matrix partitioning code (GMPC) when to support the same number of users. Under the same conditions, the bit error rate (BER) of the MSSPC system will decrease as the increase of the code weight or the number of mapping. For identical weight and similar code length, MSSPC can support more active users as compared with partitioned diagonal code (PDC).","PeriodicalId":356324,"journal":{"name":"2018 26th International Conference on Systems Engineering (ICSEng)","volume":"22 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 26th International Conference on Systems Engineering (ICSEng)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICSENG.2018.8638172","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

In this paper, we have proposed a new code families for spectral amplitude coding optical code division multiple access (SAC-OCDMA) systems. It is referred as modified synchronous square prime code (MSSPC).The proposed new code with ideal in-phase cross-correlation (IPCC) is obtained by modifying the former code. the proposed new partial balanced detection technique utilizing MSSPC can eliminate multiple access interference (MAI) and inhibit phase induced intensity noise (PIIN).Our results show that the code length required by MSSPC is the shortest compared to multi-diagonal (MD) code, zero cross-correlation (ZCC) code, enhanced multi diagonal (EMD) code and generalized matrix partitioning code (GMPC) when to support the same number of users. Under the same conditions, the bit error rate (BER) of the MSSPC system will decrease as the increase of the code weight or the number of mapping. For identical weight and similar code length, MSSPC can support more active users as compared with partitioned diagonal code (PDC).
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于新的部分平衡检测技术的SAC-OCDMA系统改进同步平方素数码
本文提出了一种用于光谱幅度编码光码分多址(SAC-OCDMA)系统的新码族。它被称为修改同步平方素数码(MSSPC)。通过对原码的改进,得到了具有理想同相相互关的新码。利用MSSPC的部分平衡检测技术可以消除多址干扰(MAI)和相位诱导强度噪声(PIIN)。结果表明,在支持相同数量的用户时,MSSPC所需的码长比多对角码(MD)、零互相关码(ZCC)、增强型多对角码(EMD)和广义矩阵划分码(GMPC)最短。在相同的条件下,MSSPC系统的误码率(BER)会随着码权或映射次数的增加而降低。在相同的权值和相似的码长下,MSSPC比PDC (partitioning diagonal code)支持更多的活跃用户。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Essential Skill of Enterprise Architect Practitioners for Digital Era Power usage optimization in multi-UAV common-mission cooperative UAS systems A New Novel Improved Technique for PAPR Reduction in OFDM System Performance Investigation of a PV Emulator Using Current Source and Diode String ICSEng 2018 Preface
×
引用
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