A novel orthogonal minimum cross-correlation spreading code in CDMA system

Monisankha Pal, S. Chattopadhyay
{"title":"A novel orthogonal minimum cross-correlation spreading code in CDMA system","authors":"Monisankha Pal, S. Chattopadhyay","doi":"10.1109/INTERACT.2010.5706205","DOIUrl":null,"url":null,"abstract":"Code Division Multiple Access (CDMA) had been used as an emergent technology in present generation Wireless Communication System. In CDMA system, a large number of users could be served over the same bandwidth by assigning a unique code to each of the users. In order to support large number of users in CDMA system, one of the primary objectives of the mobile system designers had been to create a large number of spreading codes by maintaining low Cross-correlation values between them to mitigate the effect of Multiple Access Interference (MAI). In this paper, we have proposed an algorithm to generate an “Orthogonal Minimum Cross-correlation Spreading Code” (OMCCSC), which can provide a large number of distinct spreading codes as compared to the existing orthogonal and near orthogonal spreading codes, namely Walsh code, Orthogonal Gold code and Orthogonal Kasami code. The study of cross-correlation property of the proposed code proves its superiority over other existing codes. The proposed code has been used as a spreading code in synchronous CDMA system and its Bit Error Rate (BER) performance has been compared with other existing spreading codes, in multi-user scenario.","PeriodicalId":201931,"journal":{"name":"INTERACT-2010","volume":"9 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2010-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"23","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"INTERACT-2010","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INTERACT.2010.5706205","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 23

Abstract

Code Division Multiple Access (CDMA) had been used as an emergent technology in present generation Wireless Communication System. In CDMA system, a large number of users could be served over the same bandwidth by assigning a unique code to each of the users. In order to support large number of users in CDMA system, one of the primary objectives of the mobile system designers had been to create a large number of spreading codes by maintaining low Cross-correlation values between them to mitigate the effect of Multiple Access Interference (MAI). In this paper, we have proposed an algorithm to generate an “Orthogonal Minimum Cross-correlation Spreading Code” (OMCCSC), which can provide a large number of distinct spreading codes as compared to the existing orthogonal and near orthogonal spreading codes, namely Walsh code, Orthogonal Gold code and Orthogonal Kasami code. The study of cross-correlation property of the proposed code proves its superiority over other existing codes. The proposed code has been used as a spreading code in synchronous CDMA system and its Bit Error Rate (BER) performance has been compared with other existing spreading codes, in multi-user scenario.
一种新的CDMA系统正交最小互相关扩频码
码分多址(CDMA)是当前无线通信系统中的一项新兴技术。在CDMA系统中,通过为每个用户分配唯一的编码,可以在相同的带宽上为大量用户提供服务。为了在CDMA系统中支持大量用户,移动系统设计者的主要目标之一是通过保持大量扩频码之间的低互相关值来减小多址干扰(MAI)的影响。本文提出了一种生成“正交最小相互关联扩频码”(OMCCSC)的算法,与现有的正交和近正交扩频码(即Walsh码、正交Gold码和正交Kasami码)相比,该算法可以提供大量不同的扩频码。通过对所提码的互相关特性的研究,证明了所提码的优越性。该码作为同步CDMA系统的扩频码,在多用户场景下与现有扩频码的误码率性能进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
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学术官方微信