1,722,119 research outputs found
LANG (T.)
No full textDubois Patrick. LANG (T.). In: , . Le dictionnaire de pédagogie et d'instruction primaire de Ferdinand Buisson : répertoire biographique des auteurs. Paris : Institut national de recherche pédagogique, 2002. p. 92. (Bibliothèque de l'Histoire de l'Education, 17
LANG (T.)
No full textDubois Patrick. LANG (T.). In: Le dictionnaire de pédagogie et d'instruction primaire de Ferdinand Buisson : répertoire biographique des auteurs. Paris : Institut national de recherche pédagogique, 2002. p. 92. (Bibliothèque de l'Histoire de l'Education, 17
Boosting Very High Radix Division with Prescaling and Selection by Rounding
No full textAn extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists of increasing the effective radix of the implementation by obtaining a few additional bits of the quotient per iteration, without increasing the complexity of the unit to obtain the prescaling factor or the delay of an iteration. As a consequence, for some values of the effective radix, it permits an implementation with a smaller area and the same execution time of the original scheme. Details of the algorithm and the implementation are presented. Estimations of the execution time and area are given for 54 bit and 114 bit quotients and compared with those of other division unit
Very High Radix Square Root with Prescaling and Rounding and a Combined Division/Square Root Unit
No full textAn algorithm for square root with prescaling and selection by rounding is developed and combined with a similar scheme for division. Since division is usually more frequent than square root, the main concern of the combined implementation is to maintain the low execution time of division, while accepting a somewhat larger execution time for square root. The algorithm is presented in detail, including the mathematical development of bounds for the first square-root digit and for the scaling factor. The proposed implementation is described, evaluated and compared with other combined div/sqrt units. The comparisons show that the proposed scheme potentially produces a significant speed-up for division, whereas, for square root, the speed-up is smal
Boosting Very High Radix Division with Prescaling and Selection by Rounding
No full textAn extension of the very-high radix division with prescaling and selection by rounding is presented. This extension consists in increasing the effective radix of the implementation by obtaining a few additional bits of the quotient per iteration, without increasing the complexity of the unit to obtain the prescaling factor nor the delay of an iteration. As a consequence, for some values of the effective radix, it permits an implementation with a smaller area and the same execution time than the original scheme. Estimations are given for 54-bit and 114-bit quotients
Higher Radix Square Root with Prescaling
No full textA scheme for performing higher radix square root based on prescaling of the radicand is presented to reduce the complexity of the result-digit selection. The scheme requires several steps, namely multiplication for prescaling the radicand, square root, multiplication for prescaling for the division, and division. Online algorithms are used to reduce the overall time and pipelining to reuse the different modules. An estimate of the execution time for a radix-256 unit for double-precision square root and a comparison with other implementations indicate that the proposed approach is an alternative to consider when designing a square-root uni
Very High Radix Combined Division and Square Root with Prescaling and Selection by Rounding
No full textAn algorithm for square root with prescaling is developed and combined with a similar scheme for division. An implementation is described, evaluated and compared with other combined div/sqrt implementation
Very-High Radix Division with Prescaling and Selection by Rounding
No full textA division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated and several convenient values of the radix are selected. Comparison with other dividers for radices 2^9 to 2^18 is performed using the same assumption
On the Implementation of a Parallel Algorithm for Higher Radix Division
No full textA general approach is outlined for designing units for higher radix division, which are based on two subunits operating in parallel. A lower radix division unit is used as the building block of the architecture, and the division step is split into two phases which are carried out in parallel. It is shown that the proposed architecture permits the design of units for higher radix division with digit selection tables requiring few supplementary input bits compared to the tables used by lower radix division system
Very High Radix Division with Selection by Rounding and Prescaling
No full textA division algorithm in which the quotient-digit selection is performed by rounding the shifted residual in carry-save form is presented. To allow the use of this simple function, the divisor (and dividend) is prescaled to a range close to one. The implementation presented results in a fast iteration because of the use of carry-save forms and suitable recodings. The execution time is calculated, and several convenient values of the radix are selected. Comparison with other high-radix dividers is performed using the same assumption
- …
