• Title/Summary/Keyword: state assignment

Search Result 177, Processing Time 0.025 seconds

Efficient Peer Assignment for Low-Latency Transmission of Scalable Coded Images

  • Su, Xiao;Wang, Tao
    • Journal of Communications and Networks
    • /
    • v.10 no.1
    • /
    • pp.79-88
    • /
    • 2008
  • In this paper, we propose efficient peer assignment algorithms for low-latency transmission of scalable coded images in peer-to-peer networks, in which peers may dynamically join and leave the networks. The objective of our algorithm is to minimize the transmission time of a requested image that is scalable coded. When an image is scalable coded in different bit rates, the bit stream encoded in a lower bit rate is a prefix subset of the one encoded in a higher bit rate. Therefore, a peer with the same requested image coded in any bit rate, even when it is different from the requested rate, may work as a supplying peer. As a result, when a scalable coded image is requested, more supplying peers can be found in peer-to-peer networks to help with the transfer. However, the set of supplying peers is not static during transmission, as the peers in this set may leave the network or finish their transmission at different times. The proposed peer assignment algorithms have taken into account the above constraints. In this paper, we first prove the existence of an optimal peer assignment solution for a simple identity permutation function, and then formulate peer assignment with this identity permutation as a mixed-integer programming problem. Next, we discuss how to address the problem of dynamic peer departures during image transmission. Finally, we carry out experiments to evaluate the performance of proposed peer assignment algorithms.

Eigenstructure Assignment Method for a Dynamical System with Unknown Disturbances (외란이 있는 동적시스템의 고유구조지정 제어 기법)

  • 최재원;홍금식;이만형;양경진
    • Proceedings of the Korean Society of Precision Engineering Conference
    • /
    • 1996.11a
    • /
    • pp.230-235
    • /
    • 1996
  • Eigenstructure (eigenvalues/eigenvectors) assignment has been shown to be a useful tool for flight control system design. In the sense of the eigenstructure assignment, the effectiveness and disturbance suppressibility of a controller depend mainly on the left eigenstructure (eigenvalues/left eigenvectors) of a system. On the other hand, the disturbance decouplability is governed by the right eigenstructure (eigenvalues/right eigenvectors) of the system. In this paper, in order to obtain a disturbance decouplable as well as effective and disturbance suppressible controller, a concurrent assignment methodology of the left and right eigenstructures is proposed. The biorthogonality condition between the left and right modal matrices of a system as well as the relations between the achievable right modal matrix and state selection matrices are used to develop the methodology. The proposed concurrent eigenstructure assignment methodology guarantees that the desired eigenvalues are achieved exactly and the desired left and right eigenvectors are assigned to the best possible(achievable) sets of eigenvectors in the least square sense, respectively. The proposed design methodology is applied to designing a lateral flight control system for an L-1011 aircraft with disturbances.

  • PDF

The Robust Servo Controller Design of Magnetic Levitation System Considering Pole Assignment Region (극 배치영역을 고려한 자기 부상계의 로버스트 서보제어기 설계)

  • Kim, C.H.;Jeong, H.J.;Yang, J.H.
    • Journal of Power System Engineering
    • /
    • v.4 no.4
    • /
    • pp.84-91
    • /
    • 2000
  • This paper describes a state feedback controller design method of the integral type magnetic levitation servo system which satisfies the design objectives. The design objective is a $H_{\infty}$ performance, asymptotic disturbance rejection and a robust pole assignment in linear matrix inequality(LMI) region. To the end, we investigated the validity of the designed controller which considering a robust pole assignment region, through results of simulation.

  • PDF

Elastic Demand Stochastic User Equilibrium Assignment Based on a Dynamic System (동적체계기반 확률적 사용자균형 통행배정모형)

  • Im, Yong-Taek
    • Journal of Korean Society of Transportation
    • /
    • v.25 no.4
    • /
    • pp.99-108
    • /
    • 2007
  • This paper presents an elastic demand stochastic user equilibrium traffic assignment that could not be easily tackled. The elastic demand coupled with a travel performance function is known to converge to a supply-demand equilibrium, where a stochastic user equilibrium (SUE) is obtained. SUE is the state in which all equivalent path costs are equal, and thus no user can reduce his perceived travel cost. The elastic demand SUE traffic assignment can be formulated based on a dynamic system, which is a means of describing how one state develops into another state over the course of time. Traditionally it has been used for control engineering, but it is also useful for transportation problems in that it can describe time-variant traffic movements. Through the Lyapunov Function Theorem, the author proves that the model has a stable solution and confirms it with a numerical example.

상태궤환을 이용한 2차원 시스템의 극배치

  • 이원규;이상혁
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.15 no.8
    • /
    • pp.659-666
    • /
    • 1990
  • Curing recent years, several state-space models describing discrete two dimensional systems are proposed. In this paper, we consider the problem of pole assignment of two dimensional systems using state feedback, based on state-space model proposed by Roessser. The design procedure is seperated into two steps. in thie first step, the sufficient condition for off diagonal matrix of the input transformed system to be zero is derived and in the second step, it is shown that the pole assignment problem of two dimensional systems is divided into the one of two 1-dimensional systems. Finally, a numerical example for illustrating the technique is given.

  • PDF

