“…To facilitate the algorithm development, we express (1) in matrix form as (3) where , , and with , , and . From the regular structure of , it is straightforward to see that the noise-free data matrix can be represented as (4) where (5) and (6) are complex vectors which are characterized by and , and and , respectively. It is also observed that the elements in and satisfy the LP property: (7) and (8) where (9) and (10) On the other hand, can be decomposed using SVD as (11) where is the diagonal matrix of singular values of with while and are orthonormal matrices whose columns are the corresponding left and right singular vectors, respectively.…”