Publication detail

Branching Program-Based Programmable Logic for Embedded Systems

DVOŘÁK, V.

Original Title

Branching Program-Based Programmable Logic for Embedded Systems

Type

article in a collection out of WoS and Scopus

Language

English

Original Abstract

The paper considers realization of logic functions by branching programs running on special purpose Decision Diagram Machines (DDMs). It is not the fastest way to implement logic, but it enables different versions and frequent modifications, e.g. in embedded systems. First, this paper derives upper bounds on the cost of multi-terminal binary decision diagrams (MTBDDs); the cost is directly related to the size of branching programs derived from MTBDDs. Second, optimization of heterogeneous branching programs is undertaken that makes a space-time trade-off between the amount of memory required for a branching program and its execution time. As a case study, optimal architectures of branching programs are found for a set of benchmark tasks. Beside DDMs, the technique can also be used for micro-controllers with a support for multi-way branching running logic-intensive embedded firmware.

Keywords

Boolean functions, multi-terminal binary decision diagrams MTBDDs, branching programs, MTBDD complexity, decision diagram machines DDMs

Authors

DVOŘÁK, V.

RIV year

2012

Released

29. 2. 2012

Publisher

International Academy, Research, and Industry Association

Location

New York

ISBN

978-1-61208-184-7

Book

Proceedings of ICONS 2012

Pages from

109

Pages to

115

Pages count

7

BibTex

@inproceedings{BUT91450,
  author="Václav {Dvořák}",
  title="Branching Program-Based Programmable Logic for Embedded Systems",
  booktitle="Proceedings of ICONS 2012",
  year="2012",
  pages="109--115",
  publisher="International Academy, Research, and Industry Association",
  address="New York",
  isbn="978-1-61208-184-7"
}