circular shift


Also found in: Wikipedia.

circular shift

[′sər·kyə·lər ′shift]
(computer science)
Mentioned in ?
References in periodicals archive ?
bitwise AND, bitwise XOR and circular shift operation.
The key expansion module involves the bitwise AND, bitwise XOR, and circular shift operation.
Shift registers are use to do the circular shift operation
Then R is a circular shift of L but now this is not a general feature of non-trivial r-colorings on standard diagrams of THK (3,n)'s (see, for instance, the 5-coloring of THK(3,2) on the right-hand side of Figure 4, or the 7-coloring of THK(3, 8) in Figure 6).
For prime r > 5 and odd [psi](r), we construct a non-trivial r-coloring on the standard diagram of THK(3, [psi](r)) such that the R sequence is a circular shift of the L sequence (Theorem 1.
0[less than or equal to]n[less than or equal to][psi](p)], is a circular shift of the L sequence i.
1]) = (0, - b) in order to obtain the equality between the R and L sequences, modulo circular shift.
The new circular shifts the emphasis to a physical branch.