## A Systematic Design Procedure For Asynchronous Counters Using El Naga's Transitions Technique

Conference

2001 Annual Conference

Location

Albuquerque, New Mexico

Publication Date

June 24, 2001

Start Date

June 24, 2001

End Date

June 27, 2001

ISSN

2153-5965

Page Count

10

Page Numbers

6.114.1 - 6.114.10

DOI

10.18260/1-2--9839

Permanent URL

https://peer.asee.org/9839

3486

#### Abstract NOTE: The first page of text has been automatically extracted and included below in lieu of an abstract

Session # 2793 Multimedia

A Systematic Design Procedure for Asynchronous Counters Using El Naga’s Transitions Technique

Nagi M. El Naga, Halima M. El Naga California State University, California State Polytechnic University, Northridge Pomona

Abstract

Although asynchronous counters have been discussed in almost every logical circuits design textbook, they all failed to provide the readers with a systematic design procedure. This is due to the fact that the conventional method of designing sequential circuits lacks the means to provide such procedure. In this paper, a systematic procedure for designing asynchronous counters based on the use of El Naga’s Transitions technique is presented. This technique is based on the use of the four transitions: α, the transition from 0 to 1, β, the transition from 1 to 0, I, the transition from 1 to 1, and ϕ, the transition from 0 to 0. This technique also provides the designer of logical sequential circuits with various testing algorithms that check the correctness of almost every step in the design procedure. If the provided testing algorithms are followed after each step of the design, the final design will be almost error free.

The design techniques presented in this paper make the process of designing asynchronous counters much simpler and, more importantly, make the process of teaching them much easier.

I. Introduction

In this section, the four transitions used in El Naga’s Transitions technique [1] are first presented. Then, the excitation equation of each data input of each type of flip-flop is driven in terms of these four transitions.

During the transition from one state to another, a flip-flop can go through one of four possible transitions, which are defined as:

1. α, the transition from 0 to 1, 2. β, the transition from 1 to 0, 3. I, the transition from 1 to 1, and 4. ϕ, the transition from 0 to 0.

The transition methodology is based on the use of these four transitions. For a particular data input of a specific type of flip-flop, any of the above transitions could be either an

El Naga, N., & El Naga, H. M. (2001, June), A Systematic Design Procedure For Asynchronous Counters Using El Naga's Transitions Technique Paper presented at 2001 Annual Conference, Albuquerque, New Mexico. 10.18260/1-2--9839

ASEE holds the copyright on this document. It may be read by the public free of charge. Authors may archive their work on personal websites or in institutional repositories with the following citation: © 2001 American Society for Engineering Education. Other scholars may excerpt or quote from these materials with the same citation. When excerpting or quoting from Conference Proceedings, authors should, in addition to noting the ASEE copyright, list all the original authors and their institutions and name the host city of the conference. - Last updated April 1, 2015