Detail publikace

On Lookup Table Cascade-Based Realizations of Arbiters

Originální název

On Lookup Table Cascade-Based Realizations of Arbiters

Anglický název

On Lookup Table Cascade-Based Realizations of Arbiters

Jazyk

en

Originální abstrakt

This paper presents a new algorithm of iterative decomposition for multiple-output Boolean functions with an embedded heuristics to order variables. The algorithm produces a cascade of look-up tables (LUTs) that implements the given function and simultaneously a sub-optimal Multi-Terminal Binary Decision Diagram (MTBDD). The LUT cascade can be used for pipelined processing on FPGAs with BRAMs or at a non-traditional synthesis of large combinational and sequential circuits. On the other hand, suboptimal MTBBDs can serve as prototypes for efficient firmware implementation, especially when a micro-programmed controller that firmware runs on supports multi-way branching. A novel technique is illustrated on practical examples of three types of arbiters. It may be quite useful as a more flexible alternative implementation of digital systems with increased testability and improved manufacturability.

Anglický abstrakt

This paper presents a new algorithm of iterative decomposition for multiple-output Boolean functions with an embedded heuristics to order variables. The algorithm produces a cascade of look-up tables (LUTs) that implements the given function and simultaneously a sub-optimal Multi-Terminal Binary Decision Diagram (MTBDD). The LUT cascade can be used for pipelined processing on FPGAs with BRAMs or at a non-traditional synthesis of large combinational and sequential circuits. On the other hand, suboptimal MTBBDs can serve as prototypes for efficient firmware implementation, especially when a micro-programmed controller that firmware runs on supports multi-way branching. A novel technique is illustrated on practical examples of three types of arbiters. It may be quite useful as a more flexible alternative implementation of digital systems with increased testability and improved manufacturability.

BibTex


@inproceedings{BUT32056,
  author="Petr {Mikušek} and Václav {Dvořák}",
  title="On Lookup Table Cascade-Based Realizations of Arbiters",
  annote="This paper presents a new algorithm of iterative decomposition for
multiple-output Boolean functions with an embedded heuristics to order variables.
The algorithm produces a cascade of look-up tables (LUTs) that implements the
given function and simultaneously a sub-optimal Multi-Terminal Binary Decision
Diagram (MTBDD). The LUT cascade can be used for pipelined processing on FPGAs
with BRAMs or at a non-traditional synthesis of large combinational and
sequential circuits. On the other hand, suboptimal MTBBDs can serve as prototypes
for efficient firmware implementation, especially when a micro-programmed
controller that firmware runs on supports multi-way branching. A novel technique
is illustrated on practical examples of three types of arbiters. It may be quite
useful as a more flexible alternative implementation of digital systems with
increased testability and improved manufacturability.",
  address="IEEE Computer Society",
  booktitle="11th EUROMICRO Conference on Digital System Design DSD 2008",
  chapter="32056",
  edition="NEUVEDEN",
  howpublished="print",
  institution="IEEE Computer Society",
  year="2008",
  month="june",
  pages="795--802",
  publisher="IEEE Computer Society",
  type="conference paper"
}