A less complex algorithmic procedure for computing gray codes

Afaq Ahmad*, Mohammed M.Bait Suwailam

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)


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.

Original languageEnglish
Pages (from-to)12-19
Number of pages8
JournalJournal of Engineering Research
Issue number2
Publication statusPublished - 2009


  • Algorithm
  • Binary
  • Boolean function
  • Gray code
  • Memory space
  • Min-terms
  • Processing time

ASJC Scopus subject areas

  • General Engineering


Dive into the research topics of 'A less complex algorithmic procedure for computing gray codes'. Together they form a unique fingerprint.

Cite this