Synthesis of testable pipelined datapaths using genetic search

dc.creatorRavikumar, C P
dc.creatorSaxena, V
dc.date.accessioned2006-06-29T05:10:56Z
dc.date.accessioned2019-02-09T07:44:07Z
dc.date.accessioned2022-07-11T08:40:43Z
dc.date.available2006-06-29T05:10:56Z
dc.date.available2019-02-09T07:44:07Z
dc.date.available2022-07-11T08:40:43Z
dc.date.created2006-06-29T05:10:56Z
dc.date.created2019-02-09T07:44:07Z
dc.date.issued1996
dc.description.abstractIn this paper, we describe TOGAPS, a Testability-Oriented Genetic Algorithm for Pipeline Synthesis. The input to TOGAPS is an unscheduled data flow graph along with a specification of the desired pipeline latency. TOGAPS generates a register-level description of a datapath which is near-optimal in terms of area, meets the latency requirement, and is highly testable. Genetic search is employed to explore a 3D search space, the three dimensions being the chip area, average latency, and the testability of the datapath. Testability of a design is evaluated by counting the number of self-loops in the structure graph of the data path. Each design is characterized by a four-tuple consisting of (i) the latency and schedule information, (ii) the module allocation, (iii) operation-to-module binding, and (iv) value-to-register binding. An initial population of designs is constructed from the given data flow graph using different latency cycles whose average latency is in the specified range. Multiple scheduling heuristics are used to generate schedules for the DFG. For each of the resulting scheduled data flow graphs, we decide on an allocation of modules and registers based on a lower bound estimated using the schedule and latency information. The operation-to-module binding and the value-to-register binding are then carried out. A fitness measure is evaluated for each of the resulting data paths; this fitness measure includes one component for each of the three search dimensions. We have implemented TOGAPS on a Sun/SPARC 10 and studied its performance on a number of benchmark examples. Results indicate that TOGAPS finds area-optimal datapaths for the specified latency cycle, while reducing the number of self-loops in the data path
dc.identifierVLSI Design, Proceedings, Ninth International Conference on, 205 - 210p.
dc.identifierhttp://localhost:8080/xmlui/handle/12345678/1877
dc.identifier.urihttps://demo7.dspace.org/handle/10673/7804
dc.languageen
dc.subjecttestability-oriented genetic algorithm
dc.subjectpipeline latency
dc.titleSynthesis of testable pipelined datapaths using genetic search
dc.typeArticle
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ravikumarsyn1996.pdf
Size:
76.31 KB
Format:
Adobe Portable Document Format
Description:
Collections