Lines Matching refs:outer
2620 digits as output. In each iteration of the outer loop the $pb$ variable is set (line 49) to the maximum
2778 The outer loop of this algorithm is more complicated than that of the baseline multiplier. This is because on the inside of the
2808 As per the pseudo--code we first calculate $pa$ (line 48) as the number of digits to output. Next we begin the outer loop
2813 implementation was ``row--major'' which means it adds to each of the columns in each pass. After the outer loop it would then fix
2821 a carry for the next pass. After the outer loop we use the final carry (line 77) as the last digit of the product.
3299 The outer loop of this algorithm begins on step 4. It is best to think of the outer loop as walking down the rows of the partial results, while
3317 Inside the outer loop (line 34) the square term is calculated on line 37. The carry (line 44) has been
4107 Step 5 is the main reduction loop of the algorithm. The value of $\mu$ is calculated once per iteration in the outer loop. The inner loop
4111 Using a quick inspection this algorithm requires $n$ single precision multiplications for the outer loop and $n^2$ single precision multiplications
4123 routine can be used instead. Line 47 computes the value of $\mu$ for that particular iteration of the outer loop.
4135 The biggest obstacle is that at the $ix$'th iteration of the outer loop the value of $x_{ix}$ is required to calculate $\mu$. This means the
4137 Perform a Comba like multiplier and inside the outer loop just after the inner loop fix up the $ix + 1$'th digit by forwarding the carry.
4200 4.3 will do. In effect over the $n.used$ iterations of the outer loop the $n.used$'th lower columns all have the their carries propagated forwards. Note