Finite precision arithmetic and the split Schur algorithms

The split Schur algorithms of P. Delsarte and Y. Genin (1987) represent methods of computing reflection coefficients that are computationally more efficient, in terms of multiplications, than the conventional Schur algorithm by a constant factor. The authors investigate the use of fixed-point binary arithmetic, with quantization due to rounding, in the implementation of the symmetric and antisymmetric split Schur algorithms. It is shown, through a combination of analysis and simulation, that the errors in the reflection coefficient estimates due to quantization are large when the input signal is either a narrowband high-pass signal or a narrowband low-pass signal.<
>