Building Systolic Messy Arrays for Infinite Iterative Algorithms(General Fundamentals and Boundaries)

スポンサーリンク

概要

• 論文の詳細を見る

• The size-dependent array problem is a problem with systolic arrays such that the size of systolic arrays limits the size of calculations, which in a do-loop structure controls how many times it is repeated and how deep the nesting loops are. A systolic array cannot deal with larger calculations. For the size-dependent array problem, a spiral systolic array has been studied so far. It has non-adjacent connections between PEs, such as loop paths for sending data back so that data flows over the array independently of its own size. This paper takes an approach to the problem without non-adjacent connections. This paper discusses systolic messy arrays for infinite iterative algorithms so that they are independent from the size of calculations. First a systolic messy array called two-square shape is introduced then the properties of two-square shape are summarized: memory function, cyclic addition, and cyclic multiplication. Finally a way of building systolic messy arrays that calculate infinite iterative algorithms is illustrated with concrete examples such as an arithmetic progression, a geometric progression, N factorial, and Fibonacci numbers.

• 一般社団法人電子情報通信学会の論文
• 2007-08-01

著者

• ISHIHARA Makio

  Faculty of Information Engineering, Fukuoka Institute of Technology

• Ishihara Makio

  Faculty Of Information Engineering Fukuoka Institute Of Technology

関連論文

• Calibrating Coordinates of a Tabletop Display with a Reflex in Eye-Hand Coordination
• Building Systolic Messy Arrays for Infinite Iterative Algorithms(General Fundamentals and Boundaries)

スポンサーリンク