一种求解延迟型m序列线性组合的新算法
DOI:
作者:
作者单位:

作者简介:

通讯作者:

基金项目:


A New Algorithm of Multiplex Problem for Delayed m-Sequence
Author:
Affiliation:

Fund Project:

  • 摘要
  • |
  • 图/表
  • |
  • 访问统计
  • |
  • 参考文献
  • |
  • 相似文献
  • |
  • 引证文献
  • |
  • 资源附件
    摘要:

    本文先讨论了求解延迟型m序列的线性组合关系的代数算法,通过对主m序列状态与延迟m序列之间线性关系的分析,提出用二元域线性方程组求解延迟m序列线性组合关系的新算法,并将其运用到N-CDMA移动通信系统用户掩码的分配设计中。这种方法解决了大延迟长m序列的线性组合的求解难题,工程计算量大幅度简化。

    Abstract:

    The algebra algorithm solving the linear combination characteristic of delayed m-sequence is discussed. Based on analysis of linear relationship between status of the central m-sequence and the delayed sequence, a new algorithm, which solves the multiplex problem of delayed m-sequence is given by taking advantage of linear equations over binary finite field. Application of this algorithm in the design of the mask of the N-CDMA mobile communication system is discussed. This algorithm provides a convenient way in solving the multiplex problem of long m-sequence in engineering calculation.

    参考文献
    相似文献
    引证文献
引用本文

陈德宏,刘梅.一种求解延迟型m序列线性组合的新算法[J].数据采集与处理,2014,29(3):439-444

复制
分享
文章指标
  • 点击次数:
  • 下载次数:
历史
  • 收稿日期:
  • 最后修改日期:
  • 录用日期:
  • 在线发布日期: 2014-06-25