Title page
title.pdf
Contents
contents.pdf
Research in Digital Design and Test at Tallinn University of Technology
Raimund Ubar
Gert Jervan, Artur Jutman, Jaan Raik, Peeter Ellervee, Margus Kruus - Tallinn
University of Technology, Tallinn, Estonia
pp. 4-12
ri_2008_1_1.pdf
An overview about the recent research results at the Tallinn University of Technology in the field of digital design and test is presented. The main topics discussed in the paper cover digital design, verification, emulation, dependability, fault simulation, and test generation. An experimental research environment is described which consists of prototype tools developed as a side-effect of our research activities. This environment together with a set of dedicated elearning tools serves also for teaching purposes for the disciplines of design and test of embedded systems.
Enhancing Path Delay Fault Coverage by Weighted Pseudorandom Test Generation
Øystein Gjermundnes - ARM, Norway
Einar J. Aas - Norwegian University of Science and Technology, Trondheim,
Norway
pp. 13-18
ri_2008_1_2.pdf
The implementation of a system for analyzing circuits with respect to their path-delay fault testability is presented. It includes a path-delay fault simulator, and an ATPG for path-delay faults combined into a test tool. The test tool is used to evaluate the performance of several different test vector generators. The test generators exploit weighted pseudo-random stimuli generation, based on arithmetic BIST and SIC patterns. The main goal is to find efficient heuristics that improves path-delay fault detection efficiency in terms of test time. We show that weighted ABIST stimuli are productive for detecting the K-longest path-delay faults for most circuits. On the average, we obtained fault coverage of 92.6% for the 20.000 longest paths on iscas’85 circuits.
Programming Calculations in Many-Dimensional Boolean Space
Arkadij Zakrevskij - United Institute of Informatics Problems of the
National Academy of Sciences of Belarus, Minsk
pp. 19-25
ri_2008_1_3.pdf
The set of macro operations POBS over Boolean 2n-component vectors is offered, which essentially facilitates programming calculations in many-dimensional Boolean space. The application of that set is illustrated by examples of the analysis of partial Boolean functions on a monotony and presence of functional regularities, solving problems of sequential composition and decomposition. An important role is played by operations of interaction between adjacent units of the space.
Test Pattern Overlapping - a Promising Compression Method for Narrow Test
Access Mechanism SOC Circuits
Ondřej Novák, Jiří Jeníček - Technical University Liberec, Czech Republic
pp. 26-33
ri_2008_1_4.pdf
This paper describes research results obtained in the field of test pattern compression and decompression. We refer the hardware test pattern decompression system DyRESPIN built-in on a System on Chip, which uses test patterns compressed by the compressing algorithm called COMPAS. COMPAS reorders and compresses test patterns previously generated in an ATPG in such a way that they are well suited for decompression by the scan chains in the embedded tester cores. We report improvements that have been done recently on COMPAS. COMPAS algorithm has to manipulate with enormous amount of data when compressing test sets of large circuits and the CPU time grows rapidly with the growing number of test vectors. The CPU time problem was solved by using a test vector initial encoding by sparse vectors and by using a dynamic structure for storing the precalculated parameters of candidate vectors to be used in the near future algorithm loops for overlapping with the actual scan chain content. This arrangement allows the algorithm to skip unnecessary computations. The improvements cause that the CPU time grows approximately linearly with the size of the tested circuit. DyRESPIN uses a built-in processor for test control, the embedded RAM memory for storing both the compressed test vectors and the partial reconfiguration bit streams and the FPGA part of the chip for the wrapped cores implementation. The highly compressed test vectors are transferred from the memory to those selected cores that are reconfigured into the embedded tester cores. The patterns are decompressed within the internal scan chains of the embedded tester cores and they are simultaneously fed into the parallel scan chains of the cores under test with the help of the Test Access Mechanism (TAM) and standard wrappers. After having tested the first cores under test the TAM of the SoC is partially reconfigured with the help of the partial reconfiguration bitstreams stored in the RAM memory and the till now untested cores are tested by those cores that start to serve as embedded testers.
Comparative Study of the Descriptive Experiment Design and Robust Fused
Bayesian Regularization Techniques for High-Resolution Radar Imaging
Ivan E. Villalon-Turrubiates - Department of Computer Sciences at the
University of Guadalajara Campus Valles, Mexico
Yuriy V. Shkvarko - CINVESTAV Unidad Guadalajara, Mexico
pp. 34-48
ri_2008_1_5.pdf
In this paper, we perform a comparative study of two recently proposed high-resolution radar imaging paradigms: the descriptive experiment design regularization (DEDR) and the fused Bayesian regularization (FBR) methods. The first one, the DEDR, employs aggregation of the descriptive regularization and worst-case statistical performance (WCSP) optimization approaches to enhanced radar/SAR imaging. The second one, the FBR, performs image reconstruction as a solution of the illconditioned inverse spatial spectrum pattern (SSP) estimation problem with model uncertainties via unifying the Bayesian minimum risk (MR) estimation strategy with the maximum entropy (ME) randomized a priori image model and other projection-type regularization constraints imposed on the solution. Although the DEDR and the FBR are inferred from different descriptive and statistical constrained optimization paradigms, we examine how these two methods lead to structurally similar techniques that may be further transformed into new computationally more efficient robust adaptive imaging methods that enable one to derive efficient and consistent estimates of the SSP via unifying both the robust DEDR and FBR considerations. We present the results of extended comparative simulation study of the family of the image formation/ enhancement algorithms that employ the proposed robustified FBR and DEDR methods for high-resolution reconstruction of the SSP in a virtually real time. The computational complexity of different methods are analyzed and reported together with the scene imaging protocols. The advantages of the well designed SAR imaging experiments (that employ the FBR-based and DEDR-related robust estimators) over the cases of poorer designed experiments (that employ the conventional matched spatial filtering as well as the least squares techniques) are verified trough the simulation study.
Theoretical Study of Diffusion and Adsorption Inside Nano- and Mesoporous
Active Particles
Oleksiy V. Klymenko - Mathematical and Computer Modelling Laboratory, Kharkov
National University of Radioelectronics, Ukraine
pp. 49-54
ri_2008_1_6.pdf
Mass transport of a target species towards and within spherical mesoporous organosilica particles and its adsorption by active sites at pore walls is investigated through the numerical solution of the pertinent mathematical model. The presented theoretical results allow the optimization of mesoporous materials to increase their capacity towards target ions or molecules and their time-efficiency.
Solving Parallel Multi Component Automata Equations
Natalia Shabaldina, Nina Yevtushenko - Tomsk State University, Russia
pp. 55-57
ri_2008_1_7.pdf
The problem of designing the unknown component of a system of interacting automata that combined with the known part of the system meets the specification, is well known. However, most publications are devoted to solving the problem for the proper composition of two automata. In this paper, we consider a parallel multi component automata equation and propose two methods for deriving a largest solution to this equation (if the equation is solvable). In particular, we show that the union of alphabets over all known components and of that of the specification is the largest alphabet of actions over which a solution for a solvable equation should exist, and show how a solution over an appropriate alphabet can be derived from such a largest solution.
Experiments with the Linear Automata and Synthesis Test to Them
Dmitry Speranskiy - Saratov State University, Russia
pp. 58-62
ri_2008_1_8.pdf
The overview of results in area of the experiments theory with linear automata is given. This theory is a fundamental base to devise methods of discrete systems technical diagnosis.
Research digital devices by means of modelling system on the basis of K-Value
differential calculus
Dmitrienko V.D., Leonov S.Yu., Gladkikh T.V. - National Technical University
"Kharkov Polytechnical Institute", Ukraine
pp. 63-69
ri_2008_1_9.pdf
Given article is devoted to the description of new system’s of simulation, which based on the mathematical device of K-Value differential calculus, possibilities. This system intend for research the complex high-speed devices constructed with usage of modern technologies.
Theory and Applications of Constrained
LinearPredictive (LP) models
Igor N. Presnjakov - Department of Communications, Kharkiv National
University of Radio Electronics, Ukraine
Leonid I. Nefedov - Department of Automation, Kharkiv National Auto Road
University, Ukraine
Stanislaw A. Krivenko, and Alexander P. Stativka - Department of
Communications, Kharkiv National University of Radio Electronics, Ukraine
pp. 70-77
ri_2008_1_10.pdf
The present paper relates generally to speech encoding and decoding in voice communication systems; and, more particularly, it relates to various techniques used with code- excited linear prediction coding to obtain high quality speech reproduction through a limited bit rate communication channel.
Monitoring of Photonic-Crystal Fibers Positioning in the Connection Process
À. Filipenko, Î. Sychova - Kharkov National University of Radio Electronics,
Ukraine
pp. 78-83
ri_2008_1_11.pdf
In this report the monitoring method of PCF positioning at the
connection process is offered. It is based on the matched filtration principle
in the form of autoconvolution. Equations which connected PCF core axis
coordinates with the maximum value of optical field intensity autoconvolution
was obtained. It is shown that optical fiber displacement relatively base
coordinates corresponds to half coordinates of autoconvolution maximum.
Researches have shown that the offered method possesses high noiseproof factor
and much higher accuracy in comparison with an integrated method.
Features of Decision Support’s Program at Choice of Tests Optimized Sequence
for Semiconductors Memory Diagnosing
Ryabtsev V.G, Almadi M.K. - Cherkassy State Technological University,
Ukraine
pp. 84-87
ri_2008_1_12.pdf
A method, which allows decreasing calculations works labour intensiveness at the choice of paret-optimum tests for semiconductors storage devices diagnosing is offered. This method is realized in the program Optimal-test, which allows decreasing the duration of memory’s microcircuits testing without worsening of their quality.
General Testing Models of SOC Hardware-Software Components
Vladimir Hahanov, Eugenia Litvinova, W. Gharibi - Kharkov National
University of Radio Electronics, Ukraine
pp. 88-95
ri_2008_1_13.pdf
Innovative testable design technologies of hardware and software, which oriented on making graph models of SoC components for effective test development and SoC component verification, are considered. A novel approach to evaluation of hardware and software testability, represented in the form of register transfer graph, is proposed. Instances of making of software graph models for their subsequent testing and diagnosis are shown.