A further simplification to Jury's stability test

Consideration is given to R.H. Raible's table (1974), which is a simplified version of E.I. Jury's discrete stability test. It is explicitly shown that Raible's table is none other than the classical Schur algorithm performed on a certain scattering function. This directly leads to an interpretation of Raible's table as a continued fraction expansion. The connection between Raible's table and the fast triangular factorization of the Schur-Cohn matrix is given.<
>