{"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}
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.