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

Efficient implementation of linear system solution block using LDLT factorization

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

3 Author(s)
Hanjoon Cho ; Dept. of Electron. Eng. & Program of Integrated Biotechnol., Sogang Univ., Seoul ; Jinyong Lee ; Younglok Kim

Two implementation forms of linear system solution are described in this paper. Cholesky LLT decomposition require square roots, whereas LDLT decomposition can avoid taking square roots by one more forward-substitute computation. Through computational complexity and hardware size analysis, it is shown that matrix inversion using LDLT decomposition is faster than cholesky decomposition using square root function. Moreover the LDLT decomposition has better performance of 31.4% in hardware size.

Published in:

SoC Design Conference, 2008. ISOCC '08. International  (Volume:03 )

Date of Conference:

24-25 Nov. 2008

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.