{"title":"基于Parker变换的oacf保持运算","authors":"Geyang Wang, Qi Wang","doi":"10.1109/IWSDA46143.2019.8966094","DOIUrl":null,"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.0000,"publicationDate":"2019-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"An OACF-Preserving Operation Based on Parker’s Transformation\",\"authors\":\"Geyang Wang, Qi Wang\",\"doi\":\"10.1109/IWSDA46143.2019.8966094\",\"DOIUrl\":null,\"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.0000,\"publicationDate\":\"2019-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWSDA46143.2019.8966094\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 Ninth International Workshop on Signal Design and its Applications in Communications (IWSDA)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWSDA46143.2019.8966094","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
An OACF-Preserving Operation Based on Parker’s Transformation
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.