An improved Cholesky decomposition method based on DSP implement in joint Detection
Dan Wang
Abstract
Dan Wang
Abstract
In this paper,a new method-Cholesky decomposition to R matrix is adopted,and then the recursion expression ameliorated according to the attributes of fixed DSP. Afterwards this new Cholesky decomposition method is compared with the traditional one. Simulation indicates the ameliorated Cholesky decomposition method features high data accuracy and feasibility.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this paper,a new method-Cholesky decomposition to R matrix is adopted,and then the recursion expression ameliorated according to the attributes of fixed DSP. Afterwards this new Cholesky decomposition method is compared with the traditional one. Simulation indicates the ameliorated Cholesky decomposition method features high data accuracy and feasibility.
Key concepts: Cholesky decomposition, Minimum degree algorithm, Computer science, Decomposition, Incomplete Cholesky factorization, Recursion (computer science), Digital signal processing, Algorithm