ملخص
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.
اللغة الأصلية | English |
---|---|
الصفحات (من إلى) | 12-19 |
عدد الصفحات | 8 |
دورية | Journal of Engineering Research |
مستوى الصوت | 6 |
رقم الإصدار | 2 |
المعرِّفات الرقمية للأشياء | |
حالة النشر | Published - 2009 |
ASJC Scopus subject areas
- ???subjectarea.asjc.2200.2200???