• Journal of IKEEE
• /
• v.8 no.1 s.14
• /
• pp.22-32
• /
• 2004

In this paper, we proposed MOVAG(Multi Output Value Array Graphs) based on OVAG by Honghai Jiang to construct multiple valued logic function The MDD(Muliple-valued Decision Diagra) needs many processing time and efforts in circuit design for given multi-variable function by D.M.Miller, and we designed a MOVAG which has reduce the data processing time and low complexity. We propose the construction algorithm and input matrix selection algorithm and we designed the multiple-valued logic circuit using T-gate and verified by simulation results.

• Journal of KIISE:Software and Applications
• /
• v.30 no.10
• /
• pp.938-943
• /
• 2003

In this paper, we Propose a method using the Tikhonov-Miller process to improve the robustness of watermarking under various attacks. A visually recognizable pattern watermark is embedded in the LH2, HL2 and HH2 subband of wavelet transformed domain using threshold and besides watermark is embeded by utilizing HVS(Human Visual System) feature. The pattern watermark was interlaced after random Permutation for a security and an extraction rate. To demonstrate the improvement of robustness and similarity of the proposed method, we applied some basic algorithm of image processing such as scaling, filtering, cropping, histogram equalizing and lossy compression(JPEG, gif). As a result of experiment, the proposed method was able to embed robust watermark invisibility and extract with an excellent normalized correlation of watermark under various attacks.

• ETRI Journal
• /
• v.45 no.4
• /
• pp.690-703
• /
• 2023

Multistage amplifiers have become appropriate choices for high-speed electronics and data conversion. Because of the large number of high-impedance nodes, frequency compensation has become the biggest challenge in the design of multistage amplifiers. The new compensation technique in this study uses two differential stages to organize feedforward and feedback paths. Five Miller loops and a 500-pF load capacitor are driven by just two tiny compensating capacitors, each with a capacitance of less than 10 pF. The symbolic transfer function is calculated to estimate the circuit dynamics and HSPICE and TSMC 0.18 ㎛. CMOS technology is used to simulate the proposed five-stage amplifier. A straightforward iterative approach is also used to optimize the circuit parameters given a known cost function. According to simulation and mathematical results, the proposed structure has a DC gain of 190 dB, a gain bandwidth product of 15 MHz, a phase margin of 89°, and a power dissipation of 590 ㎼.

• Journal of the Korean Mathematical Society
• /
• v.57 no.4
• /
• pp.1019-1030
• /
• 2020

Efficient computation of r-th root in 𝔽_q has many applications in computational number theory and many other related areas. We present a new r-th root formula which generalizes Müller's result on square root, and which provides a possible improvement of the Cipolla-Lehmer type algorithms for general case. More precisely, for given r-th power c ∈ 𝔽_q, we show that there exists α ∈ 𝔽_q^r such that $$Tr{\left(\begin{array}{cccc}{{\alpha}^{{\frac{({\sum}_{i=0}^{r-1}\;q^i)-r}{r^2}}}\atop{\text{ }}}\end{array}\right)}^r=c,$$ where $Tr({\alpha})={\alpha}+{\alpha}^q+{\alpha}^{q^2}+{\cdots}+{\alpha}^{q^{r-1}}$ and α is a root of certain irreducible polynomial of degree r over 𝔽_q.

• Proceedings of the KIEE Conference
• /
• 1991.07a
• /
• pp.596-599
• /
• 1991

This paper describes a novel switching algorithm of series connected power semiconductors for high voltage applications. In order to improve the reliability and efficiency of high voltage static power converters, we study on the switching characteristics of series connected power semiconductors and then propose "a servo control of snubber capacitor value" for the dynamic voltage balancing under turn-off state in series connected power semiconductors. Finally, we illustrate the validity of this algorithm by computer simulation and experimental results.

• Journal of Biomedical Engineering Research
• /
• v.26 no.4
• /
• pp.199-205
• /
• 2005

When recording single-unit responses from neural systems, a common problem is the accurate detection of spikes (action potentials) in the presence of competing unwanted (noise) signals. While some sources of noise can be readily dealt with through filtering or 'template subtraction' techniques, other sources present a more difficult problem. In particular, noise components introduced by power supplies, which contain harmonics of the power-line frequency, can be particularly troublesome in that they can mimic the shape of the desired spikes. Thus, standard 'template subtraction' techniques or notch-filtering approaches are not appropriate. In this study, we propose the use of a novel template-subtraction scheme that involves estimating the power-line noise waveform and using cross-correlation techniques to subtract them from the recordings. This technique requires two key steps: (1) cross-correlation analysis of each recorded waveform extracts a robust representation of the power-line noise waveform and (2) a second level of cross-correlation to successfully subtract that representation from each recorded waveform. This paper describes this algorithm and provides examples of its implementation using actual recorded waveforms that are contaminated with these noise signals. An improvement (reduction) in the noise level is reported, as are suggestions for future implementation of this strategy.

