CDMA中伪随机序列的最大周期相关

M. Stular, S. Tomažič
{"title":"CDMA中伪随机序列的最大周期相关","authors":"M. Stular, S. Tomažič","doi":"10.1109/MELCON.2000.880455","DOIUrl":null,"url":null,"abstract":"The article presents the comparison of the Welch, modified Welch, Sarwate and Sidelnikov lower bounds on the correlation of CDMA codes. It is shown that the modified Welch bound is the best general bound known, while for codes whose symbols are roots of unity, the Sidelnikov bound is tighter. It appears likely that these bounds are nonoptimal for larger number of codes in a code set, and that there is still place for further improvements.","PeriodicalId":151424,"journal":{"name":"2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)","volume":"175 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"12","resultStr":"{\"title\":\"Maximum periodic correlation of pseudo-random sequences in CDMA\",\"authors\":\"M. Stular, S. Tomažič\",\"doi\":\"10.1109/MELCON.2000.880455\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The article presents the comparison of the Welch, modified Welch, Sarwate and Sidelnikov lower bounds on the correlation of CDMA codes. It is shown that the modified Welch bound is the best general bound known, while for codes whose symbols are roots of unity, the Sidelnikov bound is tighter. It appears likely that these bounds are nonoptimal for larger number of codes in a code set, and that there is still place for further improvements.\",\"PeriodicalId\":151424,\"journal\":{\"name\":\"2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)\",\"volume\":\"175 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2000-05-29\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"12\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MELCON.2000.880455\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 10th Mediterranean Electrotechnical Conference. Information Technology and Electrotechnology for the Mediterranean Countries. Proceedings. MeleCon 2000 (Cat. No.00CH37099)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MELCON.2000.880455","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 12

摘要

本文比较了CDMA码相关的Welch下界、修正Welch下界、Sarwate下界和Sidelnikov下界。证明了改进的Welch界是已知的最好的一般界,而对于符号为单位根的码,Sidelnikov界更紧。对于代码集中大量的代码,这些边界似乎不是最优的,并且仍有进一步改进的余地。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Maximum periodic correlation of pseudo-random sequences in CDMA
The article presents the comparison of the Welch, modified Welch, Sarwate and Sidelnikov lower bounds on the correlation of CDMA codes. It is shown that the modified Welch bound is the best general bound known, while for codes whose symbols are roots of unity, the Sidelnikov bound is tighter. It appears likely that these bounds are nonoptimal for larger number of codes in a code set, and that there is still place for further improvements.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信