• Title/Summary/Keyword: Deterministic algorithm

Search Result 330, Processing Time 0.023 seconds

Development of an Application for Reliability Testing on Controller Area Network (차량네트워크상 신뢰성 테스트를 위한 애플리케이션 개발)

  • Kang, Ho-Suk;Choi, Kyung-Hee;Jung, Gi-Hyun
    • The KIPS Transactions:PartD
    • /
    • v.14D no.6
    • /
    • pp.649-656
    • /
    • 2007
  • Today, controller area network(CAN) is a field bus that is nowadays widespread in distributed embedded systems due to its electrical robustness, low price, and deterministic access delay. However, its use safety-critical applications has been controversial due to dependability limitation, such as those arising from its bus topology. Thus it is important to analyze the performance of the network in terms of load of data bus, maximum time delay, communication contention, and others during the design phase of the controller area network. In this paper, a simulation algorithm is introduced to evaluate the communication performance of the vehicle network and apply software base fault injection techniques. This can not only reduce any erratic implementation of the vehicle network but it also improves the reliability of the system.

The Development of FlexRay Driver for Vehicle Network System (자동차 네트워크 시스템을 위한 FlexRay 드라이버 개발)

  • Koo, Yong-Je;Kim, Jong-Chul;Shin, Choong-Yup;Park, Sang-Jong
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.16 no.6
    • /
    • pp.546-552
    • /
    • 2010
  • As the demands for the safety and convenience applications of the vehicles increase, the data load for the In-vehicle Network has increased significantly. As a result, a deterministic and fault-tolerant communication system is required to implement the safety critical applications such as X-by-wire systems. FlexRay communication system is a new standard of network communication system which provides the high speed serial communication, time triggered bus and fault tolerant communication between electronic devices. In addition to time-triggered communication, as providing of the event-triggered communication such as CAN, FlexRay protocol is able to manage the restricted communication resource more effectively. This paper presents the development of FlexRay driver which will be applied to the future ECU's communication system. To develop the FlexRay driver, the FlexRay requirement specification and FlexRay specification is analyzed. The developed FlexRay driver is implemented by using MPC5567 microprocessor of the Freescale semiconductor. To verify the developed FlexRay driver, the waveform of the FlexRay driver was measured and compared with the CAN communication system. As a result, the bus load is reduced about 13% compared with the CAN communication system.

Decision of Error Tolerance in Sonar Array by the Monte-Carlo Method (Monte-Carlo 방법에 의한 소나배열 소자의 허용오차 규정)

  • 김형동;이용범;이준영
    • The Journal of the Acoustical Society of Korea
    • /
    • v.21 no.3
    • /
    • pp.221-229
    • /
    • 2002
  • In thin paper, error tolerance of each array element which satisfies error tolerance of beam pattern is decided by using the Monte-Carlo method. Conventional deterministic method decides the error tolerance of each element from the acceptance pattern by testing all cases, but this method is not suitable for the analysis of large number of array elements because the computation resources increase exponentially as the number of array elements increases. To alleviate this problem, we applied new algorithm which reduces the increment of calculation time increased by the number of the array elements. We have validates the determined error tolerance region through several simulation.

An recognition of printed chinese character using neural network (신경망을 이용한 인쇄체 한자의 인식)

  • 이성범;오종욱;남궁재찬
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.18 no.9
    • /
    • pp.1269-1282
    • /
    • 1993
  • In this paper, we propose to method of recognizing printed chinese characters which combine the coventional deterministic methods and the neural networks. Firstly, we extract four directional vector of strokes from chinese characters. Secondly, we make the mesh of the center of gravity in the vector and then constitute the H x8 feature matrix using black pixel lenth from each meshs. This normalized feature matrix value offer as the input of neural network for classifying into the 14 character types. And this calssified character classify again into Busu group by the Busu recognizing neural network. Finally, we recognize each characters using the distance of similarity between input characters and reference characters. The usefulness of the proposed algorithm is evaluated by experimenting with recognizing the chinese characters.

  • PDF

Registration of Aerial Image with Lines using RANSAC Algorithm

  • Ahn, Y.;Shin, S.;Schenk, T.;Cho, W.
    • Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
    • /
    • v.25 no.6_1
    • /
    • pp.529-536
    • /
    • 2007
  • Registration between image and object space is a fundamental step in photogrammetry and computer vision. Along with rapid development of sensors - multi/hyper spectral sensor, laser scanning sensor, radar sensor etc., the needs for registration between different sensors are ever increasing. There are two important considerations on different sensor registration. They are sensor invariant feature extraction and correspondence between them. Since point to point correspondence does not exist in image and laser scanning data, it is necessary to have higher entities for extraction and correspondence. This leads to modify first, existing mathematical and geometrical model which was suitable for point measurement to line measurements, second, matching scheme. In this research, linear feature is selected for sensor invariant features and matching entity. Linear features are incorporated into mathematical equation in the form of extended collinearity equation for registration problem known as photo resection which calculates exterior orientation parameters. The other emphasis is on the scheme of finding matched entities in the aide of RANSAC (RANdom SAmple Consensus) in the absence of correspondences. To relieve computational load which is a common problem in sampling theorem, deterministic sampling technique and selecting 4 line features from 4 sectors are applied.

