Detail publikace

Branching Program-Based Programmable Logic for Embedded Systems

DVOŘÁK, V.

Originální název

Branching Program-Based Programmable Logic for Embedded Systems

Anglický název

Branching Program-Based Programmable Logic for Embedded Systems

Jazyk

en

Originální abstrakt

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.

Anglický abstrakt

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.

Dokumenty

BibTex


@inproceedings{BUT91450,
  author="Václav {Dvořák}",
  title="Branching Program-Based Programmable Logic for Embedded Systems",
  annote="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.",
  address="International Academy, Research, and Industry Association",
  booktitle="Proceedings of ICONS 2012",
  chapter="91450",
  edition="NEUVEDEN",
  howpublished="electronic, physical medium",
  institution="International Academy, Research, and Industry Association",
  year="2012",
  month="february",
  pages="109--115",
  publisher="International Academy, Research, and Industry Association",
  type="conference paper"
}