• The Journal of the Korea institute of electronic communication sciences
• /
• v.6 no.1
• /
• pp.20-26
• /
• 2011

In this paper, we propose an efficient algorithm for reducing the complexity of LDPC code decoding by using node monitoring (NM) and Piecewise Linear Function Approximation (NP). This NM algorithm is based on a new node-threshold method, and the message passing algorithm. Piecewise linear function approximation is used to reduce the complexity for more. This algorithm was simulated in order to verify its efficiency. Simulation results show that the complexity of our NM algorithm is reduced to about 20%, compared with thoes of well-known method.

• Journal of applied mathematics & informatics
• /
• v.29 no.1_2
• /
• pp.135-143
• /
• 2011

As a zero set of some multivariate splines, the piecewise algebraic variety is a kind of generalization of the classical algebraic variety. This paper presents an algorithm for isolating real roots of the zero-dimensional piecewise algebraic variety which is based on interval evaluation and the interval zeros of univariate interval polynomials in Bernstein form. An example is provided to show the proposed algorithm is effective.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.10 no.11
• /
• pp.1231-1238
• /
• 2015

In this paper, we proposed an efficient algorithm using Node monitoring (NM) and Piecewise Linear Function Approximation(: NP) for reducing the complexity of LDPC code decoding. Proposed NM algorithm is based on a new node-threshold method together with message passing algorithm. Piecewise linear function approximation is used to reduce the complexity of the algorithm. This new algorithm was simulated in order to verify its efficiency. Complexity of our new NM algorithm is improved to about 20% compared with well-known methods according to simulation results.

• Journal of applied mathematics & informatics
• /
• v.28 no.3_4
• /
• pp.651-661
• /
• 2010

We consider the inverse problem of the identification of a piecewise-constant conductivity in a bar given the extra information of the heat flux through one end of the bar. Our theoretical results show that such an identification is unique. This approach utilizes a "layer peeling" argument. A computational algorithm based on this method is proposed and implemented. The advantage of this algorithm is that it requires only 3D minimizations irrespective of the number of the unknown discontinuities. Its numerical effectiveness is investigated for several conductivities.

• Journal of Biomedical Engineering Research
• /
• v.16 no.1
• /
• pp.17-24
• /
• 1995

This paper presents a new compression method (or ECG data using iterated contractive transformations. The method represents any range of ECG signal by piecewise self-afrine fractal Interpolation (PSAFI). The piecewise self-afrine rractal model is used where a discrete data set is viewed as being composed of contractive arfine transformation of pieces of itself. This algorithm was evaluated using MIT/BIH arrhythmia database. PSAFI is found to yield a relatively low reconstruction error for a given compression ratio than conventional direct compression methods. The compression ratio achieved was 883.9 bits per second (bps) - an average percent rms difference (AFRD) of 5.39 percent -with the original 12b ECG samples digitized at 400 Hz.

• KIISE Transactions on Computing Practices
• /
• v.23 no.11
• /
• pp.632-640
• /
• 2017

Although solar insolation is the weather factor with the greatest influence on power generation in photovoltaic systems, the Meterological Agency does not provide solar insolation data for future dates. Therefore, it is essential to research prediction methods for solar insolation to efficiently manage photovoltaic systems. In this study, we propose a Dynamic Piecewise Prediction Model that can be used to predict solar insolation values for future dates based on information from the weather forecast. To improve the predictive accuracy, we dynamically divide the entire data set based on the sun altitude and cloudiness at the time of prediction. The Dynamic Piecewise Prediction Model is developed by applying a polynomial linear regression algorithm on the divided data set. To verify the performance of our proposed model, we compared our model to previous approaches. The result of the comparison shows that the proposed model is superior to previous approaches in that it produces a lower prediction error.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.50 no.11
• /
• pp.520-527
• /
• 2001

This paper suggests a new methodology of evolutionary computations - an Adaptive Evolutionary Algorithm (AEA) for solving the Economic Load Dispatch (ELD) problem which has piecewise quadratic cost functions and prohibited operating zones with many local minima. AEA uses a genetic algorithm (GA) and an evolution strategy (ES) in an adaptive manner in order to take merits of two different evolutionary computations: global search capability of GA and local search capability of ES. In the reproduction procedure, proportions of the population by GA and the population by ES are adaptively modulated according to the fitness. Case studies illustrate the superiority of the proposed methods to existing conventional methods in power generation cost and computation time. The results demonstrate that the AEA can be applied successfully in the solution of ELD with piecewise quadratic cost functions and prohibited operating zones

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.41 no.6
• /
• pp.672-677
• /
• 2016

Development of Internet has been successfully inspired with extensive deployment of the network technology and application. However, increases in Internet usage had caused a lot of traffic overload in these days. Thus, we need a continuous research and development on the network virtualization for effective resource allocation. In this paper, we propose a minimal cost virtual network mapping algorithm using Piecewise Linear Cost Function. We exploited an algorithm with Linear Programming and D-VINE for node mapping, and Shortest Path Algorithm based on linear programming solution is used for link mapping. In this way, we compared and analyzed the average cost for arrival rate of VN request with linear and tree structure. Simulation results show that the average cost of our algorithm shows better efficiency than ViNEyard.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.12
• /
• pp.142-151
• /
• 1994

This paper proposes new algorithms to solve canonical piecewise-linear equations with linear partitions and illustrates their efficiency through the analysis of resistive network. The basic idea of the proposed algorithm is to find the best next guess, closest to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of nest guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations rquired for convergence greatly, compared to the actual solution, at each Newton-Raphson (N-R) iteration by comparing the images of next guess candidates and that of the actual solution. The proposed algorithm can reduce the number of the N-R iterations required for convergence greatly, compared to the Katzenelson algorithm. When applied to analyzing test circuits, the proposed algorithm required 8 to 20 times fewer N-R iterations and 5 to 10 times less CPU time than the Katzenelson algorithm, depending on the size of the circuits. The experimental results also exhibit that the efficiency of the proposed algorithm over the Katzenelson algorithm increases as the number of the piecewise-linear regions for the representation of the circuit.

• Journal of the Korean Data and Information Science Society
• /
• v.17 no.4
• /
• pp.1289-1297
• /
• 2006

Before other statistical data analysis the preprocessing steps should be performed adequately to have meaningful results. These steps include processes such as baseline correction, normalization, denoising, and multiple alignment. In this paper an algorithm for baseline correction is proposed with using the piecewise cubic Hermite interpolation with block-selected points and local minima after denoising for SELDI or MALDI mass spectrometry data.