## An Efficient Methodology To Design Multi Branch Sequencers Using El Naga's Transitions Technique

Conference

2003 Annual Conference

Location

Nashville, Tennessee

Publication Date

June 22, 2003

Start Date

June 22, 2003

End Date

June 25, 2003

ISSN

2153-5965

Conference Session

ECE Education and Engineering Mathematics

Page Count

12

Page Numbers

8.187.1 - 8.187.12

DOI

10.18260/1-2--11768

Permanent URL

https://peer.asee.org/11768

198

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

Session #3632

An Efficient Methodology to Design Multi-branch Sequencers Using El Naga's Transitions Technique

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

Abstract

Designing a multi-branch sequencer using the conventional method of designing sequential circuits is a very long process that might take few hours and it does not provide a mean for the designer to check the correctness of his/her design until the implementation phase. Using the conventional method, it is very hard for teachers to present this subject and very hard for the students to understand it. In this paper, an efficient procedure to design these type of sequencers 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 procedure cuts the design time by more than 80%. 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 almost be error free. The innovated design technique that is presented in this paper makes the process of designing, teaching and understanding multi- branch sequencers much simpler.

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 derive n in terms of these four transitions [2].

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 essential transition, don’t care transition, or a zero transition. These are explained in the following:

El Naga, N., & El Naga, H. (2003, June), An Efficient Methodology To Design Multi Branch Sequencers Using El Naga's Transitions Technique Paper presented at 2003 Annual Conference, Nashville, Tennessee. 10.18260/1-2--11768

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: © 2003 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