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”

Deterministic Search Strategy of Compression Codes

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F23%3A00011281" target="_blank" >RIV/46747885:24220/23:00011281 - isvavai.cz</a>

  • Result on the web

    <a href="https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10456806&utm_source=scopus&getft_integrator=scopus&tag=1" target="_blank" >https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10456806&utm_source=scopus&getft_integrator=scopus&tag=1</a>

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    Deterministic Search Strategy of Compression Codes

  • Original language description

    Testing large circuits requires compression of test patterns before transferring them to the tested circuit and decompression on board. The compression and decompression mechanism may be built according to the linear block code rules. Broadening the decompressor structure search space to those using nonlinear block code is possible. Nonlinear block codes outperform their linear counterparts‘ compression ability. Their usage is limited due to the intricate search process. The code words‘ interconnectedness is difficult to exploit in the code word creation process as too many mutual dependencies exist among the code word bits. For this reason, random and partially random code word search methods were investigated in the past. This paper proposes two fully deterministic nonlinear code construction approaches. The obtained codes are significantly more efficient and easily scalable than the linear ones. We demonstrate their efficiency on codes with the number of specified bits equal to two, three, and four. The proposed methods may be used to create extensive codes, which are unachievable for previously published methods due to the explosion of computation time.

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

  • OECD FORD branch

    10200 - Computer and information sciences

Result continuities

  • Project

  • Continuities

    I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Others

  • Publication year

    2023

  • 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

    2023 26th Euromicro Conference on Digital System Design

  • ISBN

    979-8-3503-4419-6

  • ISSN

    2771-2508

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    198-205

  • Publisher name

    IEEE

  • Place of publication

    IEEE CS Los Alamitos

  • Event location

    Golem, Durres, Albania

  • Event date

    Jan 1, 2023

  • Type of event by nationality

    EUR - Evropská akce

  • UT code for WoS article