• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.9A
• /
• pp.1039-1047
• /
• 2004

In this paper, we propose a new channel estimation technique for long code DS-CDMA DMB down link system which estimate the channel response based on the signal space vector only, unlike the most conventional sub-space method relying on the orthogonal property of noise space vectors to the signal space vector. Because of this property of the proposed method, very optimum covariance matrix in its dimension can be used in subspace analysis channel estimation technique otherwise it is likely too large to be implemented practically.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.1E
• /
• pp.19-25
• /
• 2003

Ryu et al. recently proposed a multiple target angle-tracking algorithm without a data association problem. This algorithm, however, shows the degraded performance on evasive maneuvering targets, because the estimated signal subspace is d,:graded in the algorithm. In this Paper, we proposed a new algorithm, in which VFF-PASTd (Variable Forgetting Factor PASTd) algorithm is applied to Ryu's algorithm to effectively handle the evasive target tracking with better time-varying signal subspace.

• Journal of information and communication convergence engineering
• /
• v.5 no.1
• /
• pp.12-16
• /
• 2007

In this paper, a new method is proposed for tracking the direction-of-arrival (DOA) of the wideband moving source incident on uniform linear array sensors. DOA is estimated by focusing transformation matrices. To update focusing matrices along with new data snap shots, we use the FAST (Fast Approximate Subspace Tracking) method. Present focusing matrices are constructed by previous signal and its orthogonal basis vectors as well as present signal and its orthogonal basis vectors, which are the left and right singular vectors of the inner product of two approximated matrices. Simulation results are shown to illustrate the performance of the proposed method.

• 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.

• ETRI Journal
• /
• v.31 no.2
• /
• pp.193-200
• /
• 2009

In this paper, we study the performance of subspace-based multiuser detection techniques for multicarrier code-division multiple access (MC-CDMA) systems. We propose an improvement in the PASTd algorithm by cascading it with the classical Gram-Schmidt procedure to orthonormalize the eigenvectors after their sequential extraction. The tracking of signal subspace using this algorithm, which we call OPASTd, has a faster convergence as the eigenvectors are orthonormalized at each discrete time sample. This improved PASTd algorithm is then used to implement the subspace blind adaptive multiuser detection for MC-CDMA. We also show that, for multiuser detection, the complexity of the proposed scheme is lower than that of many other orthogonalization schemes found in the literature. Extensive simulation results are presented and discussed to demonstrate the performance of the proposed scheme.

• Journal of electromagnetic engineering and science
• /
• v.11 no.4
• /
• pp.250-256
• /
• 2011

This paper applies a compressed algorithm to improve the spectrum sensing performance of cognitive radio technology. At the fusion center, the recovery error in the analog to information converter (AIC) when reconstructing the transmit signal from the received time-discrete signal causes degradation of the detection performance. Therefore, we propose a subspace pursuit (SP) algorithm to reduce the recovery error and thereby enhance the detection performance. In this study, we employ a wide-band, low SNR, distributed compressed sensing regime to analyze and evaluate the proposed approach. Simulations are provided to demonstrate the performance of the proposed algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.10 no.5
• /
• pp.139-145
• /
• 2010

In this paper, we propose robust cell ID detection algorithm and SNR estimation algorithm applicable to mobile base station, which can be operated independently. The proposed cell ID estimation uses signal subspace to estimate cell IDs used in cell. The proposed SNR estimation algorithm uses number of noise subspace vectors and the corresponding eigen-vectors. Through the computer simulations, we showed that performance of the proposed cell ID detection and SNR estimation algorithms are superior to existing correlation based algorithms. Also we showed that the proposed algorithm is suitable to fast moving channel in high background noise and strong interference signal.

• 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 Korean Institute of Communications and Information Sciences
• /
• v.14 no.1
• /
• pp.30-37
• /
• 1989

The MUSIC(MUltiple SIgnal Characterization)algorithm has been extenced to the UCERSS(Unit Circle Eigendecomposition Rational Signal Subspace) by taking eigendecimposition on the unit circle in order to estimate incident angles of multiple wide band signals. The purpose of this paper is to presetn SSB-UCERSS(Signal Subspace Based UCERSS) and SS-UCERSS(Spatially Smoothed UCERSS) estimating the incident angles of multiple side band signals in multipath(coherent signals) environments. Computer simulation results indicate that SSB-UCERSS yields the best result, while the SS-UCERSS performs better than the UCERTSS in a multipath environment.

• Journal of Advanced Navigation Technology
• /
• v.5 no.2
• /
• pp.111-122
• /
• 2001

In this paper, we study the performance of eigencanceller which use a eigenvector and eigenvalue in order to update a weighter vector. Eigencanceller can suppress directional interferences and noise effectively while maintaining specified beam pattern constraints. The constraints and optimal weight vector of eigencanceller vary by using interference and noise or desired signal, interference signal and noise as array input signal. From the analysis results in the steady state, We show that weight vectors in each case are simplified the form of projection equation that belongs to desired subspace orthogonal to interference subspace and eigencanceller has the better performance than RLS method through mathematical analysis and simulation.