About: Space-Time Trade-offs in SW Evaluation of Boolean Functions     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • Fast evaluation of multiple-output Boolean functions with the smallest memory footprint is often required in embedded systems. The paper describes a novel method of linked tables for representation and evaluation of Boolean functions and compares it with traditional methods; PLAs from the MCS-51 micro-controller are used for comparison. Traditional methods use masks to emulate PLA one way or another. The suggested method of linked tables is based on iterative disjunctive decomposition and leads only to a series of table look-ups. Linked tables are also shown to be equivalent to specific "in-line" decision diagrams. They proved to be most flexible in making trade-offs between performance and memory space. The method of linked tables may be quite useful for embedded microprocessor or microcontroller software as well as   for digital system simulation.
  • Fast evaluation of multiple-output Boolean functions with the smallest memory footprint is often required in embedded systems. The paper describes a novel method of linked tables for representation and evaluation of Boolean functions and compares it with traditional methods; PLAs from the MCS-51 micro-controller are used for comparison. Traditional methods use masks to emulate PLA one way or another. The suggested method of linked tables is based on iterative disjunctive decomposition and leads only to a series of table look-ups. Linked tables are also shown to be equivalent to specific "in-line" decision diagrams. They proved to be most flexible in making trade-offs between performance and memory space. The method of linked tables may be quite useful for embedded microprocessor or microcontroller software as well as   for digital system simulation. (en)
  • Rychlá evaluace boolovských funkcí s více výstupy s minimální spotřebou paměti je často žádána ve vestavěných systémech. Článek popisuje novou metodu vázaných tabulek pro reprezentaci a evaluaci boolovských funkcí a srovnává ji s tradičními metodami; pro srovnání jsou použita pole PLA z mikrořadiče MCS-51. Tradiční metody používají k emulaci PLA různými způsoby masky. Navržená metoda vázaných tabulek je založena na iterativním disjunktivním rozkladu a vede na serii vyhledání v tabulkách. Je ukázáno, že vázané tabulky jsou ekvivalentní specifikým lineárním rozhodovacím diagramům. Ukázaly se jako nejpružnější při volbě mezi výkonností a spotřebou paměti. Metoda vázaných tabulek může být velmi užitečná pro software vestavěných mikroprocesorů nebo mikrořadičů stejně jako pro simulaci číslicových systémů.  (cs)
Title
  • Space-Time Trade-offs in SW Evaluation of Boolean Functions
  • Časo-prostorové kompromisy při softwarové evaluaci boolovských funkcí (cs)
  • Space-Time Trade-offs in SW Evaluation of Boolean Functions (en)
skos:prefLabel
  • Space-Time Trade-offs in SW Evaluation of Boolean Functions
  • Časo-prostorové kompromisy při softwarové evaluaci boolovských funkcí (cs)
  • Space-Time Trade-offs in SW Evaluation of Boolean Functions (en)
skos:notation
  • RIV/00216305:26230/07:PU70796!RIV08-MSM-26230___
http://linked.open.../vavai/riv/strany
  • 344-349
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(GA102/05/0467), P(GA102/07/0850), Z(MSM0021630528)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 451374
http://linked.open...ai/riv/idVysledku
  • RIV/00216305:26230/07:PU70796
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Multiple-output Boolean functions, fast sw evaluation, PLA emulation, linked tables, LUT cascades (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [C76C6B9DBC58]
http://linked.open...v/mistoKonaniAkce
  • Morne
http://linked.open...i/riv/mistoVydani
  • New York
http://linked.open...i/riv/nazevZdroje
  • Proceedings of The Second International Conference on Systems
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Dvořák, Václav
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • IEEE Computer Society
https://schema.org/isbn
  • 0-7695-2807-4
http://localhost/t...ganizacniJednotka
  • 26230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 91 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software