• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.3
• /
• pp.263-269
• /
• 1999

In this paper, an unifying design algorithm is presented for efficient digital implementation of continuous PID controller using general discrete orthogonal functions. The proposed algorithm is an algebraic method to determine controller parameters, which can unify controller design procedures divided into three ways. A set of linear equations for the controller design are derived from simple algebraic transformation based on general discrete orthogonal functions. By solving these equations, all of the controller parameters can be determined directly and simultaneously, which thus makes the design procedure systematic and straightforward. It does not involve any trial and error procedure, hence the difficulty of conventional approach can be avoided. The simulation results and discussions are given to demonstrate the efficiency of the proposed method.

• Journal of the Korean Mathematical Society
• /
• v.45 no.6
• /
• pp.1613-1622
• /
• 2008

Let G be a graph with vertex set V(G) and edge set E(G), and let g, f be two nonnegative integer-valued functions defined on V(G) such that $g(x)\;{\leq}\;f(x)$ for every vertex x of V(G). We use $d_G(x)$ to denote the degree of a vertex x of G. A (g, f)-factor of G is a spanning subgraph F of G such that $g(x)\;{\leq}\;d_F(x)\;{\leq}\;f(x)$ for every vertex x of V(F). In particular, G is called a (g, f)-graph if G itself is a (g, f)-factor. A (g, f)-factorization of G is a partition of E(G) into edge-disjoint (g, f)-factors. Let F = {$F_1$, $F_2$, ..., $F_m$} be a factorization of G and H be a subgraph of G with mr edges. If $F_i$, $1\;{\leq}\;i\;{\leq}\;m$, has exactly r edges in common with H, we say that F is r-orthogonal to H. If for any partition {$A_1$, $A_2$, ..., $A_m$} of E(H) with $|A_i|=r$ there is a (g, f)-factorization F = {$F_1$, $F_2$, ..., $F_m$} of G such that $A_i\;{\subseteq}E(F_i)$, $1\;{\leq}\;i\;{\leq}\;m$, then we say that G has (g, f)-factorizations randomly r-orthogonal to H. In this paper it is proved that every (0, mf - (m - 1)r)-graph has (0, f)-factorizations randomly r-orthogonal to any given subgraph with mr edges if $f(x)\;{\geq}\;3r\;-\;1$ for any $x\;{\in}\;V(G)$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.9C
• /
• pp.889-896
• /
• 2006

The crest factor distribution of orthogonal frequency division multiplexing (OFDM) symbol sequences is evaluated and it is shown that OFDM symbol sequences with a short period are expected to have a high crest factor. The crest factor relationship between two input symbol sequences, Hamming distance D apart is also derived. Using these two results, we propose two criteria for a phase sequence set of the selected mapping (SLM) scheme and suggest the rows of the cyclic Hadamard matrix constructed from an m-sequence as the near optimal phase sequence set of the SLM scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.8
• /
• pp.2003-2012
• /
• 1996

The 16- and 32-state Trellis-coded M-ary 4-dimensional (4-D) orthogonal modulation scheme with a frequency-reuse technique have been investigated. Here, 5 coded bits form a rate 4/5 convolutional encoder provide 32 possible symbols. Then the signals are mapped by a M-ary 4-D orthogonal modulator, where each signal has equal energy and is PSK modulated. In the M-ary 4-D modulator, we have employed the vectors which is derived by the optimization technique of signal waveforms in a 4-D sphere. This technique is usedin maximizing the minimum Euclidean distance between a set of signal poits on a multidimensional sphere. By combinig trellis coding with M-ary 4-D modulation and proper set-partitioning, we have obtained a considerable impeovement in the free minimum distance of the system over an AWGN channel. The 16-state scheme obtains coding gains up to 5.5 dB over the uncoded two-independent QPSK scheme and 2.5 dB over the two-independent 2-D TCM scheme. And, the 32-state scheme obtains coding gains up to 6.4 dB over the uncoded two-independent QPSK schemeand 3.4 dB over the two-independent 2-D TCM scheme.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.46.4-46
• /
• 2002

