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

筛选
英文 中文
New Optimal (14p, {4, 5}, 1, (3/4, 1/4))-OOCs New Optimal (14p, {4,5}, 1, (3/ 4,1 /4))-OOCs
Huangsheng Yu, Jia Tong, Dianhua Wu
{"title":"New Optimal (14p, {4, 5}, 1, (3/4, 1/4))-OOCs","authors":"Huangsheng Yu, Jia Tong, Dianhua Wu","doi":"10.1109/IWSDA.2015.7458389","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458389","url":null,"abstract":"Variable-weight optical orthogonal code (OOC) was introduced by Yang for multimedia optical CDMA systems with multiple quality of service (QoS) requirement. In this paper, it is proved that for each prime p ≡ 5 (mod 8), there exists an optimal (14p, {4, 5}, 1, {3/4, 1/4})-OOC.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"99 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":"123762534","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 novel class of QPSK zero-correlation zone sequence sets 一类新的QPSK零相关带序列集
Takafumi Hayashi, Yodai Watanabe, A. Pham, T. Miyazaki, S. Matsufuji, T. Maeda
{"title":"A novel class of QPSK zero-correlation zone sequence sets","authors":"Takafumi Hayashi, Yodai Watanabe, A. Pham, T. Miyazaki, S. Matsufuji, T. Maeda","doi":"10.1109/IWSDA.2015.7458405","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458405","url":null,"abstract":"The present paper introduces the construction of Quadrature Phase Shift Keying (QPSK) modulation based sequences having a zero-correlation zone. For a zero-correlation zone sequence set of N sequences, each of length L, the cross-correlation function and the side lobe of the autocorrelation function of the proposed sequence set is zero for the phase shifts τ within the zero-correlation zone z, such that |τ| ≤ z (τ ≠ 0 for the autocorrelation function). The ratio N(z+1) over ℓ is theoretically limited to one. When the ratio of a sequence set is equal to one, the sequence set is called an optimal zero-correlation sequence set. The proposed zero-correlation zone sequence set can be generated from an arbitrary Hadamard matrix of order n. First, the proposed sequence set is generated as a set of 4n sequences of length 8n with the zero-correlation zone z = 1. The length of the proposed sequence set can be extended by sequence interleaving, where m times interleaving can generate the 4n sequences, each of length 2m+3n. The proposed sequence set is optimal for m = 0,1 and almost optimal for m > 1.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"71 3","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131893986","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
On shortening construction of self-orthogonal quaternary codes 自正交四元码的缩短构造
Luobin Guo, Qiang Fu, Ruihu Li, Xueliang Li
{"title":"On shortening construction of self-orthogonal quaternary codes","authors":"Luobin Guo, Qiang Fu, Ruihu Li, Xueliang Li","doi":"10.1109/IWSDA.2015.7458423","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458423","url":null,"abstract":"For a given quaternary self-orthogonal (SO) code, using information of weights of codewords in the dual of the binary code generated by the supports of this SO code, one can construct new quaternary SO code by shortening method. Two methods of determining weights of codewords in the dual of the binary support code of a given large length SO code are presented. Using these methods, we construct many SO codes from a quantum 286-cap in PG(6, 4), and deduce existence of many quantum caps in PG(6, 4) and good quantum codes of distance 4.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"17 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":"133547669","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
A preamble allocation method for M2M traffics in 3GPP LTE-A networks 一种3GPP LTE-A网络中M2M流量的前置分配方法
Yang Liu, P. Fan, Hao Li
{"title":"A preamble allocation method for M2M traffics in 3GPP LTE-A networks","authors":"Yang Liu, P. Fan, Hao Li","doi":"10.1109/IWSDA.2015.7458399","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458399","url":null,"abstract":"The number of Machine-to-Machine (M2M) traffics is rapidly increasing in cellular communication systems. In order to ensure a maximum system capacity, the communication resources should be allocated appropriately to M2M traffics and common Human-to-Human (H2H) traffics. In this paper, a preamble allocation method for M2M services in 3GPP LTE system is presented. This method splits the set of available random access preambles into three subsets: the first one is for H2H services only, the second is for both H2H and M2M services and the third is for M2M services only. We model and analyze the throughput performance of the proposed method, and compare it with the two major candidate preamble allocation methods under consideration for possible adoption in LTE-Advanced networks. It is shown that the proposed method performs much better in most practical situations.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"25 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":"134323728","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
Locally repairable fractional repetition codes 局部可修复的分数重复码
Mi-Young Nam, Junghyun Kim, Hong‐Yeop Song
{"title":"Locally repairable fractional repetition codes","authors":"Mi-Young Nam, Junghyun Kim, Hong‐Yeop Song","doi":"10.7840/kics.2015.40.9.1741","DOIUrl":"https://doi.org/10.7840/kics.2015.40.9.1741","url":null,"abstract":"In this paper, we propose three constructions of locally repairable codes based on fractional repetition (FR) codes. We also derive the bounds on the maximum file size stored with locally repairable FR codes with locality 2 and 3, respectively. Construction 1 results in a locally repairable FR code with locality 2. It has repetition degree ρ = 2, and attains the bound on the maximum file size we derived. The availability of this code is designed to be ρ - 1 = 1. Construction 2 results in a code which has larger availability ρ - 1 = 2 so that multiple node failures can be `locally' repaired. This code also attains the bound on the maximum file size but with larger number of storage nodes. Construction 3 is a result of reducing the number of storage nodes.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"16 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":"128695802","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}
引用次数: 13
Rate-split based decode-and-forward protocols for cooperative communications 用于协作通信的基于速率分割的译码转发协议
Hsiao-feng Lu
{"title":"Rate-split based decode-and-forward protocols for cooperative communications","authors":"Hsiao-feng Lu","doi":"10.1109/IWSDA.2015.7458382","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458382","url":null,"abstract":"In this paper we first establish a general performance upper bound on the diversity-multiplexing tradeoff (DMT) for communication protocols for a half-duplex cooperative network where every node has a single antenna. This bound shows that the dynamic-decode-and-forward (DDF) protocol achieves optimal DMT among all variations of decode-and-forward based protocols when multiplexing gain r ≤ 1/2. Secondly, when r > 1/2 it shows that the diversity gain must be less than 1 for all protocols and for any number of relay nodes. Our bound also implies that the well-known cut-set-based DMT upper bound is not tight except for the single-relay network and that there are rooms to improve the performance of DDF protocol, thereby settling a long-time open question raised by Azarian et al.. In light of this breakthrough, a novel protocol based on a rate-split is proposed in this paper. Two variations, dynamic and non-dynamic, of the rate-split-based protocol are also presented. It is shown that the dynamic version achieves a DMT better than the DDF protocol, and in particular, meets the cut-set bound in the case of a single-relay network. The other variation, i.e., the non-dynamic one, has a much simpler implementation and reaches its optimal performance in only two channel uses. Moreover, it meets the cut-set bound in the case of a single-relay network.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"119 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":"123469096","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
On linear complexity of periodic sequences over extension fields from cyclic difference sets 循环差分集扩展域上周期序列的线性复杂度
T. Kaida, Junru Zheng
{"title":"On linear complexity of periodic sequences over extension fields from cyclic difference sets","authors":"T. Kaida, Junru Zheng","doi":"10.1109/IWSDA.2015.7458392","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458392","url":null,"abstract":"The set of constant-weight sequences over GF(q) from the cyclic difference set generalized by the authors are considered. For the linear complexity(LC) of infinite sequences with their one period as an element in the set, we give a conjecture that LCs of all sequences except two in the set are the maximum as same as their period and LCs of remaining two sequences are the maximum value minus one. Five numerical examples over two prime fields and three non-prime(extension) fields are shown for evidences of main conjecture in this paper.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"67 3 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":"115489866","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
Irreducible cyclic ℤ4—codes and allied sequences 不可约循环l4码及其相关序列
A. Alahmadi, T. Helleseth, N. Muthana, Atiqah Almuzaini, P. Solé
{"title":"Irreducible cyclic ℤ4—codes and allied sequences","authors":"A. Alahmadi, T. Helleseth, N. Muthana, Atiqah Almuzaini, P. Solé","doi":"10.1109/IWSDA.2015.7458395","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458395","url":null,"abstract":"With every odd integer N, is attached an infinite family of irreducible cyclic ℤ<sub>4</sub>-codes, of lengths of the form n = 2<sup>m</sup>- 1/N over N, for some m ≤ 3. The correlation performance of the related quaternary sequences is studied by means of incomplete Gauss sums over Galois rings.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"3 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":"132499509","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
The second-order correlation measure of Zadoff-Chu sequences Zadoff-Chu序列的二阶相关测度
Tae-Kyo Lee, Jin-Ho Chung, Kyeongcheol Yang
{"title":"The second-order correlation measure of Zadoff-Chu sequences","authors":"Tae-Kyo Lee, Jin-Ho Chung, Kyeongcheol Yang","doi":"10.1109/IWSDA.2015.7458393","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458393","url":null,"abstract":"For an integer r ≥ 1, the rth-order correlation measure (or the correlation measure of order r) of a sequence was introduced in cryptography as a measure of immunity against correlation attacks. When r = 2, it can be viewed as the maximum value in a subset of magnitudes of partial-period autocorrelation for a given sequence. In this paper, we determine the second-order correlation measure of Zadoff-Chu sequences of any period and show that it is invariant to the design parameter for them.","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"30 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":"124345812","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
On skew-cyclic codes over GR(4, 2) + uGR(4, 2) GR(4,2) + uGR(4,2)上的斜循环码
Amit K. Sharma, Maheshanand Bhaintwal
{"title":"On skew-cyclic codes over GR(4, 2) + uGR(4, 2)","authors":"Amit K. Sharma, Maheshanand Bhaintwal","doi":"10.1109/IWSDA.2015.7458413","DOIUrl":"https://doi.org/10.1109/IWSDA.2015.7458413","url":null,"abstract":"In this paper, we study skew-cyclic codes over the ring R = GR(4, 2) + uGR(4, 2), u2 = u, where GR(4, 2) is the Galois extension of ℤ4 of degree 2. We describe some structural properties of skew polynomial ring R[x, θ], where θ is an automorphism of R. A sufficient condition for skew cyclic codes over R to be free is presented. It is shown that skew-cyclic codes over R are either equivalent to cyclic codes or to quasi-cyclic codes. A brief description of the duals of these codes is also presented. We define a Gray map from R to [GR(4, 2)]2, and show that the Gray image of a skew-cyclic codes over R is a skew 2-quasi cyclic code over GR(4, 2).","PeriodicalId":371829,"journal":{"name":"2015 Seventh International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"25 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":"128336803","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学术官方微信