Nonlinear codes for test patterns compression: the old school way

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F21%3A00350039" target="_blank" >RIV/68407700:21240/21:00350039 - isvavai.cz</a>

Výsledek na webu

<a href="https://doi.org/10.1007/978-3-030-68071-8_6" target="_blank" >https://doi.org/10.1007/978-3-030-68071-8_6</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1007/978-3-030-68071-8_6" target="_blank" >10.1007/978-3-030-68071-8_6</a>

Jazyk výsledku

angličtina

Název v původním jazyce

Nonlinear codes for test patterns compression: the old school way

Popis výsledku v původním jazyce

The problem is to design a nonlinear code for test vectors expander, with the requirement of all r-tuples possible in the output. We formulated the problem as a clique cover problem. The instances of the problem have a high degree of symmetry, which offers the possibility of analytical solution or better heuristic construction. To benefit from the degrees of freedom in the problem, assigning expander inputs to the produced vectors has been identified as a Multi-Valued (MV) variable encoding problem. Experimental evaluation shows that good MV encoding is important for small r. Instances up to n=32 and r=6 were solved, with the resulting expander widths i mostly equal to or better than existing solutions. For the synthesis of the expanders, both the classical minimization-decomposition and resynthesis approaches can be used. The produced circuits were larger than corresponding linear expanders.

Název v anglickém jazyce

Nonlinear codes for test patterns compression: the old school way

Popis výsledku anglicky

The problem is to design a nonlinear code for test vectors expander, with the requirement of all r-tuples possible in the output. We formulated the problem as a clique cover problem. The instances of the problem have a high degree of symmetry, which offers the possibility of analytical solution or better heuristic construction. To benefit from the degrees of freedom in the problem, assigning expander inputs to the produced vectors has been identified as a Multi-Valued (MV) variable encoding problem. Experimental evaluation shows that good MV encoding is important for small r. Instances up to n=32 and r=6 were solved, with the resulting expander widths i mostly equal to or better than existing solutions. For the synthesis of the expanders, both the classical minimization-decomposition and resynthesis approaches can be used. The produced circuits were larger than corresponding linear expanders.

Druh

C - Kapitola v odborné knize

CEP obor

—

OECD FORD obor

20206 - Computer hardware and architecture

Projekt

<a href="/cs/project/EF16_019%2F0000765" target="_blank" >EF16_019/0000765: Výzkumné centrum informatiky</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2021

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 knihy nebo sborníku

Recent Findings in Boolean Techniques

ISBN

978-3-030-68070-1

Počet stran výsledku

18

Strana od-do

125-142

Počet stran knihy

197

Název nakladatele

Springer International Publishing AG

Místo vydání

Cham

Kód UT WoS kapitoly

—