DocumentCode
1400440
Title
A Low Complexity Iterative Algorithm for Joint Zero Diagonalization
Author
Zhang, Wei-Tao ; Lou, Shun-Tian
Author_Institution
Sch. of Electron. Eng., Xidian Univ., Xi´´an, China
Volume
19
Issue
2
fYear
2012
Firstpage
115
Lastpage
118
Abstract
In this letter, we introduce a fast and computationally efficient iterative algorithm for joint zero diagonalization of a set of complex-valued target matrices. The proposed algorithm is actually a low complexity version of FJZD algorithm, it has a computational complexity of O(K N2), where K and N are the number and dimension of the target matrices respectively. Moreover, the proposed algorithm is superior to FJZD in terms of interference to signal ratio. Simulation results demonstrate the good performance of the proposed algorithm.
Keywords
computational complexity; iterative methods; signal processing; FJZD algorithm; complex-valued target matrices; computational complexity; joint zero diagonalization; low complexity iterative algorithm; signal processing applications; Complexity theory; Cost function; Indexes; Iterative methods; Joints; Manganese; Signal processing algorithms; Complex value; complexity; iterative algorithm; joint zero diagonalization;
fLanguage
English
Journal_Title
Signal Processing Letters, IEEE
Publisher
ieee
ISSN
1070-9908
Type
jour
DOI
10.1109/LSP.2011.2179935
Filename
6105526
Link To Document