No description available.

Snehal Udar, for the Doctor of Philosophy degree in Electrical and Computer Engineering, presented on May 4, of 2011, at Southern Illinois University Carbondale. TITLE: BUILT-IN SCHEMES FOR TEST PATTERN GENERATION AND FAULT LOCATION MAJOR PROFESSOR: Dr. D. Kagaris In this dissertation, we studied the areas of test pattern generation and fault location for detecting and diagnosing the faults in today's complex chips. In the first problem, a novel reseeding based test pattern generation scheme is analyzed by proposing a hardware efficient technique that uses irreducible polynomial-primitive element pair to generate distinct subsequences of test patterns. It is shown that for the given characteristic polynomial the hardware cost remains the same irrespective of the number of seeds required to generate the test sequence of given length. This scheme is targeted at generating pseudo-random test patterns that detect easy-to-detect faults. A counter based reseeding scheme is further analyzed that embeds a given set of fully specified test patterns in minimum number of clock cycles. Second problem investigates the effectiveness of inserting observation points on the circuit lines that along with primary output lines distinguish a given set of faults. Three hardware based approaches are proposed that aim at inserting minimum observation points, and are compared with each other for different diagnostic resolutions.

Testing of delay defects is necessary in deep submicron (DSM) technologies. High coverage delay tests produced by automatic test pattern generation (ATPG) can be applied during wafer and package tests, but are difficult to apply during the board test, due to limited chip access. Delay testing at the board level is increasingly important to diagnose failures caused by supply noise or temperature in the board environment. An alternative to ATPG is the built-in self test (BIST). In combination with the insertion of test points, BIST is able to achieve high coverage of stuck-at and transition faults. The quality of BIST patterns on small delay defects is an open question. In this work we analyze the application of BIST to small delay defects using resistive short and open models in order to estimate the coverage and correlate the coverage to traditional delay fault models.

Thesis(M.S.)--Auburn University, 2006. / Abstract. Vita. Includes bibliographic references (p.74-78).

No / The complex formation of Islamic geometric Patterns (IGP) is one of the distinctive features in Islamic art and architecture. Many have attempted to reproduce these patterns in digital form, using various pattern generation techniques. Shape grammars are an effective pattern generation method, providing good aesthetic results. In this paper we present a novel approach in generating 3D IGP using an extended shape grammar: Parametrized Shape Grammar (PSG). PSG allows a user to generate both original and novel forms of Islamic geometric motifs (a repeated unit of a pattern). PSG is generalized to generate n-fold Islamic geometric motifs in a 3D environment, practically implemented as a 3D modeling tool within Autodesk Maya. The parametrization within each grammar rule is the key to generating numerous original and novel Islamic geometric motifs.

No description available.

This thesis presents four different techniques for improving the average-case performance of deterministic sequential circuit Automatic Test Patterns Generators (ATPG). Three techniques make use of information gathered during test generation to help identify more unjustifiable states with higher percentage of "don't care" value. An approach for reducing the search space of the ATPG was introduced. The technique can significantly reduce the size of the search space but cannot ensure the completeness of the search. Results on ISCAS–85 benchmark circuits show that all of the proposed techniques allow for better fault detection in shorter amounts of time. These techniques, when used together, produced test vectors with high fault coverages. Also investigated in this thesis is the Decision Inversion Problem which threatens the completeness of ATPG tools such as HITEC or ATOMS. We propose a technique which can eliminate this problem by forcing the ATPG to consider search space with certain flip-flops untouched. Results show that our technique eliminated the decision inversion problem, ensuring the soundness of the search algorithm under the 9-valued logic model. / Master of Science

Dėl didėjančio integrinių schemų sudėtingumo ir darbinių dažnių vėlinimo gedimų nustatymas tampa svarbia schemų kūrimo dalimi. Programiniai schemų prototipai leidžia atlikti schemų testavimą ankstyvojoje stadijoje. Šiame darbe yra pateikiama vėlinimo gedimų nustatymo metodų analizė ir jų palyginimas. Tyrimo objektu pasirinktas perėjimo gedimų modelis. Dokumente aprašomas AntiRandom metodo pritaikymo galimybės funkcinių testų generavimui. Taip pat yra trumpai apžvelgiami egzistuojantys sprendimai rinkoje. Projektavimo skyriuje yra aprašoma suprojektuota ir realizuota sistema, kuri susideda iš dviejų posistemių: funkcinių testų generatoriaus bei rezultatų kaupimo ir analizės posistemės. Funkcinių testų generatoriuje realizuoti du atsitiktinio ir AntiRandom metodai. Paskutinėje dokumento dalyje yra pateiktas atliktas eksperimentinis tyrimas su realizuota sistema. Taip pat yra pateikiami eksperimentinio tyrimo metu pasiekti rezultatai bei padarytos viso darbo išvados. / The increasing complexity of integrated circuits and operating frequency led delay fault identification to become an important part of the schemes development. Software prototypes allow to start testing phase at an early stage. This work covers the delay fault detection method analysis and comparison. For the study is selected transition fault identification. The paper describes the AntiRandom method and customization possibilities for the functional test generation. There is also a brief overview of an existing solutions on the market. The design section describes the designed and implemented system which consists of two subsystems: functional tests generator and results storage and analysis subsystem. Functional test generator has two random methods and customized AntiRandom method. The last part of the document covers an experimental study for the created system. It consists of results of the experiments and conclusions of the whole work.

