학술논문

Delay minimal decomposition of multiplexers in technology mapping
Document Type
Conference
Source
33rd Design Automation Conference Proceedings, 1996 DAC: design automation Design Automation Conference Proceedings 1996, 33rd. :254-257 1996
Subject
Computing and Processing
Communication, Networking and Broadcast Technologies
Components, Circuits, Devices and Systems
Delay
Multiplexing
Libraries
Tree graphs
Logic
Computer aided software engineering
Permission
Hardware design languages
Circuit synthesis
Design automation
Language
ISSN
0738-100X
Abstract
Technology mapping requires the unmapped logic network to be represented in terms of base functions, usually two-input NORs and inverters. Technology decomposition is the step that transforms arbitrary networks to this form. Typically, such decomposition schemes ignore the fact that certain circuit elements can be mapped more efficiently by treating them separately during decomposition. Multiplexers are one such category of circuit elements. They appear very naturally in circuits, in the form of datapath elements and as a result of synthesis of CASE statements in HDL specifications of control logic. Mapping them using multiplexers in technology libraries has many advantages. In this paper, we give an algorithm for optimally decomposing multiplexers, so as to minimize the delay of the network, and demonstrate its effectiveness in improving the quality of mapped circuits.