• Proceedings of the KIEE Conference
• /
• 1998.11b
• /
• pp.675-677
• /
• 1998

In this paper, we propose the fuzzy inference algorithm with multi-layer structure. MFIS(Multi-layer Fuzzy Inference System) uses PNN(Polynomial Neural networks) structure and the fuzzy inference method. The PNN is the extended structure of the GMDH(Group Method of Data Hendling), and uses several types of polynomials such as linear, quadratic and cubic, as well as the biquadratic polynomial used in the GMDH. In the fuzzy inference method, the simplified and regression polynomial inference methods are used. Here, the regression polynomial inference is based on consequence of fuzzy rules with the polynomial equations such as linear, quadratic and cubic equation. Each node of the MFIS is defined as fuzzy rules and its structure is a kind of neuro-fuzzy structure. We use the training and testing data set to obtain a balance between the approximation and the generalization of process model. Several numerical examples are used to evaluate the performance of the our proposed model.

• Structural Engineering and Mechanics
• /
• v.76 no.6
• /
• pp.675-685
• /
• 2020

As the classical response surface method (RSM), the polynomial RSM is so easy-to-apply that it is widely used in reliability analysis. However, the trade-off of accuracy and efficiency is still a challenge and the "curse of dimension" usually confines RSM to low dimension systems. In this paper, based on the univariate decomposition, the polynomial RSM is executed in a new mode, called as DPRSM. The general form of DPRSM is given and its implementation is designed referring to the classical RSM firstly. Then, in order to balance the accuracy and efficiency of DPRSM, its adaptive order revision around the most probable point (MPP) is proposed by introducing the univariate polynomial order analysis, noted as RDPRSM, which can analyze the exact nonlinearity of the limit state surface in the region around MPP. For testing the proposed techniques, several numerical examples are studied in detail, and the results indicate that DPRSM with low order can obtain similar results to the classical RSM, DPRSM with high order can obtain more precision with a large efficiency loss; RDPRSM can perform a good balance between accuracy and efficiency and preserve the good robustness property meanwhile, especially for those problems with high nonlinearity and complex problems; the proposed methods can also give a good performance in the high-dimensional cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.12
• /
• pp.2382-2390
• /
• 2007

A new polynomial-based predistortion method for linearizing nonlinear power amplifier is proposed. The proposed method finds the predistortion parameter directly without the help of postdistorter whereas most existing polynomial-based predistortion methods calculate the predistortion parameter indirectly from the prostdistorter. First, a new predistortion algorithm is derived based on the assumption that the characteristic of the amplifier is modeled by piecewise linear function. Then it is modified into a proposed method which does not require any assumption or prior knowledge of the amplifier. The proposed method is derived based on the RLS (recursive least squares) algorithm. The proposed technique is simpler to implement than the existing methods and the computer simulation demonstrates that the proposed method is more robust to the initial condition and the saturation region of the amplifier.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.41 no.1
• /
• pp.48-53
• /
• 2013

Polynomial response surface model has been widely used as approximation model which replace physical or numerical experiments in various engineering fields. Generally, low-order model is used to reduce experimental points required to construct the response surfaces, but this approach has limit to represent the highly non-linear phenomena. In this paper, we developed the method to expand modeling capabilities of polynomial response surfaces by increasing order of polynomial and selecting optimum polynomial basis functions. Genetic algorithm is used to choose optimal polynomial basis functions. Developed method was applied to analytic functions with 1 or 2 variables and wind tunnel test data modeling. The results show that this method is applicable to building response surface models for highly non-linear phenomena.

• The Transactions of the Korean Institute of Electrical Engineers D
• /
• v.53 no.1
• /
• pp.40-49
• /
• 2004

In this paper, we propose a new architecture of Genetic Algorithms(GAs)-based Self-Organizing Polynomial Neural Networks(SOPNN), discuss a comprehensive design methodology and carry out a series of numeric experiments. The conventional SOPNN is based on the extended Group Method of Data Handling(GMDH) method and utilized the polynomial order (viz. linear, quadratic, and modified quadratic) as well as the number of node inputs fixed (selected in advance by designer) at Polynomial Neurons (or nodes) located in each layer through a growth process of the network. Moreover it does not guarantee that the SOPNN generated through learning has the optimal network architecture. But the proposed GA-based SOPNN enable the architecture to be a structurally more optimized network, and to be much more flexible and preferable neural network than the conventional SOPNN. In order to generate the structurally optimized SOPNN, GA-based design procedure at each stage (layer) of SOPNN leads to the selection of preferred nodes (or PNs) with optimal parameters- such as the number of input variables, input variables, and the order of the polynomial-available within SOPNN. An aggregate performance index with a weighting factor is proposed in order to achieve a sound balance between approximation and generalization (predictive) abilities of the model. A detailed design procedure is discussed in detail. To evaluate the performance of the GA-based SOPNN, the model is experimented with using two time series data (gas furnace and NOx emission process data of gas turbine power plant). A comparative analysis shows that the proposed GA-based SOPNN is model with higher accuracy as well as more superb predictive capability than other intelligent models presented previously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.38A no.2
• /
• pp.156-163
• /
• 2013

