嵌套理想环形天线阵
Nested perfect toroidal arrays
摘要:
我们介绍二维环形阵列,是一个变种的德布鲁因托里。我们称之为嵌套完美环形阵列。而不是要求每个给定大小的数组只有一次出现,我们在同余类中划分位置,并要求每个同余类中只有一次出现。我们还要求这个属性递归地应用于每个子数组。给出了一种基于Pascal模2三角矩阵的嵌套最佳环形阵列的构造方法。对于两个符号的字母表,$n$是$2$的幂,我们的方法产生$2^{n^2+n-1}$不同的嵌套完美的环形阵列分配所有不同的$n\times n$阵列在每个同余类,从取行号模$n$和列数模$n$。
英文摘要:
We introduce two-dimensional toroidal arrays that are a variant of the de Bruijn tori. We call them nested perfect toroidal arrays. Instead of asking that every array of a given size has exactly one occurrence, we partition the positions in congruence classes and we ask exactly one occurrence in each congruence class. We also ask that this property applies recursively to each of the subarrays. We give a method to construct nested perfect toroidal arrays based on Pascal triangle matrix modulo 2. For the two-symbol alphabet, and for $n$ being a power of $2$, our method yields $2^{n^2+n-1}$ different nested perfect toroidal arrays allocating all the different $n\times n$ arrays in each congruence class that arises from taking the line number modulo $n$ and the column number modulo $n$.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。