• Journal of Communications and Networks
• /
• v.18 no.2
• /
• pp.182-189
• /
• 2016

The focus in this paper is on obtaining tight, simple algebraic-form bounds and invertible expressions for the average symbol error probability (ASEP) of M-ary phase shift keying (MPSK) in a class of composite fading channels. We employ the mixture gamma (MG) distribution to approximate the signal-to-noise ratio (SNR) distributions of fading models, which include Nakagami-m, Generalized-K ($K_G$), and Nakagami-lognormal fading as specific examples. Our approach involves using the tight upper and lower bounds that we recently derived on the Gaussian Q-function, which can easily be averaged over the general MG distribution. First, algebraic-form upper bounds are derived on the ASEP of MPSK for M > 2, based on the union upper bound on the symbol error probability (SEP) of MPSK in additive white Gaussian noise (AWGN) given by a single Gaussian Q-function. By comparison with the exact ASEP results obtained by numerical integration, we show that these upper bounds are extremely tight for all SNR values of practical interest. These bounds can be employed as accurate approximations that are invertible for high SNR. For the special case of binary phase shift keying (BPSK) (M = 2), where the exact SEP in the AWGN channel is given as one Gaussian Q-function, upper and lower bounds on the exact ASEP are obtained. The bounds can be made arbitrarily tight by adjusting the parameters in our Gaussian bounds. The average of the upper and lower bounds gives a very accurate approximation of the exact ASEP. Moreover, the arbitrarily accurate approximations for all three of the fading models we consider become invertible for reasonably high SNR.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2158-2165
• /
• 2007

In this paper, a Modified Fuzzy C-Means algorithm with Gaussian Weights(MFCM_GW) is presented for nonlinear blind channel equalization. The proposed algorithm searches the optimal channel output states of a nonlinear channel from the received symbols, based on the Bayesian likelihood fitness function and Gaussian weighted partition matrix instead of a conventional Euclidean distance measure. Next, the desired channel states of a nonlinear channel are constructed with the elements of estimated channel output states, and placed at the center of a Radial Basis Function(RBF) equalizer to reconstruct transmitted symbols. In the simulations, binary signals are generated at random with Gaussian noise. The performance of the proposed method is compared with those of a simplex genetic algorithm(GA), a hybrid genetic algorithm(GA merged with simulated annealing(SA): GASA), and a previously developed version of MFCM. It is shown that a relatively high accuracy and fast search speed has been achieved.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.23 no.1
• /
• pp.1-10
• /
• 2020

Effective jamming in electronic warfare depends on proper jamming technique selection and jamming parameter estimation. For this purpose, this paper proposes a new method of estimating jamming parameters using Gaussian kernel function networks. In the proposed approach, a new method of determining the optimal structure and parameters of Gaussian kernel function networks is proposed. As a result, the proposed approach estimates the jamming parameters in a reliable manner and outperforms other methods such as the DNN(Deep Neural Network) and SVM(Support Vector Machine) estimation models.

• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.13 no.7
• /
• pp.679-686
• /
• 2002

Based on the alternating series expansion of error probability function due to phase noise in PSK systems, the performance evaluations for Tikhonov and Gaussian probability density functions were performed in this paper. The range of the signal-to-noise ratio of recovered carrier signal which provides the same dependency between the error performances by Tikhonov function and Gaussian function was analyzed via loss evaluation due to phase noise. The phase noise with 1/f$^2$ characteristic was generated based on the relationship of the phase noise spectral density and the modulation index for frequency modulation signal. Using the generated phase noise as the input signal for digital satellite communication receiver, the performance losses due to the phase noise were measured and evaluated with the analyzed performance characteristics.

• IEIE Transactions on Smart Processing and Computing
• /
• v.4 no.4
• /
• pp.202-208
• /
• 2015

In this study, we propose a new inference algorithm for a multiclass Gaussian process classification model using a variational EM framework and the Laplace approximation (LA) technique. This is performed in two steps, called expectation and maximization. First, in the expectation step (E-step), using Bayes' theorem and the LA technique, we derive the approximate posterior distribution of the latent function, indicating the possibility that each observation belongs to a certain class in the Gaussian process classification model. In the maximization step, we compute the maximum likelihood estimators for hyper-parameters of a covariance matrix necessary to define the prior distribution of the latent function by using the posterior distribution derived in the E-step. These steps iteratively repeat until a convergence condition is satisfied. Moreover, we conducted the experiments by using synthetic data and Iris data in order to verify the performance of the proposed algorithm. Experimental results reveal that the proposed algorithm shows good performance on these datasets.

• ETRI Journal
• /
• v.32 no.6
• /
• pp.965-968
• /
• 2010

In this letter, we derive the distribution functions of five ratios involving two correlated Gaussian random variables by using the rotation of Cartesian coordinates. The results can be used in evaluating the various probability performances of wireless communications systems.

• Journal of the Chungcheong Mathematical Society
• /
• v.12 no.1
• /
• pp.133-146
• /
• 1999

Let {X(t), $t{\geq}0$} be a stochastic integral process represented by stable random measure or multiple Ito-Wiener integrals. Under some conditions, we prove the continuity and self-similarity of these stochastic integral processes. As an application, we get Gaussian chaos which has some shift continuous function.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.6
• /
• pp.1260-1265
• /
• 2012

This paper have presented the change for subthreshold characteristics for double gate(DG) MOSFET based on scaling theory and the shape of Gaussian function. To obtain the analytical solution of Poisson's equation, Gaussian function been used as carrier distribution and consequently potential distributions have been analyzed closely for experimental results, and the subthreshold characteristics have been analyzed for the shape parameters of Gaussian function such as projected range and standard projected deviation. Since this potential model has been verified in the previous papers, we have used this model to analyze the subthreshold chatacteristics. The scaling theory is to sustain constant outputs for the change of device parameters. As a result to apply the scaling theory for DGMOSFET, we know the subthreshold characteristics have been greatly changed, and the change of threshold voltage is bigger relatively.

• The Korean Journal of Applied Statistics
• /
• v.26 no.3
• /
• pp.389-399
• /
• 2013

This article introduces Gaussian process regression and shows its application with time-course microarray gene expression data. Gene screening for yeast cell cycle microarray expression data is accomplished with a ratio of log marginal likelihood that uses Gaussian process regression with a squared exponential covariance kernel function. Gaussian process regression fitting with each gene is done and shown with the nine top ranking genes. With the screened data the Gaussian model-based clustering is done and its silhouette values are calculated for cluster validity.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.49.1-49
• /
• 2001

The skin color model is a very important concept in face detection, face recognition and face tracking. Usually, this model is obtained by estimating a probability density function of skin color distribution. In many cases, it is assumed that the underlying density function follows a Gaussian distribution. In this paper, a new method for non-parametric estimation of the probability density function, by using feed-forward neural network, is used to estimate the underlying skin color model. By using this method, the resulting skin color model is better than the Gaussian estimation and substantially approaches the real distribution. Applications to face detection and face ...