Graph-based FPGA computation of elementary functions

• Autor(a) principal: Caetano, José Daniel Soares
• Data de Publicação: 2012
• Tipo de documento: Dissertação
• Idioma: eng
• Título da fonte: Repositório Científico de Acesso Aberto de Portugal (Repositórios Cientìficos)
• Texto Completo: http://hdl.handle.net/10773/11049
• topic: Engenharia electrónica; Comutação (Electricidade); Circuitos de comutação

Since C.Y.Lee first proposed the idea of representing switching circuits as decision diagrams, there has been some interest in developing these diagrams in order to make them more compact and effective. One of the main applications of this technique is to represent circuits that perform elementary functions, such as cosine, sine, square root, etc. In this thesis, we try to prove that by choosing the right polarity for an Arithmetic Decision Diagram we can compactly and effectively represent a switching function and implement it in hardware. This thesis proposes algorithms that can compactly implement a given elementary function in hardware by finding the best possible polarity for the respective Arithmetic Decision Diagram.