• Journal of KIISE
• /
• v.44 no.7
• /
• pp.649-657
• /
• 2017

As the type and purpose of drones become diverse and the number of additional functions is increasing, the role of the corresponding software has increased. Through partitioning and an efficient solving of SWaP(size, weight and power) problems, ARINC 653 can provide reliable software reuse and consolidation regarding avionic systems. ARINC 653 can be more effectively applied to drones, a small unmanned aerial vehicle, in addition to its application with large-scale aircraft. In this paper, to exploit ARINC 653 for a drone flight-control program, an intra-partition communication system is implemented through an extension of the layered ARINC 653 and applied to a real drone system. The experiment results show that the overheads of the intra-partition communication are low, while the resources that are assigned to the drone flight-control program are guaranteed through the partitioning.

• Journal of Korea Multimedia Society
• /
• v.19 no.6
• /
• pp.990-1002
• /
• 2016

In this paper, we propose a new compression method for the edge image by analyzing the characteristics and the distribution of pixel values of the edge image. The pixel values of the edge image have the Gaussian distribution around '0', and most of the pixel values are `0`. By these analyses we suggest the Zero-Based codec that expresses all values in a CU by a single bit flag. Also, in order to reduce the computational complexity of the proposed codec, the block partition and the intra-prediction techniques are proposed by using edge information like the number of each edge direction, the distribution and the amplitude of a major edge direction in the CU. Experimental results show that the proposed codec leads to a slighter distortion in Y domain than that of HEVC, but has far faster processing speed up to 53 times while it maintains the similar image quality compared to HEVC.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.2
• /
• pp.426-436
• /
• 2000

Given a linear arrangement of n base stations which generate multiple types of traffic among themselves, we consider the problem of finding a set of disjoint clusters to cover n base statons so that a cluster is assigned a location server. Our goal is to minimize the total communication cost for the entire network where the cost of intra-cluster communication is usually lower than that of intercluster communication for each type of traffic. The optimization problem is transformed into an equivavalent problem using the concept of relative cost, which generates the difference of communication costs between intracluster and intercluster communications. Using the relative cost matrix, an efficient algorithm of O($mm^2$), where m is the number of clusters in a partition, is designed by dynamic programming. The algorithm also finds all thevalid partitions in the same polynomial time, given the size constraint on a cluster, and the total allowable communication cost for the entire network.