Systematic Current Control Strategy with Pole Assignment for Grid-Connected LCL-Filtered Inverters

  • Xu, Jinming;Xie, Shaojun;Tang, Ting
    • Journal of Power Electronics
    • /
    • v.13 no.3
    • /
    • pp.447-457
    • /
    • 2013
  • For grid-connected LCL-filtered inverters, resonance yields instability and low bandwidth. As a result, careful designs are required. This paper presents a systematic current control structure, where pole assignment consisting of one or more feedbacks is the inner loop, and the outer loop is the direct grid current control. Several other issues are discussed, such as the inner-loop feedback choices, pole-assignment algorithms, robustness and harmonic rejection. Generally, this kind of strategy has three different types according to the inner-loop feedback choices. Among them, a novel pole-assignment algorithm has been proposed, where the inner control maintains four freely-assigned poles which are just two pairs of conjugated poles located at the fundamental and resonance frequencies separately. It has been found that with the different types, the steady-state and dynamic performances are quite different. Finally, simulations and experiments have been provided to verify the control and design of the proposed methods.

An Optimal State-Code Assignment Algorithm of Sequential Circuits for VLSI Design Automation Systems (VLSI 설계자동화 시스템을 위한 순서회로의 최적상태코드 할당 알고리듬)

  • Lim, Jae-Yun;Lim, In-Chil
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.1
    • /
    • pp.104-112
    • /
    • 1989
  • A design automation method for sequential circuits implementation by mans of PLA is discussed, and an optimal state-code assignment algorithm to minimize the PLA area is proposed. In order to design sequential circuit automatically, DASL (Design Automation Support Language) [8] which is easy to describe and powerful to synthesize, is proposed and used to describe sequential circuit, An optimal statecode assignment algorithm which considers next states and outputs simultaneously is proposed, and by adopting this algorithm to various examples, the area of PLA is reduced by 10% comparing privious methods. This system is constructed to design microinstruction, FSM, VLSI control part synthesis.

  • PDF

An Unequal Protection FEC Scheme for Video over Optical Access Networks

  • Cao, Yingying;Chen, Xue;Wang, Liqian;Li, Xicong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.7 no.6
    • /
    • pp.1463-1479
    • /
    • 2013
  • In this paper, we propose an unequal protection physical coding sub-layer (PCS) forward error correction (FEC) scheme for efficient and high-quality transmission of video data over optical access networks. Through identifying and resolving the unequal importance of different video frames and passing this importance information from MAC-layer to PCS, FEC scheme of PCS can be adaptive to application-layer data. Meanwhile, we jointly consider the different channel situations of optical network unit (ONU) and improve the efficiency of FEC redundancy by channel adaptation. We develop a theoretical algorithm and a hardware method to achieve efficient FEC assignment for the proposed unequal protection scheme. The theoretical FEC assignment algorithm is to obtain the optimal FEC redundancy allocation vector that results in the optimum performance index, namely frame error rate, based on the identified differential importance and channel situations. The hardware method aims at providing a realistic technical path with negligible hardware cost increment compared with the traditional FEC scheme. From the simulation results, the proposed Channel and Application-layer data Adaptation Unequal Protection (CAAUP) FEC scheme along with the FEC ratio assignment algorithm and the hardware method illustrates the ability of efficient and high-quality transmission of video data against the random errors in the channel of optical access networks.

Joint wireless and computational resource allocation for ultra-dense mobile-edge computing networks

  • Liu, Junyi;Huang, Hongbing;Zhong, Yijun;He, Jiale;Huang, Tiancong;Xiao, Qian;Jiang, Weiheng
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.14 no.7
    • /
    • pp.3134-3155
    • /
    • 2020
  • In this paper, we study the joint radio and computational resource allocation in the ultra-dense mobile-edge computing networks. In which, the scenario which including both computation offloading and communication service is discussed. That is, some mobile users ask for computation offloading, while the others ask for communication with the minimum communication rate requirements. We formulate the problem as a joint channel assignment, power control and computational resource allocation to minimize the offloading cost of computing offloading, with the precondition that the transmission rate of communication nodes are satisfied. Since the formulated problem is a mixed-integer nonlinear programming (MINLP), which is NP-hard. By leveraging the particular mathematical structure of the problem, i.e., the computational resource allocation variable is independent with other variables in the objective function and constraints, and then the original problem is decomposed into a computational resource allocation subproblem and a joint channel assignment and power allocation subproblem. Since the former is a convex programming, the KKT (Karush-Kuhn-Tucker) conditions can be used to find the closed optimal solution. For the latter, which is still NP-hard, is further decomposed into two subproblems, i.e., the power allocation and the channel assignment, to optimize alternatively. Finally, two heuristic algorithms are proposed, i.e., the Co-channel Equal Power allocation algorithm (CEP) and the Enhanced CEP (ECEP) algorithm to obtain the suboptimal solutions. Numerical results are presented at last to verify the performance of the proposed algorithms.

LQR/Eigenstructure assignment design with an application to a flight control system (고유구조 지정 기능을 갖는 LQR 설계및 비행제어시스템에의 응용)

  • Park, Jae weon;Seo, Young-Bong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.3
    • /
    • pp.280-288
    • /
    • 1998
  • In this paper, a novel relation between the weighting matrix Q in LQR and the eigenstructure of the desired closed-loop system is proposed. Thus, the state feedback gain with the desired eigenstructure in the LQR can be obtained. The proposed scheme is applied to design a simple 3rd-order system and a flight control system design to show the usefulness of the scheme.

  • PDF