We present the FPGA implementation of an extension of the binary plus–minus systolic algorithm which computes the GCD (greatest common divisor) and also the normal form of a rational number, without using division. A sample array for 8 bit operands consumes 83.4% of an Atmel 40K10 chip and operates at 25 MHz.

In this article, we prove the existence and uniqueness of a certain distribution function on the unit interval. This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a function has been conjectured by Richard Brent in his original paper [1]. Donald Knuth also supposes its existence in [5] where developments of its properties...

BACKGROUND Mutation of the human transforming growth factor beta-induced (TGFBI) gene causes granular corneal dystrophy (GCD) in various ethnic groups. In this report, we identify the genetic defect on the TGFBI gene in a Vietnamese family with atypical GCD . CASES The patient and her relatives were examined clinically. Genomic DNA was extracted from blood leukocytes. Fifty normal Vietnamese ...

We investigate weighted gcd-sum functions, including the alternating gcd-sum function and those having as weights the binomial coefficients and values of the Gamma function. We also consider the alternating lcm-sum function.

We describe algorithms for computing the greatest common divisor (GCD) of two univariate polynomials with inexactly-known coeecients. Assuming that an estimate for the GCD degree is available (e.g., using an SVD-based algorithm), we formulate and solve a nonlinear optimization problem in order to determine the coeecients of the \best" GCD. We discuss various issues related to the implementation...

BACKGROUND Goblet cell hyperplasia is a classic but variable pathologic finding in COPD. Current literature shows that smoking is a risk factor for chronic bronchitis but the relationship of these clinical features to the presence and magnitude of large airway goblet cell hyperplasia has not been well described. We hypothesized that current smokers and chronic bronchitics would have more goblet...

An interesting problem of algebraic computation is the computation of the greatest common divisor (GCD) of a set of polynomials. The GCD is usually linked with the characterisation of zeros of a polynomial matrix description of a system. The problem of finding the GCD of a set of n polynomials on R[x] of a maximal degree q is a classical problem that has been considered before (Karcanias et al....

In this article, we prove the existence and uniqueness of a certain distribution function on the unit interval. This distribution appears in Brent's model of the analysis of the binary gcd algorithm. The existence and uniqueness of such a function has been conjectured by Richard Brent in his original paper [1]. Donald Knuth also supposes its existence in [4] where developments of its properties...

1 SMP-based parallel algorithms and implementations for polynomial factoring and GCD are overviewed. Topics include polynomial factoring modulo small primes, univariate and multivariate p-adic lifting, and reformulation of lift basis. Sparse polynomial GCD is also covered.