• Journal of information and communication convergence engineering
• /
• v.16 no.1
• /
• pp.17-22
• /
• 2018

In massive multiple-input multiple-output (MIMO) systems, linear channel estimation algorithms are widely applied owing to their simple structures. However, they may cause pilot contamination, which affects the subsequent data detection performance. Therefore, herein, for an uplink multicell massive multiuser MIMO system, we consider using an alternating projection (AP) for channel estimation to eliminate the effect of pilot contamination and improve the performance of data detection in terms of the bit error rates as well. Even though the AP is nonlinear, it iteratively searches the best solution in only one dimension, and the computational complexity is thus modest. We have analyzed the mean square error with respect to the signal-to-interference ratios for both the cooperative and non-cooperative multicell scenarios. From the simulation results, we observed that the channel estimation results via the AP benefit the following signal detection more than that via the least squares for both the cooperative and non-cooperative multicell scenarios.

• Proceedings of the Korean Information Science Society Conference
• /
• 2011.06c
• /
• pp.393-396
• /
• 2011

In this paper, we propose a constrained alternating least squares nonnegative matrix factorization algorithm (cALSNMF) to detect active brain regions from single subject's task-related fMRI data. In cALSNMF, we define a new cost function which considers the uncorrelation and noisy problems of fMRI data by adding decorrelation and smoothing constraints in original Euclidean distance cost function. We also generate a novel training procedure by modifying the update rules and combining with optimal brain surgeon (OBS) algorithm. The experimental results on visuomotor task fMRI data show that our cALSNMF fits fMRI data better than original ALSNMF in detecting task-related brain activation from single subject's fMRI data.

• ETRI Journal
• /
• v.45 no.1
• /
• pp.138-149
• /
• 2023

In this study, the problem of blind signal separation for coprime planar arrays is investigated. For coprime planar arrays comprising two uniform rectangular subarrays, we link the signal separation to the tensor-based model called coupled canonical polyadic decomposition (CPD) and propose an improved coupled trilinear decomposition approach. The output data of coprime planar arrays are modeled as a coupled tensor set that can be further interpreted as a coupled CPD model, allowing a signal separation to be achieved using coupled trilinear alternating least squares (TALS). Furthermore, in the procedure of the coupled TALS, a Vandermonde structure enforcing approach is explicitly applied, which is shown to ensure fast convergence. The results of Monto Carlo simulations show that our proposed algorithm has the same separation accuracy as the basic coupled TALS but with a faster convergence speed.

• ETRI Journal
• /
• v.42 no.6
• /
• pp.922-931
• /
• 2020

A hierarchical iterative algorithm for the canonical polyadic decomposition (CPD) of tensors is proposed by improving the traditional conjugate gradient least squares (CGLS) method. Methods based on algebraic operations are investigated with the objective of estimating the direction of arrival (DoA) and polarization parameters of signals impinging on an array with electromagnetic (EM) vector-sensors. The proposed algorithm adopts a hierarchical iterative strategy, which enables the algorithm to obtain a fast recovery for the highly collinear factor matrix. Moreover, considering the same accuracy threshold, the proposed algorithm can achieve faster convergence compared with the alternating least squares (ALS) algorithm wherein the highly collinear factor matrix is absent. The results reveal that the proposed algorithm can achieve better performance under the condition of fewer snapshots, compared with the ALS-based algorithm and the algorithm based on generalized eigenvalue decomposition (GEVD). Furthermore, with regard to an array with a small number of sensors, the observed advantage in estimating the DoA and polarization parameters of the signal is notable.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.60 no.1
• /
• pp.205-213
• /
• 2011

The Long Term Evolution (LTE) system is designed to provide a high quality data service for fast moving mobile users. It is based on the Orthogonal Frequency Division Multiplexing (OFDM) and relies its channel estimation on the training samples which are systematically built within the transmitting data. Either a preamble or a lattice type is used for the distribution of training samples and the latter suits better for the multipath fading channel environment whose channel frequency response (CFR) fluctuates rapidly with time. In the lattice-type structure, the estimation of the CFR makes use of the least squares estimate (LSE) for each pilot samples, followed by an interpolation both in time-and in frequency-domain to fill up the channel estimates for subcarriers corresponding to data samples. All interpolation schemes should rely on the pilot estimates only, and thus, their performances are bounded by the quality of pilot estimates. However, the additive noise give rise to high fluctuation on the pilot estimates, especially in a communication environment with low signal-to-noise ratio. These high fluctuations could be monitored in the alternating high values of the first forward differences (FFD) between pilot estimates. In this paper, we analyzed statistically those FFD values and propose a postprocessing algorithm to suppress high fluctuations in the noisy pilot estimates. The proposed method is based on a localized adaptive moving-average filtering. The performance of the proposed technique is verified on a multipath environment suggested on a 3GPP LTE specification. It is shown that the mean-squared error (MSE) between the actual CFR and pilot estimates could be reduced up to 68% from the noisy pilot estimates.