A less complex algorithmic procedure for computing gray codes

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

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
Volume6
Issue number2
Publication statusPublished - 2009

Fingerprint

Boolean functions

Keywords

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

ASJC Scopus subject areas

  • Engineering(all)

Cite this

A less complex algorithmic procedure for computing gray codes. / Ahmad, Afaq; Suwailam, Mohammed M Bait.

In: Journal of Engineering Research, Vol. 6, No. 2, 2009, p. 12-19.

Research output: Contribution to journalArticle

@article{84b9f9492ac74e43b22e3f552d4e20b6,
title = "A less complex algorithmic procedure for computing gray codes",
abstract = "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.",
keywords = "Algorithm, Binary, Boolean function, Gray code, Memory space, Min-terms, Processing time",
author = "Afaq Ahmad and Suwailam, {Mohammed M Bait}",
year = "2009",
language = "English",
volume = "6",
pages = "12--19",
journal = "Journal of Engineering Research",
issn = "1726-6009",
publisher = "Sultan Qaboos University",
number = "2",

}

TY - JOUR

T1 - A less complex algorithmic procedure for computing gray codes

AU - Ahmad, Afaq

AU - Suwailam, Mohammed M Bait

PY - 2009

Y1 - 2009

N2 - 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.

AB - 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.

KW - Algorithm

KW - Binary

KW - Boolean function

KW - Gray code

KW - Memory space

KW - Min-terms

KW - Processing time

UR - http://www.scopus.com/inward/record.url?scp=77957819295&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=77957819295&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:77957819295

VL - 6

SP - 12

EP - 19

JO - Journal of Engineering Research

JF - Journal of Engineering Research

SN - 1726-6009

IS - 2

ER -