scispace - formally typeset
Open AccessJournal ArticleDOI

Technology mapping and architecture evalution for k/m-macrocell-based FPGAs

Reads0
Chats0
TLDR
A very efficient technology mapping algorithm, k_m_flow, is developed for a novel field-programmable gate array (FPGA) architecture that is based on k-input single-output programmable logic array- (PLA-) like cells, or, k/m-macrocells and can outperform 4-LUT-based FPGAs on this set of benchmarks.
Abstract
In this article, we study the technology mapping problem for a novel field-programmable gate array (FPGA) architecture that is based on k-input single-output programmable logic array- (PLA-) like cells, or, k/m-macrocells. Each cell in this architecture can implement a single output function of up to k inputs and up to m product terms. We develop a very efficient technology mapping algorithm, klmlflow, for this new type of architecture. The experimental results show that our algorithm can achieve depth-optimality on almost all the testcases in a set of 16 Microelectronics Center of North Carolina (MCNC) benchmarks. Furthermore it is shown that on this set of benchmarks, with only a relatively small number of product terms (m ≤ k p 3), the k/m-macrocell-based FPGAs can achieve the same or similar mapping depth compared with the traditional k-input single-output lookup table- (k-LUT-) based FPGAs. We also investigate the total area and delay of k/m-macrocell-based FPGAs and compare them with those of the commonly used 4-LUT-based FPGAs. The experimental results show that k/m-macrocell-based FPGAs can outperform 4-LUT-based FPGAs in terms of both delay and area after placement and routing by VPR on this set of benchmarks.

read more

Citations
More filters
Book

Reconfigurable Computing: The Theory and Practice of FPGA-Based Computation

Scott Hauck, +1 more
TL;DR: This book is intended as an introduction to the entire range of issues important to reconfigurable computing, using FPGAs as the context, or "computing vehicles" to implement this powerful technology.
Book

FPGA Architecture: Survey and Challenges

TL;DR: This survey reviews the historical development of programmable logic devices, the fundamental programming technologies that the programmability is built on, and then describes the basic understandings gleaned from research on architectures.
Book

FPGA Design Automation: A Survey

TL;DR: All major steps in FPGA design flow which includes: routing and placement, circuit clustering, technology mapping and architecture-specific optimization, physical synthesis, RT-level and behavior-level synthesis, and power optimization are covered.
Journal ArticleDOI

Module placement for fault-tolerant microfluidics-based biochips

TL;DR: A simulated annealing-based technique for module placement in “digital” droplet-based microfluidic biochips is presented, which not only addresses chip area, but also considers fault tolerance, which allows a micro fluidic module to be relocated elsewhere in the system when a single cell is detected to be faulty.
Proceedings ArticleDOI

Modeling routing demand for early-stage FPGA architecture development

TL;DR: This paper presents an interconnect model for island-style FPGAs, whose single output is the estimated routing demand (often referred to as W, the number of routing tracks per channel) for an FPGA as a function of several logic block, circuit and routing architecture parameters.
References
More filters
Book

Logic Minimization Algorithms for VLSI Synthesis

TL;DR: The ESPRESSO-IIAPL as discussed by the authors is an extension of the ESPRSO-IIC with the purpose of improving the efficiency of Tautology and reducing the number of blocks and covers.
Book

Architecture and CAD for Deep-Submicron FPGAS

TL;DR: From the Publisher: Architecture and CAD for Deep-Submicron FPGAs addresses several key issues in the design of high-performance FPGA architectures and CAD tools, with particular emphasis on issues that are important for FPG as implemented in deep-submicron processes.
Journal ArticleDOI

FlowMap: an optimal technology mapping algorithm for delay optimization in lookup-table based FPGA designs

TL;DR: A theoretical breakthrough is presented which shows that the LUT-based FPGA technology mapping problem for depth minimization can be solved optimally in polynomial time.
Journal ArticleDOI

Architecture of field-programmable gate arrays: the effect of logic block functionality on area efficiency

TL;DR: It was observed that the area efficiency of a logic block depends not only on its functionality but also on the average number of pins connected per logic block.
Proceedings ArticleDOI

Chortle-crf: Fast technology mapping for lookup table-based FPGAs

TL;DR: A new technology mapping algorithm for lookup tablebased Field Programmable Gate Arrays (FPGA) is presented, the major innovation is a method for choosing gate-level decompositions based on bin packing that is up to 28 times faster than a previous exhaustive approach.
Related Papers (5)