WCDMA下行链路上多个OVSF码的分配

A. Rouskas, Iraklis I. Athanasakis
{"title":"WCDMA下行链路上多个OVSF码的分配","authors":"A. Rouskas, Iraklis I. Athanasakis","doi":"10.1109/PIMRC.2004.1370912","DOIUrl":null,"url":null,"abstract":"We examine the problem of assigning multiple orthogonal variable spreading factor (OVSF) codes to serve calls at the downlink in WCDMA. In contrast to previously published approaches, we propose algorithms that fully exploit any additional hardware available at the user equipment. Depending on the requested rate and the number of available transceivers, our schemes support a call by as many OVSF codes as possible. Compared to previous multiple code assignment schemes, our approach significantly lowers code blocking. Different ways to calculate the most appropriate combination of codes result in different variations of our schemes. It turns out that if we attempt to minimize the highest rate among the codes used, instead of minimizing the excess bandwidth wasted, we get better results in terms of code blocking, and the number of reassignments to support the call.","PeriodicalId":201962,"journal":{"name":"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","volume":"68 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2004-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":"{\"title\":\"Assignment of multiple OVSF codes at the downlink in WCDMA\",\"authors\":\"A. Rouskas, Iraklis I. Athanasakis\",\"doi\":\"10.1109/PIMRC.2004.1370912\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We examine the problem of assigning multiple orthogonal variable spreading factor (OVSF) codes to serve calls at the downlink in WCDMA. In contrast to previously published approaches, we propose algorithms that fully exploit any additional hardware available at the user equipment. Depending on the requested rate and the number of available transceivers, our schemes support a call by as many OVSF codes as possible. Compared to previous multiple code assignment schemes, our approach significantly lowers code blocking. Different ways to calculate the most appropriate combination of codes result in different variations of our schemes. It turns out that if we attempt to minimize the highest rate among the codes used, instead of minimizing the excess bandwidth wasted, we get better results in terms of code blocking, and the number of reassignments to support the call.\",\"PeriodicalId\":201962,\"journal\":{\"name\":\"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)\",\"volume\":\"68 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2004-09-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"2\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PIMRC.2004.1370912\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2004 IEEE 15th International Symposium on Personal, Indoor and Mobile Radio Communications (IEEE Cat. No.04TH8754)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PIMRC.2004.1370912","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

摘要

研究了在WCDMA下行链路分配多个正交可变扩频因子(OVSF)码的问题。与以前发表的方法相反,我们提出的算法充分利用用户设备上可用的任何额外硬件。根据请求的速率和可用收发器的数量,我们的方案支持由尽可能多的OVSF代码调用。与以前的多种代码分配方案相比,我们的方法显著降低了代码阻塞。计算最合适的代码组合的不同方法导致方案的不同变化。事实证明,如果我们尝试最小化所使用的代码中的最高速率,而不是最小化多余的带宽浪费,我们会在代码阻塞和支持调用的重新分配数量方面获得更好的结果。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Assignment of multiple OVSF codes at the downlink in WCDMA
We examine the problem of assigning multiple orthogonal variable spreading factor (OVSF) codes to serve calls at the downlink in WCDMA. In contrast to previously published approaches, we propose algorithms that fully exploit any additional hardware available at the user equipment. Depending on the requested rate and the number of available transceivers, our schemes support a call by as many OVSF codes as possible. Compared to previous multiple code assignment schemes, our approach significantly lowers code blocking. Different ways to calculate the most appropriate combination of codes result in different variations of our schemes. It turns out that if we attempt to minimize the highest rate among the codes used, instead of minimizing the excess bandwidth wasted, we get better results in terms of code blocking, and the number of reassignments to support the call.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术文献互助群
群 号:604180095
Book学术官方微信