A less complex algorithmic procedure for computing gray codes

Abstract EN

The purpose of this paper is to present a new and faster algorithmic procedure for generating the n bit 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.