The use of an error-correcting code is essential in communication systems where the channel is noisy. When channel coding parameters are unknown at a receiver side, decoding becomes difficult. To perform decoding without the channel coding information, we should estimate the parameters. In this paper, we introduce a method to reconstruct the generator polynomial of BCH(Bose-Chaudhuri-Hocquenghem) codes based on the idea that the generator polynomial is compose of minimal polynomials and BCH code is cyclic code. We present a probability compensation method to improve the reconstruction performance. This is based on the concept that a random data pattern can also be divisible by a minimal polynomial of the generator polynomial. And we confirm the performance improvement through an intensive computer simulation.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.9
• /
• pp.660-669
• /
• 1987

Routh approximation method is the most computationally attractive. But this method may cause time-response error because this method does not match the time-response directly. In this paper a new mixed method for obtaining stable reduced-order models for high-order continuous-time systems is proposed. It makes use of the advantages of the Routh approximation method and the Minimization of Integral Squared Error(MISE) criterion approach. In this mixed method the characteristic polynomial of the reduced-order model is first obtained from that of original system by using the Auxiliary Denominator Polynomial(ADP). The numerator polynomial is then determined so as to minimize the intergral squared-error of unit step responses. The advantages of the propsed method are that the reduced models are always stable if the original system are stable and the frequency domain and time domain characteristic of the original system will be preserved in the reduced models.

• ETRI Journal
• /
• v.28 no.6
• /
• pp.745-760
• /
• 2006

In this paper, we particularly deal with no $F_p$-rational two-torsion elliptic curves, where $F_p$ is the prime field of the characteristic p. First we introduce a shift product-based polynomial transform. Then, we show that the parities of (#E - 1)/2 and (#E' - 1)/2 are reciprocal to each other, where #E and #E' are the orders of the two candidate curves obtained at the last step of complex multiplication (CM)-based algorithm. Based on this property, we propose a method to check the parity by using the shift product-based polynomial transform. For a 160 bits prime number as the characteristic, the proposed method carries out the parity check 25 or more times faster than the conventional checking method when 4 divides the characteristic minus 1. Finally, this paper shows that the proposed method can make CM-based algorithm that looks up a table of precomputed class polynomials more than 10 percent faster.

• Journal of Electrical Engineering and Technology
• /
• v.10 no.2
• /
• pp.676-687
• /
• 2015

Path planning algorithms are used to allow mobile robots to avoid obstacles and find ways from a start point to a target point. The general path planning algorithm focused on constructing of collision free path. However, a high continuous path can make smooth and efficiently movements. To improve the continuity of the path, the searched waypoints are connected by the proposed polynomial interpolation. The existing polynomial interpolation methods connect two points. In this paper, point groups are created with three points. The point groups have each polynomial. Polynomials are made by matching the differential values and simple matrix calculation. Membership functions are used to distribute the weight of each polynomial at overlapped sections. As a result, the path has $G^2$ continuity. In addition, the proposed method can analyze path numerically to obtain curvature and heading angle. Moreover, it does not require complex calculation and databases to save the created path.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.7 no.4
• /
• pp.7-14
• /
• 2011

Infinite failure NHPP models presented in the literature exhibit either constant, monotonic increasing or monotonic decreasing failure occurrence rate per fault (hazard function). This infinite non-homogeneous Poisson process is model which reflects the possibility of introducing new faults when correcting or modifying the software. In this paper, polynomial hazard function have been proposed, which can efficiency application for software reliability. Algorithm for estimating the parameters used to maximum likelihood estimator and bisection method. Model selection based on mean square error and the coefficient of determination for the sake of efficient model were employed. In numerical example, log power time model of the existing model in this area and the polynomial hazard function model were compared using failure interval time. Because polynomial hazard function model is more efficient in terms of reliability, polynomial hazard function model as an alternative to the existing model also were able to confirm that can use in this area.