• Title/Summary/Keyword: delay space

Search Result 637, Processing Time 0.032 seconds

A Fractional Model Reduction for T-S Fuzzy Systems with State Delay

  • Yoo Seog-Hwan;Choi Byung-Jae
    • International Journal of Fuzzy Logic and Intelligent Systems
    • /
    • v.6 no.3
    • /
    • pp.184-189
    • /
    • 2006
  • This paper deals with a fractional model reduction for T-S fuzzy systems with time varying delayed states. A contractive coprime factorization of time delayed T-S fuzzy systems is defined and obtained by solving linear matrix inequalities. Using generalized controllability and observability gramians of the contractive coprime factor, a balanced state space realization of the system is derived. The reduced model will be obtained by truncating states in the balanced realization and an upper bound of model approximation error is also presented. In order to demonstrate efficacy of the suggested method, a numerical example is performed.

Congestion Control in ATM Networks Using Mixed-LQR

  • Song, Hae-Seok;Seo, Young-Bong;Choi, Jae-Weon
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2001.10a
    • /
    • pp.57.1-57
    • /
    • 2001
  • The objectives of congestion control in ATM (Asynchronous Transfer Mode) networks are maximum utilization of network resources, acceptable level of low cell loss and fairness among all VCs (Virtual Connections). In this paper, we present a congestion control algorithm which is based on state space model, The proposed controller uses optimal control algorithms (LQR, Mixed-LQR), where control parameters can be designed to ensure the stability of the control loop in a control theoretic sense, over the propagation delay. We show how the control mechanism can be used to design a controller to support ABR service based on feedback of explicit rates. Simulation results are presented to substantiate our claim.

  • PDF

Performance Analysis of Pseudorange Error in STAP Beamforming Algorithm for Array Antenna

  • Lee, Kihoon;So, Hyungmin;Song, Kiwon
    • Journal of Positioning, Navigation, and Timing
    • /
    • v.3 no.2
    • /
    • pp.37-44
    • /
    • 2014
  • The most effective method to overcome GPS jamming problem is to use an adaptive array antenna which has the capability of beamforming or nulling to a certain direction. In this paper, Space Time Adaptive Processing (STAP) beamforming algorithm of four elements array antenna will be designed and the anti-jamming performance will be analyzed. According to the analysis, the signal to noise ratio (SNR) and anti-jamming performance can be enhanced by beamforming algorithm. Also, the time tap effect of STAP algorithm will be analyzed theoretically and verified with array antenna modeling and simulation. Specially, the cautious selection of reference time tap in STAP can prevent the degradation of position accuracy performance.

Optimal Collision-Avoidance Task Planning for Dual-Arm Using Neural Network (신경회로망을 이용한 Dual-Arm 로봇의 충돌회피 최적작업계획)

  • 최우형;신행봉;윤대식;문병갑;한성현
    • Proceedings of the Korean Society of Machine Tool Engineers Conference
    • /
    • 2001.04a
    • /
    • pp.244-249
    • /
    • 2001
  • Collision free task planning for dual-arm robot which perform many subtasks in a common work space can be achieved in two steps : path planning and trajectory planning. Path planning finds the order of tasks for each robot to minimize path lengths as well as to avoid collision with static obstacles. A trajectory planning strategy is to let each robot move along its path as fast as possible and delay one robot at its initial position or reduce speed at the middle of its path to avoid collision with the other robot.

  • PDF

Path Loss Characteristics in Subway Platform at 2.45GHz Band (2.45GHz 대역의 지하철 플랫폼에서 경로손실 특성)

  • 최낙일;공민한;강영진;송문규
    • Proceedings of the IEEK Conference
    • /
    • 2003.07a
    • /
    • pp.318-321
    • /
    • 2003
  • In this paper, path loss and delay profile characteristics are measured in the subway platform. To evaluate the fading characteristics of the measured signals, the standard deviations are computed. The standard deviation is bigger for shorter distance. The shorter the distance, the bigger the phase difference between direct wave and reflected waves according the distance, which results in heavy fading. To compute the path loss according to distance, the average values of path loss exponent(n) is evaluated. The path loss exponents measured in the subway environment for Omni-VP(omni-directional vertical polarization) antenna and CP(circular polarization) antenna are 1.418 and 1.680, respectively, which are considerably less than 2.0, the free space path loss exponent.

  • PDF

