Search Strategy of Large Nonlinear Block Codes

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F46747885%3A24220%2F21%3A00008997" target="_blank" >RIV/46747885:24220/21:00008997 - isvavai.cz</a>

Result on the web

<a href="https://ieeexplore.ieee.org/document/9556478" target="_blank" >https://ieeexplore.ieee.org/document/9556478</a>

DOI - Digital Object Identifier

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

Result language

angličtina

Original language name

Search Strategy of Large Nonlinear Block Codes

Original language description

Test pattern compression techniques reduce the amount of transferred data while decompressed pattern flexibility remains high. The flexibility can be measured by the guaranteed number of specified test pattern bits, equal to or greater than the number of care bits in the pattern. This paper addresses the problem of test pattern compression and decompression using nonlinear codes. Test patterns can be encoded using a linear code that leads to an XOR network that decompresses the compressed patterns transferred from a tester. This XOR network can be completed or replaced by a standard (nonlinear) combinational network with substantially improved compression efficiency. The problem of finding the code was formulated as a clique cover problem. This approach’s tight throat lies in computational complexity and the needed memory capacity to temporarily retain intermediate results of clique coverage search attempts. The paper proposes a method that substantially reduces the computational time to get a robust nonlinear code with decompression ability. It shows that random search algorithms cannot reach the code parameters obtained by a restricted iterative search proposed in the paper. Additional knowledge concerning the check-bit truth table characteristics was used to avoid unsuccessful investigations. The proposed decompressor schemes have higher efficiency than till now known decompressor constructions. On the other hand, finding other heuristics that provide efficient codes for a broader class of code parameters is challenging than the proposed solution.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace

Publication year

2021

Confidentiality

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

Article name in the collection

2021 24th Euromicro Conference on Digital System Design (DSD)

ISBN

978-1-6654-2703-6

ISSN

—

e-ISSN

—

Number of pages

8

Pages from-to

527-534

Publisher name

IEEE

Place of publication

—

Event location

Palermo, Italy

Event date

Jan 1, 2021

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

000728394500076