Uniquely decodable codes for overloaded synchronous CDMA with two sets of orthogonal signatures

A. Singh, Pardeep Singh
{"title":"Uniquely decodable codes for overloaded synchronous CDMA with two sets of orthogonal signatures","authors":"A. Singh, Pardeep Singh","doi":"10.1109/INDICON.2014.7030549","DOIUrl":null,"url":null,"abstract":"In this paper, a new system model is proposed for synchronous overloaded code division multiple access (CDMA), where the errorless transmission is guaranteed over noiseless channel for a total number users (M) being greater than the spreading gain (N). The first N users are accommodated within a code subspace, which is an antipodal orthogonal Hadamard Sylvester (HS) matrix. In contrast, the rest (M-N) number of users are assigned with an orthogonal ternary subset. The proposal aims at the existence of orthogonal derived subset, which if replaced with the quasi orthogonal sequences of O/O CDMA can achieve significant improvement in error performance without any further increase in receiver complexity. The proposed signature matrix has a maximum achievable overloading capacity of 150%. The overall decoding process involves two stages of matched filters (MF) for each subset followed by an intermediate stage of interference cancellation. The extended HS (EHS) matrix in spite of being uniquely decodable (UD) facilitates the use of conventional MF, which unlike any other set of UD codes add more simplicity to the overall design.","PeriodicalId":409794,"journal":{"name":"2014 Annual IEEE India Conference (INDICON)","volume":"156 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2014-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2014 Annual IEEE India Conference (INDICON)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/INDICON.2014.7030549","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

In this paper, a new system model is proposed for synchronous overloaded code division multiple access (CDMA), where the errorless transmission is guaranteed over noiseless channel for a total number users (M) being greater than the spreading gain (N). The first N users are accommodated within a code subspace, which is an antipodal orthogonal Hadamard Sylvester (HS) matrix. In contrast, the rest (M-N) number of users are assigned with an orthogonal ternary subset. The proposal aims at the existence of orthogonal derived subset, which if replaced with the quasi orthogonal sequences of O/O CDMA can achieve significant improvement in error performance without any further increase in receiver complexity. The proposed signature matrix has a maximum achievable overloading capacity of 150%. The overall decoding process involves two stages of matched filters (MF) for each subset followed by an intermediate stage of interference cancellation. The extended HS (EHS) matrix in spite of being uniquely decodable (UD) facilitates the use of conventional MF, which unlike any other set of UD codes add more simplicity to the overall design.
具有两组正交签名的重载同步CDMA的唯一可解码代码
本文提出了一种新的同步过载码分多址(CDMA)系统模型,当用户总数(M)大于扩频增益(N)时,在无噪声信道上保证无差错传输。前N个用户被容纳在一个码子空间中,该码子空间是一个对对正交Hadamard Sylvester (HS)矩阵。相反,其余(M-N)个用户分配一个正交三元子集。该方案针对正交派生子集的存在性,将其替换为O/O CDMA的拟正交序列,可以在不增加接收机复杂度的前提下显著提高误码性能。所提出的签名矩阵的最大可实现过载容量为150%。整个解码过程包括对每个子集进行两个阶段的匹配滤波器(MF),然后是中间阶段的干扰消除。扩展的HS (EHS)矩阵尽管是唯一可解码的(UD),但方便了传统MF的使用,这与其他任何一组UD代码不同,为整体设计增加了更多的简单性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信