Thesis (M. App. Sc.)--Carleton University, 2004. / Includes bibliographical references (p. 95-98). Also available in electronic format on the Internet.

Orientador: Alberto Martins Jorge / Dissertação (mestrado) - Universidade Estadual de Campinas, Faculdade de Engenharia Eletrica e de Computação / Made available in DSpace on 2018-08-09T08:44:01Z (GMT). No. of bitstreams: 1 MingotoJunior_CarlosRoberto_M.pdf: 657421 bytes, checksum: dc6ef4bc58fb70a90293781871a969c6 (MD5) Previous issue date: 2005 / Resumo: Os circuitos quaternários são uma alternativa para o processamento das informações, que, atualmente, acontece de forma binária. Ainda em fase de definições, a lógica multivalores mostra-se como um campo de pesquisas que pode auxiliar a busca pelo incremento de desempenho e redução de área de ocupação dos transistores de um circuito integrado. A lógica multi-valores utilizando-se de quatro dígitos na representação das informações é a lógica quaternária. Neste trabalho são propostos alguns blocos básicos de circuitos eletrônicos quaternários que, progressivamente, são aglutinados formando blocos mais complexos para finalmente construir-se um circuito meio-somador, um somador completo e um multiplicador quaternários. As montagens são feitas e testadas em simulador de circuitos eletrônicos e operam em modo corrente com transistores bipolares NPN e PNP / Abstract: The quaternary circuits are an alternative to data processing that, nowadays, occurs in a binary way. Still in a definition stage, the multiple-valued logic seems to be a research area to aid the increase of performance and reduction of area of the transistors inside an integrated circuit. The multiple-valued logic using four digits to represent the data is called quaternary logic. In this work are proposed some basic blocks of electronic quaternary circuit which are progressively joined to become more complex blocks and finally a half-adder, a full adder and a multiplier. The configurations are done and evaluated in a circuit simulator operating in a current-mode with bipolar NPN and PNP transistors / Mestrado / Eletrônica, Microeletrônica e Optoeletrônica / Mestre em Engenharia Elétrica

This thesis presents the implementation of some of the basic concepts of digital logic design in a fun and creative way with the help of paper electronics. This involves circuit building on paper using conductive tape or conductive ink and circuit components as electronics craft materials. Paper electronics toolkit called circuit sticker microcontroller which is deployed by a company named Chibitronics and AT89C51 microcontroller were used for the computational functioning of the circuits built on paper. This can be used to teach the fundamentals of digital logic design to the students in their early stage of studies in an attractive way and can help them them gain a better understanding. This thesis can also be helpful in grabbing the attention of high school students and motivate them towards choosing the engineering discipline for their higher studies.

Approved for public release; distribution is unlimited / The contribution of this thesis is the development of a CAD (computer aided design) tool for current mode multiple-valued logic (MVL) CMOS circuits. It is only the second known MVL CAD tool and the first CAD tool for MVL CMOS. The tool accepts a specification of the function to be realized by the user, produces a minimal or near-minimal realization (if such a realization is possible), and produces a layout of a programmable logic array (PLA) integrated circuit that realizes the given function. The layout is in MAGIC format, suitable for submission to a chip manufacturer. The CAD tool also allows the user to simulate the realized function so that he/she can verify correctness of design. The CAD tool is designed also to be an analysis tool for heuristic minimization algorithms. As part of this thesis, a random function generator and statistics gathering package were developed. In the present tool, two heuristics are provided and the user can choose one or both. In the latter case, the better realization is output to the user. The CAD tool is designed to be flexible, so that future improvements can be made in the heuristic algorithms, as well as the layout generator. Thus, the tool can be used to accommodate new technologies, for example, a voltage mode CMOS PLA rather than the current mode CMOS currently implemented. / http://archive.org/details/cadtoolforcurren00leeh / Lieutenant, Republic of Korea Navy

<p>U radu je razmatran problem dizajna i minimizacije rekurzivne<br />Bulove formule konstruisane za proizvoljnu Bulovu funkciju y:BN<br />&rarr;B.<br />U cilju rešavanja ovog problema, predstavljene su dve algoritamske<br />heuristike za minimizaciju rekurzivne Bulove formule. Minimizacija<br />rekurzivne Bulove formule vrši se korišćenjem regularnih poredaka<br />pozitivnih proizvod termova. U disertaciji je dokazano kako je ova<br />regularnost poredaka zapravo potreban i dovoljan uslov da željena<br />Bulova funcija y bude korektno predstavljena rekurzivnom Bulovom<br />formulom konstruisanom na osnovu tih poredaka. Pokazano je i kako<br />predstavljeni algoritmi daju bolje rezultate za veći broj instanci<br />problema u poređenju sa algoritmima dostupnim u literaturi.</p> / <p>In this thesis, the problem of design and minimization of recursive Boolean<br />formula, based on an arbitrary Boolean function y:BN<br />&rarr;B , is considered. As a<br />solution of a problem, two heuristic algorithms that minimize the length of<br />recursive Boolean formula, were presented. Minimization, itself, is done by<br />using regular orders of positive product terms. In the thesis it was proved that<br />the regularity of orders represents necessary and sufficient condition for<br />correct representation of Boolean function y by recursive Boolean formula<br />based on such regular order. Developed algorithms are compared with other<br />heuristic algorithms for recursive Boolean formula minimization, available in<br />the literature, and it is shown how algorithms proposed in this thesis provide<br />better results for more problem instances.</p>

