摘要
Gram-Schmidt orthogonalization algorithm is an interesting theme in the field of adaptive beam-forming and filtering as a fast algorithm. However, a key problem associated with this algorithm is that the number of orthogonalization, namely, the dimensions of interference subspace, is required to know prior. In this paper we derive a threshold and adopt it to detect the number of orthogonalization in the procedure of Gram-Schmidt(GS) orthogonalization decomposition, and this detection approach is simpler and faster than the approach based on eigenanalysis. Finally, computer simulation results were presented too.
Gram-Schmidt orthogonalization algorithm is an interesting theme in the field of adaptive beam-forming and filtering as a fast algorithm. However, a key problem associated with this algorithm is that the number of orthogonalization, namely, the dimensions of interference subspace, is required to know prior. In this paper we derive a threshold and adopt it to detect the number of orthogonalization in the procedure of Gram-Schmidt(GS) orthogonalization decomposition, and this detection approach is simpler and faster than the approach based on eigenanalysis. Finally, computer simulation results were presented too.
