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”

Nonlinear compression block codes: Exact and random search strategy

The result's identifiers

  • Result code in IS VaVaI

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

  • Result on the web

    <a href="https://doi.org/10.1016/j.micpro.2023.104877" target="_blank" >https://doi.org/10.1016/j.micpro.2023.104877</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1016/j.micpro.2023.104877" target="_blank" >10.1016/j.micpro.2023.104877</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Nonlinear compression block codes: Exact and random search strategy

  • Original language description

    The nonlinear block codes have significantly better testing abilities than the linear ones used in Built-In Self Test Equipment or test pattern decompressors. Unfortunately, no sufficiently effective deterministic code creation strategy has been discovered till now. This paper deals with a deterministic nonlinear code search strategy and a strategy based on extending linear compression codes by nonlinear check bits that improve the usability of decompressed patterns for testing circuits with more inputs. The earlier works used a purely or partially random search of the nonlinear check-bits truth tables to construct the first nonlinear structures. Here, we derive deterministic rules that can be used for the iterative process of code generation with no necessity of any random search for codes with the number of specified bits equal to three. We compare the code parameters of codes based on linear code extension, direct deterministic code search methods, and previously published results. The most extensive codes still need to be constructed with a partial random search strategy, but keeping the restrictions introduced in the paper causes the search to be substantially more efficient.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    20206 - Computer hardware and architecture

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

  • Name of the periodical

    Microprocessors and Microsystems

  • ISSN

    0141-9331

  • e-ISSN

  • Volume of the periodical

    101

  • Issue of the periodical within the volume

    September

  • Country of publishing house

    NL - THE KINGDOM OF THE NETHERLANDS

  • Number of pages

    9

  • Pages from-to

  • UT code for WoS article

    001030310600001

  • EID of the result in the Scopus database

    2-s2.0-85163122150