A Nonconventional Approach to Generating Efficient Binary Gray Code Sequences

Ahmad, Afaq; Bait-Shiginah, Fahad

doi:10.1109/mpot.2011.2178193

Cited by 9 publications

(7 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…In previous research works [19] - [21], algorithmic ways have been devised to generate efficiently the Gray code for large orders, special Gray codes and their properties. The theorem below relates the minterms and Gray code and provide extensive help in constructing the Kmaps for large number of input variables n. By using this procedure samples of K-maps for n = 6 and n = 8 are shown in Figures 1 and Figure 2 respectively.…”

Section: Preliminaries Of Our Approachmentioning

confidence: 99%

See 1 more Smart Citation

Determining the possible minimal Boolean expressions via a newly developed procedure and tool

Ahmad

Ruelens²,

Ahmad

et al. 2015

2015 6th International Conference on Computing, Communication and Networking Technologies (ICCCNT)

Self Cite

View full text Add to dashboard Cite

This paper proposes a new idea and implementation tool for two level minimization of Boolean expressions. A simpler and more versatile method is developed by exploiting the adjacency field relationships between Gray code and decimal numbers. Our algorithmic procedures also consider the optimal use of don't care terms. We implemented our algorithm in MATLAB and tested accuracy and efficiency for large values of input variables (more than 25). This developed novel technique is bound to provide all possible optimally minimized Boolean expressions.

show abstract

Section: Preliminaries Of Our Approachmentioning

confidence: 99%

“…In our work [19] we developed an algorithmic procedures for relating the decimal and Gray coded numbers in terms of their field locations. How these locations are appearing when we differentiate between the Gray coded locations and decimal locations.…”

Section: Theoremmentioning

confidence: 99%

Determining the possible minimal Boolean expressions via a newly developed procedure and tool

Ahmad

Ruelens²,

Ahmad

et al. 2015

2015 6th International Conference on Computing, Communication and Networking Technologies (ICCCNT)

Self Cite

View full text Add to dashboard Cite

show abstract

“…Gray code arithmetic has been reported to be efficient in its application in the area following areas in the literature; straight and rotational shaft position encoding systems, puzzle challenges solver, error corrections, genetic algorithms, protection of digital circuit designs, image processing, image stabilization, video processing, and scrambling [1], [3], [13]- [20]. Although the use of the Gray code number system can be applied in so many areas, its unweighted nature has made it is so unsuitable for arithmetic operations [21]- [23].…”

Section: Introductionmentioning

confidence: 99%

Performance analysis of gray code number system in image security

Babatunde

Jimoh

Oshodi

et al. 2019

Jurnal Teknologi dan Sistem Komputer

View full text Add to dashboard Cite

The encryption of digital images has become essential since it is vulnerable to interception while being transmitted or stored. A new image encryption algorithm to address the security challenges of traditional image encryption algorithms is presented in this research. The proposed scheme transforms the pixel information of an original image by taking into consideration the pixel location such that two neighboring pixels are processed via two separate algorithms. The proposed scheme utilized the Gray code number system. The experimental results and comparison shows the encrypted images were different from the original images. Also, pixel histogram revealed that the distribution of the plain images and their decrypted images have the same pixel histogram distributions, which means that there is a high correlation between the original images and decrypted images. The scheme also offers strong resistance to statistical attacks.

show abstract

“…Moreover, a new and faster algorithmic procedure for generating the n-bit Gray codes has been presented in 18 . Further, more efficient algorithmic procedures for computing n-bit GCs have been developed and presented through research publications 19,20 . Thereby, through this paper they have presented the derivation, design and implementation of a newly developed algorithm for the generation of the n-bit binary reflected GC sequences.…”

Section: Introductionmentioning

confidence: 99%