• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.71-76
• /
• 2001

In this paper we propose the Digital Automatic Gain Controller for IEEE 802.11a-High-speed Physical Layer in the 5 GHz Band. The input gain it estimated by calculating the energy of the training symbol that it a synchronizing signal. The renewal gain is calculated by comparing the estimated gain with the ideal gain. The renewal gain is converted into the controlled voltage for GCA to reduce or amplify the input signals. We used a piecewise-linear approximation to reduce the hardware size. The gain control is performed seven times to provide more accurate gain control. The proposed automatic gain controller is designed with VHDL and verified by using the Xilinx FPGA.

• Proceedings of the KIEE Conference
• /
• 1999.07c
• /
• pp.1506-1509
• /
• 1999

This paper presents a new economic dispatch algorithm to improve the unit commitment solution while guaranteeing the near optimal solution without reducing calculation speed. The conventional economic dispatch algorithms have the problem that it is not applicable to the unit commitment formulation due to the frequent on/off state changes of units during the unit commitment calculation. Therefore, piecewise linear iterative method have generally been used for economic dispatch algorithm for unit commitment. In that method, the approximation of the generator cost function makes it hard to obtain the optimal economic dispatch solution. In this case, the solution can be improved by introducing a inverse of the incremental cost function. The proposed method is tested with sample system. The results are compared with the conventional piecewise linear iterative method. It is shown that the proposed algorithm yields more accurate and economical solution without calculation speed reduction.

• The KIPS Transactions:PartB
• /
• v.8B no.4
• /
• pp.351-356
• /
• 2001

표준 매개변수 소속 함수(SPMF)에 기반을 둔 구간 선형 변환 방법(PLTM)을 제안한다. 이는 구간 선형 변환 방법을 사용해서 비 매개변수 소속 함수(NPMF)로 표현된 퍼지 집합이 매개변수 소속 함수(PMF)로 표현된 퍼지 집합으로 변환될 수 있다는 생각에서 유래되었다. 이 경우, 이들 매개변수들은 퍼지 집합의 구조를 결정하기 위한 특징점들 이라고 할 수 있다. 결과적으로 구간 선형 변환 방법은 비 매개변수 소속 함수를 매개변수 소속 함수로 변환해 줌으로써 비 매개변수 소속 함수에 기반을 둔 퍼지 시스템과 비교해 볼 때 퍼지 시스템이 상대적으로 빠르게 처리될 수 있게 한다. 한편, 표준 매개변수 소속 함수들의 전형적인 형태가 소개되고 분석된다. 끝으로, PLTM의 전형적인 응용을 제시하고 수치적인 예를 보여준다.

• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1268-1270
• /
• 1987

This paper suggests several simple and efficient algorithms for detecting the ECG Signal by Microcomputer's software. The ECG signal detection was performed with the Linear Approximation and the feature extraction. The linear transformation approximates a given waveform by a piecewise-linear function with a preset upper bound on the absolute error between the functional values of the original function and the approximation. And the feature extraction from ECG signal, the features are different wave amplitudes, durations and interwave intervals, used the slope, the amplitude and time-Duration of ECG Sinal.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.106-109
• /
• 1998

Wireless communication systems, in particular, must operate in a crowded electro-magnetic environmnet where in-band undesired signals are treated as noise by the receiver. These interfering signals are often random but not Gaussian Due to nongaussian noise, the distribution of the observables cannot be specified by a finite set of parameters; instead r-dimensioal sample space (pure noise samples) is equiprobably partitioned into a finite number of disjointed regions using quantiles and a vector quantizer based on training samples. If we assume that the detected symbols are correct, then we can observe the pure noise samples during the training and transmitting mode. The algorithm proposed is based on a piecewise approximation to a regression function based on quantities and conditional partition moments which are estimated by a RMSA (Robbins-Monro Stochastic Approximation) algorithm. In this paper, we develop a diversity combiner with modified detector, called Non-Linear Detector, and the receiver has a differential phase detector in each diversity branch and at the combiner each detector output is proportional to the second power of the envelope of branches. Monte-Carlo simulations were used as means of generating the system performance.

• Journal of applied mathematics & informatics
• /
• v.7 no.3
• /
• pp.787-800
• /
• 2000

