Abstract

The results of application of the synchronous circuit scheduling to controlled data flow graph (CDFG) on placing a restriction on the number of usable operators in the circuit are used for specifications in the proposed method for dependency graphs for asynchronous circuit synthesis with the shortest possible execution time. First, in this method, operators are assigned to each operation so that the execution order restriction of the operations by co-use of the operators increases less than it would otherwise. In particular, when conditional branching is involved in the specification, such a branching probability is taken into account. Next, from the binding results, dependency graphs are generated that can be mapped directly to the hardware while the execution sequence restriction of each operation and the conformity of the graphs are taken into account. From the experimental results, it is found that the proposed method functions effectively for the specifications of the actual digital filter and for the hypothetical specifications generated randomly. © 2000 Scripta Technica, Electron Comm Jpn Pt 3, 83(12): 70–77, 2000

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.