Deterministic Search Strategy of Compression Codes

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

Výsledek na webu

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

Jazyk výsledku

angličtina

Název v původním jazyce

Deterministic Search Strategy of Compression Codes

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

Deterministic Search Strategy of Compression Codes

Popis výsledku anglicky

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.

Druh

D - Stať ve sborníku

CEP obor

—

OECD FORD obor

10200 - Computer and information sciences

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 statě ve sborníku

2023 26th Euromicro Conference on Digital System Design

ISBN

979-8-3503-4419-6

ISSN

2771-2508

e-ISSN

—

Počet stran výsledku

8

Strana od-do

198-205

Název nakladatele

IEEE

Místo vydání

IEEE CS Los Alamitos

Místo konání akce

Golem, Durres, Albania

Datum konání akce

1. 1. 2023

Typ akce podle státní příslušnosti

EUR - Evropská akce

Kód UT WoS článku

—