Skip to content
Free planNo credit card requiredStart writing
AI for Research home
AI for Research home
Dashboard
Sign inGet started

Search 250 million research papers

Read the abstract, see who wrote it and who cites it, and get the citation in APA, MLA, Chicago or Harvard.

About 6,965 papers for “Gray code”

Binary Gray Code

Schreiber, Michael · Acervo Digital da Universidade Estadual Paulista (Universidade Estadual Paulista) · 2016

Números consecutivos podem diferir em muitos bits em uma representação binária de inteiros ordinário, no entanto, eles diferem por apenas um bit na representação binária do código Gray. A representação mostra várias gamas de números começando em 0, cujos bits são dados nas colunas, a contar da esquerda

Cited by 0

Binary Gray Code

Schreiber, Michael · Acervo Digital da Universidade Estadual Paulista (Universidade Estadual Paulista) · 2013

Números consecutivos podem diferir em muitos bits em uma representação binária de inteiros ordinário, no entanto, eles diferem por apenas um bit na representação binária do código Gray. A representação mostra várias gamas de números começando em 0, cujos bits são dados nas colunas, a contar da esquerda

Cited by 0

Code Gray (Workshop)

Winifred J. Pinch, R.N., Ed.D., Winifred J. Pinch, R.N., Ed.D. · DigitalGeorgetown (Georgetown University Library) · 2013

Cited by 0Open access

Binary Gray Code

Michael Schreiber · 2016

Numeros consecutivos podem diferir em muitos bits em uma representacao binaria de inteiros ordinario, no entanto, eles diferem por apenas um bit na representacao binaria do codigo Gray. A representacao mostra varias gamas de numeros comecando em 0, cujos bits sao dados nas colunas, a contar da esquerda

Cited by 0

Code Name Sara Gray

Luke Conrad Jackson (13080627) · Figshare · 2007

Code Name Sara Gray, the eagerly anticipated sequel to Sleeper, continues the story of 16-year-old Sara Gray, an unwilling secret agent.

Cited by 0Open access

Code Gray Response Team

Brizzee, Charlie A. · Scholar Works (Boise State University) · 2021

This video presentation addresses the declining feeling of safety by frontline clinical staff due to the recent escalation of combative patients and workplace violence in the healthcare setting, identified through Emotional intelligence and the approach created to address it. This project was crafted as an innovative and creative approach to addressing the issue in the clinical setting without adding additional staff or additional expense to the organization. Additionally, the approach had to be innovative and creative as the author does not own the current process, and knowing to receive stakeholder acceptance, the ownership had to remain with the current stakeholder. The creative approach is to utilize existing staff from ancillary departments and to provide enhanced specialized hybrid workplace violence and security hands-on training for the volunteers to the program to appropriately prepare them as a viable resolution. Additionally, the approach consists of current employees providing their involvement and willful participation in the solution, therefore empowering them.

Cited by 0

A Gray Code Counter

Arieh F. Fischmann · IEEE Transactions on Electronic Computers · 1957

Cited by 7

The Gray Code 1

Robert W. Doran · 2008

Abstract: Here we summarise the properties and algorithms of the Gray code. Descriptions are given of the Gray code definition, algorithms and circuits for generating the code and for conversion between binary and Gray code, for incrementing, counting, and adding Gray code words. Some interesting applications of the code are also treated. Java implementations of the algorithms in this paper are available at:

Cited by 0

Code Gray Case Studies

Jackie McDaniel · Critical Care Nursing Quarterly · 2003

Stroke in an inpatient poses many complex, and frequently very challenging, issues. Not only does the patient present with past medical history and various comorbidities, but also has been admitted to the hospital for some other diagnosis. In addition, any organized response to these stroke patients has been largely ignored by health care. As a result, the response to stroke-like symptoms may vary from facility to facility, and patient to patient. This article presents 5 case studies in the emergency response to inpatient stroke occurrences in one urban medical center. The histories, admitting diagnoses, signs and symptoms, as well as therapeutic interventions and outcome are reviewed.

Cited by 3

The Gray Code Function

Francis Clarke · 1992

Abstract The Gray code of a positive integer m can be defined in terms of its binary expansion as follows. Shift m to the right, discarding the last digit, and then add the result to m without carrying (an exclusive or). Thus if we write ® for the exclusive or operation and ÷ for integer division, so that m÷2 is the right shift of m, then the Gray code of m is g(m) = m ® (m÷2). For each k, the function g permutes the integers between 0 and 2 k – 1. It has the property that the binary expansions of g(m) and (g(m+1) always differ in precisely one digit. This is true cyclically, in the sense that it holds for g(2 k – 1) = 2 k-1 and g(0) = 0. This provides a Hamiltonian circuit on the k-dimensional cube and is the basis of the construction of the diagram in Figure 1.

Cited by 0

Abstract The Gray Code

R. W. Doran, R W Doran · 2007

This report is a self-contained summary of properties and algorithms concerning the Gray code. Descriptions are given of the Gray code definition, algorithms and circuits for generating the code and for conversion between binary and Gray code, for incrementing, counting, and adding Gray code words. Some interesting applications of the code are also treated. 1.

Cited by 0

A Gray Code Counter

M. Cohn, Shimon Even · IEEE Transactions on Computers · 1969

A Gray code counter which has an iterative and relatively simple structure is described. The code is shown to be the reflected binary Gray code, implying simple conversion of the count into binary code.

Cited by 13

Genetic code as a Gray code revisited

Dragan Bošnački, ten Hmm Huub Eikelder, Paj Peter Hilbers · TU/e Research Portal (Eindhoven University of Technology) · 2003

In this paper we revisit the idea of relating the genetic code to a Gray code. This idea was originally fostered by Rosemary Swanson as a “unifying concept for the amino acid code”. We show that cyclic arrangements of the codons which are different from the one proposed by Swanson, but which are still based on the principle of minimal change, yield a better grouping of the amino acids by similarity. To this end we model the problem of finding generalized Gray codes (codon arrangements) as a Traveling Salesman Problem. Solutions of this problem lead to several Gray code arrangements of the codons. We discuss the possible implications of the results from evolutionary and physico-chemical point of views.

Cited by 12

Interval arithmetic using gray code

Takashi Hisakado, Márcia Orie de Sousa Hamada, A. Yonemoto et al. · 2004

The Gray code arithmetic is characterized by the bit serial arithmetic from the most significant bit and the uniqueness of the representation. This paper describes that the properties of the Gray code are very effective for interval arithmetics. First, we represent the interval using the Gray code and propose an effective representation of the Gray code interval. Next, we show an algorithm for the derivation of the representation. Last, we suggest that the computational cost of the Gray code interval is decreased by the proposed representation.

Cited by 2

Moore Test Using Gray Code

Takashi Hisakado, K. Okumura · 2005

The Moore test is a powerful tool for finding all solutions of nonlinear equations. However, this algorithm requires tremendously many interval computations and iterative bisections of regions. This paper describes that Gray code is an effective code for the Moore test. Using the property of the MSB (most significant bit) first algorithm of the Gray code arithmetic, we can perform the Moore test with the least required accuracy, i.e., the least computational cost. Further, we point out that the region bisection corresponds to the MSB first computation by the Gray code arithmetic. Using this fact, we show that the computational results before the bisection are reused for the bisected regions and that the computational cost is considerably reduced.

Cited by 1