• Title/Summary/Keyword: Embedded tree

Search Result 100, Processing Time 0.024 seconds

Destructive Test of a BLDC Motor Controller Utilizing a Modified Classification Tree Method (변형된 Classification Tree Method를 이용한 BLDC 모터제어기 파괴 시험)

  • Shin, Jae Hyuk;Chung, Ki Hyun;Choi, Kyung Hee
    • KIPS Transactions on Software and Data Engineering
    • /
    • v.3 no.6
    • /
    • pp.201-214
    • /
    • 2014
  • In this paper, we propose a test case generation method adequate to destructive test of the BLDC(Brush Less Direct Current) motor controller used for the MDPS(Motor Driven Power Steering) system embedded in an automobile. The proposed method is a modified CTM(Classification Tree Method). CTM generates test cases assuming that all inputs are equally important. Therefore, it is very hard to generate test cases for extreme situations. To overcome the drawback and generate test cases specialized for destructive test. a modified CTM that compensates the limitation of traditional CTM is proposed. The proposed method has an advantage that it can intensively generate the test scenarios adequate to extreme situations by combining the test cases generated by the transitional CTM the while keeping the merit of the traditional CTM. The test scenarios for destructive test for the MDPS system embedded in a commercial automobile are generated utilizing the proposed method. The effectiveness of the proposed algorithm is verified through the test.

Performance Evaluation of Tree Routing in Large-Scale Wireless Sensor Networks (대규모 센서네트워크에서의 트리라우팅 성능평가)

  • Beom-Kyu Suh;Ki-Il Kim
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.18 no.2
    • /
    • pp.67-73
    • /
    • 2023
  • Tree routing is one of appropriate routing schemes in wireless sensor network because the complexity of this approach is relatively low. But, congestion at a specific node may happen because a parent node toward a sink node is usually selected in one hop way, specially where large number of node are deployed. As feasible solution for this problem, multiple paths and sinks schemes can be applied. However, the performance of these schemes are not proved and analyzed yet. In this paper, we conduct diverse simulaton scenarios performance evaluation for these cases to identify the improvement and analyze the impact of schemes. The performance is measured in the aspects of packet transmission rate, throughput, and end-to-end delay as a function of amount of network traffic.

Development of Unmanned Driving Technologies for Speed Sprayer in Orchard Environment (과수원 환경에서의 방제기 무인주행 기술 개발)

  • Li, Song;Kang, Dongyeop;Lee, Hae-min;An, Su-yong;Kwon, Wookyong;Chung, Yunsu
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.15 no.6
    • /
    • pp.269-279
    • /
    • 2020
  • This paper presents the design and implementation of embedded systems and autonomous path generation for autonomous speed sprayer. Autonomous Orchard Systems can be divided into embedded controller and path generation module. Embedded controller receives analog sensor data, on/off switch data and control linear actuator, break, clutch and steering module. In path generation part, we get 3D cloud point using Velodyne VLP16 LIDAR sensor and process the point cloud to generate maps, do localization, generate driving path. Then, it finally generates velocity and rotation angle in real time, and sends the data to embedded controller. Embedded controller controls steering wheel based on the received data. The developed autonomous speed sprayer is verified in test-bed with apple tree-shaped artworks.

Link-Disjoint Embedding of Complete Binary Trees in 3D-Meshes (3차원 메쉬에 대한 완전 이진트리의 링크 충돌없는 임베딩)

  • 이주영;이상규
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.7_8
    • /
    • pp.381-386
    • /
    • 2003
  • In this paper, we consider the problem of embedding complete binary trees into 3-dimensional meshes. The method of embedding a complete binary tree into 3-dimensional mesh with the link congestion two is considered in [1], and the embedding in [2] shows that a complete binary tree can be embedded into a ,3-dimensional mesh of expansion 1.27. The proposed embedding in this paper shows that a complete binary tree can be embedded into a 3-dimensional mesh of expansion approximately 1.125 with the link congestion one, using the dimensional ordered routing. Such method yields some improved features in terms of minimizing the link congestion or the expansion of embedding comparing to the previous results.

The design of interconnection network using postorder traversal on Fibonacci tree (피보나치 트리에서 후위순회를 이용한 상호 연결망의 설계)

  • 유명기;김용석
    • Proceedings of the IEEK Conference
    • /
    • 2001.06c
    • /
    • pp.63-66
    • /
    • 2001
  • In this paper, We propose the new interconnection network which is designed to edge numbering labeling using postorder traversal which can reduce diameter when it has same node number with Hypercube, which can reduce total node numbers considering node degree and diameter on Fibonacci trees and its jump sequence of circulant is Fibonacci numbers. It has a simple (shortest oath)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded to Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube.

  • PDF

