The basic inclusion-exclusion algorithm is considered in the context of binary vectors. A connection is revealed between the algorithm and the generation of convolution codes for BIST applications in LSI and VLSI circuits. A strategy for changing from combinatorial identities to theoretical probabilities (with infinitely many vectors) is used to extend some classical relations of discrete mathematics and to investigate the results from the viewpoint of signature synthesis. It is shown that the inclusion-exclusion approach is not an identification algorithm in its own right, as it essentially gives the sum of i empirical probabilities.
Russian Microelectronics – Springer Journals
Published: Mar 21, 2006
It’s your single place to instantly
discover and read the research
that matters to you.
Enjoy affordable access to
over 18 million articles from more than
15,000 peer-reviewed journals.
All for just $49/month
Query the DeepDyve database, plus search all of PubMed and Google Scholar seamlessly
Save any article or search result from DeepDyve, PubMed, and Google Scholar... all in one place.
All the latest content is available, no embargo periods.
“Whoa! It’s like Spotify but for academic articles.”@Phil_Robichaud