In dataflow representations for signal processing systems, applications are represented as directed graphs in which vertices represent computations and edges correspond to buffers that store data as it passes among computations. The edges in the dataflow graph are single-input, single-output components that manage data transmission in a first-in, first-out (FIFO) fashion. In this paper, we formulate the vertices and edges into concepts called “active blocks” and “passive blocks”, respectively in the graph representation. Computation in the dataflow graph is represented as “active blocks”, while the concept of dataflow buffers is represented as “passive blocks”. Like dataflow edges, passive blocks are used to store data during the intervals between its production and consumption by actors. However, passive blocks can have multiple inputs and multiple outputs, and can incorporate operations on and rearrangements of the stored data subject to certain constraints. We define a form of flowgraph representation that is based on replacing dataflow edges with the proposed concept of passive blocks. We present a structured design methodology for utilizing this new form of signal processing flowgraph, and demonstrate its application to improving memory management efficiency, and execution time performance.

在信号处理系统的数据流表示中，应用程序表示为有向图，其中顶点表示计算，边对应于在数据通过计算时存储数据的缓冲区。数据流图中的边缘是单输入单输出组件，以先进先出（FIFO）的方式管理数据传输。在本文中，我们在图形表示中将顶点和边分别表述为称为“主动块”和“被动块”的概念。数据流图中的计算表示为“主动块”，而数据流缓冲区的概念表示为“被动块”。像数据流边缘一样，无源块用于在参与者生产和消费之间的时间间隔内存储数据。然而，无源块可以具有多个输入和多个输出，并且可以在某些约束下合并对存储的数据进行的操作和重新排列。我们定义了一种流程图表示形式，该形式基于用所提出的无源块概念替换数据流边缘。我们提出了一种利用这种新形式的信号处理流程图的结构化设计方法，并演示了其在提高内存管理效率和执行时间性能方面的应用。