address computation

address computation

[′ad·res ‚käm·pyə′tā·shən]
(computer science)
The modification by a computer of an address within an instruction, or of an instruction based on results obtained so far. Also known as address modification.
Mentioned in ?
References in periodicals archive ?
There are two approaches to this computation for discrete images: forward and reverse address computation.
y] are each greater than unity, the address computation of Eq.
Rotation: Rotation of an input image about its Cartesian (21) origin can be accomplished by the address computation
A more elegant approach is to formulate the address computation as a vector-space manipulation.
These requirements make the died address computation efficient with a minor expense of resources.
The additional system performance cost of tiled address computation is presumed acceptable in light of the reduced i/o.
The first implementations of tiling by McKellar [7] buried the additional address computations in the matrix arithmetic algorithms(3) being studied.
For the non-tiled versions, macros are provided that perform non-tiled address computations.
Returning to the general case, the address computation can be implemented in several ways.
Given the address computation algorithm, retrieval and insertion of an element is straightforward.
The address computation of spiral storage is illustrated in Figure 5.
Their use is explained in connection with the address computation algorithm.