### Table 1. Comparison of computational complexity (bit operations)

1988

"... In PAGE 8: ... Therefore, the complexity of decryption is O(n3). Table1 shows the comparison of computational complexity. Table 1.... ..."

Cited by 12

### Table 1. Integer register instructions, 32-bit operations and 64-bit operations.

2005

Cited by 2

### TABLE 16. Operations used in VHDL to simulate bit operations Type of Bit Manipulation Type of Operation

### Table 2. Integer register instructions, 32-bit operations.

2005

Cited by 2

### Table 1: Interpretation by the bit operation of exclusive-OR

### Table 2: Bit rates operating modes

"... In PAGE 4: ...Table2 indicates how different rate encoders (10- 24 kbps) are obtained by modifying the total number of bits used to represent the fixed codevector indices and by changing their update rate. For low bit rate coders, where the codevector indices and gains are updated only once a frame, the update takes place for the second sub-frame.... ..."

### Table 2: Bit rates operating modes

"... In PAGE 4: ...Table2 indicates how different rate encoders (10- 24 kbps) are obtained by modifying the total number of bits used to represent the fixed codevector indices and by changing their update rate. For low bit rate coders, where the codevector indices and gains are updated only once a frame, the update takes place for the second sub-frame.... ..."

### Table 1. Response table of the bit merging operator.

Cited by 1

### Table I. Number of bit vectors operated upon.

Cited by 1