• Title/Summary/Keyword: 설계행렬

Search Result 723, Processing Time 0.025 seconds

Observer Design for Linear Neutral Systems with Time-Varying Delays (시변 시간 지연을 포함하는 선형 뉴트럴 시스템의 관측기 설계)

  • Song, Min-Kook;Joo, Young-Hoon;Park, Jin-Bae
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.17 no.4
    • /
    • pp.483-487
    • /
    • 2007
  • This paper is concerned with the observer design problem for linear neutral systems with time-varying delays. The problem addressed is that of designing a full-order observer that guarantees the exponential stability of the error system. An effective algebraic matrix equation approach is developed to solve this problem. In particular, both observer analysis and design problems are investigated. Sufficient conditions for a linear neutral system to be stable are first established. Furthermore, an illustrative example is used to demonstrate the validity of the proposed design procedure.

Hardware and Software Co-Design Platform for Energy-Efficient FPGA Accelerator Design (에너지 효율적인 FPGA 가속기 설계를 위한 하드웨어 및 소프트웨어 공동 설계 플랫폼)

  • Lee, Dongkyu;Park, Daejin
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.1
    • /
    • pp.20-26
    • /
    • 2021
  • Recent systems contain hardware and software components together for faster execution speed and less power consumption. In conventional hardware and software co-design, the ratio of software and hardware was divided by the designer's empirical knowledge. To find optimal results, designers iteratively reconfigure accelerators and applications and simulate it. Simulating iteratively while making design change is time-consuming. In this paper, we propose a hardware and software co-design platform for energy-efficient FPGA accelerator design. The proposed platform makes it easy for designers to find an appropriate hardware ratio by automatically generating application program code and hardware code by parameterizing the components of the accelerator. The co-design platform based on the Vitis unified software platform runs on a server with Xilinx Alveo U200 FPGA card. As a result of optimizing the multiplication accelerator for two matrices with 1000 rows, execution time was reduced by 90.7% and power consumption was reduced by 56.3%.

The 64-Bit Scrambler Design of the OFDM Modulation for Vehicles Communications Technology (차량 통신 기술을 위한 OFDM 모듈레이션의 64-비트 스크램블러 설계)

  • Lee, Dae-Sik
    • Journal of Internet Computing and Services
    • /
    • v.14 no.1
    • /
    • pp.15-22
    • /
    • 2013
  • WAVE(Wireless Access for Vehicular Environment) is new concepts and Vehicles communications technology using for ITS(Intelligent Transportation Systems) service by IEEE standard 802.11p. Also it increases the efficiency and safety of the traffic on the road. However, the efficiency of Scrambler bit computational algorithms of OFDM modulation in WAVE systems will fall as it is not able to process in parallel in terms of hardware and software. This paper proposes an algorithm to configure 64-bits matrix table in scambler bit computation as well as an algorithm to compute 64-bits matrix table and input data in parallel. The proposed algorithm on this thesis is executed using 64-bits matrix table. In the result, the processing speed for 1 and 1000 times is improved about 40.08% ~ 40.27% and processing rate per sec is performed more than 468.35 compared to bit operation scramble. And processing speed for 1 and 1000 times is improved about 7.53% ~ 7.84% and processing rate per sec is performed more than 91.44 compared to 32-bits operation scramble. Therefore, if the 64 bit-CPU is used for 64-bits executable scramble algorithm, it is improved more than 40% compare to 32-bits scrambler.

Path-based Dynamic User Equilibrium Assignment Model using Simulation Loading Method (시뮬레이션 부하기법을 이용한 경로기반 동적통행배정모형의 개발)

  • 김현명;임용택;백승걸
    • Journal of Korean Society of Transportation
    • /
    • v.19 no.3
    • /
    • pp.101-113
    • /
    • 2001
  • Since late 1970s. one of the principal research areas in transportation problem is dynamic traffic assignment (DTA). Although many models have been developed regarding DTA, yet they have some limits of describing real traffic patterns. This reason comes from the fact that DTA model has the time varying constraints such as state equation, flow propagation constraint, first in first out(FIFO) rule and queuing evolution. Thus, DTA model should be designed to satisfy these constraints as well as dynamic route choice condition, dynamic user equilibrium. In this respect, link-based DTA models have difficulty in satisfying such constraints because they have to satisfy the constraints for each link, while path-based DTA models may easily satisfy them. In this paper we develop a path-based DTA model. The model includes point queue theory to describe the queue evolution and simulation loading method for depicting traffic patterns in more detail. From a numerical test, the model shows promising results.

  • PDF