A teoria das redes complexas tem se consolidado por seu forte caráter interdisciplinar, relativa simplicidade conceitual e ampla aplicabilidade na modelagem de sistemas reais. Embora tendo evoluído rapidamente, uma série de problemas ainda não foram estudados usando as redes complexas. Em especial, sistemas envolvendo acoplamento e interação entre diferentes redes complexas têm sido pouco investigados. Na presente monografia, apresentamos duas contribuições fundamentais no estudo desses sistemas. A primeira consiste num modelo que descreve a interação entre um padrão de massa evoluindo numa rede regular com uma rede complexa que se organiza para impedir a evolução desse padrão. Os vértices da rede complexa se ativam e se movem sobre a rede regular conforme são requisitados por seus vizinhos, que se ativam pela rede regular. Essa última ativação ocorre quando a concentração de massa ultrapassa um limiar na respectiva posição do vértice e consiste em liberar uma difusão oposta de massa neutralizadora contra a massa original. A dinâmica mostrou-se completamente relacionada à estrutura da rede de controle. A presença de concentradores no modelo de Barabási-Albert tem papel fundamental para acelerar o processo de geração de massa neutralizadora. Por outro lado, a distribuição uniforme de vizinhos da rede de Erdös-Rényi resultou numa melhora de desempenho na presença de várias regiões distintas contendo massa original. A segunda contribuição consiste num modelo de interação entre duas espécies (predador e presa) através de campos sensitivos, que dependem da distância Euclidiana entre dois indivíduos e do seu respectivo tipo. Padrões espaço-temporais emergem nesse sistema e estão diretamente relacionados à intensidade de atração entre os indivíduos da mesma espécie. Para entender a evolução do sistema e quantificar a transferência de informação entre os diferentes aglomerados, duas redes complexas são construídas onde os vértices representam os indivíduos. Na primeira rede, o peso das conexões é dado pela distância Euclidiana entre os indivíduos e na segunda, pelo tempo que eles permaneceram suficientemente próximos. A partir de um mecanismo de fusão entre as duas redes, obtemos uma terceira rede complexa onde os vértices correspondem a grupos espaciais definidos a partir de um processo de limiarização dos pesos da primeira rede. Algumas configurações de parâmetros privilegiam a sobrevivência de presas enquanto outras beneficiam a caça dos predadores. / Complex network theory has become very popular because of its interdisciplinarity, conceptual simplicity and wide applicability to model real systems. Although fast growing, there is a number of problems which have not been addressed by using complex networks. For example, few efforts have been directed to systems involving coupling and interaction between different complex networks. In the following monography, we present two fundamental contributions in the study of such systems. The first consists in a model which describes the interaction dynamics between a mass pattern evolving in a regular network with a complex network, which are expected to control the pattern evolution. As soon as a complex network node is activated by the regular network, it requests help from its topological neighbours and activates them. The activation is triggered when the mass concentration overcomes a threshold in the node position and consists in liberating an opposite diffusion intended to eliminate the original pattern. The dynamics is completely related to the structure of the control network. The existence of hubs in the Barabási-Albert model plays a fundamental role to accelerate the opposite mass generation. Conversely, the uniform distribution of neighbours in the Erdös-Rényi network provided an increase in the efficiency when several focuses of the original pattern were distributed in the regular network. The second contribution consists in a model based on interactions between two species (predator and prey) provided by sensitive fields which depends of the Euclidean distance between two agents and on their respective types. Spatio-temporal patterns emerge in the system which are directly related to the attraction intensity between same species agents. To understand the dynamics evolution and quantify the information transfer through different clusters, we built two complex networks where the nodes represent the agents. In the first network, the edge weight is given by the Euclidean distance between two agents and, in the second network, by the amount of time two agents become close one another. By following a merging process, another network is obtained whose nodes correspond to spatial groups defined by a weight thresholding process in the first network. Some configurations favor the preys survival, while predators efficiency are improved by other ones.

本篇論文對於傳統的東方風格雲紋進行分析，歸納其中的生成規則與排列特性，並將雲紋圖樣作簡單的分類，發現雲紋圖樣具有自我相似與遞迴組成的特性，此點特性非常符合原本用於模擬植物生長的L-system，所以我們就針對所蒐集的眾多雲紋圖樣參考資料所分析出的資訊定義了一個適用於立體東方風格雲紋的生成生長規則，以L-system之技術為基礎進行撰寫規則語法，利用所定義結構化之規則循序地在三維空間中動態模擬雲紋的生長與變化。更進一步地，加入具時間序列的參數調整，可以使得雲紋隨著時間軸的變化產生東方風格立體動態雲紋。 / Cloud Pattern is an important and common element in oriental decoration art, it is a challenge to extend the 2D abstract line into 3D objects. In this thesis, we try to induce the pattern generation rule and the feature of oriental cloud by analyzing the ancient oriental cloud pattern. We make classification from the oriental 2D cloud pattern, and discover the pattern is combined with symmetric, self-similar and repetitive features. These characteristic are the core of L-System, which is a suitable framework for plant growth and simulation, so we generate a new rule with specific parameter from the feature of 2D cloud pattern to generate oriental cloud pattern in 3-dimention space, simulating the growth of cloud and variety in structure. Further, we add the time temporal parameter to control the 3D oriental cloud pattern generation process dynamically.