By Topic

Stability of recursive QRD-LS algorithms using finite-precision systolic array implementation

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Leung, H. ; Commun. Res. Lab., McMaster Univ., Hamilton, Ont., Canada ; Haykin, S.

A proof of the stability (in the sense of bounded input/bounded output) of the recursive QRD-LS algorithm using finite-precision systolic array implementation is presented. Two popular systolic array structures are considered. A similar proof can be extended to other systolic implementations. The first structure discussed is due to W.M. Gentleman and H.T. Kung (1981), and the second one is due to J.G. McWhirter (1983).<>

Published in:

Acoustics, Speech and Signal Processing, IEEE Transactions on  (Volume:37 ,  Issue: 5 )