Digital Arithmetic

620 c H APT E R 11 CORDIC Algorithm and Implementations

Scaling iterations

(1)(+2)(-5)(+10)(+16)(+19)(+22)

,,

Scalings

+ repetitions

(--2)(+16)(+17)

1,3,5,6

TABLE 11.3

Scale-factor compensation for n = 24.

scaling factor. The problem consists then in finding the minimum number

of scaling iterations plus repetitions so that the scale factor is compensated.

For instance, for n = 24, Table 11.3 shows a set of scaling iterations and of

scaling plus repetitions.

Although for the n = 24 case there is no difference in the number of

iterations among both methods, in some cases (for instance, in the use of

redundant adders as described later) ...