首页> 外文会议> >Performance bounds for direct-sequence spread-spectrum communications with complex signature sequences
【24h】

Performance bounds for direct-sequence spread-spectrum communications with complex signature sequences

机译:具有复杂签名序列的直接序列扩频通信的性能界限

获取原文

摘要

The authors present a unified performance analysis of direct-sequence spread-spectrum multiple-access (DS/SSMA) communications with deterministic complex signature sequences. The probability density function (pdf) of the multiple-user interference is determined. Using a round-down and round-up procedure on the pdf, arbitrarily tight lower and upper bounds on the probability of bit error (pbe) are obtained. Results based on the Gaussian approximation method are also presented. It is shown that complex sequences can yield better pbe performance than binary sequences. Using complex sequences, the number of signature sequences that have good auto- and crosscorrelation properties is greatly enlarged. New users that use complex or binary signature sequences can be added into existing systems with graceful performance degradation.
机译:作者呈现了与确定性复杂签名序列的直接序列扩频多址(DS / SSMA)通信的统一性能分析。确定多用户干扰的概率密度函数(PDF)。使用PDF上的圆形和校正步骤,获得了比特误差(PBE)的概率上的任意紧密和上限。还提出了基于高斯近似方法的结果。结果表明,复杂序列可以产生比二进制序列更好的PBE性能。使用复杂序列,具有良好的自动和跨相关性能的签名序列的数量大大放大。使用复杂或二进制签名序列的新用户可以添加到具有优雅性能下降的现有系统中。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号