• Transactions on Electrical and Electronic Materials
• /
• v.15 no.6
• /
• pp.309-314
• /
• 2014

This work proposes an integrated high frequency divider with an inductive peaking technique implemented in a current mode logic (CML) frequency divider. The proposed divider is composed with a master-slave flip-flop, and the master-slave flip-flop acts as a latch and read circuits which have the differential pair and cross-coupled n-MOSFETs. The cascode bias is applied in an inductive peaking circuit as a current source and the cascode bias is used for its high current driving capability and stable frequency response. The proposed divider is designed with $0.18-{\mu}m$ CMOS process, and the simulation used to evaluate the divider is performed with phase-locked loop (PLL) circuit as a feedback circuit. A divide-by-two operation is properly performed at a high frequency of 20 GHz. In the output frequency spectrum of the PLL, a peak frequency of 2 GHz is obtained witha divide-by-eight circuit at an input frequency of 250 MHz. The reference spur is obtained at -64 dBc and the power consumption is 13 mW.

• Korean Journal of Mathematics
• /
• v.6 no.2
• /
• pp.221-229
• /
• 1998

Let $k$ be a real abelian field and $k_{\infty}$ be its $\mathbb{Z}_p$-extension for an odd prime $p$. Let $A_n$ be the Sylow $p$-subgroup of the ideal class group of $k_n$, the $nth$ layer of the $\mathbb{Z}_p$-extension. By using the main conjecture of Iwasawa theory, we have the following: If $p$ does not divide $\prod_{{{\chi}{\in}\hat{\Delta}_k},{\chi}{\neq}1}B_{1,{\chi}{\omega}^{-1}$, then $A_n$ = {0} for all $n{\geq}0$, where ${\Delta}_k=Gal(k/\mathbb{Q})$ and ${\omega}$ is the Teichm$\ddot{u}$ller character for $p$. The converse of this statement does not hold in general. However, we have the following when $k$ is of prime conductor $q$: Let $q$ be an odd prime different from $p$. and let $k$ be a real subfield of $\mathbb{Q}({\zeta}_q)$. If $p{\mid}{\prod}_{{\chi}{\in}\hat{\Delta}_{k,p},{\chi}{\neq}1}B_{1,{\chi}{\omega}}-1$, then $A_n{\neq}\{0\}$ for all $n{\geq}1$, where ${\Delta}_{k,p}$ is the $Gal(k_{(p)}/\mathbb{Q})$ and $k_{(p)}$ is the decomposition field of $k$ for $p$.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.44 no.9
• /
• pp.1-9
• /
• 2007

For an efficient implementation of cryptosystems based on arithmetic in a finite field $GF(2^n)$, their hardware implementation is an important research topic. To construct a multiplier with low area complexity, the divide-and-conquer technique such as the original Karatsuba-Ofman method and multi-segment Karatsuba methods is a useful method. Leone proposed an efficient parallel multiplier with low area complexity, and Ernst at al. proposed a multiplier of a multi-segment Karatsuba method. In [1], the authors proposed new $MSK_5$ and $MSK_7$ methods with low area complexity to improve Ernst's method. In [3], the authors proposed a method which combines $MSK_2$ and $MSK_3$. In this paper we propose an efficient multiplication method by combining $MSK_2,\;MSK_3\;and\;MSK_5$ together. The proposed method reduces $116{\cdot}3^l$ gates and $2T_X$ time delay compared with Gather's method at the degree $25{\cdot}2^l-2^l with l>0.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.6
• /
• pp.673-679
• /
• 2014

The important requirements of designing a pattern classifier are high throughput and low memory requirements, and low cost hardware implementation. A pattern classifier by using Multiple Attractor Cellular Automata(MACA) proposed by Maji et al. reduced the complexity of the classification algorithm from $O(n^3)$ to O(n) by using Dependency Vector(DV) and Dependency String(DS). In this paper, we generate a pattern classifier using LFSR to improve efficiently the space and time complexity and we propose a method for finding DV by using the 0-basic path. Also we investigate DV and the attractor of the generated pattern classifier. We can divide an n-bit DS by m number of $DV_i$ s and generate various pattern classifiers.

• Journal of Platform Technology
• /
• v.6 no.1
• /
• pp.3-8
• /
• 2018

This paper proposes a technique for recognizing online handwritten cursive data obtained by tracing a motion trajectory while a user is in the 3D space based on a convolution neural network (CNN) algorithm. There is a difficulty in recognizing the virtual character input by the user in the 3D space because it includes both the character stroke and the movement stroke. In this paper, we divide syllable into consonant and vowel units by using labeling technique in addition to the result of localizing letter stroke and movement stroke in the previous study. The coordinate information of the separated consonants and vowels are converted into image data, and Korean handwriting recognition was performed using a convolutional neural network. After learning the neural network using 1,680 syllables written by five hand writers, the accuracy is calculated by using the new hand writers who did not participate in the writing of training data. The accuracy of phoneme-based recognition is 98.9% based on convolutional neural network. The proposed method has the advantage of drastically reducing learning data compared to syllable-based learning.

• 제어로봇시스템학회:학술대회논문집
• /
• 1999.10a
• /
• pp.278-280
• /
• 1999

This paper proposes controlling of temperature in an oven by using 4 bits Integral - Cycle Binary Rate Modulation (IBRM) method and ac line with frequency 50 Hz. Microcontroller MCS-51 controls IBRM according to Proportional Integral controller (PI) function. Discrete signals are used in the system modeled by using Ziegler Nichols principle for analyzing the stability before designing the system. This procedure makes it easy to investigate system response. The system is implemented by 4 bits digital circuit which gives 320 patterns of ac signal fur controlling the generation of energy for 3,000 watts thermal coil every 20 ms of each cycle. We divide scan time (Ts$\sub$n/) in to 20 intervals, 1 ms interval is selected to generate 16 patterns IBRM. Because of this method gives the ripple lower than 2% it generates less noise fur system. Moreover, we can consider whole system from the time model of control procedure and IBRM algorithm at 40-200$^{\circ}C$ with ${\pm}$ 1$^{\circ}C$ error in the 1 cubic meter oven.

• International Journal of Advanced Culture Technology
• /
• v.4 no.2
• /
• pp.7-18
• /
• 2016

The first D2C-era web-real variety show in Korea was broadcast via tvN of CJ E&M. The web-real variety program 'SinSeoYuGi' accumulated 54 million views, along with 50 million views at the Chinese portal site QQ. This study carries out an analysis using text mining that extracts portal site blogs, twitter page views and associative terms. In addition, this study derives viewers' response by extracting key words with opinion mining techniques that divide positive words, neutral words and negative words through customer sentiment analysis. It is found that the success factors of the web-real variety were reduced in appearance fees and production cost, harmony between actual cast members and scenario characters, mobile TV programing, and pre-roll advertising. It is expected that web-real variety broadcasting will increase in value as web contents in the future, and be established as a new genre with the job of 'technical marketer' growing as well.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.10 no.5
• /
• pp.962-966
• /
• 2009

In this paper, N-way resistance power divider is described for wideband frequency characteristic. For this, we derived in design equation of a N-way resistance power divider using 3-way resistance power divider. We designed 8-way resistance power divider that can divide same power by 7 output and measurement result of fabricated resistance power divider is observed to prove the validity of derived design equation. Fabricated resistance power divider shown equal power division ratio and reflection loss displayed excellent characteristic by about -25dB in broadband from DC to 3GHz.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.20 no.4
• /
• pp.455-462
• /
• 2010

We investigate the worst case complexity regarding the number of comparisons for a simple and stable merging algorithm. The complexity analysis shows that the algorithm performs O(mlog(n/m)) comparisons for two sequences of sizes m and n $m{\leq}n$. So, according to the lower bound for merging $\Omega$(mlog(n/m)), the algorithm is asymptotically optimal regarding the number of comparisons. For proving the worst case complexity we divide the domain of all inputs into two disjoint cases. For either of these cases we will extract a special subcase and prove the asymptotic optimality for these two subcases. Using this knowledge for special cases we will prove the optimality for all remaining cases. By using this approach we give a transparent solution for the hardly tractable problem of delivering a clean complexity analysis for the algorithm.

• 한국HCI학회:학술대회논문집
• /
• 2009.02a
• /
• pp.232-239
• /
• 2009

Emerging social networking services provide a new paradigm for human-to-human communication. However, these services are centralized and managed by single service provider. In this paper, we propose MicroPost, a decentralized event notification service architecture for social applications based on publish/subscribe model. In our design space, event brokers are structured as an overlay network which provides the substrate of distributed peer-to-peer lookup service for storing and retrieving subscriptions with hashed keys. Event clients interact with event brokers to publish or subscribe social messages over the wide-area network. Using XML standards, we present an efficient algorithm to forward events for rendezvous-based matching in this paper. In our design space, the cost of routing is O(${\omega}log_kN$), where N is the number of event brokers, ${\omega}$ is the number of meta-data obtained from event messages, and k is a constant, which is selected by our design, to divide the identifier space and to conquer the lookup of given key. Consequently, what we achieved is an asynchronous social messaging service architecture which is decentralized, efficient, scalable, and flexible.