A class of hard c-means algorithms is derived from 'defuzzifying' objective functions of the entropy-based fuzzy c-means and the KL-information based fuzzy c-means. Namely an entropy term is deleted from the o...
详细信息
ISBN:
(纸本)0780392981
A class of hard c-means algorithms is derived from 'defuzzifying' objective functions of the entropy-based fuzzy c-means and the KL-information based fuzzy c-means. Namely an entropy term is deleted from the objective functions while other parameters of cluster sizes and covariances are preserved. As a result the objective function becomes linear with respect to the membership whereby a hard c-means algorithm is derived. Variations of the basic hard c-means algorithms are moreover proposed and reduction of computation using iterative matrix inversion is considered. Numerical examples are shown to compare results of proposed algorithms. Finally a cluster validity measure is used whereby stability of clusters by different algorithms is compared.
In this paper, an iterative high-resolution DOA algorithm is proposed for DOA estimation for CDMA systems. The algorithmiteratively removes detected signals from the received data and searches the residue spatial spe...
详细信息
ISBN:
(纸本)9780769536101
In this paper, an iterative high-resolution DOA algorithm is proposed for DOA estimation for CDMA systems. The algorithmiteratively removes detected signals from the received data and searches the residue spatial spectrum for further signals. It does not require any computationally expensive eigen decomposition or spatial smoothing in coherent multipath scenarios. Results are presented illustrating high-resolution at significantly lower SNR levels than those obtained by classical DOA algorithms such as MUSIC and MVM.
In this paper, the problem of carrier frequency offset estimation for burst-mode transmission on the AWGN channel in GMSK system and OFDM system is exploited within the framework of the expectation-maximization (EM) a...
详细信息
ISBN:
(纸本)9781538635216
In this paper, the problem of carrier frequency offset estimation for burst-mode transmission on the AWGN channel in GMSK system and OFDM system is exploited within the framework of the expectation-maximization (EM) algorithm. A joint pilot symbols and unknown data symbol CFO estimation algorithm based on EM is introduced. By exploiting the posterior information of the unknown data symbols which are referred to latent variable in EM algorithm and known pilot symbols jointly, the accuracy of the estimation can be improved effectively without degrading the spectral efficiency. Simulation results show that the proposed algorithm has a better performance than that of the conventional Data-Aided algorithm and the accuracy can achieve the Cramer-Rao Bound (CRB) at moderately high signal-to-noise ratios (SNR).
Singular value decomposition (SVD) plays an important role in signal processing for multi-input multi-output (MIMO) communication systems. Under massive MIMO scenarios, as the channel matrix is very large, implementin...
详细信息
ISBN:
(纸本)9781479928934
Singular value decomposition (SVD) plays an important role in signal processing for multi-input multi-output (MIMO) communication systems. Under massive MIMO scenarios, as the channel matrix is very large, implementing SVD at every frame is highly inefficient. Existing literature on iterative SVD algorithms are mostly heuristic based, and the associated tracking performance under time-varying channels is not clear. The difficulties of deriving and analyzing SVD algorithms are due to the non-convexity of the associated optimization problem and the time-varying nature of the MIMO channel. In this paper, we formulate the problem on Grassmann manifolds and derive a multi-stream iterative SVD algorithm using optimization techniques. To enhance the tracking performance under timevarying channels, we propose a compensation algorithm to offset the motion of the time-varying target eigenspace. We analyze the convergence behavior of the proposed algorithm, where we show that under some mild conditions, the proposed iterative SVD algorithm with compensations has zero tracking error, despite the underlying problem being non-convex and the channel being time-varying. The complexity of the algorithm is only O(n(2)p) for estimating p singular vectors, compared with O(n(3)) for the SVD of a n x n channel matrix.
This paper explores the source localization problem using the time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements when sensor location information suffers from random uncertaintie...
详细信息
ISBN:
(纸本)9789881563804
This paper explores the source localization problem using the time difference of arrival (TDOA) and frequency difference of arrival (FDOA) measurements when sensor location information suffers from random uncertainties. The analysis of the Cramer-Rao lower bound (CRLB) illustrates that the sensor uncertainties can considerably deteriorate the localization accuracy, so we fully incorporate the sensor location information uncertainties into the problem formulation. An iterative source localization algorithm is proposed to recursively solve the formulated problem, where the sensor information uncertainties is incorporated in each iteration to improve the localization performance.
Previously we have presented a method for selective sharpness enhancement of monochrome images. Our method is based on the simultaneous nonlinear reaction-diffusion time-evolution equipped with a nonlinear diffusion t...
详细信息
ISBN:
(纸本)0819450235
Previously we have presented a method for selective sharpness enhancement of monochrome images. Our method is based on the simultaneous nonlinear reaction-diffusion time-evolution equipped with a nonlinear diffusion term, a reaction term and an overshooting term, and it can sharpen only degraded edges blurred by several causes without increasing the visibility of nuisance factors such as random noise. This paper extends our method to selective sharpening of color images. As to the how to extend it, we take into accounts some variations about the treatment of three color components and the selection of the color space. By experiments, we quantitatively evaluate performance of these variations. Among them, the collective treatment of color components based on the simultaneous full-nonlinear reaction-diffusion time-evolution achieves the best performance, and sharpens blurred color edges selectively much better than the existing sharpness enhancement methods such as the adaptive peaking method.
This paper treats the output feedback H-2 control with regional pole placement condition. In general, this problem is a BMI problem which is difficult to be solved theoretically. The purpose of this paper is to propos...
详细信息
ISBN:
(纸本)9788995003848
This paper treats the output feedback H-2 control with regional pole placement condition. In general, this problem is a BMI problem which is difficult to be solved theoretically. The purpose of this paper is to propose an iterative method for obtaining a sub-optimal solution of the H-2 control problem with regional pole placement condition. The key idea of this paper is to employ a full-order observer-based controller. The proposed method produces a sequence of controllers which approaches to the unconstrained globally optimal H-2 controller while it satisfies the D-stability constraint. A numerical example shows the effectiveness of our method.
The evaluation of near-field data can be an effective way to analyze EMI sources. In contrast to antenna measurements, near-field techniques can determine the emitted field without special requirements on the measurem...
详细信息
ISBN:
(纸本)9781665448888
The evaluation of near-field data can be an effective way to analyze EMI sources. In contrast to antenna measurements, near-field techniques can determine the emitted field without special requirements on the measurement environment. Moreover, critical sources can be found when current distributions can be identified. Therefore, current reconstruction methods for PCB traces were developed. With additional voltage information the termination impedances of the traces can be found. The known phase-less approaches suffers from different limitations, e.g., non-unique reconstruction results. In this paper, the necessary conditions for a unique reconstruction are discussed by investigating simulated phase-less near-field data. Based on these findings, measured near-field data of a PCB trace is evaluated, and the successful retrieval of the phase information is shown. Additionally, reconstructed voltage distributions are presented and compared to measurement data.
The thermal regime of the flanged radiator Is analyzed at change of his thickness. It is shown, that at the certain thickness of a plate the minimal value of weight or weight clearance parameters of a radiator is prov...
详细信息
ISBN:
(纸本)9781424413218
The thermal regime of the flanged radiator Is analyzed at change of his thickness. It is shown, that at the certain thickness of a plate the minimal value of weight or weight clearance parameters of a radiator is provided. Recommendations at sampling materials are given.
The Young/Daly formula for periodic checkpointing is known to hold for a divisible load application where one can checkpoint at any time-step. In an nutshell, the optimal period is P-YD = root 2 mu C-f where mu(f) is ...
详细信息
ISBN:
(纸本)9781450388160
The Young/Daly formula for periodic checkpointing is known to hold for a divisible load application where one can checkpoint at any time-step. In an nutshell, the optimal period is P-YD = root 2 mu C-f where mu(f) is the Mean Time Between Failures (MTBF) and C is the checkpoint time. This paper assesses the accuracy of the formula for applications decomposed into computational iterations where: (i) the duration of an iteration is stochastic, i.e., obeys a probability distribution law D of mean mu(D);and (ii) one can checkpoint only at the end of an iteration. We first consider static strategies where checkpoints are taken after a given number of iterations k and provide a closed-form, asymptotically optimal, formula for k, valid for any distribution D. We then show that using the Young/Daly formula to compute k (as k . mu(D) = P-YD) is a first order approximation of this formula. We also consider dynamic strategies where one decides to checkpoint at the end of an iteration only if the total amount of work since the last checkpoint exceeds a threshold W-th, and otherwise proceed to the next iteration. Similarly, we provide a closed-form formula for this threshold and show that P-YD is a first-order approximation of W-th. Finally, we provide an extensive set of simulations where D is either Uniform, Gamma or truncated Normal, which shows the global accuracy of the Young/Daly formula, even when the distribution D had a large standard deviation (and when one cannot use a first-order approximation). Hence we establish that the relevance of the formula goes well beyond its original framework.
暂无评论