On Optimizing Dissimilarity-Based Classifications Using a DTW and Fusion Strategies (DTW와 퓨전기법을 이용한 비유사도 기반 분류법의 최적화)

  • Kim, Sang-Woon;Kim, Seung-Hwan
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.47 no.2
    • /
    • pp.21-28
    • /
    • 2010
  • This paper reports an experimental result on optimizing dissimilarity-based classification(DBC) by simultaneously using a dynamic time warping(DTW) and a multiple fusion strategy(MFS). DBC is a way of defining classifiers among classes; they are not based on the feature measurements of individual samples, but rather on a suitable dissimilarity measure among the samples. In DTW, the dissimilarity is measured in two steps: first, we adjust the object samples by finding the best warping path with a correlation coefficient-based DTW technique. We then compute the dissimilarity distance between the adjusted objects with conventional measures. In MFS, fusion strategies are repeatedly used in generating dissimilarity matrices as well as in designing classifiers: we first combine the dissimilarity matrices obtained with the DTW technique to a new matrix. After training some base classifiers in the new matrix, we again combine the results of the base classifiers. Our experimental results for well-known benchmark databases demonstrate that the proposed mechanism achieves further improved results in terms of classification accuracy compared with the previous approaches. From this consideration, the method could also be applied to other high-dimensional tasks, such as multimedia information retrieval.

Comparison Study of H-infinity Controller Design Algorithms for Spacecraft Attitude Control (인공위성 자세제어를 위한 H-infinity 제어기 설계 알고리즘 비교 연구)

  • Rhee, Seung-Wu
    • Journal of the Korean Society for Aeronautical & Space Sciences
    • /
    • v.44 no.1
    • /
    • pp.57-69
    • /
    • 2016
  • There are three kinds of algorithms(2-ARE, mu-synthesis, LMI) for controller design using closed-loop shaping method. This paper provides the summary of background theory of three algorithms and $H_{\infty}$ controller design results for spacecraft attitude control using the three controller design tools of Matlab$^{TM}$ Toolbox for comparison. As a result, it reveals that LMI design method is more reliable as well as easier than others for spacecraft attitude control design. Comparison results are as follow: 2-ARE method and LMI method provide almost same results in robust stability, robust performance and control authority level. But 2-ARE method is more sensitive than LMI method with respect to proper design of weighting functions: 2-ARE method is more difficult than LMI method in weighting function design. The design result of mu-synthesis method shows worse performance and requires bigger control authority than others.

A Study on the Highly Parallel Multiple-Valued Logic Circuit Design using by the DCG (DCG에 의한 고속병렬다치논리회로설계에 관한 연구)

  • 변기녕;최재석;박춘명;김흥수
    • Journal of the Korean Institute of Telematics and Electronics C
    • /
    • v.35C no.6
    • /
    • pp.20-29
    • /
    • 1998
  • This paper proposes the algorithms that design the highly parallel multiple-valued logic curcuit and assign the code to each node of DCG(Directed Cyclic Graph) of length 1. The conventional Nakajima's algorithm have some problems, so this paper introduce the matrix equation from DCG of length 1 and proposes circuit design algorithms according to the DCG of length 1. Using the proposed circuit design algorithms in this paper, it become realized that was not able to design from Nakajima's algorithm. Also, making a comparision between the circuit design using Nakajima's algorithm and this paper's, we testify that proposed paper's algorithm is able to realize more optimized circuit design. According to proposed curcuit design algorithm in this paper, it is possible to design curcuit that DCG have natural number, so it have the following advantages; reduction of the curcuit input/output digits, simplification of curcuit composition, reduction of computation time and cost. And we show compatibility and verification about this paper's algorithm.

