A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit <a rel="external noopener" href="https://ren-fengbo.lab.asu.edu/sites/default/files/14_esl_a_square-root-free_matrix_decomposition_method_for_energy-efficient_least_square_computation_on_embedded_systems.pdf">the original URL</a>. The file type is <code>application/pdf</code>.
<i title="Institute of Electrical and Electronics Engineers (IEEE)">
<a target="_blank" rel="noopener" href="https://fatcat.wiki/container/fcpafl32h5cn5cfpmldtiodhge" style="color: black;">IEEE Embedded Systems Letters</a>
QR decomposition (QRD) is used to solve leastsquares (LS) problems for a wide range of applications. However, traditional QR decomposition methods, such as Gram-Schmidt (GS), require high computational complexity and nonlinear operations to achieve high throughput, limiting their usage on resource-limited platforms. To enable efficient LS computation on embedded systems for real-time applications, this paper presents an alternative decomposition method, called QDRD, which relaxes system<span class="external-identifiers"> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/les.2014.2350997">doi:10.1109/les.2014.2350997</a> <a target="_blank" rel="external noopener" href="https://fatcat.wiki/release/gqirkfu7xrftvcn6v5yp6exrni">fatcat:gqirkfu7xrftvcn6v5yp6exrni</a> </span>
more »... ents while maintaining the same level of performance. Specifically, QDRD eliminates both the square-root operations in the normalization step and the divisions in the subsequent backward substitution. Simulation results show that the accuracy and reliability of factorization matrices can be significantly improved by QDRD, especially when executed on precision-limited platforms. Furthermore, benchmarking results on an embedded platform show that QDRD provides constantly better energy-efficiency and higher throughput than GS-QRD in solving LS problems. Up to 4 and 6.5 times improvement in energy-efficiency and throughput, respectively, can be achieved for small-size problems.
<a target="_blank" rel="noopener" href="https://web.archive.org/web/20170705091834/https://ren-fengbo.lab.asu.edu/sites/default/files/14_esl_a_square-root-free_matrix_decomposition_method_for_energy-efficient_least_square_computation_on_embedded_systems.pdf" title="fulltext PDF download" data-goatcounter-click="serp-fulltext" data-goatcounter-title="serp-fulltext"> <button class="ui simple right pointing dropdown compact black labeled icon button serp-button"> <i class="icon ia-icon"></i> Web Archive [PDF] <div class="menu fulltext-thumbnail"> <img src="https://blobs.fatcat.wiki/thumbnail/pdf/57/d1/57d12552b3a917ab7335ca9d64625d4998be7e2b.180px.jpg" alt="fulltext thumbnail" loading="lazy"> </div> </button> </a> <a target="_blank" rel="external noopener noreferrer" href="https://doi.org/10.1109/les.2014.2350997"> <button class="ui left aligned compact blue labeled icon button serp-button"> <i class="external alternate icon"></i> ieee.com </button> </a>