scholarly journals Optimizing SOC Test Resources Using Dual Sequences

2006 ◽  
pp. 181-196
Author(s):  
Wei Zou ◽  
Chris C. N. Chu ◽  
Sudhakar M. Reddy ◽  
Irith Pomeranz
Keyword(s):  
Soc Test ◽  
Dual Sequences

3D SoC test optimization method based on balance of scan chain

2013 ◽  
Vol 26 (7) ◽  
pp. 586-590
Author(s):  
Wei Wang ◽  
Xin Li ◽  
Tian Chen ◽  
Jun Liu ◽  
Fang Fang ◽  
...  
Keyword(s):  
Optimization Method ◽  
Soc Test ◽  
Scan Chain ◽  
Test Optimization

scholarly journals Congruences related to dual sequences and Catalan numbers

2022 ◽  
Vol 101 ◽  
pp. 103458
Author(s):  
Rong-Hua Wang ◽  
Michael X.X. Zhong
Keyword(s):  
Catalan Numbers ◽  
Dual Sequences

scholarly journals Closed paths whose steps are roots of unity

2011 ◽  
Vol DMTCS Proceedings vol. AO,... (Proceedings) ◽  
Author(s):  
Gilbert Labelle ◽  
Annie Lacasse
Keyword(s):  
Roots Of Unity ◽  
Explicit Formulas ◽  
Asymptotic Expressions ◽  
International Audience ◽  
Dual Sequences ◽  
Polygonal Paths

International audience We give explicit formulas for the number $U_n(N)$ of closed polygonal paths of length $N$ (starting from the origin) whose steps are $n^{\textrm{th}}$ roots of unity, as well as asymptotic expressions for these numbers when $N \rightarrow \infty$. We also prove that the sequences $(U_n(N))_{N \geq 0}$ are $P$-recursive for each fixed $n \geq 1$ and leave open the problem of determining the values of $N$ for which the $\textit{dual}$ sequences $(U_n(N))_{n \geq 1}$ are $P$-recursive. Nous donnons des formules explicites pour le nombre $U_n(N)$ de chemins polygonaux fermés de longueur $N$ (débutant à l'origine) dont les pas sont des racines $n$-ièmes de l'unité, ainsi que des expressions asymptotiques pour ces nombres lorsque $N \rightarrow \infty$. Nous démontrons aussi que les suites $(U_n(N))_{N \geq 0}$ sont $P$-récursives pour chaque $n \geq 1$ fixé et laissons ouvert le problème de déterminer les valeurs de $N$ pour lesquelles les suites $\textit{duales}$ $(U_n(N))_{n \geq 1}$ sont $P$-récursives.

scholarly journals Ideals of Numerical Semigroups and Error-Correcting Codes

Symmetry ◽  
2019 ◽  
Vol 11 (11) ◽  
pp. 1406
Author(s):  
Bras-Amorós
Keyword(s):  
Secret Sharing ◽  
Error Correcting Codes ◽  
Numerical Semigroups ◽  
Secret Sharing Schemes ◽  
List Decoding ◽  
Generalized Hamming Weights ◽  
Resilient Functions ◽  
Weierstrass Semigroups ◽  
Hamming Weights ◽  
Dual Sequences

Several results relating additive ideals of numerical semigroups and algebraic-geometrycodes are presented. In particular, we deal with the set of non-redundant parity-checks, the codelength, the generalized Hamming weights, and the isometry-dual sequences of algebraic-geometrycodes from the perspective of the related Weierstrass semigroups. These results are related tocryptographic problems such as the wire-tap channel, t-resilient functions, list-decoding, networkcoding, and ramp secret sharing schemes.

Power-Aware Optimization of SoC Test Schedules Using Voltage and Frequency Scaling

2017 ◽  
Vol 33 (2) ◽  
pp. 171-187 ◽  
Author(s):  
Vijay Sheshadri ◽  
Vishwani D. Agrawal ◽  
Prathima Agrawal
Keyword(s):  
Frequency Scaling ◽  
Soc Test

scholarly journals SOC test planning using virtual test access architectures

2004 ◽  
Vol 12 (12) ◽  
pp. 1263-1276 ◽  
Author(s):  
A. Sehgal ◽  
V. Iyengar ◽  
K. Chakrabarty
Keyword(s):  
Test Planning ◽  
Virtual Test ◽  
Soc Test

A New Test Data Compression/Decompression Scheme To Reduce SOC Test Time

2006 ◽  
Author(s):  
Long Jieyi ◽  
Feng Jianhua ◽  
Zhu lida ◽  
Xu Wenhua ◽  
Wang Xinan
Keyword(s):  
Data Compression ◽  
Test Data ◽  
Test Time ◽  
Test Data Compression ◽  
Soc Test
Sign in / Sign up

Export Citation Format

Share Document