.png){kind=icon}
Return
A Low Complexity Iterative Algorithm for Joint Zero Diagonalization
.png){kind=icon}
PRE
AI
DOI：10.1109/LSP.2011.2179935.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
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(KN2), where K and N and 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:
Complex value
complexity
iterative algorithm
joint zero diagonalization
AI Summary
Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.
Journal
IF:
9.6
Papers:
1.1W
Citations:
1.7W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveThe extrapolation of the Drucker–Prager/Cap material parameters to low and high relative densities
PREAI
ShareSaveShareSaveShareSaveShareSave no more
no more