Pub Date : 2019-10-01DOI: 10.1109/IWSDA46143.2019.8966102
H. Han, Limengnan Zhou, Xing Liu
Low hit zone frequency hopping sequences (LHZ FHSs) with favorable partial Hamming correlation properties are desirable in quasi-synchronous frequency hopping multiple-access systems. An LHZ FHS set is said to be strictly optimal if it has optimal partial Hamming correlation for all correlation windows. In this paper, we propose an interleaved construction of new sets of strictly optimal LHZ FHSs. By choosing suitable known optimal FHSs and certain appropriate shift sequences, strictly optimal LHZ FHS sets with new and flexible parameters can be obtained.
{"title":"New Construction for Low Hit Zone Frequency Hopping Sequence Sets with Optimal Partial Hamming Correlation","authors":"H. Han, Limengnan Zhou, Xing Liu","doi":"10.1109/IWSDA46143.2019.8966102","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966102","url":null,"abstract":"Low hit zone frequency hopping sequences (LHZ FHSs) with favorable partial Hamming correlation properties are desirable in quasi-synchronous frequency hopping multiple-access systems. An LHZ FHS set is said to be strictly optimal if it has optimal partial Hamming correlation for all correlation windows. In this paper, we propose an interleaved construction of new sets of strictly optimal LHZ FHSs. By choosing suitable known optimal FHSs and certain appropriate shift sequences, strictly optimal LHZ FHS sets with new and flexible parameters can be obtained.","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":"134362460","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.8966093
Yajing Zhou, Zhengchun Zhou, Yang Yang
Complementary sequences with quadrature amplitude modulation (QAM) are proposed to deal with the high peakto- mean envelope power ratio (PMEPR) problem in Orthogonal frequency-division multiplexing (OFDM) systems. There have been many constructions of 4q-QAM Golay complementary sequences of length 2m. This paper presents a construction of 4q-QAM complementary sequence sets of size 4 with non-power-of-two lengths, whose PMEPRs are upper bounded by 4. The number of 4q-QAM complementary sequences generated from this construction is also calculated in this paper.
{"title":"4q-QAM Complementary Sequence Sets with Non-Power-of-Two Length*","authors":"Yajing Zhou, Zhengchun Zhou, Yang Yang","doi":"10.1109/IWSDA46143.2019.8966093","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966093","url":null,"abstract":"Complementary sequences with quadrature amplitude modulation (QAM) are proposed to deal with the high peakto- mean envelope power ratio (PMEPR) problem in Orthogonal frequency-division multiplexing (OFDM) systems. There have been many constructions of 4q-QAM Golay complementary sequences of length 2m. This paper presents a construction of 4q-QAM complementary sequence sets of size 4 with non-power-of-two lengths, whose PMEPRs are upper bounded by 4. The number of 4q-QAM complementary sequences generated from this construction is also calculated in this paper.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"12 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":"114358734","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.8966091
Peihua Li, Cuiling Fan, Yang Yang
In frequency-hopping systems, there should be a wide frequency-hopping gap between two adjacent frequencies in case the received signals are prone to be interfered by staying at one frequency point for a long time. In this paper, a bound on the maximum partial Hamming autocorrelation of wide-gap frequency-hopping sequence (WGFHS) and two bounds on the maximum partial Hamming correlation of WGFHS sets are discussed. Moreover, the proposed bounds are tighter than the existing Eun-Jin-Hong-Song bound and Zhou-Tang-Niu-Udaya bounds in the sense that they can be achieved by the parameters of some WGFHSs and they are obtained in the literature for the first time.
{"title":"New Bounds on the Partial Hamming Correlation of Wide-Gap Frequency-Hopping Sequence Sets*","authors":"Peihua Li, Cuiling Fan, Yang Yang","doi":"10.1109/IWSDA46143.2019.8966091","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966091","url":null,"abstract":"In frequency-hopping systems, there should be a wide frequency-hopping gap between two adjacent frequencies in case the received signals are prone to be interfered by staying at one frequency point for a long time. In this paper, a bound on the maximum partial Hamming autocorrelation of wide-gap frequency-hopping sequence (WGFHS) and two bounds on the maximum partial Hamming correlation of WGFHS sets are discussed. Moreover, the proposed bounds are tighter than the existing Eun-Jin-Hong-Song bound and Zhou-Tang-Niu-Udaya bounds in the sense that they can be achieved by the parameters of some WGFHSs and they are obtained in the literature for the first time.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"119 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":"132942545","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.8966087
Shibsankar Das, P. Udaya, S. Majhi, Zilong Liu
In this paper, we first introduce a novel concept, called Z-paraunitary (ZPU) matrices. These ZPU matrices include conventional PU matrices as a special case. Then, we show that there exists an equivalence between a ZPU matrix and a Z-complementary code set (ZCCS) when the latter is expressed as a matrix with polynomial entries. The proposed ZPU matrix has an advantage over the conventional PU matrix with regard to the availability of wider range of matrix sizes and sequence lengths. In addition, the proposed construction framework can accommodate more choices of ZCCS parameters compared to the existing works.
{"title":"Construction of New Optimal Z-Complementary Code Sets from Z-Paraunitary Matrices","authors":"Shibsankar Das, P. Udaya, S. Majhi, Zilong Liu","doi":"10.1109/IWSDA46143.2019.8966087","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966087","url":null,"abstract":"In this paper, we first introduce a novel concept, called Z-paraunitary (ZPU) matrices. These ZPU matrices include conventional PU matrices as a special case. Then, we show that there exists an equivalence between a ZPU matrix and a Z-complementary code set (ZCCS) when the latter is expressed as a matrix with polynomial entries. The proposed ZPU matrix has an advantage over the conventional PU matrix with regard to the availability of wider range of matrix sizes and sequence lengths. In addition, the proposed construction framework can accommodate more choices of ZCCS parameters compared to the existing works.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"28 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":"121293747","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.8966111
Inseon Kim, Hong‐Yeop Song
In this paper, we propose a construction of parity-check equations for Low Density Parity-Check (LDPC) based Parity-Check Concatenated (PCC) polar codes in order to (i) increase the minimum Hamming weight and (ii) correct some errors using belief propagation decoding. We simulate some experiment to show that the proposed LDPC base PCC polar codes have coding gain in the sense of block error rate compared with existing PCC polar codes.
{"title":"A new class of parity-check concatenated polar codes using belief propagation decoding","authors":"Inseon Kim, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966111","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966111","url":null,"abstract":"In this paper, we propose a construction of parity-check equations for Low Density Parity-Check (LDPC) based Parity-Check Concatenated (PCC) polar codes in order to (i) increase the minimum Hamming weight and (ii) correct some errors using belief propagation decoding. We simulate some experiment to show that the proposed LDPC base PCC polar codes have coding gain in the sense of block error rate compared with existing PCC polar codes.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"76 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":"126290511","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.8966121
Gangsan Kim, Min Hyung Lee, Hong‐Yeop Song
In this paper, we calculate the number of binary sequences of length 2n – 1 that satisfy the run property, called run sequences. We know that only a small portion of those run sequences satisfy the span property. In this paper, in addition, we present some interesting properties of those run sequences with or without the span property.
{"title":"Some notes on the binary sequences of length 2n – 1 with the run property","authors":"Gangsan Kim, Min Hyung Lee, Hong‐Yeop Song","doi":"10.1109/IWSDA46143.2019.8966121","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966121","url":null,"abstract":"In this paper, we calculate the number of binary sequences of length 2n – 1 that satisfy the run property, called run sequences. We know that only a small portion of those run sequences satisfy the span property. In this paper, in addition, we present some interesting properties of those run sequences with or without the span property.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"18 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":"121286049","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.8966094
Geyang Wang, Qi Wang
Binary sequences with low odd-periodic correlation magnitudes have found important applications in communication systems. It is well known that the three operations, negacyclic shift, decimation, and negation, preserve the odd-periodic autocorrelation function (OACF) in general. In this paper, we define a new operation based on Parker’s transformation, which also preserves the OACF of binary sequences. This enables us to classify Parker’s 16 cases into 8 ones, and may possibly further allow to classify all constructions based on Parker’s transformation.
{"title":"An OACF-Preserving Operation Based on Parker’s Transformation","authors":"Geyang Wang, Qi Wang","doi":"10.1109/IWSDA46143.2019.8966094","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966094","url":null,"abstract":"Binary sequences with low odd-periodic correlation magnitudes have found important applications in communication systems. It is well known that the three operations, negacyclic shift, decimation, and negation, preserve the odd-periodic autocorrelation function (OACF) in general. In this paper, we define a new operation based on Parker’s transformation, which also preserves the OACF of binary sequences. This enables us to classify Parker’s 16 cases into 8 ones, and may possibly further allow to classify all constructions based on Parker’s transformation.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"54 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":"116419923","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.8966097
Xiuping Peng, Chengqian Xu, Yubo Li
Two mismatched sequences are called a mismatched periodic complementary pair if the sum of their periodic correlation functions is a delta function. In this paper, we present two constructions to obtain mismatched binary periodic complementary pairs with period 3q, where q is a prime, by using new generalized cyclotomy. One construction is based on the order 1 – 2, and the other is based on order 2 – 2. It is shown that many periods for which binary periodic complementary pairs are not exist become admissible for our constructions.
{"title":"Mismatched Binary Periodic Complementary Pairs with Period 3q","authors":"Xiuping Peng, Chengqian Xu, Yubo Li","doi":"10.1109/IWSDA46143.2019.8966097","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966097","url":null,"abstract":"Two mismatched sequences are called a mismatched periodic complementary pair if the sum of their periodic correlation functions is a delta function. In this paper, we present two constructions to obtain mismatched binary periodic complementary pairs with period 3q, where q is a prime, by using new generalized cyclotomy. One construction is based on the order 1 – 2, and the other is based on order 2 – 2. It is shown that many periods for which binary periodic complementary pairs are not exist become admissible for our constructions.","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":"121794956","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.8966096
Takeru Miyazaki, Shunsuke Araki, Kohei Kawase, S. Uehara, Y. Nogami
In this paper, we give some important characteristics of Knuth’s quadratic congruential sequences with a particular modulus as a pseudorandom number generator. For modulus m = 2W p where p is an odd prime, we derive some periodic relations of the sequence by using analysis results shown by Iwasaki and Umeno for their one-stroke polynomial. Accordingly, we have theoretical analysis for randomness of these sequences and evaluate pseudorandom number outputs by these sequences by the NIST statistical tests.
{"title":"Properties of Knuth’s Quadratic Congruential Sequences with Modulus m = 2W p","authors":"Takeru Miyazaki, Shunsuke Araki, Kohei Kawase, S. Uehara, Y. Nogami","doi":"10.1109/IWSDA46143.2019.8966096","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966096","url":null,"abstract":"In this paper, we give some important characteristics of Knuth’s quadratic congruential sequences with a particular modulus as a pseudorandom number generator. For modulus m = 2W p where p is an odd prime, we derive some periodic relations of the sequence by using analysis results shown by Iwasaki and Umeno for their one-stroke polynomial. Accordingly, we have theoretical analysis for randomness of these sequences and evaluate pseudorandom number outputs by these sequences by the NIST statistical tests.","PeriodicalId":326214,"journal":{"name":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","volume":"102 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":"115551116","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.8966095
Hang Mu
This paper presents a novel iterative decoding method for bit-interleaved polar coded modulation system (BIPCM) by using a soft-in soft-out (SISO) re-encoder. Associated with successive cancellation list (SCL) decoding, bit error rate (BER) and block error rate (BLER) are significantly improved, which verified the correctness and the effectiveness of the proposed iterative receiving strategy.
{"title":"Iterative Successive Cancellation List Decoding in Bit-interleaved Polar Coded Modulation System","authors":"Hang Mu","doi":"10.1109/IWSDA46143.2019.8966095","DOIUrl":"https://doi.org/10.1109/IWSDA46143.2019.8966095","url":null,"abstract":"This paper presents a novel iterative decoding method for bit-interleaved polar coded modulation system (BIPCM) by using a soft-in soft-out (SISO) re-encoder. Associated with successive cancellation list (SCL) decoding, bit error rate (BER) and block error rate (BLER) are significantly improved, which verified the correctness and the effectiveness of the proposed iterative receiving strategy.","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":"130290855","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
扫码关注我们
求助内容：
应助结果提醒方式：