...
首页> 外文期刊>Journal of Optical Communications >New Methods to Analyze Bounds of OOC for OCDMA System Based on Optical Code-hoop
【24h】

New Methods to Analyze Bounds of OOC for OCDMA System Based on Optical Code-hoop

机译:基于光码箍的OCDMA系统OOC边界分析新方法

获取原文
获取原文并翻译 | 示例
   

获取外文期刊封面封底 >>

       

摘要

Having excellent quality of correlation and large number of cardinality, optical orthogonal code has become one of the main signature codes for OCDMA system. The main goals of OOC designing are to make MUI as little as possible and cardinality as large as possible. The paper has designed a device standing for OOC, optical code-hoop, which can be used easily to check the correlation of code family. Code-hoop can replace code-pattern made by Salehi, which can only check correlation between two special codes one time. The hoop can check the correlations between all codes in the family at one time. More importantly, based on the code-hoop, the upper bound of code cardinality be acquired from code family itself the code-hoop, instead of introducing Johnson bound of error-correcting code to OCDMA system. In the article, the upper bounds of cardinalities of symmetric, constant-weight OOC (L,w,1) and (L,w,λ) are an-alyzed in detail, and the results are concordant with introducing Johnson bound.
机译:具有优异的相关质量和大量基数,光学正交码已成为OCDMA系统的主要签名码之一。 OOC设计的主要目标是使MUI尽可能少,基数尽可能大。本文设计了一种用于OOC的光学码箍装置,可以轻松地检查代码族的相关性。跳码可以代替Salehi制作的码型,后者只能一次检查两个特殊码之间的相关性。箍可以一次检查家族中所有代码之间的相关性。更重要的是,基于码环,代码基数的上限是从码族本身的码环中获取的,而不是将纠错码的Johnson边界引入OCDMA系统。在本文中,详细分析了对称,恒定权重OOC(L,w,1)和(L,w,λ)的基数的上界,其结果与引入Johnson界一致。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号