A Less Complex Algorithmic Procedure for Computing Gray Codes

Afaq Ahmad, Department of Electrical and Computer Engineering, College of Engineering, Sultan Qaboos University, P.O. Box 33, Postal Code 123, Muscat, Sultanate of Oman
Mohammed M. Bait Suwailam, Department of Electrical and Computer Engineering, College of Engineering, Sultan Qaboos University, P.O. Box 33, Postal Code 123, Muscat, Sultanate of Oman

Abstract

The purpose of this paper is to present a new and faster algorithmic procedure for generating the n bi Gray codes. Thereby, through this paper we have presented the derivation, design and implementation of a newly developed algorithm for the generation of an n-bit binary reflected Gray code sequences. The developed algorithm is stemmed from the fact of generating and properly placing the min-terms from the universal set of all the possible min-terms [m0 m1 m2 …. mN] of Boolean function of n variables, where, 0 < N < 2n-1. The resulting algorithm is in concise form and trivial to implement. Furthermore, the developed algorithm is equipped with added attributes of optimizing of time and space while executed.

Recommended Citation

Ahmad, Afaq and Suwailam, Mohammed M. Bait (2009) "A Less Complex Algorithmic Procedure for Computing Gray Codes," The Journal of Engineering Research: Vol. 6: Iss. 2, Article 6.
DOI: https://doi.org/10.24200/tjer.vol6iss2pp12-19