首页> 外文期刊>Photonic network communications >Construction and performance analysis of 2-D variable-length variable-weight optical orthogonal codes
【24h】

Construction and performance analysis of 2-D variable-length variable-weight optical orthogonal codes

机译:二维变长变权光学正交码的构造和性能分析

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

摘要

In this paper, a new generation algorithm of a two-dimensional variable-length and variable-weight optical orthogonal codes (2-D VLVWOOCs) is proposed. By analysis of the BER performance for the corresponding optical code division multiple access (OCDMA) system, it is shown that the users with different codewords have significant differences in performance. Users with heavier-weight address matrices always outperform those with lighter-weight address matrices, and shorter-length and longer-length matrices support high bit-rate and low bit-rate in OCDMA applications, respectively. Therefore, heavier-weight shorter-length matrices can accommodate high bit-rate and high-quality of services (QoS) (e.g., real-time video), and lighter-weight longer-length matrices can achieve low bit-rate and low-QoS (e.g., voice). The system performance becomes worse as the users concentrate on one type of service. Especially, a surge of the number of users with shorter-length matrices has particularly impact on system performance. Thus, the 2-D VLVWOOCs can be used to provide many different types of services with different rate-levels and different levels of QoS, and simultaneously make better use of bandwidth resources in optical networks.
机译:本文提出了一种二维可变长度和可变权重光学正交码(2-D VLVWOOCs)的新一代算法。通过分析相应的光码分多址(OCDMA)系统的BER性能,可以看出具有不同码字的用户在性能上存在显着差异。地址矩阵较重的用户总是优于地址矩阵较轻的用户,而长度较短和长度较长的矩阵在OCDMA应用中分别支持高比特率和低比特率。因此,较重的较短长度矩阵可以容纳高比特率和高质量的服务(QoS)(例如实时视频),而较轻量的较长长度矩阵可以实现低比特率和低比特率。 QoS(例如语音)。当用户专注于一种服务时,系统性能会变差。特别是,使用长度较短的矩阵的用户数量激增特别影响系统性能。因此,二维VLVWOOC可用于提供具有不同速率等级和QoS等级的许多不同类型的服务,并同时更好地利用光网络中的带宽资源。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号