• Proceedings of the KIPE Conference
• /
• 2003.07a
• /
• pp.5-9
• /
• 2003

Conventional variable-speed Induction motor drives with inverters are subject to detrimental effect of zero-sequence voltages, such a shaft voltage and bearing current. This paper presents a way of the suppression of the zero-sequence components in multilevel H-bridge inverters. First examined Is the inherent zero-sequence characteristic of the conventional subharmonic PW method. Then it is shown that the zero-sequence voltage can be eliminated with proper -selection of switching states with space vector modulation. Although this method alone restricts the linear modulation range of control, a combination of the proposed method and the minimum switching method appears to be effective in suppressing the zero-sequence voltage to minimum level while maintaining the linear control range.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.13 no.1
• /
• pp.133-140
• /
• 2018

In this paper we discover the generation principle of a sequence when the characteristic polynomial of the sequence is a power of a primitive polynomial. With the generation principle, we can rearrange a sequence. Also we get the linear complexity and the required term of the sequence efficiently.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.10
• /
• pp.507-511
• /
• 2005

We have derived the linear complexity of a binary sequence generated by a Feedback with Carry Shift Regiater(FCSR) under the following condition: q is a power of a prime such that $q=r^e,\;(e{\geq}2)$ and r=2p+1, where both r and p are 2-prime. Also, a summation generator creates sequence from addition with carry of LFSR(Linear Feedback Shift Register) sequences. Similarly, it is possible to generate keystream by bitwise exclusive-oring on two FCSR sequences. In this paper, we described the cryptographic properties of a sequence generated by the FCSRs in view of the linear complexity.

• Journal of the Korean Statistical Society
• /
• v.31 no.4
• /
• pp.483-490
• /
• 2002

A weak convergence is obtained for a linear process of the form (equation omitted) where {$\varepsilon$$_{t}$ } is a strictly stationary sequence of associated random variables with E$\varepsilon$$_{t}$ = 0 and E$\varepsilon$$^{^2}$$_{t}$ < $\infty$ and {a $_{j}$ } is a sequence of real numbers with (equation omitted). We also apply this idea to the case of linearly positive quadrant dependent sequence.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.5C
• /
• pp.595-600
• /
• 2004

In this paper, we propose a new simple scheme of layered nonlinear feedforward logic (NLFFL) overlaid on a linear feedback shift resistor (LFSR) to generate pseudonoise sequences, which have good balance property and large linear complexity. This method guarantee noiselike statistics without any designed connection scheme e.g. Langford arrangement.

• Agricultural and Biosystems Engineering
• /
• v.2 no.1
• /
• pp.15-23
• /
• 2001

On the assumption that the voices of the cows are produced by the linear prediction filter, we characterized the cows’voices. The order of this filter was determined by examining the voice characteristics both in time and frequency domains. The proposed order of the linear prediction filter is 15 for modeling voice production of the cow. The characteristics of the amplitude envelope of the voice signal was investigated by analyzing the sequence of the short time variance both in time and frequency domains, and the new parameters were defined. One of the coefficients o the linear prediction filter generating the voice signal, the fundamental frequency, the slope of the straight line regressed from the log-log spectra of the short time variance and the coefficients of the linear prediction filter generating the sequence of the short time variance of the voice signal can differentiate the two cows.

• Communications of the Korean Mathematical Society
• /
• v.23 no.1
• /
• pp.133-140
• /
• 2008

Let {${\xi}_k,\;k\;{\in}\;{\mathbb{Z}}$} be a strictly stationary associated sequence of H-valued random variables with $E{\xi}_k\;=\;0$ and $E{\parallel}{\xi}_k{\parallel}^2\;<\;{\infty}$ and {$a_k,\;k\;{\in}\;{\mathbb{Z}}$} a sequence of linear operators such that ${\sum}_{j=-{\infty}}^{\infty}\;{\parallel}a_j{\parallel}_{L(H)}\;<\;{\infty}$. For a linear process $X_k\;=\;{\sum}_{j=-{\infty}}^{\infty}\;a_j{\xi}_{k-j}$ we derive that {$X_k} fulfills the functional central limit theorem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.10
• /
• pp.2283-2291
• /
• 2010

The shrinking generator which is one of clock-controlled generator is a very simple generator with good cryptographic properties. A nonlinear sequence generator based on two 90/150 maximum length cellular automata can generate pseudorandom sequences at each cell of cellular automata whose characteristic polynomials are same. The nonlinear sequence generated by cellular automata has a larger period and a higher linear complexity than shrunken sequence generated by LFSRs. In this paper we analyze shrunken-interleaved sequence based on 90/150 maximum length cellular automata. We show that the sequence generated by nonlinear sequence generator based on cellular automata belongs to the class of interleaved sequence. And we give an effective algorithm for reconstructing unknown bits of output sequence based on intercepted keystream bits.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.37 no.7
• /
• pp.498-509
• /
• 1988

A BF(breadth-first) linear quadtree as a new data structure for image data is suggested, which enables us to compress the image data efficiently and to make operations of the compressed data easily. It is a list of path names for black nodes as the linear quadtree is. The path name for each black node of a BF linear quadtree is represented as a sequence of path codes from the root node to itself, whereas that of linear quadtree as a sequence of path codes from the root node to itself and fill characters for cut-offed path from it to any n-level node which corresponds to a pixel of an image. The BF linear quadtree provides a more efficent compression ratio than the linear quadtree does, because the former does not require redundant characters, fill characters, for the cut-offed paths. Several operations for image processing can be also implemented on this hierarchical structure efficiently, because it is composed of only the black nodes ad the linear quadtree is . In this paper, algorithms for several operations on the BF linear quadtree are defined and analyzed. Experimental results for forur image data are also given and discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 1994.10a
• /
• pp.7-12
• /
• 1994

This paper describes an outline of pseudorandom M-sequence and its applications to measurement and control engineering. At first, generation and properties of M-sequence is briefly described and then its applications to delay time measurement, information transmission by use of M-array, two dimensional positioning, fault detection of logical circuit, fault detection of RAM, linear and nonlinear system identification.