operand

(redirected from Operands)
Also found in: Dictionary, Thesaurus.

operand

a quantity or function upon which a mathematical or logical operation is performed

operand

[′äp·ə‚rand]
(computer science)
Any one of the quantities entering into or arising from an operation.

operand

(programming)
An argument of an operator or of a machine language instruction.

operand

The part of a machine instruction that references data or a peripheral device. In the instruction, ADD A to B, A and B are the operands (nouns), and ADD is the operation code (verb). In the instruction READ TRACK 9, SECTOR 32, track and sector are the operands.
References in periodicals archive ?
This is called extended mode and it can be handled by preventing the clock signal of the registers storing the adder's operands.
In [8] and [9] it is reported that (6, 3) counter arrays give best performance result for the reduction of partial products and multi-operand addition input operand reduction, whenever 6-input LUT structures are implemented.
9] is the synchronization point and the source operands of [i.
Enqueue(o); } else { // token is an operand double operand = 0, val; if ((val = esteConstanta(token[i])) > 0) operand = val; // is a constant else try { operand = Convert.
PSE has been found in numerous studies (see Ashcraft, 1992; Ashcraft & Guillaume, 2009; and Zbrodoff & Logan, 2005, for various revisions), and refers to the fact that reaction times to simple arithmetic problems are, in general, slower and more error prone if the operands and their correct solutions become numerically larger.
In a study with expert arithmetical solvers, Fayol and Thevenot (2012) found that presenting the arithmetical sign before the operands (e.
Generic operands can be generated on the low level with gate-level ATPG for the full combinational logic used for all instructions.
Nachtigal, M, Thapliyal, H, Ranganathan, N: Design of a reversible single precision floating point multiplier based on operand decomposition.
The two operands, A and B, XORed, and the output of this XOR XORed again with bit carried in from the next less significant stage to produce the SUM bit.
This makes it possible to convert the operands to Montgomery residues once at the beginning, and then, do several consecutive multiplications/squarings, and convert the final result to the original representation.
3,x,y] # operand were considered to be correct if any of the two possible operands came up as the item most similar to those subquestions.
In some environments (including most settings of CASs), the operands of the selected operation are chosen by the program.