All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

A Novel and Efficient Method to Initialize FPGA Embedded Memory Content in Asymptotically Constant Time

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F16%3A00303813" target="_blank" >RIV/68407700:21240/16:00303813 - isvavai.cz</a>

  • Result on the web

    <a href="http://ieeexplore.ieee.org/document/7857146/" target="_blank" >http://ieeexplore.ieee.org/document/7857146/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/ReConFig.2016.7857146" target="_blank" >10.1109/ReConFig.2016.7857146</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Novel and Efficient Method to Initialize FPGA Embedded Memory Content in Asymptotically Constant Time

  • Original language description

    This paper describes analysis and implementation of a new method for maintaining valid content of FPGA memory blocks with an asymptotically constant time synchronous clear ability, that can be useful for (re)initialization to one default value. A particular application can be for high-speed real-time LZ77 lossless compression algorithms, where a dictionary has to be (re)initialized before each run of the implemented compression algorithm. The method is based on two most widely used techniques for clearing the memory content: a linear passage of the memory and clearing each cell by writing a default value and creating a register field providing an (in)valid bit for each memory cell. Our solution combines these two techniques together with the use of FPGA distributed memory blocks implemented in LUTs (Look-Up Tables) to overcome negative features of each previous method without losing the most of positive features. Our solution provides a balance between the two previous techniques and exceeds them in speed, resources utilization and latency of (re)initialization.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    IN - Informatics

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    S - Specificky vyzkum na vysokych skolach

Others

  • Publication year

    2016

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Article name in the collection

    ReConFig’16

  • ISBN

    978-1-5090-3707-0

  • ISSN

  • e-ISSN

  • Number of pages

    6

  • Pages from-to

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Cancún

  • Event date

    Nov 30, 2016

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article