Cluster-oriented scheduling in pipelined data path synthesis
Chang, C.-T.
Rose, K.
Walker, R.A.
Center for Integrated Electron., Rensselaer Polytech. Inst., Troy, NY;
Abstract
We present a new algorithm for cluster-oriented scheduling (COS)
in pipelined data path synthesis. First, cluster structure information
is extracted from the corresponding linear graph representation of a
data flow graph (DFG). Then, scheduling and allocation globally interact
with the cluster information under the timing constraints of pipeline
latency and data initialization interval (DII). Using this technique,
the costs of registers, multiplexors, and interconnection were reduced
dramatically in both the FIR and elliptic filter examples
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
