用初等矩阵分解实现分布式图滤波器
Implementing distributed graph filters by elementary matrix decomposition
摘要:
在这封信中,我们考虑分布式图滤波器的实现问题,其中每个节点只能访问当前及其相邻节点的信号。通过使用高斯消除,我们表明,只要图是连接的,我们可以实现任何图滤波器分解成一个产品的直接可实现的过滤器,过滤器,只使用在当前和相邻节点的信号作为输入的过滤器。我们还包括一个具体的例子作为说明。
英文摘要:
In this letter, we consider the implementation problem of distributed graph filters, where each node only has access to the signals of the current and its neighboring nodes. By using Gaussian elimination, we show that as long as the graph is connected, we can implement any graph filter by decomposing the filter into a product of directly implementable filters, filters that only use the signals at the current and neighboring nodes as inputs. We have also included a concrete example as an illustration.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。