Low area pipelined circuits by multi-clock cycle paths and clock scheduling

— A new algorithm is proposed to reduce the number of intermediate registers of a pipelined circuit using a combination of multi-clock cycle paths and clock scheduling. The algorithm analyzes the pipelined circuit and determines the intermediate registers that can be removed. An efficient subsidiary algorithm is presented that computes the minimum feasible clock period of a circuit containing multi-clock cycle paths. Experiments with a pipelined adder and multiplier verify that the proposed algorithm can reduce the number of intermediate registers without degrading performance, even when delay variations exist.

• Type: Conference
• Year: 2006
• Where: ASPDAC
• Authors: Bakhtiar Affendi Rosdi, Atsushi Takahashi
• Keywords: Algorithm, ASPDAC 2006, Intermediate Registers, Multi-clock Cycle Paths