This study was motivated how it might be possible to validate structured sampling with orthogonal array for optimal design of a pin. The Taguchi method by orthogonal array, one of the structured sampling methods, has much advantage that is row cost and time saving for experiments. But this method has been applied in limited areas especially for mechanical problems. In this study, we experimented whether the structured sampling is useful for applying optimal design of mechanical elements. For the experiment, we first set up a mechanical problem which was related to determining optimal parameters associated a pin's crack occurred inside a hole. We, then, calculated combination of...

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.2C
• /
• pp.174-180
• /
• 2007

In the tone reservation (TR) scheme, it is known that the set of randomly selected peak reduction tones (PRT's) performs better than the contiguous PRT set and the interleaved PRT set in the PAPR reduction of orthogonal frequency division multiplexing (OFDM). It is also known that finding the optimal PRT set corresponds to the secondary peak minimization problem in the TR scheme. However, the problem cannot be solved for the practical number of tones since it is NP-hard. In this paper, a new search algorithm for the near optimal PRT set is proposed based on the fact that the secondary peak value of the PRT set statistically tends to decrease asthe variance of the PRT set decreases.

• Journal of information and communication convergence engineering
• /
• v.2 no.3
• /
• pp.187-192
• /
• 2004

A method using two dimension Haar functions approximation for solving the problem of a partial differential equation and estimating the parameters of a non-linear distributed parameter system (DPS) is presented. The applications of orthogonal functions, including Haar functions, and their transforms have been given much attention in system control and communication engineering field since 1970's. The Haar functions set forms a complete set of orthogonal rectangular functions similar in several respects to the Walsh functions. The algorithm adopted in this paper is that of estimating the parameters of non-linear DPS by converting and transforming a partial differential equation into a simple algebraic equation. Two dimension Haar functions approximation method is introduced newly to represent and solve a partial differential equation. The proposed method is supported by numerical examples for demonstration the fast, convenient capabilities of the method.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.35S no.2
• /
• pp.22-30
• /
• 1998

In this paper, we analyze CDMA systems using M-orthogonal spreading codes. We assume that each user one set of M-orthogonal spreading codes allocated randomaly. The effect of multiple access interference from the reference and adjacent cells is considered slowly frequency selective rayleigh fading channels. and the adjacent cells interference is considered toanalyze the system performance. We calculate bit error rate and the maximum number of users whoe can communicate simulaneously within a cell by suing Rake receiver. By comparing CDMA systemwhich transmits 1 bit/spreding code, our system shows bit error rate decreases as M increases under the same bandwidth and infromation rate.

• Journal of applied mathematics & informatics
• /
• v.6 no.2
• /
• pp.669-684
• /
• 1999

We are interested in the problem of fitting a curve to a set of points in the plane in such a way that the sum of the squares of the orthogonal distances to given data points ins minimized. In[1] the prob-lem of fitting circles and ellipses was considered and numerically solved with general purpose methods. Especially in [2] H. Spath proposed a special purpose algorithm (Spath's ODF) for parabolas y-b=$c($\chi$-a)^2$ and for rotated ones. In this paper we present another parabola fitting algorithm which is slightly different from Spath's ODF. Our algorithm is mainly based on the steepest descent provedure with the view of en-suring the convergence of the corresponding quadratic function Q(u) to a local minimum. Numerical examples are given.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2004.10a
• /
• pp.11-18
• /
• 2004

In this paper, an efficient model reduction scheme is presented for large scale dynamic systems. The method is founded on a modal analysis in which optimal eigenvalue is extracted from time samples of the given system response. The techniques we discuss are based on classical theory such as the Karhunen-Loeve expansion. Only recently has it been applied to structural dynamics problems. It consists in obtaining a set of orthogonal eigenfunctions where the dynamics is to be projected. Practically, one constructs a spatial autocorrelation tensor and then performs its spectral decomposition. The resulting eigenfunctions will provide the required proper orthogonal modes(POMs) or empirical eigenmodes and the correspondent empirical eigenvalues (or proper orthogonal values, POVs) represent the mean energy contained in that projection. The purpose of this paper is to compare the reduced order model using Karhunen-Loeve expansion with the full model analysis. A cantilever beam and a simply supported plate subjected to sinusoidal force demonstrated the validity and efficiency of the reduced order technique by K-L method.