• Journal of Institute of Control, Robotics and Systems
• /
• v.16 no.9
• /
• pp.827-832
• /
• 2010

Many researchers have tried to detect the falling and to reduce the injury associated with falling. Normally the method of detection of a loss of balance is more efficient than that of a compensatory motion in order to predict the falling. The detection algorithm of the loss of balance was composed of three main parts: parts of processing of measured data, construction of an internal model and detection of the loss of balance. The internal model represented a simple dynamic motion balancing with two rear legs of a four-legged chair and was a simplified model of a central nervous system of a person. The internal model was defined by the experimental data obtained within a fixed time interval, and was applied to the detecting algorithm to the end of the experiment without being changed. The balancing motion controlled by the human brain was improved in process of time because of the experience accruing to the brain from controlling sensory organs. In this study a reconstruction method of the internal model was used in order to improve the success rate and the detecting time of the algorithm and was changed with time the same as the brain did. When using the reconstruction method, the success rate and the detecting time were 95 % and 0.729 sec, respectively and those results were improved by about 7.6 % and 0.25 sec in comparison to the results of the paper of Ahmed and Ashton-Miller. The results showed that the proposed reconstruction method of the internal model was efficient to improve the detecting performance of the algorithm.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.13 no.3
• /
• pp.103-109
• /
• 2013

Miller-Rabin method is the most prevalently used primality test. However, this method mistakenly reports a Carmichael number or semi-prime number as prime (strong lier) although they are composite numbers. To eradicate this problem, it selects k number of m, whose value satisfies the following : m=[2,n-1], (m,n)=1. The Miller-Rabin method determines that a given number is prime, given that after the computation of $n-1=2^sd$, $0{\leq}r{\leq}s-1$, the outcome satisfies $m^d{\equiv}1$(mod n) or $m^{2^rd}{\equiv}-1$(mod n). This paper proposes a step-by-step primality testing algorithm that restricts m=2, hence achieving 98.8% probability. The proposed method, as a first step, rejects composite numbers that do not satisfy the equation, $n=6k{\pm}1$, $n_1{\neq}5$. Next, it determines prime by computing $2^{2^{s-1}d}{\equiv}{\beta}_{s-1}$(mod n) and $2^d{\equiv}{\beta}_0$(mod n). In the third step, it tests ${\beta}_r{\equiv}-1$ in the range of $1{\leq}r{\leq}s-2$ for ${\beta}_0$ > 1. In the case of ${\beta}_0$ = 1, it retests m=3,5,7,11,13,17 sequentially. When applied to n=[101,1000], the proposed algorithm determined 96.55% of prime in the initial stage. The remaining 3% was performed for ${\beta}_0$ >1 and 0.55% for ${\beta}_0$ = 1.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.3
• /
• pp.93-100
• /
• 2007

Since Koblitz and Miller suggested the use of elliptic curves in cryptography, there has been an extensive literature on elliptic curve cryptosystem (ECC). The use of ECC is based on the observation that the points on an elliptic curve form an additive group under point addition operation. To realize secure cryptosystems using these groups, it is very important to find an elliptic curve whose group order is divisible by a large prime, and also to find a base point whose order equals this prime. While there have been many dramatic improvements on finding an elliptic curve and computing its group order efficiently, there are not many results on finding an adequate base point for a given curve. In this paper, we propose an efficient method to find a random base point on an elliptic curve defined over $GF(p^m)$. We first show that the critical operation in finding a base point is exponentiation. Then we present efficient algorithms to accelerate exponentiation in $GF(p^m)$. Finally, we implement our algorithms and give experimental results on various practical elliptic curves, which show that the new algorithms make the process of searching for a base point 1.62-6.55 times faster, compared to the searching algorithm based on the binary exponentiation.

• Journal of the Korean Data and Information Science Society
• /
• v.27 no.4
• /
• pp.979-991
• /
• 2016

Measuring nation images was a challenging task when employing offline surveys was the only option. It was not only prohibitively expensive, but too much time-consuming and therefore unfitted to this rapidly changing world. Although demands for monitoring real-time nation images were ever-increasing, an affordable and reliable solution to measure nation images has not been available up to this date. The researcher in this study developed a semi-automatic ontology construction algorithm, named "double-crossing double keyword collection (or DCDKC)" to measure nation images from Wikipedia in real-time. The ontology, WikiOnto, can be used to reflect dynamic image changes. In this study, an instance of WikiOnto was constructed by applying the algorithm to the big-three exporting countries in East Asia, Korea, Japan, and China. Then, the numbers of page views for words in the instance of WikiOnto were counted. A collection of the counting for each country was compared to each other to inspect the possibility to use for dynamic nation images. As for the conclusion, the result shows how the images of the three countries have changed for the period the study was performed. It confirms that DCDKC can very well be used for a real-time nation-image monitoring system.