Yang, Xiaoqing. / Thesis (Ph.D.)--Chinese University of Hong Kong, 2011. / Includes bibliographical references (leaves 113-120). / Electronic reproduction. Hong Kong : Chinese University of Hong Kong, [2012] System requirements: Adobe Acrobat Reader. Available via World Wide Web. / Abstract also in Chinese.

Orientador: Rodolfo Jardim de Azevedo / Dissertação (mestrado) - Universidade Estadual de Campinas, Instituto de Computação / Made available in DSpace on 2018-08-17T02:11:17Z (GMT). No. of bitstreams: 1 Goto_SamuelShojiFukujima_M.pdf: 4578638 bytes, checksum: c8297ac26a037d8b90ccb1c1ad3d6c43 (MD5) Previous issue date: 2010 / Resumo: Desde sua popularização, processadores dobraram de capacidade e desempenho à cada dois anos. No entanto, paralelamente, essa tendência foi apenas sustentada pelo crescimento da sofisticação das implementações utilizadas. Atualmente, apesar de eficientes, processadores são complexos e difíceis de projetar. Para gerenciar esse problema, foram criadas linguagens chamadas ADLs que simplificam a especificação e simulação em níveis mais abstratos, enquanto HDLs ainda são utilizadas para a descrição RTL. Esse trabalho unifica o fluxo de especificação e simulação de processadores com o fluxo de implementação RTL a partir da mesma linguagem ADL. Para isso, escolhemos uma linguagem de descrição de arquitetura chamada ArchC. Sintetizamos com sucesso parte de processadores descritos em ArchC, como o PIC16F84, o I8051, o MIPS-I, o R3000 e uma JVM. Subconjuntos dos processadores foram prototipados em FPGA, com frequências de operação entre 80MHZ à 120MHZ projetados duas a três vezes mais rapidamente do que os desenvolvidos com HDLs. Mostramos que ArchC é sintetizável, completando o fluxo de projeto da linguagem até o nível RTL. Criamos as ferramentas necessárias e fornecemos modelos RTL dos processadores citados / Abstract: The design and implementation of processors is a complex task. Architecture Description Languages (ADLs) were created to extend existing HDLs to manage the inherit complexity of modern processors. Along with HDLs, they ease the development and prototyping of new architectures by providing a set of tools and algorithms to optimize and automate some of the tedious parts. However, while much has been done on using ADLs for simulating high level specifications, the academia knows very little about how to reuse them to implement real life processors. This work addresses the issues of synthesizing processors from an ADL model. To accomplish that, we chose an ADL called ArchC and we successfully synthesized pieces of its most stable models, like the PIC16F84, the i8051, the MIPS-I, the R3000 and a JVM. The processors were prototyped in FPGAs, with frequencies of operation as fast as 80MHZ to 120MHZ developed two to tree times faster compared to current approaches. We show that ArchC is in fact synthesizable, completing the design flow down to the RTL level. We provide all the necessary tools that were created to synthesize the models as well as the RTL models themselves / Mestrado / Arquitetura de Computadores / Mestre em Ciência da Computação

