Joint frequency and scrambling code allocation for TD-SCDMA cellular network optimization

Cheng Wang, Zhouyun Wu, Aiping Huang, Hangguan Shan, Liang Shen, Zhoushi Xiong
{"title":"Joint frequency and scrambling code allocation for TD-SCDMA cellular network optimization","authors":"Cheng Wang, Zhouyun Wu, Aiping Huang, Hangguan Shan, Liang Shen, Zhoushi Xiong","doi":"10.1109/WCSP.2013.6677250","DOIUrl":null,"url":null,"abstract":"Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Wireless Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2013.6677250","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Frequency allocation and scrambling code allocation are challenging issues for TD-SCDMA networks. Proper allocation schemes should not only meet traffic volume requirement and networking constraints, but suppress intercell interference effectively as well. This paper investigates joint frequency and scrambling code allocation, in order to take full use of the freedom degrees owned by these two resources and thus suppress interference to the greatest extent. A complete model of intercell interference is established, taking radio propagation condition, traffic distribution, frequency orthogonality and code correlation into consideration. A novel two-step joint allocation algorithm is proposed, with joint frequency and scrambling code family allocation in the first step and then scrambling code selection in the second step. Therefore, the minimum interference is achieved by the joint allocation, and computational complexity is greatly reduced by the two-step implementation. Numerical results show that in interference suppression point of view, our proposed joint allocation outperforms the sequential allocation commonly used in engineering.
TD-SCDMA蜂窝网络优化的联合频率和加扰码分配
频率分配和加扰码分配是TD-SCDMA网络中具有挑战性的问题。合理的分配方案既要满足通信量需求和组网约束,又要有效抑制小区间干扰。本文研究了联合频率和加扰码的分配,以充分利用这两种资源所拥有的自由度,从而最大程度地抑制干扰。考虑无线电传播条件、业务分布、频率正交性和码相关性,建立了完整的小区间干扰模型。提出了一种新的两步联合分配算法,第一步进行联合频率和置乱码族分配,第二步进行置乱码选择。因此,通过联合分配实现了最小的干扰,并通过两步实现大大降低了计算复杂度。数值结果表明,从抑制干扰的角度来看,本文提出的联合分配方法优于工程上常用的顺序分配方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信