{"title":"确定扩频序列下多处理增益CDMA的性能研究","authors":"O. Kucur, S. Dilek, V. Kumbasar, M. Dogan","doi":"10.1109/SIU.2006.1659745","DOIUrl":null,"url":null,"abstract":"In this paper, we analyze the bit error rate performance of multi-processing gain (MPG) code division multiple access (CDMA) for deterministic spreading sequences over an asynchronous additive white Gaussian noise channel. Performances of Gold, Hadamard sequences are compared to that of random sequences. Results show that random code assumption is not realistic for MPG-CDMA since its performance differs a lot from those of deterministic ones","PeriodicalId":415037,"journal":{"name":"2006 IEEE 14th Signal Processing and Communications Applications","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2006-04-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Performance of Multi-Processing Gain CDMA for Deterministic Spreading Sequences\",\"authors\":\"O. Kucur, S. Dilek, V. Kumbasar, M. Dogan\",\"doi\":\"10.1109/SIU.2006.1659745\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In this paper, we analyze the bit error rate performance of multi-processing gain (MPG) code division multiple access (CDMA) for deterministic spreading sequences over an asynchronous additive white Gaussian noise channel. Performances of Gold, Hadamard sequences are compared to that of random sequences. Results show that random code assumption is not realistic for MPG-CDMA since its performance differs a lot from those of deterministic ones\",\"PeriodicalId\":415037,\"journal\":{\"name\":\"2006 IEEE 14th Signal Processing and Communications Applications\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2006-04-17\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2006 IEEE 14th Signal Processing and Communications Applications\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/SIU.2006.1659745\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2006 IEEE 14th Signal Processing and Communications Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/SIU.2006.1659745","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Performance of Multi-Processing Gain CDMA for Deterministic Spreading Sequences
In this paper, we analyze the bit error rate performance of multi-processing gain (MPG) code division multiple access (CDMA) for deterministic spreading sequences over an asynchronous additive white Gaussian noise channel. Performances of Gold, Hadamard sequences are compared to that of random sequences. Results show that random code assumption is not realistic for MPG-CDMA since its performance differs a lot from those of deterministic ones