• 전기의세계
• /
• v.30 no.9
• /
• pp.579-581
• /
• 1981

A rendezvous method via delayed state feedback is presented for a class of linear systems with time-delays. The property of pointwise degeneracy of delay differential system is utilized and it is shown that the controller is a minimun-time suboptimal controller.

• 대한임상약리학회:학술대회논문집
• /
• 2007.11a
• /
• pp.82-83
• /
• 2007

See Full Text

• Proceedings of the KIEE Conference
• /
• 1987.07a
• /
• pp.760-763
• /
• 1987

• Journal of Communications and Networks
• /
• v.11 no.2
• /
• pp.148-156
• /
• 2009

The fixed spectrum assignment policy in today's wireless networks leads to inefficient spectrum usage. Cognitive radio network is a new communication paradigm that enables the unlicensed users to opportunistically use the spatio-temporally unoccupied portions of the spectrum, and hence realizing a dynamic spectrum access (DSA) methodology. Interference temperature model proposed by Federal Communications Commission (FCC) permits the unlicensed users to utilize the licensed frequencies simultaneously with the primary users provided that they adhere to the interference temperature constraints. In this paper, we formulate two NP-hard optimal scheduling methods that meet the interference temperature constraints for cognitive radio networks. The first one maximizes the network throughput, whereas the second one minimizes the scheduling delay. Furthermore, we also propose suboptimal schedulers with linear complexity, referred to as maximum frequency selection (MFS) and probabilistic frequency selection (PFS). We simulate the throughput and delay performance of the optimal as well as the suboptimal schedulers for varying number of cognitive nodes, number of primary neighbors for each cognitive node, and interference temperature limits for the frequencies. We also evaluate the performance of our proposed schedulers under both additive white gaussian noise (AWGN) channels and Gilbert-Elliot fading channels.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.12 no.5
• /
• pp.577-584
• /
• 2009

Fusion of decisions in wireless sensor networks having flexibility on energy efficiency is studied in this paper. Two representative distributions, the generalized Gaussian and $\alpha$-stable probability density functions, are used to model non-Gaussian noise channels. By incorporating noise channels into the parallel fusion model, the optimal fusion rules are represented and suboptimal fusion rules are derived by using a large signal-to-noise ratio(SNR) approximation. For both distributions, the obtained suboptimal fusion rules are same and have equivalent form to the Chair-Varshney fusion rule(CVR). Thus, the CVR does not depend on the behavior of noise distributions that belong to the generalized Gaussian and $\alpha$-stable probability density functions. The simulation results show the suboptimality of the CVR at large SNRs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.15 no.5
• /
• pp.384-398
• /
• 1990

This paper compares and shows the characteristics of various PWM strategies used to generate pulse signals of voltage source inverter. We designed the inverter using PTR and constituted the variable speed drive (VSD) system. For each PWM strategy, acoustic noise level, line-to-line voltage and current waveform, and current harmonic spectrum are measured with respect to the VSD of induction motor. The Suboptimal PWM strategy showed the similar harmonic effects to those of the Optimal PWM strategy. In addition, the microprocessor application was available to the former. The TP PWM strategy was excellent in that it could reduce the CPU load and increase the output voltage since the strategy could control only two phase of the three.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.10A
• /
• pp.974-983
• /
• 2007

In this paper, a low complexity subcarrier allocation scheme is proposed for multiuser MIMO-OFDM systems with zero-forcing beamformer (ZFBF) so that the total transmit power can be minimized satisfying given target data rate. Since the optimal method requires very high computational complexity, we propose a low complextiy suboptimal method. Using the fact that the effective channel gain is proportional to the orthogonallity of channels of multiplexed users, a user set with the highest orthogonality of channel among users is assigned to each subcarrier in order to minimize required transmit power. The numerical results show that the proposed suboptimal method can reduce computational complexity with little performance loss.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.8 no.11
• /
• pp.4087-4102
• /
• 2014

Two-way relaying is an effective way of improving system spectral efficiency by making use of physical layer network coding. However, energy efficiency in OFDM-based bidirectional relaying with asymmetric traffic requirement has not been investigated. In this study, we focused on subcarrier transmission mode selection, bit loading, and power allocation in a multicarrier single amplified-and-forward relay system. In this scheme, each subcarrier can operate in two transmission modes: one-way relaying and two-way relaying. The problem is formulated as a mixed integer programming problem. We adopt a structural approximation optimization method that first decouples the original problem into two suboptimal problems with fixed subcarrier subsets and then finds the optimal subcarrier assignment subsets. Although the suboptimal problems are nonconvex, the results obtained for a single-tone system are used to transform them to convex problems. To find the optimal subcarrier assignment subsets, an iterative algorithm based on subcarrier ranking and matching is developed. Simulation results show that the proposed method can improve system performance compared with conventional methods. Some interesting insights are also obtained via simulation.

• Journal of Institute of Control, Robotics and Systems
• /
• v.12 no.5
• /
• pp.411-418
• /
• 2006

There are mainly two types of bang-bang controllers for nominal linear time-invariant (LTI) system. Optimal bang-bang controller is designed based on optimal control theory and suboptimal bang-bang controller is obtained by using Lyapunov stability condition. In this paper, the suboptimal bang-bang control method is extended to LTI system involving both control input saturation and structured real parameter uncertainties by using Lyapunov robust stability condition. Two robust optimal bang-bang controllers are derived by minimizing the time derivative of Lyapunov function subjected to the limit of control input. The one is developed based on the classical quadratic stability(QS), and the other is developed based on the affine quadratic stability(AQS). And characteristics of the two controllers are compared. Especially, bounds of parameter uncertainties which theoretically guarantee robust stability of the two controllers are compared quantitatively for 1DOF vibrating system. Moreover, the validity of robust optimal bang-bang controller based on the AQS is shown through numerical simulations for this system.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.10
• /
• pp.3831-3851
• /
• 2015

This paper is concerned with the problem of joint resource allocation and user-pairing in virtual MIMO SC-FDMA systems to improve service quality of experience (QoE). No-reference logarithmic model is introduced to quantify service experience for each user and the objective is to maximize sum of all user's mean of score (MOS). We firstly formulate the optimal problem into an S-dimensional (S-D) assignment problem. Then, to solve this problem, the modified Lagrangian relaxation algorithm is deduced to obtain the suboptimal result of joint user-paring and subchannel allocation. The merits of this solution are as follows. First, the gap between its results and the global optimal one can be quantified and controlled by balancing the complexity and accuracy, which merit the other suboptimal algorithms do not have. Secondly, it has the polynomial computational complexity and the worst case complexity is O(3LN³), where L is the maximum iteration time and N is the number of subchannels. Simulations also prove that our proposed algorithm can effectively improve quality of experience and the gap between our proposed and the optimal algorithms can be controlled below 8%.