Timothy Petersen, Benjamin Cavy, David Paganin, Imants Svalbe
{"title":"Families of multi-level Legendre-like arrays","authors":"Timothy Petersen, Benjamin Cavy, David Paganin, Imants Svalbe","doi":"10.1007/s10472-023-09903-9","DOIUrl":null,"url":null,"abstract":"<div><p>Families of new, multi-level integer 2<i>D</i> arrays are introduced here as an extension of the well-known binary Legendre sequences that are derived from quadratic residues. We present a construction, based on Fourier and Finite Radon Transforms, for families of periodic perfect arrays, each of size <span>\\(p\\times p\\)</span> for many prime values <i>p</i>. Previously delta functions were used as the discrete projections which, when back-projected, build 2<i>D</i> perfect arrays. Here we employ perfect sequences as the discrete projected views. The base family size is <span>\\(p+1\\)</span>. All members of these multi-level array families have perfect autocorrelation and constant, minimal cross-correlation. Proofs are given for four useful and general properties of these new arrays. 1) They are comprised of odd integers, with values between at most <span>\\(-p\\)</span> and <span>\\(+p\\)</span>, with a zero value at just one location. 2) They have the property of ‘conjugate’ spatial symmetry, where the value at location (<i>i</i>, <i>j</i>) is always the negative of the value at location <span>\\((p-i, p-j)\\)</span>. 3) Any change in the value assigned to the array’s origin leaves all of its off-peak autocorrelation values unchanged. 4) A family of <span>\\(p+1\\)</span>, <span>\\(p\\times p\\)</span> arrays can be compressed to size <span>\\((p+1)^2\\)</span> and each family member can be exactly and rapidly unpacked in a single <span>\\(p\\times p\\)</span> decompression pass.</p></div>","PeriodicalId":7971,"journal":{"name":"Annals of Mathematics and Artificial Intelligence","volume":"92 1","pages":"169 - 182"},"PeriodicalIF":1.2000,"publicationDate":"2023-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s10472-023-09903-9.pdf","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Annals of Mathematics and Artificial Intelligence","FirstCategoryId":"94","ListUrlMain":"https://link.springer.com/article/10.1007/s10472-023-09903-9","RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE","Score":null,"Total":0}
引用次数: 0
Abstract
Families of new, multi-level integer 2D arrays are introduced here as an extension of the well-known binary Legendre sequences that are derived from quadratic residues. We present a construction, based on Fourier and Finite Radon Transforms, for families of periodic perfect arrays, each of size \(p\times p\) for many prime values p. Previously delta functions were used as the discrete projections which, when back-projected, build 2D perfect arrays. Here we employ perfect sequences as the discrete projected views. The base family size is \(p+1\). All members of these multi-level array families have perfect autocorrelation and constant, minimal cross-correlation. Proofs are given for four useful and general properties of these new arrays. 1) They are comprised of odd integers, with values between at most \(-p\) and \(+p\), with a zero value at just one location. 2) They have the property of ‘conjugate’ spatial symmetry, where the value at location (i, j) is always the negative of the value at location \((p-i, p-j)\). 3) Any change in the value assigned to the array’s origin leaves all of its off-peak autocorrelation values unchanged. 4) A family of \(p+1\), \(p\times p\) arrays can be compressed to size \((p+1)^2\) and each family member can be exactly and rapidly unpacked in a single \(p\times p\) decompression pass.
期刊介绍:
Annals of Mathematics and Artificial Intelligence presents a range of topics of concern to scholars applying quantitative, combinatorial, logical, algebraic and algorithmic methods to diverse areas of Artificial Intelligence, from decision support, automated deduction, and reasoning, to knowledge-based systems, machine learning, computer vision, robotics and planning.
The journal features collections of papers appearing either in volumes (400 pages) or in separate issues (100-300 pages), which focus on one topic and have one or more guest editors.
Annals of Mathematics and Artificial Intelligence hopes to influence the spawning of new areas of applied mathematics and strengthen the scientific underpinnings of Artificial Intelligence.