We revisit existing linear computation coding (LCC) algorithms, and introduce a new framework that measures the computational cost of computing multidimensional linear functions, not only in terms of the number of additions, but also with respect to their suitability for parallel processing. Utilizing directed acyclic graphs, which correspond to signal flow graphs in hardware, we propose a novel LCC algorithm that controls the trade-off between the total number of operations and their parallel executability. Numerical evaluations show that the proposed algorithm, constrained to a fully parallel structure, outperforms existing schemes.

翻译：我们重新审视了现有的线性计算编码（Linear Computation Coding, LCC）算法，并提出了一种新的框架，该框架不仅从加法次数角度衡量多维线性函数的计算成本，还关注其并行处理的适用性。利用与硬件中信号流图相对应的有向无环图，我们提出了一种新颖的LCC算法，该算法能够控制总运算次数与其并行可执行性之间的折中。数值评估表明，所提出的算法在约束为全并行结构时，优于现有方案。