递归重建和检索方法加速大规模数字编码元表面的快速电磁验证
Fast Electromagnetic Validations of Large-Scale Digital Coding Metasurfaces Accelerated by Recurrence Rebuild and Retrieval Method
摘要:
提出了一种递归重建与检索方法(R3 M),用于加速大规模数字编码元表面(DCM)的电磁(EM)验证。R3 M旨在加速具有不同码本的DCM的EM验证,这涉及到一组相似但不相同的结构的分析。该方法通过将每个编码单元替换为包含所有可能编码状态的宏单元,将一般DCM变换为严格周期阵列。与严格周期阵列对应的系统矩阵通过隐式检索被具有任意码本的DCM全局共享。周期边界的基延拓消除了棱单元和角单元相互作用的差异。此外,分层模式开发(HPE)算法被用来有效地组装系统矩阵,以进一步加速。由于R3 M-HPE充分利用了矩阵的刚性周期性,理论上其计算复杂度低于相同范式下的$\mathcal{H}$ -矩阵。对两类DCM的数值计算结果表明,与商业软件相比,R3 M-HPE是准确的。此外,R3 M-HPE还兼容预处理,以实现高效的迭代解决方案。R3 M-HPE在存储和CPU时间成本方面的效率优于传统的快速算法。
英文摘要:
The recurrence rebuild and retrieval method (R3M) is proposed in this paper to accelerate the electromagnetic (EM) validations of large-scale digital coding metasurfaces (DCMs). R3M aims to accelerate the EM validations of DCMs with varied codebooks, which involves the analysis of a group of similar but not identical structures. The method transforms general DCMs to rigorously periodic arrays by replacing each coding unit with the macro unit, which comprises all possible coding states. The system matrix corresponding to the rigorously periodic array is globally shared for DCMs with arbitrary codebooks via implicit retrieval. The discrepancy of the interactions for edge and corner units are precluded by the basis extension of periodic boundaries. Moreover, the hierarchical pattern exploitation (HPE) algorithm is leveraged to efficiently assemble the system matrix for further acceleration. Due to the fully utilization of the rigid periodicity, the computational complexity of R3M-HPE is theoretically lower than that of $\mathcal{H}$-matrix within the same paradigm. Numerical results for two types of DCMs indicate that R3M-HPE is accurate in comparison with commercial software. Besides, R3M-HPE is also compatible with the preconditioning for efficient iterative solutions. The efficiency of R3M-HPE for DCMs outperforms the conventional fast algorithms in both the storage and CPU time cost.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。