Nonlinear compression block codes: Exact and random search strategy

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

Nonlinear compression block codes: Exact and random search strategy

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Nonlinear compression block codes: Exact and random search strategy

Popis výsledku anglicky

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.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

Projekt

—

Návaznosti

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Rok uplatnění

2023

Kód důvěrnosti údajů

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

Název periodika

Microprocessors and Microsystems

ISSN

0141-9331

e-ISSN

—

Svazek periodika

101

Číslo periodika v rámci svazku

September

Stát vydavatele periodika

NL - Nizozemsko

Počet stran výsledku

9

Strana od-do

—

Kód UT WoS článku

001030310600001

EID výsledku v databázi Scopus

2-s2.0-85163122150