DYNAMIC-RANGE, STABILITY, AND FAULT-TOLERANT CAPABILITY OF FINITE-PRECISION RLS SYSTOLIC ARRAY BASED ON GIVENS ROTATIONS

Abstract

The QRD RLS algorithm is generally recognized as having good numerical properties under a finite-precision implementation. Furthermore, it is quite suited for VLSI implementation since it can be easily mapped onto a systolic array. However, it is still unclear how to obtain the dynamic range of the algorithm in order a wordlength can be chosen to ensure correct operations of the algorithm. In this paper, we first propose a quasi-steady state model by observing the rotation parameters generated by boundary cells will eventually reach quasi-steady-state regardless of the input data statistics if lambda is close to one. With this model, we can obtain upper bounds of the dynamic range of processing cells. Thus the wordlength can be obtained from upper bounds of the dynamic range to prevent overflow and to ensure correct operations of the QRD RLS algorithm. Then we reconsider the stability problem under quantization effects with a more general analysis and obtain tighter bounds than given in a previous work [13]. Finally, two fault-tolerant problems, the missing error detection and the false alarm effect, that arise under finite-precision implementation are considered. Detailed analysis on preventing missing error detection with a false alarm free condition is presented.