Loading...
Search for: arithmetic-circuit
0.006 seconds

    A novel voltage-to-voltage logarithmic converter with high accuracy

    , Article Przeglad Elektrotechniczny ; Volume 87, Issue 4 , 2011 , Pages 150-153 ; 00332097 (ISSN) Ghanaattian Jahromi, A ; Abrishamifar, A ; Medi, A ; Sharif University of Technology
    Abstract
    A novel BiCMOS voltage-to-voltage converter with logarithmic characteristics and very high accuracy is presented. The relationship between the emitter current and the base-emitter voltage in bipolar transistors is used to realize the logarithmic function. With 1.8 supply voltage, the total power consumption is less than 15.75 mW and a Log error of < -36dB is shown in the ADS simulations. Compared to the other method in the literature, very better accuracy in logarithm calculation is achieved. The proposed method can be used in arithmetical operation circuits like analog processors  

    Arithmetic circuits verification without looking for internal equivalences

    , Article 2008 6th ACM and IEEE International Conference on Formal Methods and Models for Co-Design, MEMOCODE'08, Anaheim, CA, 5 June 2008 through 7 June 2008 ; 2008 , Pages 7-16 ; 9781424424177 (ISBN) Sarbishei, O ; Alizadeh, B ; Fujita, M ; Sharif University of Technology
    2008
    Abstract
    In this paper, we propose a novel approach to extract a network of half adders from the gate-level net-list of an addition circuit while no internal equivalences exist. The technique begins with a gatelevel net-list and tries to map it into word-level adders based on an efficient bit-level adder representation. It will be shown that the proposed technique is suitable for several gate-level architectures of multipliers, as it extracts adder components in a step-wise method. This approach can also be generalized to other arithmetic circuits. In order to evaluate the effectiveness of our approach, we run it on several arithmetic circuits and compare experimental results with those of... 

    A formal approach for debugging arithmetic circuits

    , Article IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Volume 28, Issue 1 , 2009 , Pages 742-754 ; 02780070 (ISSN) Sarbishei, O ; Tabandeh, M ; Alizadeh, B ; Fujita, M ; Sharif University of Technology
    2009
    Abstract
    This paper presents a novel automatic debugging algorithm for a postsynthesis combinational arithmetic circuit. The approach is robust under wide varieties of arithmetic circuit architectures and design optimizations. The debugging algorithm in this paper consists of three phases of partial product initialization, XOR extraction, and carry-signalmapping. The run-time complexity of conventional carry-signal-mapping algorithms, such as the approach described by Stoffel and Kunz, is exponential. However, in the proposed algorithm, by making use of some important design issues, we categorize the extracted XORs into half/full-adders to make a very fast debugging algorithm. This approach is robust... 

    Operand Width Aware Hardware Reuse: A low cost fault-tolerant approach to ALU design in embedded processors

    , Article Microelectronics Reliability ; Volume 51, Issue 12 , December , 2011 , Pages 2374-2387 ; 00262714 (ISSN) Fazeli, M ; Namazi, A ; Miremadi, S. G ; Haghdoost, A ; Sharif University of Technology
    2011
    Abstract
    This paper presents a low cost fault-tolerant technique so called OWHR (Operand Width Aware Hardware Reuse) to ALU design in embedded processors. The OWHR technique is motivated by two facts: (1) Many of the produced and consumed values are narrow-width values in the embedded processors, i.e. they have leading zeros or ones in their most significant bits. This indicates that only a fraction of the circuit is performing useful operations when a particular arithmetic or logic circuit in the ALU is operating on narrow-width values; (2) other circuits of the ALU are not used, when a particular arithmetic or logic circuit is being utilized to perform a specific operation in the ALU in the... 

    Optimization and Verification of Arithmetic Circuits under Different Levels of Abstraction

    , M.Sc. Thesis Sharif University of Technology Sarbishei, Omid (Author) ; Tabandeh, Mahmoud (Supervisor) ; Alizadeh, Bijan (Supervisor)
    Abstract
    Arithmetic circuits are considered as very important blocks of datapaths in microprocessor structures. Due to the high importance of these circuits, several optimization approaches in different levels of abstraction have been proposed for them. These approaches can be implemented by either software or manually by digital logic designers. As within this optimization process, specially, in manual approaches, the probability of introducing logic bugs in the circuit is high, it would then be necessary to make use of verification and debugging techniques for the designed circuits. One of the classic verification methods is simulation. This approach is not suitable for large designs and it does... 

    A formal approach for debugging arithmetic circuits

    , Article IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems ; Volume 28, Issue 5 , 2009 , Pages 742-754 ; 02780070 (ISSN) Sarbishei, O ; Tabandeh, M ; Alizadeh, B ; Fujita, M ; Sharif University of Technology
    2009
    Abstract
    This paper presents a novel automatic debugging algorithm for a postsynthesis combinational arithmetic circuit. The approach is robust under wide varieties of arithmetic circuit architectures and design optimizations. The debugging algorithm in this paper consists of three phases of partial product initialization, xor extraction, and carry-signal mapping. The run-time complexity of conventional carry-signal-mapping algorithms, such as the approach described by Stoffel and Kunz, is exponential. However, in the proposed algorithm, by making use of some important design issues, we categorize the extracted xors into half/full-adders to make a very fast debugging algorithm. This approach is... 

    CNTFET full-adders for energy-efficient arithmetic applications

    , Article 6th International Conference on Computing, Communications and Networking Technologies, 13 July 2015 through 15 July 2015 ; 2015 ; 9781479979844 (ISBN) Grailoo, M ; Hashemi, M ; Haghshenas, K ; Rezaee, S ; Rapolu, S ; Nikoubin, T ; University of North Texas ; Sharif University of Technology
    Institute of Electrical and Electronics Engineers Inc 
    Abstract
    In this paper, we present two energy-efficient full adders (FAs) which are a crucial building block of nano arithmetic logic units (nano-ALUs) with the Cell Design Methodology (CDM). Since the most suitable design configuration for CNT-based ICs is pass transistor configuration (PTL), CDM which properly benefits from PTL advantages is utilized. So the designs herewith take full advantages of simplicity, fewer transistors and better immunity against threshold voltage fluctuations of the PTL than the CCMOS configuration. CDM also resolves two problems of PTL by employing elegant mechanisms which are threshold voltage drop and loss of gain. Using the amend mechanisms and SEA sizing algorithm...