Register-Transfer Synthesis of Pipelined Data Paths
نویسندگان
چکیده
منابع مشابه
Automatic Synthesis of Time-Stationary Controllers for Pipelined Data Paths
We address the problem of control synthesis for pipelined data paths. Two basic control schemes are possible: datastationary and time-stationary. In this work, we consider the latter approach. We developed an approach to automatically synthesize time-stationarycontrollers for pipelined data paths produced by high level synthesis tools. A highly optimized FSM controller is implemented using eith...
متن کاملNew Efficient Clique Partitioning Algorithms for Register-Transfer Synthesis of Data Paths
Numerous problems can be modeled as clique partitioning problems in digital design synthesis. In this paper, we present two new polynomial time heuristic algorithms for efficient clique partitioning with or without limiting the maximum clique size. The goal of clique partitioning is to partition a graph into a minimum number of cliques. The basic approach of the new algorithm is to find small c...
متن کاملConverting Combinational Circuits into Pipelined Data Paths
This paper presents an algorithm which converts combinational circuits into pipelined datu paths under considerotion of U given clock priod. The approach minimizes the number of registers which is achieved by a recursive procedure selecting jor each pipeline level those circuit parts where U register location satisfies the timing constraints. The selection is based on an as-soon-as-possible and...
متن کاملHigh-Level Synthesis of Structured Data Paths
In this paper we present a genetic scheduling algorithm to support the synthesis of structured data paths with the aim of producing designs with a predictable layout structure and conserving on-chip wiring resources. The data path is organized as architectural blocks (A-block) with local functional unit (FU), memory elements and internal interconnections. The A-blocks are interconnected by a fe...
متن کاملPhantom redundancy: a register transfer level technique for gracefully degradable data path synthesis
In this paper we present an area-efficient register transfer level technique for gracefully degradable data path synthesis called phantom redundancy. In contrast to spare-based approaches, phantom redundancy is a recovery technique that does not use any standby spares. Phantom redundancy uses extra interconnect to make the resulting data path reconfigurable in the presence of any (single) funct...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: VLSI Design
سال: 1994
ISSN: 1065-514X,1563-5171
DOI: 10.1155/1994/43564