Fast algorithm for obtaining low-order coprime fractional representations of SISO systems

Control system design and analysis based on the factorization approach requires one to compute the plant coprime factors and the solution to the Bezout identity. The available algorithms for computation of the solution to the Bezout identity usually result in high-order coprime pairs. We present an algorithm which identifies low-order coprime pairs that are solution to the Bezout identify. The algorithm is computationally fast.