The design of interconnection network using inorder traversal on Fibonacci tree (피보나치 트리에서 중위순회를 이용한 상호연결망 설계)

  • 김현주;김용석
    • Proceedings of the IEEK Conference
    • /
    • 2000.11c
    • /
    • pp.59-62
    • /
    • 2000
  • In this paper, We propose the new interconnection network which is designed to edge numbering method using inorder traversal a Fibonacci trees and its jump sequence is Fibonacci numbers. It has a simple (shortest path)routing algorithm, diameter, node degree. It has a spaning subtree which is Fibonacci tree and it is embedded Fibonacci tree. It is compared with Hypercube. We improve diameter compared with Hypercube on interconnection network measrtes.

  • PDF

Improvement of Hierarchical Routing in ZigBee Networks (지그비 계층적 라우팅의 성능 향상 기법)

  • Kim, Taehong;Kim, Daeyoung;Yoo, Seong-Eun;Sung, Jongwoo;Kim, Youngsoo
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.1 no.2
    • /
    • pp.104-112
    • /
    • 2006
  • ZigBee is the emerging industrial standard for ad hoc networks based on IEEE 802.15.4. It is used for low data rate and low power wireless network applications. Expected applications of ZigBee include wireless sensor networks for remote monitoring, home control, and industrial automation. Since one of the most important design goals of ZigBee is to reduce the installation and running costs, the ZigBee stack is embedded in the cheap and small micro-controller unit. The hierarchical routing algorithm is used for ZigBee end devices which have very limited resources. Using the block addressing scheme, end devices can send data to the destination without a routing table. However, hierarchical routing has the problem that the packets follow the tree hierarchy to the destination even if the destination is located nearby. In this paper, we propose a scheme to improve the hierarchical routing algorithm in ZigBee networks by employing the neighbor table that is originally used together with the routing table. We suggest selecting the neighbor node that has the minimum remaining hops to the destination as the next hop node. Simulation result shows that the proposed scheme saves more than 30% of the hop counts compared with the original hierarchical routing.

  • PDF

A Semi-blind Digital Watermarking Scheme Based on the Triplet of Significant Wavelet Coefficients

  • Chu, Hyung-Suk;Batgerel, Ariunzaya;An, Chong-Koo
    • Journal of Electrical Engineering and Technology
    • /
    • v.4 no.4
    • /
    • pp.552-558
    • /
    • 2009
  • We proposed a semi-blind digital image watermarking technique for copyright protection. The proposed algorithm embedded a binary sequence watermark into significant wavelet coefficients by using a quantization method. The main idea of the quantization method was to quantize a middle coefficient of the triplet of a significant wavelet coefficient according to the watermark's value. Unlike an existing algorithm, which used a random location table to find a coefficient in which the watermark bit will be embedded: the proposed algorithm used quad-tree decomposition to find a significant wavelet coefficient for embedding. For watermark detection, an original host image was not required. Thanks to the usage of significant wavelet coefficients, the proposed algorithm improved the correlation value, up to 0.43, in comparison with the existing algorithm.

Image Compression of Embedded Tree Structure Using Multiwavlet Filterbanks (멀티웨이브릿 필터뱅크를 이용한 임베디드 제로 트리구조의 영상압축)

  • 권기창;권영담;남제호;권기룡
    • Proceedings of the Korea Multimedia Society Conference
    • /
    • 2001.11a
    • /
    • pp.91-94
    • /
    • 2001
  • 본 논문에서는 멀티웨이브릿 필터뱅크를 이용한 임베디드 제로 트리 구조(embedded zero tree structure)의 영상 압축방법을 제안한다. 본 논문에서 사용한 멀티웨이브릿 함수는 근사화 차수가 2인 새로운 방법의 DGHM 멀티웨이브릿을 사용하였으며, 영상을 부호화하기 위하여 임베디드 제로 트리 구조의 코딩기법을 사용한다. 높은 근사화 차수를 갖는 멀티웨이브릿 필터는 보다 우수한 에너지 압축 효과를 가지게 된다. 따라서 본 논문에서는 우수한 에너지 압축 효과는 내기 위하여 수학적으로 정립이 된 근사화 차수가 2인 DGHM 멀티웨이브릿을 영상압축에 사용한다. 또한 기존의 멀티웨이브릿 필터들보다 높은 성능을 갖는 DGHM 멀티스케일링 및 멀티웨이브릿 필터를 구성하여 영상을 완전복원이 되도록 한다.

  • PDF

Reliability Evaluation for the Avionic Embedded System (항공용 임베디드 시스템 하드웨어 신뢰성 평가)

  • Kim, Byeong-Young;Lee, Dong-Woo;Na, Jong-Wha
    • Journal of Advanced Navigation Technology
    • /
    • v.13 no.1
    • /
    • pp.19-26
    • /
    • 2009
  • Air Traffic Management (ATM) system requires extremely high reliability for the safe and dependable operations in the airport. This paper reports a study on the reliability of the prototype ATM hardware system including the servers and local area networks. Reliability Block Diagram and Fault Tree Analysis on the prototype ATM hardware were performed.

  • PDF