Uniquely generated paraunitary-based complementary QAM sequences

2017 51st Asilomar Conference on Signals, Systems, and Computers Pub Date : 2017-10-01 DOI:10.1109/ACSSC.2017.8335659

P. Spasojevic, Srdjan Z. Budisin

{"title":"Uniquely generated paraunitary-based complementary QAM sequences","authors":"P. Spasojevic, Srdjan Z. Budisin","doi":"10.1109/ACSSC.2017.8335659","DOIUrl":null,"url":null,"abstract":"A Boolean generator for a broad set of standard pairs of complex valued complementary sequences of length 2K is proposed. Binary, M-PSK and QAM sequences can be generated. The Boolean generator is derived from our earlier paraunitary algorithm from 2013 that is based on matrix multiplication. Both algorithms are based on unitary matrices. In contrast to previous Boolean QAM algorithms, which have an additive form, our algorithm has a multiplicative form. Any element of the sequence can be efficiently generated by indexing entries of K unitary matrices using a binary counter. MQum generation algorithm uses exactly M <K QAM unitary matrices each having at least one non-unit-norm entry. Greatest common divisor of Gaussian integers plays a key role in ensuring that the algorithm generates a set of unique sequences and, consequently, in deriving their enumeration formula. Our 1Qum and 2Qum algorithms generate generalized Case I, II and III, as well as, generalized Case IV and V sequences given by Liu et al. in 2013, respectively, in addition to many other sequences. The ratio of the total number to Case I-V sequences grows with the constellation size and the sequence length. As an example, for 1024-QAM and length 1024, our algorithm generates 340% additional sequences.","PeriodicalId":296208,"journal":{"name":"2017 51st Asilomar Conference on Signals, Systems, and Computers","volume":"2 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 51st Asilomar Conference on Signals, Systems, and Computers","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ACSSC.2017.8335659","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}

引用次数: 1

Abstract

A Boolean generator for a broad set of standard pairs of complex valued complementary sequences of length 2K is proposed. Binary, M-PSK and QAM sequences can be generated. The Boolean generator is derived from our earlier paraunitary algorithm from 2013 that is based on matrix multiplication. Both algorithms are based on unitary matrices. In contrast to previous Boolean QAM algorithms, which have an additive form, our algorithm has a multiplicative form. Any element of the sequence can be efficiently generated by indexing entries of K unitary matrices using a binary counter. MQum generation algorithm uses exactly M

查看原文本刊更多论文

唯一生成的基于准酉的互补QAM序列

提出了一种长度为2K的复值互补序列的广义标准对集的布尔生成器。二进制，M-PSK和QAM序列可以生成。布尔生成器源自我们2013年基于矩阵乘法的较早的准酉算法。这两种算法都基于酉矩阵。与以前的布尔QAM算法(具有加法形式)相比，我们的算法具有乘法形式。序列的任何元素都可以通过使用二进制计数器索引K个酉矩阵的条目来有效地生成。MQum生成算法使用M

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

2017 51st Asilomar Conference on Signals, Systems, and Computers

自引率

0.00%

发文量

京公网安备 11010802042870号

Book学术文献互助群
群号：481959085