异步宽带CDMA蜂窝系统的小区搜索方法比较

J. Nystrom, K. Jamal, Y. Wang, R. Esmailzadeh
{"title":"异步宽带CDMA蜂窝系统的小区搜索方法比较","authors":"J. Nystrom, K. Jamal, Y. Wang, R. Esmailzadeh","doi":"10.1109/ICUPC.1998.733622","DOIUrl":null,"url":null,"abstract":"Cell search within a CDMA system consists of the tasks carried out by a mobile station in order to find, identify, and synchronize to a new cell. We distinguish between initial cell search, where the mobile station after power on searches for the cell to which it has the lowest path loss, and cell search carried out for maintaining connection to the network in idle mode and to find handover candidates in active mode. In this paper, we focus on initial cell search. In cellular systems employing asynchronous base stations, no common time reference exists. Consequently, base stations cannot be identified by their relative time offset. One way to facilitate cell search in an asynchronous system is to have each cell transmitting a unique downlink scrambling code. The disadvantage is that the mobile station must now search for a large number of different scrambling codes, which leads to significantly higher complexity compared to the case of a synchronized system. One approach to cell search in an asynchronous system has been proposed for ETSI WCDMA. In this case, each cell uses a unique downlink scrambling code of length 10 ms. The set of scrambling codes is divided into groups with a limited number of codes in each group. In addition, each cell periodically transmits two special orthogonal code words, known as the primary and secondary synchronization codes, PSC and SSC respectively. In ETSI WCDMA, as well as in our work, orthogonal Gold codes are used for the PSC and SSC codes.","PeriodicalId":341069,"journal":{"name":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","volume":"343 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1998-10-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"16","resultStr":"{\"title\":\"Comparison of cell search methods for asynchronous wideband CDMA cellular system\",\"authors\":\"J. Nystrom, K. Jamal, Y. Wang, R. Esmailzadeh\",\"doi\":\"10.1109/ICUPC.1998.733622\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Cell search within a CDMA system consists of the tasks carried out by a mobile station in order to find, identify, and synchronize to a new cell. We distinguish between initial cell search, where the mobile station after power on searches for the cell to which it has the lowest path loss, and cell search carried out for maintaining connection to the network in idle mode and to find handover candidates in active mode. In this paper, we focus on initial cell search. In cellular systems employing asynchronous base stations, no common time reference exists. Consequently, base stations cannot be identified by their relative time offset. One way to facilitate cell search in an asynchronous system is to have each cell transmitting a unique downlink scrambling code. The disadvantage is that the mobile station must now search for a large number of different scrambling codes, which leads to significantly higher complexity compared to the case of a synchronized system. One approach to cell search in an asynchronous system has been proposed for ETSI WCDMA. In this case, each cell uses a unique downlink scrambling code of length 10 ms. The set of scrambling codes is divided into groups with a limited number of codes in each group. In addition, each cell periodically transmits two special orthogonal code words, known as the primary and secondary synchronization codes, PSC and SSC respectively. In ETSI WCDMA, as well as in our work, orthogonal Gold codes are used for the PSC and SSC codes.\",\"PeriodicalId\":341069,\"journal\":{\"name\":\"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)\",\"volume\":\"343 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1998-10-05\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"16\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICUPC.1998.733622\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"ICUPC '98. IEEE 1998 International Conference on Universal Personal Communications. Conference Proceedings (Cat. No.98TH8384)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICUPC.1998.733622","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 16

摘要

CDMA系统中的小区搜索包括由移动站执行的查找、识别和同步新小区的任务。我们区分了初始小区搜索和在空闲模式下为保持与网络的连接而进行的小区搜索,在活动模式下为寻找切换候选者而进行的小区搜索。在初始小区搜索中,移动站在通电后搜索其路径损失最小的小区。在本文中,我们主要关注初始单元搜索。在采用异步基站的蜂窝系统中,不存在共同的时间参考。因此,基站不能通过它们的相对时间偏移来识别。在异步系统中方便小区搜索的一种方法是让每个小区传输唯一的下行链路置乱码。缺点是移动站现在必须搜索大量不同的加扰码,与同步系统的情况相比,这导致了明显更高的复杂性。提出了一种针对ETSI WCDMA异步系统的小区搜索方法。在这种情况下,每个单元使用长度为10毫秒的唯一下行置乱码。置乱码集被分成若干组,每组中有有限数量的码。此外,每个小区定期发送两个特殊的正交码字,分别称为主同步码和次同步码,分别为PSC和SSC。在ETSI WCDMA中,以及在我们的工作中,PSC和SSC代码使用正交金码。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Comparison of cell search methods for asynchronous wideband CDMA cellular system
Cell search within a CDMA system consists of the tasks carried out by a mobile station in order to find, identify, and synchronize to a new cell. We distinguish between initial cell search, where the mobile station after power on searches for the cell to which it has the lowest path loss, and cell search carried out for maintaining connection to the network in idle mode and to find handover candidates in active mode. In this paper, we focus on initial cell search. In cellular systems employing asynchronous base stations, no common time reference exists. Consequently, base stations cannot be identified by their relative time offset. One way to facilitate cell search in an asynchronous system is to have each cell transmitting a unique downlink scrambling code. The disadvantage is that the mobile station must now search for a large number of different scrambling codes, which leads to significantly higher complexity compared to the case of a synchronized system. One approach to cell search in an asynchronous system has been proposed for ETSI WCDMA. In this case, each cell uses a unique downlink scrambling code of length 10 ms. The set of scrambling codes is divided into groups with a limited number of codes in each group. In addition, each cell periodically transmits two special orthogonal code words, known as the primary and secondary synchronization codes, PSC and SSC respectively. In ETSI WCDMA, as well as in our work, orthogonal Gold codes are used for the PSC and SSC codes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信