首页> 外文期刊>IEEE Transactions on Information Theory >Large Sets of Orthogonal Sequences Suitable for Applications in CDMA Systems
【24h】

Large Sets of Orthogonal Sequences Suitable for Applications in CDMA Systems

机译:适用于CDMA系统的大型正交序列集

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

摘要

In this paper, we employ the so-called semi-bent functions to achieve significant improvements over currently known methods, regarding the number of orthogonal sequences per cell that can be assigned to a regular tessellation of hexagonal cells, typical for certain code-division multiple-access systems. Our initial design method generates a large family of orthogonal sets of sequences derived from vectorial semi-bent functions. A modification of the original approach is proposed to avoid a hard combinatorial problem of allocating several such orthogonal sets to a single cell of a regular hexagonal network, while preserving the orthogonality to adjacent cells. This modification increases the number of users per cell by starting from shorter codewords and then extending the length of these codewords to the desired length. The specification and assignment of these orthogonal sets to a regular tessellation of hexagonal cells have been solved, regardless of the parity and size of (where is the length of the codewords). In particular, when the re-use distance is , the number of users per cell is for almost all , which is twice as many as can be obtained by the best known methods.
机译:在本文中,我们可以使用所谓的半弯函数来实现对当前已知方法的显着改进,这涉及可以分配给六边形单元的规则镶嵌的每单元正交序列的数量,这对于某些码分倍数通常是典型的-访问系统。我们的初始设计方法会生成大量的正交序列集,这些序列是从矢量半弯曲函数中得出的。提出了对原始方法的修改,以避免在将几个这样的正交集分配给规则六边形网络的单个单元格的同时保留与相邻单元格的正交性的硬组合问题。通过从较短的码字开始,然后将这些码字的长度扩展到所需的长度,此修改增加了每个小区的用户数量。解决了这些正交集对六边形单元的规则镶嵌的规范和分配问题,无论奇偶校验和大小(其中码字的长度)如何,都可以解决。特别地,当重用距离为时,每个小区的用户数几乎是全部,这是通过最公知的方法可获得的数量的两倍。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号