A simple algorithm on minimal balanced realization for transfer function matrices

Given a transfer function matrix, it is shown that its minimal balanced realization can be obtained directly from the singular values and the singular vectors of a constant matrix constructed from the coefficients of the least common denominator polynomial. The algorithm is based on the close relationship of controllability and the observability gramians to the singular value decomposition of the associated infinite block Hankel matrix.<>