Open Access Open Access  Restricted Access Subscription or Fee Access

Delay and Performance Estimation for a 4-bit Even Parity Bit Generator Using the Logical Effort Model


(*) Corresponding author


Authors' affiliations


DOI: https://doi.org/10.15866/irecos.v10i8.6279

Abstract


Recent digital applications require high speed and high performance designs. The circuit design can be implemented using different types of logic gates. The logic gates are classified into two types; primitive and compound (complex) gates. Any complex logic circuit diagram can be converted into primitive using one type of universal gates; such as the NAND gates or the NOR gates only. The combinational circuits and any functional block can also be implemented using the NAND or the NOR gates only. This article shows how to build a 4-bit even parity bit generator using both universal gate types: the implementation using NAND gates only and the implementation for the 4-bit even parity bit generator using NOR gates only. A performance comparison between these two implementations, with different output loads in each case, is achieved to study the impact of the output load on the circuit delay. It will also determine which type of universal gates can be used to get better performance (delay) readings by using the logical effort technique. The logical effort is a technique used to estimate the static logic circuit delay and the power dissipated by a circuit. It helps designers make their right decisions about the delay and the power for a given design before the real implementation begins.
Copyright © 2015 Praise Worthy Prize - All rights reserved.

Keywords


Branching Effort; Critical Path; Gate Delays; Logical Effort; Universal Gates; Parasitic Delay

Full Text:

PDF


References


M. Morris Mano and Charles R. Kime, Logic and Computer Design Fundamentals, p. 103-106, (Pearson Prentice Hall, 2008).

A. Neha and A. Satyajit, Logical Effort to Study the Performance of 32-bit Heterogeneous Adder, International Journal of Computer Applications, Vlo. 65- No. 16, March 2013.

S. K. Karandikar and S. S. Sapatnekar, Technology Mapping using Logical Effort Solving the Load Distribution Problem, IEEE Trans. Comput. Aided Design Integer. Circuits Syst., Vol. 27, No. 1, pp. 45-58, Jan. 2008.
http://dx.doi.org/10.1109/tcad.2007.907067

Saraswathy, S., Jayasudha, F.V., A CMOS-based dual logic mode gate for analysis of logical effort in sequential and combinational circuit, (2015) International Review on Computers and Software (IRECOS), 10 (1), pp. 27-35.
http://dx.doi.org/10.15866/irecos.v10i1.5260

A. Rajput and S. Sharma, Implementation of CMOS Circuits in Logic Optimization using Logical Effort Technique, International Journal of Engineering and Computer Science, Vol. 2, pp. 3106-3110, Nov. 2013.

N. H. E. Weste and D. Harris, CMOS VLSI Design, A Circuit and System Perspective (Boston, Pearson, 2004).

H. Dao and V. G. Oklobdzija, Comparative Delay Analysis of Representative Adders using Logical Effort Technique, 35th Asilomar Conference on Signals, Systems and Computers, 2001.
http://dx.doi.org/10.1109/acssc.2001.987768

S. Anand, P. K. Ghosh, M. Kumar and G. Dhiman, Logical Effort to Study and Compare the Performance of VLSI Adders, UACEE International Journal of Advances in Electronics Engineering, Vol. 1, pp. 23-27, June 2011.

S. C. Tiwari, K. Singh and M. Gubta, Design and Development of Logical Effort Based Automated Transistor Width Optimization Methodology, World Applied Science Journal IDOSI Publication, Vol. 16, pp. 29-36, 2012.

V. Paramar, S. Kumar and N. Singh, Delay Estimation of a Hierarchical Decoder with the help of Logical Effort and Transistor Sizing, International Journal of Engineering Research and Applications IJERA, Vol. 3, pp. 816-820, Jan. 2013.

I. E. Sutherland and R. F. Sproull, Logical Effort: Designing for Speed on the Back of an Envelop, Advanced Research in VLSI, pp. 1-16, 1991.

I. E. Sutherland, B. Sproull and D. Harris, Logical Effort: Designing Fast CMOS Circuits, Morgan Kaufmann publisher, Jan. 1999.


Refbacks

  • There are currently no refbacks.



Please send any question about this web site to info@praiseworthyprize.com
Copyright © 2005-2024 Praise Worthy Prize