Minimizing power consumption in scan testing: pattern generation and DFT techniques

A realistic test sets compression method is proposed to effectively reduce test data volume and test application time during system-on-chip (SoC) scan testing, count compatible pattern run-length (CCPRL) coding method counts the consecutive number of the equal to or contrary to the retained patterns, it modifies the compatible code of variable-length pattern run-length (VPRL) coding rules and adds a count code block to replace original rules for increasing compression ratio. Next, the decoder architecture and the state diagram of finite state machine (FSM) are designed. In addition, the power model of test vectors is analyzed, and the power consumption of scanned-in vectors is roughly evaluated. The six largest ISCAS'89 benchmark circuits verify the proposed coding method has a shorter codeword. Experiment results shows that all compression ratios have been increased as much as possible, test data decompression is lossless, less test application time is consumed, yet the peak power and average power consumption of scanned-in test vector needs to be further improved for modern circuit scan testing.

Download Full-text

A performance comparison between closed form and numerical optimization solutions for humanoid robot walking pattern generation

International Journal of Advanced Robotic Systems ◽

10.1177/17298814211029774 ◽

2021 ◽

Vol 18 (4) ◽

pp. 172988142110297

Author(s):

Samer A Mohamed ◽

Shady A Maged ◽

Mohammed I Awad

Keyword(s):

Power Consumption ◽

Closed Form ◽

Numerical Optimization ◽

Humanoid Robot ◽

Closed Form Solution ◽

Computational Effort ◽

Form Solution ◽

Pattern Generation ◽

Walking Pattern ◽

Walking Pattern Generation

This article presents the modeling process of the lower part of a humanoid biped robot in terms of kinematic/dynamic states and the creation of a full dynamic simulation environment for a walking robot using MATLAB/Simulink. This article presents two different approaches for offline walking pattern generation: one relying on a closed-form solution of the linear inverted pendulum model (LIPM) mathematical model and another that considers numerical optimization as means of desired output trajectory following for a cart table state-space model. This article then investigates the possibility of introducing solution-dependent modifications to both approaches that could increase the reliability of basic walking pattern generation models in terms of smooth single support–double support phase transitioning and power consumption optimization. The algorithms were coded into offline walking pattern generators for NAO humanoid robot as a valid example and the two approaches were compared against each other in terms of stability, power consumption, and computational effort as well as against their basic unmodified counterparts.

Download Full-text

Design of a 1.9 GHz low-power LFSR Circuit using the Reed-Solomon Algorithm for Pseudo-Random Test Pattern Generation

International Journal of Integrated Engineering ◽

10.30880/ijie.2021.13.06.020 ◽

2021 ◽

Vol 13 (6) ◽

Author(s):

Vishnupriya Shivakumar ◽

◽

C. Senthilpari ◽

Zubaida Yusoff ◽

◽

...

Keyword(s):

Power Consumption ◽

Test Pattern ◽

Pattern Generation ◽

Maximum Length ◽

Linear Feedback ◽

Test Pattern Generation ◽

Ic Design ◽

Test Power ◽

Random Test ◽

Lower Test

A linear feedback shift register (LFSR) has been frequently used in the Built-in Self-Test (BIST) designs for the pseudo-random test pattern generation. The higher volume of the test patterns and the lower test power consumption are the key features in the large complex designs. The motivation of this study is to generate efficient pseudo-random test patterns by the proposed LFSR and to be applied in the BIST designs. For the BIST designs, the proposed LFSR satisfied with the main strategies such as re-seeding and lesser test power consumption. However, the reseeding approach was utilized by the maximum-length pseudo-random test patterns. The objective of this paper is to propose a new LFSR circuit based on the proposed Reed-Solomon (RS) algorithm. The RS algorithm is created by considering the factors of the maximum length test patterns with a minimum distance over the time t. Also, it has been achieved an effective generation of test patterns over a stage of complexity order O (m log2 m), where m denotes the total number of message bits. We analysed our RS LFSR mathematically using the feedback polynomial function to decrease the area overhead occupied in the designs. The simulation works of the proposed RS LFSR bit-wise stages are simulated using the TSMC 130 nm on the Mentor Graphics IC design platform. Experimental results showed that the proposed LFSR achieved the effective pseudo-random test patterns with a lower test power consumption of 25.13 µW and 49.9 µs. In addition, proposed LFSR along with existing authors’ LFSR are applied in the BIST design to examine their power consumption. Ultimately, overall simulations operated with the highest operating frequency environment as 1.9 GHz.

Download Full-text

Test Pattern Generation with Low Power for Delay Faults in Digital Circuits by Evolution Method with Hybrid Strategies

The Open Electrical & Electronic Engineering Journal ◽

10.2174/1874129001408010077 ◽

2014 ◽

Vol 8 (1) ◽

pp. 77-83

Author(s):

Pan Zhongliang ◽

Chen Ling ◽

Chen Yihui

Keyword(s):

Power Consumption ◽

Low Power ◽

Digital Circuits ◽

Test Pattern ◽

Average Power ◽

Pattern Generation ◽

Test Pattern Generation ◽

Delay Faults ◽

High Power Consumption ◽

Test Vectors

The high power consumption during circuit test process can produce unwanted failures or take effects on circuit reliability, therefore the reduction of both peak power and average power of circuit test is necessary. A test pattern generation approach is presented in this paper for the delay faults in digital circuits, the approach makes use of the evolution method with the hybrid strategies to produce the test vectors with low power consumption. First of all, a pair of vectors that may detect a delay fault is coded as an individual. A lot of individuals constitute the populations. Secondly, the test vectors with low power are produced by the evolution of these populations. Many new individuals are randomly produced and are added into every evolution step, and the mutation mode of individuals is related to other individuals in the current population. A lot of experimental results show that the test vectors with low power for the delay faults in digital circuits can be produced by the approach proposed in this paper, and the approach can get the large reduction of power consumption when compared with random test generation algorithm.

Download Full-text

An Efficient Test Pattern Generation Scheme for an On Chip BIST

VLSI Design ◽

10.1155/2001/45324 ◽

2001 ◽

Vol 12 (4) ◽

pp. 551-562 ◽

Cited By ~ 1

Author(s):

B. K. S. V. L. Varaprasad ◽

L. M. Patnaik ◽

H. S. Jamadagni ◽

V. K. Agrawal

Keyword(s):

Power Consumption ◽

Low Power ◽

Test Pattern ◽

Circuit Simulation ◽

Cost Effective ◽

Pattern Generation ◽

Test Pattern Generation ◽

Space Applications ◽

Efficient Test ◽

On Chip

Testing and power consumption are becoming two critical issues in VLSI design due to the growing complexity of VLSI circuits and remarkable success and growth of low power applications (viz. portable consumer electronics and space applications). On chip Built In Self Test (BIST) is a cost-effective test methodology for highly complex VLSI devices like Systems On Chip. This paper deals with cost-effective Test Pattern Generation (TPG) schemes in BIST. We present a novel methodology based on the use of a suitable Linear Feedback Shift Register (LFSR) which cycles through the required sequences (test vectors) aiming at a desired fault coverage causing minimum circuit toggling and hence low power consumption while testing. The proposed technique uses circuit simulation data for modeling. We show how to identify the LFSR using graph theory techniques and compute its feedback coefficients (i.e., its characteristic polynomial) for realization of a Test Pattern Generator.

Download Full-text