• The Journal of the Acoustical Society of Korea
• /
• v.28 no.6
• /
• pp.514-519
• /
• 2009

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimates the signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. FE-PAST (Forward-Backward PAST) is one of the results from the improvement studies. In this paper, we propose a new algorithm to improve the orthogonality of the FB-PAST (Forward-Backward PAST).

• The Journal of the Acoustical Society of Korea
• /
• v.27 no.1E
• /
• pp.25-29
• /
• 2008

The projection approximation subspace tracking (PAST) is one of the attractive subspace tracking algorithms, because it estimatesthe signal subspace adaptively and continuously. Furthermore, the computational complexity is relatively low. However, the algorithm still has room for improvement in the subspace estimation accuracy. In this paper, we propose a new algorithm to improve the subspace estimation accuracy using a normally ordered input vector and a reversely ordered input vector simultaneously.

• 전자공학회논문지 IE
• /
• v.48 no.1
• /
• pp.7-15
• /
• 2011

In this paper, we propose a correlation-based subspace estimation technique, which is called square-root forward/backward correlation-based projection approximation subspace tracking(SRFB-COPAST). The SRFB-COPAST utilizes the forward and backward correlation matrix as well as square-root recursive matrix update in projection approximation approach to develop the subspace tracking algorithm. With the projection approximation, the square-root recursive FB-COPAST is presented. The proposed algorithm has the better performance than the recently developed COPAST method.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.189-192
• /
• 2000

본 논문은 Nonstationary 환경에서 동작하는 소나의 DOA추정의 정확도를 높이기 위하여 가변 망각인자를 도입한 새로운 Extended PASTd (Extended Projection Approximation of Subspace Tracking with deflation) 을 제안하고 기존 알고리즘과 비교함으로써 새로운 알고리즘의 향상된 성능을 보인다.

• Journal of Communications and Networks
• /
• v.12 no.3
• /
• pp.216-221
• /
• 2010

In this paper, we propose and develop a new algorithm for the principle subspace tracking by orthonormalizing the eigenvectors using an approximation of Gram-Schmidt procedure. We carry out a novel mathematical derivation to show that when this approximated version of Gram-Schmidt procedure is added to a modified form of projection approximation subspace tracking deflation (PASTd) algorithm, the eigenvectors can be orthonormalized within a linear computational complexity. While the PASTd algorithm tries to extracts orthonormalized eigenvectors, the new scheme orthonormalizes the eigenvectors after their extraction, yielding much more tacking efficiency. We apply the new tracking scheme for blind adaptive multiuser detection for non-stationary cellular CDMA environment and use extensive simulation results to demonstrate the performance improvement of the proposed scheme.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.9
• /
• pp.148-156
• /
• 2014

In the MVDR (minimum variance distortionless response) adaptive array, its performance could be greatly deteriorated in the presence of steering vector errors as the desired signal is treated as an interference. This paper suggests an computationally simple adaptive beamforming method which is robust against these errors. In the proposed method, a minimization problem that is formulated according to the DCB (doubly constrained beamforming) principle is solved to find a solution vector, which is in turn projected onto a subspace to obtain a new steering vector. The minimization problem and the subspace projection are dealt with using some principal eigenpairs, which are obtained using a modified PASTd(projection approximation subspace tracking with deflation). We improve the existing MPASTd(modified PASTd) algorithm such that the computational complexity is reduced. The proposed beamforming method can significantly reduce the complexity as compared with the conventional ones directly eigendecomposing an estimate of the corelation matrix to find all eigenvalues and eigenvectors. Moreover, the proposed method is shown, through simulation, to provide performance improvement over the conventional ones.

• The Journal of the Acoustical Society of Korea
• /
• v.20 no.1E
• /
• pp.7-13
• /
• 2001

In this paper we propose a new subspace tracking algorithm based on the PASTd (Projection Approximation Subspace Tracking with deflation). The algorithm is obtained via introducing the variable forgetting factor which adapts itself to the time-varying subspace environments. The tracking capability of the proposed algorithm is demonstrated by computer simulations in an abruptly changing DOA scenario. The estimation results of the variable forgetting factor PASTd(VFF-PASTd) outperform those of the PASTd in the nonstationary case as well as in the stationary case.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.47 no.6
• /
• pp.162-170
• /
• 2010

Adaptive arrays reject interferences while preserving the desired signal, exploiting a priori information on its arrival angle. Subspace-based adaptive arrays, which adjust their weight vectors in the signal subspace, have the advantages of fast convergence and robustness to steering vector errors, as compared with the ones in the full dimensional space. However, the complexity of theses subspace-based methods is high because the eigendecomposition of the covariance matrix is required. In this paper, we present a simple subspace-based method based on the PASTd (projection approximation subspace tracking with deflation). The orignal PASTd algorithm is modified such that eigenvectora are orthogonal to each other. The proposed method allows us to significantly reduce the computational complexity, substantially having the same performance as the beamformer with the direct eigendecomposition. In addition to the simple beamforming method, we present theoretical analyses on the SINR (signal-to-interference plus noise ratio) of subspace beamformers to see their behaviors.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.37-40
• /
• 2000

기존의 신호 공간 추적 방법을 이용한 blind multiuser detector는 nonstationary 환경에서 새로운 환경에 적응하기 위해 비교적 긴 시간을 필요로 한다 본 논문은 가변 망각 인자를 도입한 확장 PASTd (Projection Approximation Subspace Tracking with Deflation) 알고리즘을 이용하여 환경 변화에 좀더 신속히 적응하는 성능 향상을 모의실험을 통해 보이고자 한다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.325-328
• /
• 2004

본 논문에서는 PAST(Projection Approximation Subspace Tracking)에 기반 한 새로운 부공간(subspace) 추적 알고리즘을 제안하고자 한다. 빠른 시분할 대상의 목표물의 방위각을 추정하는 것이 필요하다. 그러나 PAST 기법은 고속의 시분할 환경에서는 잘 동작하지 않는다 따라서 가변망각 인자를 도입하여 빠르게 변화하는 부공간의 비정재 (Nonstationary) 상태에 잘 적응시켜 PAST 성능 향상을 보고자 한다.