发布求助
文献互助 智能选刊 最新文献

2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)最新文献

筛选
英文 中文
New unimodular sequences with two-level periodic autocorrelations 具有两水平周期自相关的新单模序列
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458391
A. Leukhin, P. Fan
{"title":"New unimodular sequences with two-level periodic autocorrelations","authors":"A. Leukhin, P. Fan","doi":"10.1109/IWSDA.2015.7458391","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458391","url":null,"abstract":"An algebraic method for designing unimodular sequence with two-level periodic autocorrelations by solving a trigonometric equation is proposed. Based on this algebraic method, new constructions of p-ary (p = 3,5) sequences arc presented.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116823072","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Feeding back the output or sharing state, which is better for the state-dependent degraded wiretap channel with noncausal CSI at the transmitter? 反馈输出或共享状态，哪个更适合状态依赖的降级窃听信道，在发射机处具有非因果CSI ?
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458421
Bin Dai, Zheng Ma, Linman Yu
{"title":"Feeding back the output or sharing state, which is better for the state-dependent degraded wiretap channel with noncausal CSI at the transmitter?","authors":"Bin Dai, Zheng Ma, Linman Yu","doi":"10.1109/IWSDA.2015.7458421","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458421","url":null,"abstract":"In this paper, we show that a noiseless feedback link from the legitimate receiver to the transmitter increases the maximum achievable secrecy rate of Chen and Han Vinck's model of the degraded wiretap channel with CSI only available at the transmitter. Moreover, we find that in some particular cases, this feedback scheme performs even better than Chia and El Gamal's CSI sharing scheme on improving the maximum achievable secrecy rate of Chen and Han Vinck's model.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126352976","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 3
Optimal frequency-hopping sequence sets under maximum aperiodic Hamming correlation 最大非周期汉明相关下的最优跳频序列集
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458402
Changyuan Wang, D. Peng
{"title":"Optimal frequency-hopping sequence sets under maximum aperiodic Hamming correlation","authors":"Changyuan Wang, D. Peng","doi":"10.1109/IWSDA.2015.7458402","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458402","url":null,"abstract":"In order to evaluate the goodness of frequency-hopping sequences, the maximum aperiodic Hamming correlation is used as an important measure. In this paper, based on generalized Gordon-Mills-Welch sequences (GGMW sequences) and generalized m-sequences (GM sequences), two classes of frequency-hopping sequence sets arc presented, which are optimal for maximum aperiodic Hamming correlation according to the aperiodic Hamming correlation bound.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"36 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127715175","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 2
Sufficient conditions for an (n, 1) mother code and its puncturing pattern to generate a given convolutional code (n, 1)母码及其穿刺模式生成给定卷积码的充分条件
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458422
Habong Chung, Hwanseok Jang, Jinwoo Seong
{"title":"Sufficient conditions for an (n, 1) mother code and its puncturing pattern to generate a given convolutional code","authors":"Habong Chung, Hwanseok Jang, Jinwoo Seong","doi":"10.1109/IWSDA.2015.7458422","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458422","url":null,"abstract":"Puncturing is the most common way of increasing the rate of convolutional codes. The puncturing process is done to the original code called the mother code by a specific puncturing pattern. In this article, we investigate into the question whether any convolutional code is obtainable by puncturing some (n, 1) mother codes. We present two sufficient conditions for the mother code and the puncturing pattern to satisfy in order that the punctured code is equivalent to the given (N, K) convolutional code.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128471480","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multiplication in a Galois ring 伽罗瓦环中的乘法
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458407
S. Akleylek, F. Özbudak
{"title":"Multiplication in a Galois ring","authors":"S. Akleylek, F. Özbudak","doi":"10.1109/IWSDA.2015.7458407","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458407","url":null,"abstract":"In this paper, we focus on the efficient multiplication in a Galois ring of the size 4n, where n is a positive integer. We consider to adapt the finite field multiplication methods to the Galois ring multiplication. We give the polynomial multiplication in the Galois ring as a Toeplitz matrix-vector multiplication design with a modification used in finite fields of characteristic two. By this method, we reduce the multiplication complexity. Note that the proposed approach can be easily generalized to Galois rings of arbitrary characteristic. To the best of our knowledge, this is the first study to have a subquadratic space complexity to multiply two elements in the Galois rings.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131525446","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Multi-dimensional Anderson-Darling statistic based goodness-of-fit test for spectrum sensing 基于多维Anderson-Darling统计量的频谱感知拟合优度检验
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458396
Sanjeev Gurugopinath, B. Samudhyatha
{"title":"Multi-dimensional Anderson-Darling statistic based goodness-of-fit test for spectrum sensing","authors":"Sanjeev Gurugopinath, B. Samudhyatha","doi":"10.1109/IWSDA.2015.7458396","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458396","url":null,"abstract":"In this paper, we propose a multi-dimensional extension of the Anderson-Darling statistic based goodness-of-fit lest for spectrum sensing in a cognitive radio network with multiple nodes. A technique lo evaluate the optimal detection threshold that satisfies a constraint on the false-alarm probability is discussed. Assuming stationary and known noise statistics, we show that this detector, called as the K-sample Anderson-Darling statistic based detector, outperforms the well-known energy detector under various practically relevant primary signal models and channel fading models, through extensive Monte Carlo simulations.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"16 6","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120889317","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 4
The computational complexity of some algorithms for the rank bounded distance on cyclic codes 讨论了循环码的秩有界距离算法的计算复杂度
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458409
Junru Zheng, T. Kaida
{"title":"The computational complexity of some algorithms for the rank bounded distance on cyclic codes","authors":"Junru Zheng, T. Kaida","doi":"10.1109/IWSDA.2015.7458409","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458409","url":null,"abstract":"The authors proposed an algorithm for calculation of new lower bound using the discrete Fourier transform in 2010. Afterward, we considered some algorithms to improve the original algorithm. In this paper, we discuss the computational complexity of the rank bounded distance for cyclic codes.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"70 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122597398","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A secure and robust dynamic ID-based mutual authentication scheme with smart card using elliptic curve cryptography 基于椭圆曲线密码的智能卡动态身份认证方案
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458418
M. Sarvabhatla, C. Vorugunti
{"title":"A secure and robust dynamic ID-based mutual authentication scheme with smart card using elliptic curve cryptography","authors":"M. Sarvabhatla, C. Vorugunti","doi":"10.1109/IWSDA.2015.7458418","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458418","url":null,"abstract":"As networking and wireless communication technologies advance more rapidly, it give rise to a quick change in the m-commerce land scape. The insecure public internet as an access medium resulted in lots of cryptographic attacks on wireless transactions. Due to this, there is an extreme demand for light weight and secure authentication protocols. In this context, few researchers have proposed E.C.C based authentication schemes to validate the legitimacy of the user connecting to remote server. Recently Islam et al has proposed a dynamic ID based authentication scheme using E.C.C and claimed that their scheme is secure and flexible. In this manuscript, we will illustrate that their scheme is susceptible to offline password guessing attack and user impersonation attack. We then communicate a secure and robust authentication scheme, which is resistant to all cryptographic attacks and light weight. We have analyzed security strengths of our scheme formally using random oracle model and game theory.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127628234","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 9
Self-dual cyclic codes over ℤ4 + uℤ4 自对偶循环码在素数4 + u素数4上
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458414
R. Luo, P. Udaya
{"title":"Self-dual cyclic codes over ℤ4 + uℤ4","authors":"R. Luo, P. Udaya","doi":"10.1109/IWSDA.2015.7458414","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458414","url":null,"abstract":"In this paper we study the structure of self-dual cyclic codes over the ring Λ = ℤ<sub>4</sub> + uℤ<sub>4</sub>. The ring Λ is a local Frobenius ring but not a chain ring. We characterize self-dual cyclic codes of odd length n over Λ. The results can be used to construct some optimal binary, quaternary cyclic and self-dual codes.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127346496","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 1
Construction of near-complementary sequences of length n · 2m 长度为n·2m的近互补序列的构造
2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA) Pub Date : 2015-09-01 DOI: 10.1109/IWSDA.2015.7458401
Gaofei Wu, Zilong Wang
{"title":"Construction of near-complementary sequences of length n · 2m","authors":"Gaofei Wu, Zilong Wang","doi":"10.1109/IWSDA.2015.7458401","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458401","url":null,"abstract":"The problem of constructing near-complementary sequences for peak power control in orthogonal frequency-division multiplexing (OFDM) is considered in this paper. In some applications, it is required that the sequences have various lengths as well as low peak-to-mean envelope power ratio (PMEPR). In this paper, we give a method for constructing length n · 2m-k near-complementary sequences by the aid of standard Golay sequences. The method is a generalization of the construction of Golay sequences given by Fielder et al. Our method transforms seed pairs of length n to near-complementary sequences of length n · 2m-k, while the PMEPR bound of these sequences is two times as many as that of the seed pairs. When the seed pairs are Golay pairs, a class of complementary sets of size 4 will be obtained. We will consider the number of sequences of length n · 2m-k with PMEPR ≤ 4 in the future.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127535475","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：481959085
Book学术官方微信