Cart (Loading....) | Create Account
Close category search window

Diagonally loaded SMI algorithm based on inverse matrix recursion

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 $31
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)
Jianshu, Cao ; Coll. of Electronic Engineering, Univ. of Electronic Science and Technology, Chengdu 610054, P. R. China ; Xuegang, Wang

The derivation of a diagonally loaded sample-matrix inversion (LSMI) algorithm on the busis of inverse matrix recursion (i.e. LSMI-IMR algorithm) is conducted by reconstructing the recursive formulation of covariance matrix. For the new algorithm, diagonal loading is by setting initial inverse matrix without any addition of computation. In addition, a corresponding improved recursive algorithm is presented, which is low computational complexity. This eliminates the complex multiplications of the scalar coefficient and updating matrix, resulting in significant computational savings. Simulations show that the LSMI-IMR algorithm is valid.

Published in:

Systems Engineering and Electronics, Journal of  (Volume:18 ,  Issue: 1 )

Date of Publication:

March 2007

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.