Proceedings International Conference on Computer Design. VLSI in Computers and Processors (Cat. No.98CB36273)
DOI: 10.1109/iccd.1998.727024
|View full text |Cite
|
Sign up to set email alerts
|

Optimal design of synchronous circuits using software pipelining techniques

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1

Citation Types

0
52
0

Publication Types

Select...
4
1

Relationship

2
3

Authors

Journals

citations
Cited by 15 publications
(52 citation statements)
references
References 10 publications
0
52
0
Order By: Relevance
“…We represent the scheduling sequences relations among different transitions within the periodic clock framework and by a subtyping relation so that the throughput constraints can be inferred. We show that our method gives a result compatible to [10]; 2) Synthesis of the fractional synchronizer. We employ ideas from the periodic clock calculus to infer the number of fractional synchronizers used at each join transition (the transition with multiple inputs).…”
mentioning
confidence: 58%
See 2 more Smart Citations
“…We represent the scheduling sequences relations among different transitions within the periodic clock framework and by a subtyping relation so that the throughput constraints can be inferred. We show that our method gives a result compatible to [10]; 2) Synthesis of the fractional synchronizer. We employ ideas from the periodic clock calculus to infer the number of fractional synchronizers used at each join transition (the transition with multiple inputs).…”
mentioning
confidence: 58%
“…(13) implies that the p th firing of S2 should be no earlier than the (p − 1) th firing of S0 plus one instant, which gives the same relation presented in [10]. Therefore, the schedule of this marked graph can also be obtained by BellmanFord's algorithm to find the longest paths to and from a chosen transition.…”
Section: (7)mentioning
confidence: 91%
See 1 more Smart Citation
“…For example, retiming [4] can minimize the worst case clock period by moving in circuit registers. Also Software pipelining was a good approach to generate optimal clocking schemes [5], better that retiming when longest paths between registers cannot be equalized; registers are then activated at non uniform time intervals, like what we propose here. But these methods take in account static worst case delays only, not the delays variations according to dynamic conditions.…”
Section: Related Workmentioning
confidence: 97%
“…The technique is based on the software pipelining model of [19], which involves obtaining a schedule for each block. Similar to [16], the method handles increased cycle latencies by slowing down the circuit.…”
Section: B Frequency Constrained Wire-pipelined Circuitsmentioning
confidence: 99%