• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2003년도 ICCAS
• /
• pp.468-472
• /
• 2003

The lifting technique is a standard control procedure that is commonly applied to dual-rate systems, where a critical difficulty is that care must be taken so that the resulting equivalent system preserves the causality constraint between the control signal and the measured output. To overcome this difficulty, the most attractive result has been suggested by defining control time sequences as the union of sample and hold time sequences. However, the sacrifice of regular control period scheme results in some serious disadvantages; restrictions on the implementation to hardware and the corresponding inefficient control scheme. On the contrary, this paper proposes a novel dual-rate control technique, which redescribes the system as a control-rate-based system having regular control period and designs the controller, with no causality constraint, through Linear Matrix Inequality (LMI) formulation.

• 대한수학회보
• /
• 제52권2호
• /
• pp.409-419
• /
• 2015

The concept of Cayley-symmetric semigroups is introduced, and several equivalent conditions of a Cayley-symmetric semigroup are given so that an open problem proposed by Zhu [19] is resolved generally. Furthermore, it is proved that a strong semilattice of self-decomposable semigroups $S_{\alpha}$ is Cayley-symmetric if and only if each $S_{\alpha}$ is Cayley-symmetric. This enables us to present more Cayley-symmetric semi-groups, which would be non-regular. This result extends the main result of Wang [14], which stated that a regular semigroup is Cayley-symmetric if and only if it is a Clifford semigroup. In addition, we discuss Cayley-symmetry of Rees matrix semigroups over a semigroup or over a 0-semigroup.

• 대한수학회지
• /
• 제48권2호
• /
• pp.301-309
• /
• 2011

Let R = $Mat_2(F)$ be the ring of all 2 by 2 matrices over a finite field F, X the set of all nonzero, nonunits of R and G the group of all units of R. After investigating some properties of orbits under the left (and right) regular action on X by G, we show that the graph automorphisms group of $\Gamma(R)$ (the zero-divisor graph of R) is isomorphic to the symmetric group $S_{|F|+1}$ of degree |F|+1.

• 호남수학학술지
• /
• 제41권4호
• /
• pp.725-744
• /
• 2019

In this paper we introduce some new types of double difference sequence spaces defined by a new definition of convergence of double sequences and a double series with the help of sequence of Orlicz functions and a four dimensional bounded regular matrices A = (a_rtkl). We also make an effort to study some topological properties and inclusion relations between these sequence spaces. Finally, we compute the closed ideals in the space 𝑙²_∞.

• International Journal of Control, Automation, and Systems
• /
• 제6권4호
• /
• pp.515-525
• /
• 2008

In this paper, the problem of delay-dependent stabilization for singular systems with multiple internal and external incommensurate constant point delays is investigated. The condition when a singular system subject to point delays is regular independent of time delays is given and it can be easily test with numerical or algebraic methods. Based on Lyapunov-Krasovskii functional approach and the descriptor integral-inequality lemma, a sufficient condition for delay-dependent stability is obtained. The main idea is to design multiple memoryless state feedback control laws such that the resulting closed-loop system is regular independent of time delays, impulse free, and asymptotically stable via solving a strict linear matrix inequality (LMI) problem. An explicit expression for the desired memoryless state feedback control laws is also given. Finally, a numerical example illustrates the effectiveness and the availability for the proposed method.

• ETRI Journal
• /
• 제29권3호
• /
• pp.381-389
• /
• 2007

In this paper we propose a graph-theoretic method based on linear congruence for constructing low-density parity check (LDPC) codes. In this method, we design a connection graph with three kinds of special paths to ensure that the Tanner graph of the parity check matrix mapped from the connection graph is without short cycles. The new construction method results in a class of (3, ${\rho}$)-regular quasi-cyclic LDPC codes with a girth of 12. Based on the structure of the parity check matrix, the lower bound on the minimum distance of the codes is found. The simulation studies of several proposed LDPC codes demonstrate powerful bit-error-rate performance with iterative decoding in additive white Gaussian noise channels.

• 대한전기학회논문지:시스템및제어부문D
• /
• 제49권7호
• /
• pp.399-406
• /
• 2000

We propose an nonlinear demodulation algorithm for undersampled multicomponent AM(Amplitude Modulation), FM(Frequency Modulation) and AM-FM signals. First, we derive respectively undersampling frequency of the AM, FM and AM-FM using undersampling scheme, and separate respectively monocomponent signals from multicomponent signals using periodic algebraic separation algorithm. In this case augmented separation matrix is very regular and sparse, it has a special structure. The proposed demodulation algorithm detects respectively message signals of the IA(Instantaneous Amplitude) and IF(Instantaneous Frequency) from descrete monocomponent AM, FM and AM-FM signals with an undersampling frequency to be controllable. Verifying the RMS(Root Mean Squares) errors of the detected signals, we show that the performance is excellent.

• 제어로봇시스템학회논문지
• /
• 제15권8호
• /
• pp.812-817
• /
• 2009

In this paper, a new method to design sliding surfaces using eigenstructure assignment is proposed. Most conventional methods for constructing the surfaces require special form like canonical or regular canonical form of system matrices. But the proposed method can be applied to arbitrary system matrices. Futhermore, the surface matrix, C can be decided for the matrix multiplication, CB to have a designated form. SVD is used to decide desirable eigenvectors explicitly. To verify the proposed algorithm, a sliding mode controller for a multivariable system with matched uncertainty is constructed. The controller is designed to guarantee minimum approach velocity to the sliding surface.

• 한국통신학회논문지
• /
• 제21권12호
• /
• pp.3256-3264
• /
• 1996

This paper presents an efficient VLSI architecture for transposing matris in high speed. In the case of transposing N*N matrix, N$^{2}$ numbers of transposition cells are configured as regular and spuare shaped structure, and pipeline structure for operating each transposition cell in paralle. Transposition cell consists of register and input data selector. The characteristic of this architecture is that the data to be transposed are divided into several bundles of bits, then processed serially. Using the serial transposition of divided input data, hardware complexity of transpositioncell can be reduced, and routing between adjacent transposition cells can be simple. the proposed architecture is designed and implemented with 0.5 .mu.m VLSI library. As a result, it shows stable operation in 200 MHz and less hardware complexity than conventional architectures.

• Transactions on Electrical and Electronic Materials
• /
• 제2권3호
• /
• pp.1-6
• /
• 2001

A simulation method is proposed to study the amorphous structure of carbon nitride. The material properties of a non-uniform nitrogen distribution in an amorphous CN matrix can be studied. The cohesive energy of a group of randomly generated atoms can be minimized to find the relative positions of atoms. From the calculated configuration of atoms, many properties of amorphous carbon nitride can be calculated such as bulk modulus, P-V curve, sp$^3$/sp$^2$ ratio of carbon, and vibrational spectra. The calculation shows that the cohesive energy of non-uniform nitrogen distribution is lower than that of a uniform distribution. This may suggest that the regular structure of carbon nitride can at most be metastable. It is not easy to incorporate nitrogen atoms into a carbon matrix.