Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966092
C. Peng, Lei Yang, Xiaomin Jiang, Yue Song, Sha Zou
In this paper, a simple model of ship radiated noise is designed. Firstly, the characteristics of ship radiated noise are analyzed. Then, according to the characteristics of ship radiated noise, the calculation model of sound field, the line spectrum component and the continuous spectrum component of radiated noise are established respectively, Simple model has the advantages of high calculation efficiency and more practicability. At the same time, we use the simple ship radiated noise model to carry out the application of high-order cumulant in weak signal detection. Experiments and simulation results show that the simple ship radiated noise model established in this paper is in line with the characteristics of ship radiated noise, and has very good reference and application value. Simultaneously, the simulation results show that the slice spectrum of high-order cumulant has obvious advantages over the power spectrum (second-order spectrum). High-order spectrum can effectively extract the harmonic components of radiated noise, and can also be used for the detection of quadratic phase coupling.
{"title":"A Simple Ship Radiated Noise Model and Its Application in Weak Signal Detection Based on Higher Order Cumulant","authors":"C. Peng, Lei Yang, Xiaomin Jiang, Yue Song, Sha Zou","doi":"10.1109/IWSDA46143.2019.8966092","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966092","url":null,"abstract":"In this paper, a simple model of ship radiated noise is designed. Firstly, the characteristics of ship radiated noise are analyzed. Then, according to the characteristics of ship radiated noise, the calculation model of sound field, the line spectrum component and the continuous spectrum component of radiated noise are established respectively, Simple model has the advantages of high calculation efficiency and more practicability. At the same time, we use the simple ship radiated noise model to carry out the application of high-order cumulant in weak signal detection. Experiments and simulation results show that the simple ship radiated noise model established in this paper is in line with the characteristics of ship radiated noise, and has very good reference and application value. Simultaneously, the simulation results show that the slice spectrum of high-order cumulant has obvious advantages over the power spectrum (second-order spectrum). High-order spectrum can effectively extract the harmonic components of radiated noise, and can also be used for the detection of quadratic phase coupling.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"1 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":"129453563","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966112
Zhi Jing, Gangsan Kim, Hong‐Yeop Song
We propose a construction for binary locally repairable codes (LRCs) with locality r = 2 using the concatenated structure of the punctured code and cyclic code. From the proposed construction, we found some new LRCs with larger dimension then those by C. Kim in 2018 at some length of n.
{"title":"A Concatenated Binary Locally Repairable Codes With Locality 2 Using Puncturing","authors":"Zhi Jing, Gangsan Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966112","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966112","url":null,"abstract":"We propose a construction for binary locally repairable codes (LRCs) with locality r = 2 using the concatenated structure of the punctured code and cyclic code. From the proposed construction, we found some new LRCs with larger dimension then those by C. Kim in 2018 at some length of n.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"20 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":"126876187","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966122
T. Kojima
Hadamard matrix is defined as a square matrix where any components are −1 or +1, and where any pairs of rows are mutually orthogonal. In this work, we consider the similar matrix on finite field GF(p) where p is an odd prime. In such a matrix, every component is one of the integers on GF(p){0}, that is, {1, 2, . . . , p–1}. Any additions and multiplications should be executed under modulo p. The author has proposed a method to generate such matrices, and applied them to generate n-shift orthogonal sequences and complete complementary codes. The generated complete complementary code is a family of multi-valued sequences on GF(p){0}, where the number of sequence sets, the number of sequences in each sequence set and the sequence length depend on the various divisors of p – 1. Such complete complementary codes with various parameters have not been proposed in previous studies. In this paper, some properties of those matrices are shown to give various construction methods.
阿达玛矩阵被定义为任意分量为- 1或+1，且任意行对相互正交的方阵。本文研究有限域GF(p)上的相似矩阵，其中p为奇素数。在这样的矩阵中，每个分量都是GF(p){0}上的整数之一，即{1,2，…, p - 1}。任何加法和乘法都应在模p下进行。作者提出了一种生成这种矩阵的方法，并将其应用于生成n移正交序列和完全互补码。生成的完全互补码是GF(p){0}上的一组多值序列，其中序列集的个数、每个序列集中的序列个数和序列长度取决于p - 1的各个因数。这种具有各种参数的完备互补码在以往的研究中尚未被提出。本文给出了这些矩阵的一些性质，并给出了各种构造方法。
{"title":"Some Properties of Hadamard-type Matrices on Finite Fields","authors":"T. Kojima","doi":"10.1109/IWSDA46143.2019.8966122","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966122","url":null,"abstract":"Hadamard matrix is defined as a square matrix where any components are −1 or +1, and where any pairs of rows are mutually orthogonal. In this work, we consider the similar matrix on finite field GF(p) where p is an odd prime. In such a matrix, every component is one of the integers on GF(p){0}, that is, {1, 2, . . . , p–1}. Any additions and multiplications should be executed under modulo p. The author has proposed a method to generate such matrices, and applied them to generate n-shift orthogonal sequences and complete complementary codes. The generated complete complementary code is a family of multi-valued sequences on GF(p){0}, where the number of sequence sets, the number of sequences in each sequence set and the sequence length depend on the various divisors of p – 1. Such complete complementary codes with various parameters have not been proposed in previous studies. In this paper, some properties of those matrices are shown to give various construction methods.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"14 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":"126433700","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966103
Kangquan Li, Sihem Mesnager, Longjiang Qu
2-to-1 mappings over finite fields play important roles in symmetric cryptography, such as APN functions, bent functions, semi-bent functions and so on. Very recently, Mesnager and Qu [9] provided a systematic study of 2-to-1 mappings over finite fields. Particularly, they determined all 2-to-1 mappings of degree ≤ 4 over any finite fields. In addition, another research direction is to consider 2-to-1 polynomials with few terms. Some results about 2-to-1 monomials and binomials can be found in [9].Motivated by their work, in this present paper, we continue studying 2-to-1 mappings, particularly, over finite fields with characteristic 2. Firstly, we determine 2-to-1 polynomials with degree 5 over $mathbb{F}_{2^n}$ completely by the Hasse-Weil bound. Besides, using the multivariate method and the resultant of two polynomials, we present two classes of 2-to-1 trinomials and four classes of 2-to-1 quadrinomials over $mathbb{F}_{2^n}$.
{"title":"Further study of 2-to-1 mappings over F2n","authors":"Kangquan Li, Sihem Mesnager, Longjiang Qu","doi":"10.1109/IWSDA46143.2019.8966103","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966103","url":null,"abstract":"2-to-1 mappings over finite fields play important roles in symmetric cryptography, such as APN functions, bent functions, semi-bent functions and so on. Very recently, Mesnager and Qu [9] provided a systematic study of 2-to-1 mappings over finite fields. Particularly, they determined all 2-to-1 mappings of degree ≤ 4 over any finite fields. In addition, another research direction is to consider 2-to-1 polynomials with few terms. Some results about 2-to-1 monomials and binomials can be found in [9].Motivated by their work, in this present paper, we continue studying 2-to-1 mappings, particularly, over finite fields with characteristic 2. Firstly, we determine 2-to-1 polynomials with degree 5 over $mathbb{F}_{2^n}$ completely by the Hasse-Weil bound. Besides, using the multivariate method and the resultant of two polynomials, we present two classes of 2-to-1 trinomials and four classes of 2-to-1 quadrinomials over $mathbb{F}_{2^n}$.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"1 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":"131415053","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966117
Qiaoling Zhang, Lei Zheng, Minquan Cheng, Qingchun Chen
Recently, coded caching has been widely studied due to its ability of significantly reducing the amount of transmissions (i.e., rate) during peak-traffic time. While to achieve this rate, each file is divided into a number of packets, which is even exponentially increasing with users. In practice, we prefer to design a coded caching scheme to achieve smaller rate with lower packet number. In order to reduce the packet number, the well known grouping method has been proposed by Shanmugam et al. in [1] and generated by Cheng et al. in [2]. However, the rate of the scheme obtained by grouping method is very large since there is no multicasting gain generated between different user groups. Thus, many other schemes have been investigated from other perspective. In this paper, we will show that when some files are requested more than once, the scheme obtained by grouping method has a smaller rate and smaller packet numbers than that of some other improved schemes.
{"title":"The Advantages of Grouping Method for Repeated Requests in Coded Caching","authors":"Qiaoling Zhang, Lei Zheng, Minquan Cheng, Qingchun Chen","doi":"10.1109/IWSDA46143.2019.8966117","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966117","url":null,"abstract":"Recently, coded caching has been widely studied due to its ability of significantly reducing the amount of transmissions (i.e., rate) during peak-traffic time. While to achieve this rate, each file is divided into a number of packets, which is even exponentially increasing with users. In practice, we prefer to design a coded caching scheme to achieve smaller rate with lower packet number. In order to reduce the packet number, the well known grouping method has been proposed by Shanmugam et al. in [1] and generated by Cheng et al. in [2]. However, the rate of the scheme obtained by grouping method is very large since there is no multicasting gain generated between different user groups. Thus, many other schemes have been investigated from other perspective. In this paper, we will show that when some files are requested more than once, the scheme obtained by grouping method has a smaller rate and smaller packet numbers than that of some other improved schemes.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"47 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":"124072509","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966089
Jinchen Bao, Rong Shi, Xuehua Wang, Chang Liu, Ke Deng, Jian Yan
This paper investigates the error performance of uplink sparse code multiple access (SCMA) over Rician fading channels, with the assumption of joint maximum likelihood multiuser detection. We provide an expression for the pairwise-error probability of SCMA codewords, for multiuser signaling in the presence of additive white Gaussian noise and independent Rician fadings. Based on the derived codeword pairwise-error probability, a tight upper bound on the average codeword error probability is then developed by using multiuser union bound estimation, which gives an accurate evaluation of the error performance of uplink SCMA. Simulations are carried out for different Rician channel scenarios, to verify the effectiveness of the analysis.
{"title":"Performance Analysis of Uplink Sparse Code Multiple Access in Rician Fading","authors":"Jinchen Bao, Rong Shi, Xuehua Wang, Chang Liu, Ke Deng, Jian Yan","doi":"10.1109/IWSDA46143.2019.8966089","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966089","url":null,"abstract":"This paper investigates the error performance of uplink sparse code multiple access (SCMA) over Rician fading channels, with the assumption of joint maximum likelihood multiuser detection. We provide an expression for the pairwise-error probability of SCMA codewords, for multiuser signaling in the presence of additive white Gaussian noise and independent Rician fadings. Based on the derived codeword pairwise-error probability, a tight upper bound on the average codeword error probability is then developed by using multiuser union bound estimation, which gives an accurate evaluation of the error performance of uplink SCMA. Simulations are carried out for different Rician channel scenarios, to verify the effectiveness of the analysis.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"1 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":"126153650","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966119
Jiahuan Wang, P. Fan, Zhengchun Zhou, Yang Yang
In this paper, sequences with low local ambiguity functions are presented by analyzing the matrix-valued ambiguity function in a fully polarimetric radar system, and then generated by majorization minimization algorithm. The two sequences, formed from the obtained Quasi Z-complementary pair whose transmission orders are determined by the Prouhet-Thue-Morse sequence and the Alamouti matrix, can result in a low local autoambiguity function in a modest Doppler shift interval and a very low local cross-ambiguity function among all Doppler shifts.
{"title":"Doppler Resilient Sequences with Low Local Ambiguity Functions for Fully Polarimetric Radar Systems","authors":"Jiahuan Wang, P. Fan, Zhengchun Zhou, Yang Yang","doi":"10.1109/IWSDA46143.2019.8966119","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966119","url":null,"abstract":"In this paper, sequences with low local ambiguity functions are presented by analyzing the matrix-valued ambiguity function in a fully polarimetric radar system, and then generated by majorization minimization algorithm. The two sequences, formed from the obtained Quasi Z-complementary pair whose transmission orders are determined by the Prouhet-Thue-Morse sequence and the Alamouti matrix, can result in a low local autoambiguity function in a modest Doppler shift interval and a very low local cross-ambiguity function among all Doppler shifts.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"2012 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":"127398189","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966106
Huan Chen, P. Fan, Li Li
To support massive Machine Type Communications (mMTC) applications, especially for overcoming the high overhead problem, compressive sensing algorithm for grantfree multiple access is advocated. For an mMTC system with a large number of users, in most existing research, each user is allocated a complex Gaussian random sequence, and approximated message passing (AMP) algorithm is normally employed at the receiver to detect the active users. In this paper, binary deterministic sequences are considered, resulting much simpler implementation. It is shown that, due to the smaller coherence value, significant performance gain can be obtained by employing the binary deterministic sequences into AMP process. In particular, binary quasi-orthogonal sequences (QOS) exhibit excellent performance in the short-packet transmission. Moreover, an improved AMP algorithm is presented by designing a new stopping criterion to reduce the number of iterations without loss of accuracy.
{"title":"Active Users Detection Based on Deterministic Sequences for Massive Connectivity","authors":"Huan Chen, P. Fan, Li Li","doi":"10.1109/IWSDA46143.2019.8966106","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966106","url":null,"abstract":"To support massive Machine Type Communications (mMTC) applications, especially for overcoming the high overhead problem, compressive sensing algorithm for grantfree multiple access is advocated. For an mMTC system with a large number of users, in most existing research, each user is allocated a complex Gaussian random sequence, and approximated message passing (AMP) algorithm is normally employed at the receiver to detect the active users. In this paper, binary deterministic sequences are considered, resulting much simpler implementation. It is shown that, due to the smaller coherence value, significant performance gain can be obtained by employing the binary deterministic sequences into AMP process. In particular, binary quasi-orthogonal sequences (QOS) exhibit excellent performance in the short-packet transmission. Moreover, an improved AMP algorithm is presented by designing a new stopping criterion to reduce the number of iterations without loss of accuracy.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"8 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":"127482522","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966126
Shangyao Huang, Hanxu Hou, Xiangshou Yu
EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.
{"title":"A Lower Bound on Disk Reads for Single Information Disk Failure Recovery and One Recovery Scheme for EVENODD(p, 3)","authors":"Shangyao Huang, Hanxu Hou, Xiangshou Yu","doi":"10.1109/IWSDA46143.2019.8966126","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966126","url":null,"abstract":"EVENODD(p, 3) are binary MDS array codes with p information columns and three parity columns. When an information column fails, we can recover the failed information bits by downloading some bits from p−1 surviving information columns and three parity columns. In this paper, we derive a lower bound on the total number of bits downloaded during the repair process. Moreover, we present an algorithm for the single information recovery of EVENODD(p, 3). The results show that the total number of bits downloaded during the repair process of our algorithm is less than that of the existing algorithm.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"67 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":"123856187","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}
Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966109
Sota Eguchi, Takeru Miyazaki, Shunsuke Araki, S. Uehara, Y. Nogami
In this paper, we focus on binary sequences obtained from piecewise logistic map over integers, and show the relation between the Lyapunov exponents of the maps and results of the NIST tests for the sequences. When the Lyapunov exponent is a negative value, we confirm that the branch diagram is sparse and the bit occurrence rate is also greatly biased. We also give a sample of that the positive/negative signs of the Lyapunov exponents mostly coincide on the evaluations of the NIST tests. From the branching diagram of the piecewise logistic map, we can moreover find that there are many good pseudorandom sequences generated by the individual control parameters of the map.
{"title":"Relations Between Evaluations of NIST Tests and Lyapunov Exponents of Sequences Generated by the Piecewise Logistic Map over Integers","authors":"Sota Eguchi, Takeru Miyazaki, Shunsuke Araki, S. Uehara, Y. Nogami","doi":"10.1109/IWSDA46143.2019.8966109","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966109","url":null,"abstract":"In this paper, we focus on binary sequences obtained from piecewise logistic map over integers, and show the relation between the Lyapunov exponents of the maps and results of the NIST tests for the sequences. When the Lyapunov exponent is a negative value, we confirm that the branch diagram is sparse and the bit occurrence rate is also greatly biased. We also give a sample of that the positive/negative signs of the Lyapunov exponents mostly coincide on the evaluations of the NIST tests. From the branching diagram of the piecewise logistic map, we can moreover find that there are many good pseudorandom sequences generated by the individual control parameters of the map.","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":"128099171","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：