• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2946-2948
• /
• 2000

In this paper, we proposed the Fuzzy Polynomial Neural Networks(FPNN) model with fuzzy activation node. The proposed FPNN structure is generated from the mutual combination of PNN(Polynomial Neural Networks) structure and fuzzy inference system. The premise of fuzzy inference rules defines by triangular and gaussian type membership function. The fuzzy inference method uses simplified and regression polynomial inference method which is based on the consequence of fuzzy rule expressed with a polynomial such as linear, quadratic and modified quadratic equation are used. The structure of FPNN is not fixed like in conventional Neural Networks and can be generated. The design procedure to obtain an optimal model structure utilizing FPNN algorithm is shown in each stage. Gas furnace time series data used to evaluate the performance of our proposed model.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.10a
• /
• pp.474-478
• /
• 1998

A new approach for the decision feedback equalizer(DFE) based on the back-propagation neural networks is described. We propose the method of optimal structure for back-propagation neural networks model. In order to construct an the optimal structure, we first prescribe the bounds of learning procedure, and the, we employ the method of incrementing the number of input neuron by utilizing the derivative of the error with respect to an hidden neuron weights. The structure is applied to the problem of adaptive equalization in the presence of inter symbol interference(ISI), additive white Gaussian noise. From the simulation results, it is observed that the performance of the propose neural networks based decision feedback equalizer outperforms the other two in terms of bit-error rate(BER) and attainable MSE level over a signal ratio and channel nonlinearities.

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

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.65 no.6
• /
• pp.1070-1079
• /
• 2016

In this paper, the design of recursive radial basis function neural networks based on incremental fuzzy c-means is introduced for processing the big data. Radial basis function neural networks consist of condition, conclusion and inference phase. Gaussian function is generally used as the activation function of the condition phase, but in this study, incremental fuzzy clustering is considered for the activation function of radial basis function neural networks, which could effectively do big data processing. In the conclusion phase, the connection weights of networks are given as the linear function. And then the connection weights are calculated by recursive least square estimation. In the inference phase, a final output is obtained by fuzzy inference method. Machine Learning datasets are employed to demonstrate the superiority of the proposed classifier, and their results are described from the viewpoint of the algorithm complexity and performance index.

• Journal of Digital Convergence
• /
• v.10 no.6
• /
• pp.225-230
• /
• 2012

When a car accident happened, the accident vehicle should broadcast a safe message to its neighbors in multi-hop. However, the pure flooding is difficult to protect a chain-reaction collision because of the frequent collision and the communication delay. To solve this problem, we proposes a back-off algorithm applied to the estimation of the neighbor node count using the t-distribution. And we proposes a MAC protocol preventing the communication delay by separating the neighbor's count collection channel and data channel. As a result, we show the frame reception success rate of our protocol improved more 10% than the previous protocol.

• 제어로봇시스템학회:학술대회논문집
• /
• 1998.10a
• /
• pp.356-361
• /
• 1998

Neural Networks, modeled succinctly from the real nervous system of a living body, can be categorized into two folds; artificial neural network(ANN) and biological neural network(BNN). While the former has been developed to solve practical problems using function approximation capability, pattern classification) clustering algorithm, etc, the latter has been focused on verifying the information processing capability to which brain research gives an impetus, by mimicking real biological systems. However, BNN suffers Iron severe nonlinearities dealt with. A bridge between two neural networks is chaotic neural network(CNN), which simply delineate the real nor-vous system and comprises almost all the ANN structures by selecting parameters. Main research theme of this area is to develop an explanation tool to clarify the information processing mechanism in biological systems and its extension to engineering applications. The CNN has a Gaussian-shaped refractory function with hysteresis effect and the chaotic responses of it have been observed fur a wide range of parameter space. Through the examination of the coupling effects of excitatory and inhibitory connections, the secrets of information processing and memory structure will appear.

• Proceedings of the KIEE Conference
• /
• 2004.11c
• /
• pp.337-339
• /
• 2004

In this paper, we discuss optimal design of Fuzzy Polynomial Neural Networks by means of Genetic Algorithms(GAs). Proceeding the layer, this model creates the optimal network architecture through the selection and the elimination of nodes by itself. So, there is characteristic of flexibility. We use a triangle and a Gaussian-like membership function in premise part of rules and design the consequent structure by constant and regression polynomial (linear, quadratic and modified quadratic) function between input and output variables. GAs is applied to improve the performance with optimal input variables and number of input variables and order. To evaluate the performance of the GAs-based FPNNs, the models are experimented with the use of Medical Imaging System(MIS) data.

• Proceedings of the KIEE Conference
• /
• 2000.11d
• /
• pp.800-802
• /
• 2000

In this paper, we propose the Self-Organizing Networks(SON) based on competitive Fuzzy Polynomial Neuron(FPN) for the optimal design of nonlinear process system. The SON architectures consist of layers with activation nodes based on fuzzy inference rules. Here each activation node is presented as FPN which includes either the simplified or regression Polynomial fuzzy inference rules. The proposed SON is a network resulting from the fusion of the Polynomial Neural Networks(PNN) and a fuzzy inference system. The conclusion part of the rules, especially the regression polynomial uses several types of high-order polynomials such as liner, quadratic and modified quadratic. As the premise part of the rules, both triangular and Gaussian-like membership functions are studied. Chaotic time series data used to evaluate the performance of our proposed model.

• Transactions of the Korean Society of Mechanical Engineers A
• /
• v.33 no.8
• /
• pp.753-759
• /
• 2009

Feed-forward neural networks have been widely used as function approximation tools in the context of global approximate optimization. In the present study, a wavelet neural network (WNN) which is based on wavelet transform theory is suggested as an alternative to a traditional back-propagation neural network (BPN). The basic theory of wavelet neural network is briefly described, and approximation performance is tested using a nonlinear multimodal function and a composite rotor blade analysis problem. Laplacian of Gaussian function, Mexican function, and Morlet function are considered during the construction of WNN architectures. In addition, approximation results from WNN are compared with those from BPN.

• Journal of Communications and Networks
• /
• v.5 no.3
• /
• pp.230-239
• /
• 2003

In this paper, we propose a framework to study how to route packets efficiently in multipath communication networks. Two traffic congestion control techniques, namely, flow assignment and packet scheduling, have been investigated. The flow assignment mechanism defines an optimal splitting of data traffic on multiple disjoint paths. The resequencing delay and the usage of the resequencing buffer can be reduced significantly by properly scheduling the sending order of all packets, say, according to their expected arrival times at the destination. To illustrate our model, and without loss of generality, Gaussian distributed end-to-end path delays are used. Our analytical results show that the techniques are very effective in reducing the average end-to-end path delay, the average packet resequencing delay, and the average resequencing buffer occupancy for various path configurations. These promising results can form a basis for designing future adaptive multipath protocols.