Effect of complex sample design on Pearson test statistic for homogeneity (복합표본자료에서 동질성검정을 위한 피어슨 검정통계량의 효과)

  • Heo, Sun-Yeong;Chung, Young-Ae
    • Journal of the Korean Data and Information Science Society
    • /
    • v.23 no.4
    • /
    • pp.757-764
    • /
    • 2012
  • This research is for comparison of test statistics for homogeneity when the data is collected based on complex sample design. The survey data based on complex sample design does not satisfy the condition of independency which is required for the standard Pearson multinomial-based chi-squared test. Today, lots of data sets ara collected by complex sample designs, but the tests for categorical data are conducted using the standard Pearson chi-squared test. In this study, we compared the performance of three test statistics for homogeneity between two populations using data from the 2009 customer satisfaction evaluation survey to the service from Gyeongsangnam-do regional offices of education: the standard Pearson test, the unbiasedWald test, and the Pearsontype test with survey-based point estimates. Through empirical analyses, we fist showed that the standard Pearson test inflates the values of test statistics very much and the results are not reliable. Second, in the comparison of Wald test and Pearson-type test, we find that the test results are affected by the number of categories, the mean and standard deviation of the eigenvalues of design matrix.

Design of User Clustering and Robust Beam in 5G MIMO-NOMA System Multicell (5G MIMO-NOMA 시스템 멀티 셀에서의 사용자 클러스터링 및 강력한 빔 설계)

  • Kim, Jeong-Su;Lee, Moon-Ho
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.18 no.1
    • /
    • pp.59-69
    • /
    • 2018
  • In this paper, we present a robust beamforming design to tackle the weighted sum-rate maximization (WSRM) problem in a multicell multiple-input multiple-output (MIMO) - non-orthogonal multipleaccess (NOMA) downlink system for 5G wireless communications. This work consider the imperfectchannel state information (CSI) at the base station (BS) by adding uncertainties to channel estimation matrices as the worst-case model i.e., singular value uncertainty model (SVUM). With this observation, the WSRM problem is formulated subject to the transmit power constraints at the BS. The objective problem is known as on-deterministic polynomial (NP) problem which is difficult to solve. We propose an robust beam forming design which establishes on majorization minimization (MM) technique to find the optimal transmit beam forming matrix, as well as efficiently solve the objective problem. In addition, we also propose a joint user clustering and power allocation (JUCPA) algorithm in which the best user pair is selected as a cluster to attain a higher sum-rate. Extensive numerical results are provided to show that the proposed robust beamforming design together with the proposed JUCPA algorithm significantly increases the performance in term of sum-rate as compared with the existing NOMA schemes and the conventional orthogonal multiple access (OMA) scheme.

Robust and Non-fragile H Controller Design Algorithm for Time-delayed System with Randomly Occurring Uncertainties and Disturbances ) (임의발생 불확실성 및 외란을 고려한 시간지연시스템의 강인비약성 H 제어기 설계 알고리듬)

  • Yang, Seung Hyeop;Paik, Seung Hyun;Lee, Jun Yeong;Park, Hong Bae
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.52 no.12
    • /
    • pp.89-98
    • /
    • 2015
  • This paper provides a robust and non-fragile $H_{\infty}$ controller design algorithm for time-delayed systems with randomly occurring polytopic uncertainties and disturbances. First, we design time-delayed system considering randomly occurring uncertainties and disturbances. Next, The sufficient condition for the existence of robust and non-fragile $H_{\infty}$ controller is presented by LMI(linear matrix inequality) using Lyapunov stability analysis and $H_{\infty}$ performance measure. Since the obtained condition can be expressed as a PLMI(parameterized linear matrix inequality) by changes of variables and Schur complement, all solutions including controller gain, degrees of controller satisfying non-fragility, $H_{\infty}$ norm bound ${\gamma}$ can be calculated simultaneously. Finally, numerical examples are given to illustrate the performance and the effectiveness of the proposed robust and non-fragile $H_{\infty}$ controller compared with the deterministic uncertainty model even though there exists randomly occurring uncertainties, disturbances and time delays.