Đang chuẩn bị nút TẢI XUỐNG, xin hãy chờ
Tải xuống
High Level Synthesis: from Algorithm to Digital Circuit- P29: This book presents an excellent collection of contributions addressing different aspects of high-level synthesis from both industry and academia. "High-Level Synthesis: from Algorithm to Digital Circuit" should be on each designer's and CAD developer's shelf, as well as on those of project managers who will soon embrace high level design and synthesis for all aspects of digital system design. | 270 M.C. Molina et al. 14.3.3 Bound Update Once an operation or a fragment has been scheduled in a cycle c it is checked if the distribution defined by the actual value of the bound is still reachable. Otherwise the value of the bound is updated with the next most uniform distribution still reachable. This occurs when The sum of the computational costs of operations scheduled in cycle c does not reach the bound and there are not new operations left that could be scheduled in it either because they are already scheduled or their mobilities have changed. CCS t c bound A UOPT p where UOPJ set of unscheduled operations of type t whose mobility makes their scheduling possible in cycle c. The new bound value is the previous one plus the value needed to reach the bound in cycle c divided by the number of open cycles included in the mobility of the unscheduled operations . NewBound bound bound - CCS t c HOCH where OC c N UOP C 0 . The sum of the computational costs of the operations scheduled in cycle c equals the bound and there exists at least one unscheduled operation whose mobility includes cycle c but even fragmented cannot be scheduled in its mobility cycles. CCS t c bound A 3op UOPT Y bound-CCS t c width op I c op where jaop set of cycles included in the mobility of operation op. The new bound value is the old one plus for every operation satisfying the above condition the computational cost of the operation fragment that cannot be scheduled divided by the number of cycles of its mobility. COST op - Y bound CCS t c c pop NewBound bound 3--------------n----n-------------. IM 14.3.4 Operation Fragmentation In order to schedule an addition fragment in a certain cycle it is not necessary to define the portion of the addition to be calculated in that cycle. It will be fixed once 14 Exploiting Bit-Level Design Techniques in Behavioural Synthesis 271 the operation has been completely scheduled i.e. when all the addition fragments have been scheduled. Then the algorithm .
