Families of multi-level Legendre-like arrays

IF 1.2 4区 计算机科学 Q4 COMPUTER SCIENCE, ARTIFICIAL INTELLIGENCE Annals of Mathematics and Artificial Intelligence Pub Date : 2023-11-02 DOI:10.1007/s10472-023-09903-9
Timothy Petersen, Benjamin Cavy, David Paganin, Imants Svalbe
{"title":"Families of multi-level Legendre-like arrays","authors":"Timothy Petersen,&nbsp;Benjamin Cavy,&nbsp;David Paganin,&nbsp;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 (ij) 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.

查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多级 Legendre-like 阵列族
本文介绍了新的、多层次的整数二维阵列族,作为著名的二元 Legendre 序列的扩展,这些序列来自二次残差。我们以傅里叶变换和有限拉顿变换为基础,介绍了周期性完美阵列族的构造,对于许多素值 p,每个阵列的大小都是\(p\times p\) 。以前,delta 函数被用作离散投影,当反向投影时,就会建立二维完美阵列。在这里,我们使用完美序列作为离散投影视图。基本族的大小是 \(p+1\)。这些多级阵列族的所有成员都具有完美的自相关性和恒定的最小交叉相关性。本文给出了这些新阵列的四个有用的一般特性的证明。1)它们由奇数整数组成,其值最多在\(-p\)和\(+p\)之间,只有一个位置的值为零。2)它们具有 "共轭 "空间对称性,即位置(i,j)上的值总是位置((p-i,p-j))上值的负值。3) 阵列原点值的任何变化都会使其所有非峰值自相关值保持不变。4) \(p+1\)、\(p/times p\) 数组的族可以被压缩到大小为 \((p+1)^2\),并且每个族成员都可以在一次 \(p/times p\) 解压缩中被精确快速地解压缩。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence 工程技术-计算机:人工智能
CiteScore
3.00
自引率
8.30%
发文量
37
审稿时长
>12 weeks
期刊介绍: 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.
期刊最新文献
Time-penalised trees (TpT): introducing a new tree-based data mining algorithm for time-varying covariates Conformal test martingales for hypergraphical models Costly information providing in binary contests Tumato 2.0 - a constraint-based planning approach for safe and robust robot behavior Calibration methods in imbalanced binary classification
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1