The partitioning problem on VLSI arrays: I/O and local memory complexity
Wayne P. Burleson · 1991
The space/time costs of implementing the nonlocal communication of partitioned algorithms are studied. In addition, the author looks at the often-neglected issue of I/O complexity for partitioned algorithms. He illustrates the design method and tradeoffs with an example in DSP, the fixed-point multiply-accumulator (MAC).>