FINITE WORDLENGTH ANALYZING FOR RLS SYSTOLIC ALGORITHM BASED ON THE SQUARE-ROOT-FREE SCALED GIVENS ROTATIONS  

作　　者：Xiong Jun Liao Guisheng Wu Shunjun(Key Laboratory of Radar Signal Processing, Xidian University, Xj’an 710071) 

出　　处：《Journal of Electronics(China)》1997年第4期367-373,共7页电子科学学刊（英文版）

摘　　要：The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. We analyze upper bounds of the dynamic range of processing cells and the internal parameters. Thus the wordlength can be obtained to prevent overflow and to ensure correct operations. Simulation results confirm the theoretical conclusions and the stability of the algorithm.The least squares(LS) minimization problem constitutes the core of many real-time signal processing problems. A square-root-free scaled Givens rotations algorithm and its systolic architecture for the optimal RLS residual evaluation are presented in this paper. We analyze upper bounds of the dynamic range of processing cells and the internal parameters. Thus the wordlength can be obtained to prevent overflow and to ensure correct operations. Simulation results confirm the theoretical conclusions and the stability of the algorithm.

关 键 词：Linear least SQUARES MINIMIZATION problem Adaptive signal processing SYSTOLIC array 

分 类 号：TN911[电子电信—通信与信息系统]