Mingxing Zhang, Zhengchun Zhou, Yang Yang, Haode Yan
{"title":"Optimization Method for Designing Sequences With Low Partial-period Autocorrelation Sidelobes","authors":"Mingxing Zhang, Zhengchun Zhou, Yang Yang, Haode Yan","doi":"10.1109/IWSDA46143.2019.8966100","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966100","url":null,"abstract":"The partial-period autocorrelation of sequences is an important performance measure of communication systems employing them, but it is notoriously difficult to be analyzed. In this paper, we propose an algorithm to design unimodular sequences with low partial-period autocorrelations via directly minimizing the partial-period integrated sidelobe level (PISL). The proposed algorithm is inspired by the monotonic minimizer for integrated sidelobe level (MISL) algorithm. Numerical experiments show that the proposed algorithm can effectively generate sequences with lower partial-period peak sidelobe level (PPSL) than the well-known Zadoff-Chu sequences.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"24 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114019615","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}
{"title":"More Quasi-Complementary Sequence Sets from Difference Sets and Almost Difference Sets","authors":"Yubo Li, Chengqian Xu, Xiuping Peng","doi":"10.1109/IWSDA46143.2019.8966099","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966099","url":null,"abstract":"A quasi-complementary sequence set (QCSS) is a set of two-dimensional matrices which has low correlation sums of rows for all non-trivial time shifts. In multi-carrier code-division multiple-access (MC-CDMA) communications, QCSSs can be utilized to achieve low interference performance. In this paper, constructions of periodic QCSSs are proposed by using difference sets and almost difference sets. We remark that the periodic QCSSs obtained from this paper are asymptotically optimal and with new parameters.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"34 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121117493","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}
{"title":"Deep Learning Based Modified Message Passing Algorithm for Sparse Code Multiple Access","authors":"Lanping Li, Xiaohu Tang, C. Tellambura","doi":"10.1109/IWSDA46143.2019.8966120","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966120","url":null,"abstract":"Shuffled message passing algorithm (SMPA) is a serial variant of message passing algorithm (MPA) for sparse code multiple access (SCMA) signal detection, which accelerates the convergence rate of MPA. However, SMPA still achieves the near-optimal performance due to the effect of cycles in the factor graph. In the paper, we propose to optimize the weights assigned to the edges of the factor graph by unfolding SMPA as layers of deep neural network (DNN). We consider the weights as network parameters and then train the network offline to obtain weights which can minimize the loss function. With simulations, we show that DNN based SMPA (DNN-SMPA) outperforms SMPA in terms of bit-error-rate (BER) for the same level of computational complexity.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133516154","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}
{"title":"A Construction of Non-binary Polar codes with 4 by 4 kernels","authors":"S. Byun, Gangsan Kim, Won Jun Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966125","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966125","url":null,"abstract":"In this paper, we propose a specific type of non-binary 4 by 4 kernel for non-binary polar codes. The non-binary polar codes generated by such type of kernel have same encoding and successive cancellation decoding complexities as the non-binary polar codes generated by the $left[begin{array}{ccc} 1 & 0 eta & 1 end{array} right]$ type of non-binary 2 by 2 kernel with same code length. At certain code parameters, we investigate the FER for the polar codes with all the $left[begin{array}{ccc} 1 & 0 eta & 1 end{array} right]$ type of non-binary 2 by 2 kernels. And then, we experimentally confirm the existence of several non-binary 4 by 4 kernels of the proposed type which generate non-binary polar codes with better FER performance than non-binary polar codes generated by any $left[begin{array}{ccc} 1 & 0 eta & 1 end{array} right]$ type of non-binary 2 by 2 kernel.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134313306","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}
{"title":"Arithmetic Coding Based on Reflected Binary Codes","authors":"Sian-Jheng Lin, Ziting Gao, Y. Han","doi":"10.1109/IWSDA46143.2019.8966088","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966088","url":null,"abstract":"Arithmetic coding is a lossless data compression technology on a sequence of symbols in independent and identically distributed (i.i.d.) distributions. In this paper, we pointed out that the conventional arithmetic coding has the possibility of burst outputs between the encoder and the output buffer, and this brings up a number of potential risks. To solve this issue, we present a new arithmetic coding which encodes the output bitstream in reflected binary codes. The analysis shows that the proposed coding method can avoid the burst outputs during the encoding. The comparisons with Huffman codes, conventional arithmetic codes and Asymmetric numeral system are discussed. Simulations show that the proposed approach has better throughput performance than the conventional approach.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"213 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121277461","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}
{"title":"Decoding Scheduling for Unequal Error Protection Quasi-Cyclic Low-Density Parity-Check Codes","authors":"Jia-jyun Wu, Chung-hsuan Wang, Chi-chao Chao","doi":"10.1109/IWSDA46143.2019.8966090","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966090","url":null,"abstract":"Algebraic constructions of quasi-cyclic (QC) low-density parity-check (LDPC) codes with unequal error protection (UEP) capabilities have recently been proposed, which can provide different error-correcting capabilities for different parts of the coded bits. However, conventional decoding algorithms are not designed for LDPC codes with UEP. In this paper, we propose three decoding schemes for UEP QC-LDPC codes extended from existing scheduling strategies, tailored to the special structures of the parity-check matrices. Simulation results show that the proposed schemes can provide improved error rate performance especially for coded bits on low protection levels. The decoding convergence can also be accelerated, thereby reducing the computational complexity.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"192 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114205659","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}
{"title":"An Approach for Computing the Number of Points on Elliptic Curve y2 = x3 + a (mod p) via Explicit Formula for That Number Modulo p","authors":"Y. Borissov, M. Markov","doi":"10.1109/IWSDA46143.2019.8966127","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966127","url":null,"abstract":"We present an efficient approach for determining the cardinality of the set of points on each elliptic curve of the family $mathcal{E}_p = {E_a :y^2 = x^3 + a,(mod,p),a in mathbb{Z}_p^* }$ by applying the famous Hasse’s bound together with an explicit formula for that cardinality reduced to modulo p which is derived by us. As a by-product it is shown that for fixed p ≡ 1 (mod 6) those cardinalities take exactly six distinct values. The latter permits us to provide a reasoning why the curve E7 employed by Bitcoin system has an optimal resistance among the curves from ℰp against the EC variant of Pohlig-Hellman algorithm when p is the actual modulo used in that system. This approach allows also to give another proof of the known result that in case p ≡ 2 (mod 3) the cardinalities of all curves from ℰp are equal to p + 1.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"412 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124399489","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}
{"title":"The Boomerang Uniformity of Power Permutations x2k−1 over F2n*","authors":"Zhengbang Zha, L. Hu","doi":"10.1109/IWSDA46143.2019.8966114","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966114","url":null,"abstract":"The boomerang uniformity is a safety index of S-boxes, which measures the resistance of block ciphers to the boomerang attack. In this paper, we investigate the boomerang uniformity of power permutations of the form x<sup>2</sup><sup>k</sup><sup>−1</sup> over $mathbb{F}_{2^n}$. As a result, the relationship between the differential uniformity and the boomerang uniformity of x<sup>2</sup><sup>k</sup><sup>−1</sup> is given. Especially, for even n, the boomerang uniformity of power permutation x<sup>7</sup> is completely determined.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"74 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122283546","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}
{"title":"Large Zero Correlation Zones of Golay Complementary Sets","authors":"Yong Wang, Tinghua Hu, Yang Yang, Zhengchun Zhou","doi":"10.1109/IWSDA46143.2019.8966105","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966105","url":null,"abstract":"Golay complementary sets (GCSs) and zero correlation zone (ZCZ) sequences are widely used in communication systems respectively. In this paper, inspired by Chen and Wu’s work, we found more new GCSs with large ZCZ property, which have not been reported before. These proposed sequence sets are strong candidates for synchronization in communication systems.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"143 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123342267","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}
{"title":"Two Lower Bounds on the Secrecy Capacity of the Action-dependent Dirty Paper Wiretap Channel","authors":"Linman Yu, Zhuojun Zhuang, Zheng Ma, Bin Dai","doi":"10.1109/IWSDA46143.2019.8966104","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966104","url":null,"abstract":"In this paper, we study the state-dependent Gaussian wiretap channel with action encoder and noncausal state at the transmitter, which is also called the action-dependent dirty paper wiretap channel. Two lower bounds on the secrecy capacity of this model are provided, and we find that the two bounds have their advantages and disadvantages, i.e., none of the two always performs better than the other. In addition, we find that taking action on the state helps to increase the achievable secrecy rate of the dirty paper wiretap channel.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133892430","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}