Submitted by Renata Lopes (renatasil82@gmail.com) on 2017-06-01T15:26:09Z No. of bitstreams: 1 franciscoaugustolimamanfrini.pdf: 2355106 bytes, checksum: 0c2126ac87b502d91fbb53cda2fa0b2a (MD5) / Approved for entry into archive by Adriana Oliveira (adriana.oliveira@ufjf.edu.br) on 2017-06-02T15:56:42Z (GMT) No. of bitstreams: 1 franciscoaugustolimamanfrini.pdf: 2355106 bytes, checksum: 0c2126ac87b502d91fbb53cda2fa0b2a (MD5) / Made available in DSpace on 2017-06-02T15:56:42Z (GMT). No. of bitstreams: 1 franciscoaugustolimamanfrini.pdf: 2355106 bytes, checksum: 0c2126ac87b502d91fbb53cda2fa0b2a (MD5) Previous issue date: 2017-02-23 / A computação evolucionista tem sido aplicada em diversas áreas do conhecimento para a descoberta de projetos inovadores. Quando aplicada na concepção de circuitos digitais o problema da escalabilidade tem limitado a obtenção de circuitos complexos, sendo apontado como o maior problema em hardware evolutivo. O aumento do poder dos métodos evolutivos e da eficiência da busca constitui um importante passo para melhorar as ferramentas de projeto. Este trabalho aborda a computação evolutiva aplicada ao projeto de circuito lógicos combinacionais e cria estratégias para melhorar o desempenho dos algoritmos evolutivos. As três principais contribuições resultam dessa tese são: (i) o desenvolvimento de uma nova metodologia que ajuda a compreensão das causas fundamentais do sucesso/fracasso evolutivo;(ii)a proposta de uma heurística para a semeadura da população inicial; os resultados mostram que existe uma correlação entre a topologia da população inicial e a região do espaço de busca explorada; e (iii) a proposta de um novo operador de mutação denominado Biased SAM; verificou-se que esta mutação pode guiar de maneira efetiva a busca. Nos experimentos realizados o operador proposto é melhor ou equivalente ao operador de mutação tradicional. Os experimentos computacionais que validaram as respectivas contribuições foram feitos utilizando circuitos benchmark da literatura. / Evolutionary computation has been applied in several areas of knowledge for discovering Innovative designs. When applied to a digital circuit design the scalability problem has limited the obtaining of complex circuits, being pointed as the main problem in the evolvable hardware field. Increased power of evolutionary methods and efficiency of the search constitute an important step towards improving the design tool. This work approaches the evolutionary computation applied to the design of combinational logic circuits and createsstrategiestoimprovetheperformanceofevolutionaryalgorithms. The three main contributions result from this thesis are: (i) the developement of a methodology that helps to understand the success/failure of the genetic modifications that occur along the evolution; (ii) a heuristic proposed for seeding the initial population; the results showed there is a correlation between the topology of the initial population and the region of the search space which is explored. (iii) a proposal of a new mutation operator referred to as Biased SAM; it is verified that this operator can guide the search. In the experiments performed the mutation proposed is better than or equivalent to the traditional mutation. The computational experiments that prove the efficiency of the respective contributions were made using benchmark circuits of the literature.

This dissertation presents the design and development of a multi-processor logic simulator. After an introduction to parallel processing, the concept of distributed simulation is described as well as the possibility of deadlock in a distributed system. It is proven that the proposed system does not deadlock. Next, the modeling techniques are discussed along with the timing mechanisms used for logic simulation. A new approach, namely process oriented simulation is studied in depth. It is shown that modeling for this kind of simulation is more efficient regarding modeling ease, computer memory and simulation time, than existing simulation methods. The hardware design of the multi-processor system and the algorithms for synchronization and signal interchange between the processors are presented next. An algorithm for an efficient partitioning of the digital network to be simulated among the processors of the system is also described. Apart from the simulation of a single digital network, the simulator can also be used for fault simulation and design verification. Regarding fault simulation, the fault injection and fault detection techniques are presented. The experimental results obtained by running the multi-processor simulator are compared with the theoretical estimates as well as with results obtained by other multi-processor systems. The comparison shows that the proposed simulator exhibits the estimated performance. Finally, the design of a common bus interface is given. This interface will connect the processors of the system directly without the intervention of a hard disk which was used for the development and testing of the system. / Ph. D.

Finding an optimal solution for the logic circuit design problem is challenging and time-consuming especially for complex logic circuits. As the number of logic gates increases the task of designing optimal logic circuits extends beyond human capability. A number of evolutionary algorithms have been invented to tackle a range of optimisation problems, including logic circuit design. This dissertation explores two of these evolutionary algorithms i.e. Gene Expression Programming (GEP) and Multi Expression Programming (MEP) with the aim of integrating their strengths into a new Genetic Programming (GP) algorithm. GEP was invented by Candida Ferreira in 1999 and published in 2001 [8]. The GEP algorithm inherits the advantages of the Genetic Algorithm (GA) and GP, and it uses a simple encoding method to solve complex problems [6, 32]. While GEP emerged as powerful due to its simplicity in implementation and exibility in genetic operations, it is not without weaknesses. Some of these inherent weaknesses are discussed in [1, 6, 21]. Like GEP, MEP is a GP-variant that uses linear chromosomes of xed length [23]. A unique feature of MEP is its ability to store multiple solutions of a problem in a single chromosome. MEP also has an ability to implement code-reuse which is achieved through its representation which allow multiple references to a single sub-structure. This dissertation proposes a new GP algorithm, Improved Gene Expression Programming (IGEP) which im- proves the performance of the traditional GEP by combining the code-reuse capability and simplicity of gene encoding method from MEP and GEP, respectively. The results obtained using the IGEP and the traditional GEP show that the two algorithms are comparable in terms of the success rate when applied on simple problems such as basic logic functions. However, for complex problems such as one-bit Full Adder (FA) and AND-OR Arithmetic Logic Unit (ALU) the IGEP performs better than the traditional GEP due to the code-reuse in IGEP / Mathematical Sciences / M. Sc. (Applied Mathematics)