I. Introduction
The QR-Decomposition algorithm is classified as a model-based (MB) method [1]. MB reconstruction algorithms allow a detailed mathematical description of the physical processes involved in tomographic systems [2], [3]. This advantage can reduce image artifacts and noise and leads toward dose reduction in CT. Model-based iterative reconstruction (MBIR) method is often considered as a general designation for all MB methods [4]. MBIR algorithms arise a large size optimization problem as well as a careful choice of an optimization function along with an iterative search of the solution in which each step involves two matrix vector products. The QR-Decomposition algorithm takes advantage of the benefits of the MB approach, but only requires a matrix vector product and backward substitution for the image reconstruction. It could be broadly labeled as a model-based direct reconstruction (MBDiR). QR decomposition process can be computed a priori and it is only necessary to compute them once.