查看文章

Principal component (PC) algorithm has recently been shown as a very accurate blind detection technique in comparison with other covariance-based detection algorithms. However, it also has a higher complexity owing to the computation of the eigenvectors. We propose a low-complexity Lanczos principal component (LPC) algorithm that utilizes Lanczos iterative method to compute the eigenvectors. In comparison with the PC algorithm, the proposed LPC algorithm offers significant reduction in complexity while giving a similar detection performance. Low-complexity LPC algorithm allows for the use of larger sized covariance matrix that further improves the detection performance. Maximum-minimum eigenvalue (MME) algorithm is also included in the comparison and it gives an inferior performance as compared to both PC and LPC algorithm. All the algorithms were tested with experimental data while …