A Static Time Analysis of 1-bit to 32-page SCA architecture for Logic Test
Abstract
This research proposes the Static Time Analysis of 32 page Single cycle access (SCA) architecture for Logic test. The timing analysis of each and very path of Logic test are observed that is setup and hold timings are calculated. It also eliminates the peak power consumption problem of conventional shift-based scan chains and reduces the activity during shift and capture cycles using Clock-Gating technique. This leads to more realistic circuit behavior during at-speed tests. It enables the complete test to run at much higher frequencies equal or close to the one in functional mode. It will be shown, that a lesser number of test cycles can be achieved compared to other published solutions. The test cycle per net based on a simple test pattern generator algorithm without test pattern compression is below 1 for larger designs and is independent of the design size. The structure allows an additional on-chip debugging signal visibility for each register. The method is backward compatible to full scan designs and existing test pattern generators and simulators can be used with a minor enhancement. It is shown how to combine the proposed solution with built-in self-test (BIST) and massive parallel  scan  chains.  The  results  are  observed  on  Xilinx XC3s1600e-5fgg484
Keywords
References
Tobias Strauch,†Single Cycle Access Structure for Logic Testâ€,IEEE Trans. On Very Large Scale Integration System, May 2012
.Rajski, J. Tyszer, M. Kassab, and N. Mukherjee, “Embedded deter- ministic test,†IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 23, no. 5, pp. 776–792, May 2004.
D. Czysz, G. Mrugalski, J. Rajski, and J. Tyszer, “Low-power test data application in EDT environment throughdecompression freeze,†IEEE
D. Czysz, M. Kassab, X. Lin, G. Mrugalski, J. Rajski, and J.access scan: Towards low area and routing overhead,†inProc. Asia South PacificTyszer, “Low power scan shift and capture in the EDTenvironment,†in Proc.Des. Autom. Conf., 2008, pp. 565–570
Y. Cho, I. Pomeranz, and S. M. Reddy, “On reducing test application time for scan circuits using limited scan operations and transfer se- quences,†IEEE Trans. Comput.- Aided Des. Integr. Circuits Syst.,vol.24, no. 10, pp. 1594–1605, Oct. 2005.
J. Chen, C. Yand, and K. Lee, “Test pattern generation and clock disabling for simultaneous test time and powerreduction,†IEEE Trans.
Computer-Aided Des.Integr. Circuits Syst.,vol.22, no. 3, pp.363–370,Mar. 2003.
S. Wang, “A BIST TPG for low power dissipation and high fault cov- erage,†IEEE Trans. Very Large Scale Integr. (VLSI) Syst., vol. 15, no.7, pp. 777–789, Jul. 2007.
S. Almukhaizim and O. Sinanoglu, “Dynamic scan chainpartitioning for reducing peak shift power during test,†IEEETrans. Comput.-AidedDes. Integr. Circuits Syst., vol. 28, no. 2, pp. 298–302, Feb.
A. Al-Yamani, N. Devta-Prasanna, E. Chmelar, M. Grinchuk,and A.Gunda, “Scan test cost and power reduction through systematicscan re- configuration,†IEEE Trans. Comput.-Aided Des.
Integr. Circuits Syst.,vol. 26, no. 5, pp. 907–917, May 2007.
S. Lin, C. Lee, J. Chen, J. Chen, K. Luo, and W. Wu, “Amultilayer data copy test data compression scheme forreducing shifting-in power
for multiple scan design,†IEEE Trans. Very Large Scale Integr. (VLSI)Syst., vol. 15, no. 7, pp. 767–776, Jul. 2007.
S. Sde-Paz and E. Salomon, “Frequency and power correlationbetween at-speed scan and functional tests,†presented at theInt. Test Conf.,
Santa Clara, CA, 2008, Paper 13.3.
I. Pomeranz and S. Reddy, “Test compaction for at-speedtesting of scan circuits based on nonscan test sequences and removal of transfer sequences,†IEEE Trans. Comput.-AidedDes. Integr. Circuits Syst., vol. 21, no. 6, pp. 706–714, Jun.2002.
N. Ahmed, M. Tehranipoor, C. Ravikumar, and K. Butler, “Local at-speed scan enable generation for transition fault testing usinglow-cost testers,†IEEE Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 26, no. 5, pp. 896–906, May 2007.
H. Ando, “Testing VLSI with random access scan,†in Proc.Diag. Pa- pers Compcon 80, 1980, pp. 50–52.
applica- tion time minimization for RAS using basis
optimization of columndecoder,†in Proc. IEEE Int. Symp. Circuits Syst., 2010, pp. 2614–2617. [23] D. Baik and K. Saluja, “Test cost reduction using partitioned grid
random access scan,†in Proc. 19th Int. Conf. VLSI Des.,
, pp.1–6
D. Baik and S. Kajthara, “Random access scan: A solution to test power, test data valume and test time,†in Proc. 17th Int. Conf. VLSI
Des., 2004, pp. 883–888.
S. Lin, C. Lee, and J. Chen, “A cocktail approach on randomaccess scan toward low power ad high efficiency test,†in Proc.Conf. Comput.-Aided Des., 2005, pp. 94–99
.
T. Chen, H. Liang, M. Zhang, and W. Wang, “A scheme of test pattern generation based on reseeding of segment-fixing counter,†in Proc. 9th Int. Conf. for Young Comput. Scientists,2008, pp. 2272–2277.
Y. Hu, Y. Han, X. Li, H. Li, and X. Wen, “Compression/scan co-design for reducing test data volume, scan-in power dissipation and test appli-
cation time,†in Proc. 11th Pacific Rim Int. Symp. Depend. Comput.,2006, pp. 1–8.
Y. Hu, C. Li, Y. Han, X. Li, W. Wang, H. Li, L. Wang, and X. Wen, “Test data compression based on clustered random access scan,†inProc. 15th Asian Tests Symp., 2006, pp. 231–236.
R. Adiga, G. Arpit, V. Singh, K. Saluja, and A. Singh, “Modified T-flip-flop based scan cell for RAS,†in Proc. 5th IEEE Eur. Test Symp., 2010, pp. 113–118.
A. Mudlapur, V. Agrawal, and A. Singh, “A random access scan ar- chitecture to reduce hardware overhead,†in Proc. Int. Test Conf., 2006,Trans. Comput.-Aided Des. Integr. Circuits Syst., vol. 27, no.7, pp.pp. 350–358.
Y. Hu, X. Fu,X. Fan, and H. Fujiwara, “Localized random1278–1290, Jul. 2008.
A. A. , A. Khan, V. Singh, K. Saluja,and A. Singh, “TestInt. Test Conf., 2008, pp. 1–10.
Refbacks
- There are currently no refbacks.
Copyright © 2013, All rights reserved.| ijseat.com
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.
Â