In this paper we consider an optimal control system described by n-dimensional heat equation with a thermal source. Thus problem is to find an optimal control which puts the system in a finite time T, into a stationary regime and to minimize a general objective function. Here we assume there is no constraints on control. This problem is reduced to a moment problem. We modify the moment problem into one consisting of the minimization of a positive linear functional over a set of Radon measures and we show that there is an optimal measure corresponding to the optimal control. The above optimal measure approximated by a finite combination of atomic measures. This construction gives rise to a finite dimensional linear programming problem, where its solution can be used to determine the optimal combination of atomic measures. Then by using the solution of the above linear programming problem we find a piecewise-constant optimal control function which is an approximate control for the original optimal control problem. Finally we obtain piecewise-constant optimal control for two examples of heat equations with a thermal source in one-dimensional.

• Journal of Korean Institute of Industrial Engineers
• /
• v.7 no.1
• /
• pp.5-11
• /
• 1981

In the case of numerical implementation, the exact solution method for the M/M/s system where customers demand multiple server use [2] reveals limitations, if a system has large number of servers or types of customers. This is due to the huge matrices involved in the course of the calculations. This paper offers an approximation scheme for such cases. Capitalizing the characteristics of the service rate curve of the system, this method approximates the service rate as a piecewise linear function. With the service rates obtained from the linear function for each number of customers n (n=0. 1. 2,$\cdots$), ${\mu}(n)$, steady-state probabilities and measures of performance are found treating this system as an ordinary M/M/s system. This scheme performs well when the traffic intensity of a system is below about 0.8. Some numerical examples are presented.

• ETRI Journal
• /
• v.42 no.4
• /
• pp.619-632
• /
• 2020

Highly dispersive S-boxes are desirable in cryptosystems as nonlinear confusion sublayers for resisting modern attacks. For a near optimal cryptosystem resistant to modern cryptanalysis, a highly nonlinear and low differential probability (DP) value is required. We propose a method based on a piecewise linear chaotic map (PWLCM) with optimization conditions. Thus, the linear propagation of information in a cryptosystem appearing as a high DP during differential cryptanalysis of an S-box is minimized. While mapping from the chaotic trajectory to integer domain, a randomness test is performed that justifies the nonlinear behavior of the highly dispersive and nonlinear chaotic S-box. The proposed scheme is vetted using well-established cryptographic performance criteria. The proposed S-box meets the cryptographic performance criteria and further minimizes the differential propagation justified by the low DP value. The suitability of the proposed S-box is also tested using an image encryption algorithm. Results show that the proposed S-box as a confusion component entails a high level of security and improves resistance against all known attacks.

• Proceedings of the Korean Statistical Society Conference
• /
• 2002.05a
• /
• pp.55-60
• /
• 2002

We present an extension of the Wong-Zakai type approximation theorem for a multiple stochastic integral. Using a piecewise linear approximation $W^{(n)}$ of a Wiener process W, we prove that the multiple integral processes {${\int}_{0}^{t}{\cdots}{\int}_{0}^{t}f(t_{1},{\cdots},t_{m})W^{(n)}(t_{1}){\cdots}W^{(n)}(t_{m}),t{\in}[0,T]$} where f is a given symmetric function in the space $C([0,T]^{m})$, converge to the multiple Stratonovich integral of f in the uniform $L^{2}$-sense.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.11 no.1
• /
• pp.36-43
• /
• 1986

In this study, the fuzzy programming is extended to handle various types of membership functions by transformation of the complicated fuzzy programming problems into the equivalent crisp linear programming problems with single objective. It is well-known that the fuzzy programming problem with linear membership functions (i.e., ramp type) can be easily transformed into a linear programming problem by introducing one dummy variable to minimize the worst unwanted deviation. However, until recently not many researches have been done to handle various general types of complicated linear membership functions which might be more realistic than ramp-or triangular-type functions. In order to handle these complicated membership functions, the goal dividing concept, which is based on the fuzzy set operation (i. e., intersection and union operations), has been prepared. The linear model obtained using the goal dividing concept is more efficient and single than the previous models [4, 8]. In addition, this result can be easily applied to any nonlinear membership functions by piecewise approximation since the membership function is continuous and monotone increasing or decreasing.