Minimizing Sensing Decision Error in Cognitive Radio Networks using Evolutionary Algorithms

  • Akbari, Mohsen;Hossain, Md. Kamal;Manesh, Mohsen Riahi;El-Saleh, Ayman A.;Kareem, Aymen M.
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.9
    • /
    • pp.2037-2051
    • /
    • 2012
  • Cognitive radio (CR) is envisioned as a promising paradigm of exploiting intelligence for enhancing efficiency of underutilized spectrum bands. In CR, the main concern is to reliably sense the presence of primary users (PUs) to attain protection against harmful interference caused by potential spectrum access of secondary users (SUs). In this paper, evolutionary algorithms, namely, particle swarm optimization (PSO) and genetic algorithm (GA) are proposed to minimize the total sensing decision error at the common soft data fusion (SDF) centre of a structurally-centralized cognitive radio network (CRN). Using these techniques, evolutionary operations are invoked to optimize the weighting coefficients applied on the sensing measurement components received from multiple cooperative SUs. The proposed methods are compared with each other as well as with other conventional deterministic algorithms such as maximal ratio combining (MRC) and equal gain combining (EGC). Computer simulations confirm the superiority of the PSO-based scheme over the GA-based and other conventional MRC and EGC schemes in terms of detection performance. In addition, the PSO-based scheme also shows promising convergence performance as compared to the GA-based scheme. This makes PSO an adequate solution to meet real-time requirements.

Determining the shortest paths by using the history of IP network traffic records (IP 네트워크에서 트래픽 레코드를 이용한 최단 거리 결정 기법)

  • Hong, Sung-Hyuck
    • Journal of Digital Convergence
    • /
    • v.10 no.4
    • /
    • pp.223-228
    • /
    • 2012
  • There are many algorithms to improve the network traffic and to avoid losing packets in the network. This paper proposed determining the shortest paths for hops, which are in the middle of the source and destination. The shortest path in this paper means the fastest path between them. Recently, dynamic routing algorithm is currently used now but this paper suggests the fastest paths between the source and the destination is by using the record of the network traffic history. People are using the networking and the network traffic is always corresponding to how many people use the networking in specific time. Therefore, I can predict the network condition by referring to the history of network traffic record, and then the shortest path can be produced without using RIP too much. It will be helpful to improve the network traffic.

Model Fitting using an Active Surface with Global Detormations (전역 변형을 갖는 활성곡면을 사용한 모델 적합)

  • Kim, Dong-Geun;Choe, Jeung-Won;Hwang, Chi-Jeong
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.3
    • /
    • pp.792-801
    • /
    • 1997
  • In this paper we propose an algorithm which fits a surface to noise-corrupted data points using an aceive sur-vace with global deformations.It is 3-dimensional surface extension of our precious works on 2-dimensional curve modell[11,12].We use fimite differences,and represent shapes of surface as global transfromation suring evolution based on the ballon [odel[2,3]which allows partial inflation or deflation by using niegborhood'sextermal foreces on each node points.At first,we make local deformations based on the balloon [odel,and then the blobal transformation from the surface before deformations to the defomed surface is calcualted by the deterministic lest squre method,finally we apply the global transformation to the surface before deformations.In experiments we fit a surface(elliposid,B-spline)to noise-corrupted 3D data points using the active surface with affine deformations.

  • PDF

Iterative Decoding Performance for Gray Coded QAM Signals with I/Q Phase Unbalance (I/Q 위상 불균형을 동반한 Gray 부호화된 QAM 신호의 반복 복호 성능)

  • Kim Ki-Seol;Park Sang-Kyu
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.6A
    • /
    • pp.611-616
    • /
    • 2006
  • In this paper, we propose a practical implementation method of a soft bit decision expression for an R-QAM (Gray coded Rectangular Quadrature Amplitude Modulation) signal based on the Max-Log-MAP algorithm. The parameters of the soft decision expression for the practical implementation can be obtained with simple arithmetic functions associated with some deterministic parameters such as a received value, distances between symbols, and the order of modulation on a signal space. Also, we analyze the performance of an iterative decoding scheme for the QAM signal with I/Q phase unbalance. The unbalance results from the non-ideal characteristic of components such as a phase shifter between in-phase and quadrature paths for quadrature modulator/demondulator.

Near optimal scheduling of flexible flow shop using fuzzy optimization technique (퍼지 최적화기법을 이용한 유연 흐름 생산시스템의 근사 최적 스케쥴링)

  • Park, Seung-Kyu;Lee, Chang-Hoon;Jang, Seok-Ho;Woo, Kwang-Bang
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.2
    • /
    • pp.235-245
    • /
    • 1998
  • This paper presents the fuzzy optimization model based scheduling methodology for the efficient production control of a FFS(FIexible Flow Shop) under the uncertain production environment. To develop the methodology, a fuzzy optimization technique is introduced in which the uncertain production capacity caused by the random events like the machine breakdowns or the absence of workers is modeled by fuzzy number. Since the problem is NP hard, the goal of this study is to obtain the near optimal but practical schedule in an efficient way. Thus, Lagrangian relaxation method is used to decompose the problem into a set of subproblems which are easier to solve than the original one. Also, to construct the feasible schedule, a heuristic algorithm was proposed. To evaluate the performance of the proposed method, computational experiments, based on the real factory data, are performed. Then, the results are compared with those of the other methods, the deterministic one and the existing one used in the factory, in the various performance indices. The comparison results demonstrate that the proposed method is more effective than the other methods.

  • PDF