Fault Diagnosis of Ball Bearing using Correlation Dimension (상관차원에 의한 볼베어링 고장진단)

  • 김진수;최연선
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 2004.05a
    • /
    • pp.979-984
    • /
    • 2004
  • The ball bearing having faults generally shows, nonlinear vibration characteristics. For the effective method of fault diagnosis on bail bearing, non-linear diagnostic methods can be used. In this paper, the correlation dimension analysis based on nonlinear timeseries was applied to diagnose the faults of ball bearing. The correlation dimension analysis shows some Intrinsic information of underlying dynamical systems, and clear the classification of the fault of ball bearing.

  • PDF

HPC(High Performance Computer) Linux Clustering for UltraSPARC(64bit-RISC processor) (UltraSPARC(64bit-RISC processor)을 위한 고성능 컴퓨터 리눅스 클러스터링)

  • 김기영;조영록;장종권
    • Proceedings of the IEEK Conference
    • /
    • 2003.11b
    • /
    • pp.45-48
    • /
    • 2003
  • We can easily buy network system for high performance micro-processor, progress computer architecture is caused of high bandwidth and low delay time. Coupling PC-based commodity technology with distributed computing methodologies provides an important advance in the development of single-user dedicated systems. Lately Network is joined PC or workstation by computers of high performance and low cost. Than it make intensive that Cluster system is resembled supercomputer. Unix, Linux, BSD, NT(Windows series) can use Cluster system OS(operating system). I'm chosen linux gain low cost, high performance and open technical documentation. This paper is benchmark performance of Beowulf clustering by UltraSPARC-1K(64bit-RISC processor). Benchmark tools use MPI(Message Passing Interface) and NetPIPE. Beowulf is a class of experimental parallel workstations developed to evaluate and characterize the design space of this new operating point in price-performance.

  • PDF

A Fractional Model Reduction for Linear Systems with State Delay (상태변수 시간지연을 갖는 선형시스템의 분수 모델 축소)

  • Yoo, Seog-Hwan
    • Journal of the Institute of Electronics Engineers of Korea SC
    • /
    • v.41 no.2
    • /
    • pp.29-36
    • /
    • 2004
  • This paper deals with a fractional model reduction for linear systems with time varying delayed states. A contractive coprime factorization of linear time delayed systems is defined and obtained by solving linear matrix inequalities. Using generalize controllability and observability gramians of tile contractive coprime factor, a balanced state space realization of the system is derived. The reduced model will be obtained by truncating states in the balanced realization and an upper bound of model approximation error is also presented. In order to demonstrate efficacy of the suggested method, a numerical example is illustrated.

Low Latency Systolic Multiplier over GF(2m) Using Irreducible AOP (기약 AOP를 이용한 GF(2m)상의 낮은 지연시간의 시스톨릭 곱셈기)

  • Kim, Kee-Won;Han, Seung-Chul
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.4
    • /
    • pp.227-233
    • /
    • 2016
  • Efficient finite field arithmetic is essential for fast implementation of error correcting codes and cryptographic applications. Among the arithmetic operations over finite fields, the multiplication is one of the basic arithmetic operations. Therefore an efficient design of a finite field multiplier is required. In this paper, two new bit-parallel systolic multipliers for $GF(2^m)$ fields defined by AOP(all-one polynomial) have proposed. The proposed multipliers have a little bit greater space complexity but save at least 22% area complexity and 13% area-time (AT) complexity as compared to the existing multipliers using AOP. As compared to related works, we have shown that our multipliers have lower area-time complexity, cell delay, and latency. So, we expect that our multipliers are well suited to VLSI implementation.

Location-awareness based Hybrid P2P System (위치 인식 기반 계층형 P2P 시스템)

  • Min, Su-Hong;Cho, Dong-Sub
    • Proceedings of the KIEE Conference
    • /
    • 2007.04a
    • /
    • pp.448-450
    • /
    • 2007
  • Peer-to-Peer system has emerged as a popular model aiming at further utilizing Internet information and resources, complementing the available client-server services. However, the mechanism of peers randomly choosing logical neighbors without any knowledge about underlying physical location aware topology can cause serious performance degradation. In this paper, we consider the network distance between peers so that it helps peers select neighbors located at the nearest when they exchange queries for sharing of resources. To reduce the unnecessary signaling traffic and delay of query exchange, we propose a location aware topology based Hybrid P2P system. This system calculates the network distance which combines the direct measurement such as RTT (Round Trip Time) with geographic space of peers using IP address

  • PDF