• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.125-133
• /
• 2015

The Remote Device Management (RDM) protocol is used to manage the devices in the lighting control networks. RDM provides bi-directional communications between a controller and many lighting devices over the DMX512-A network. In RDM, using a simple binary search scheme, which is based on the 48-bit unique ID (UID) of each device, discovers the lighting devices. However, the existing binary search scheme tends to require a large delay in the device discovery process. In this paper, we propose a novel partition-based discovery scheme for fast device discovery in RDM. In the proposed scheme, all devices are divided into several partitions as per the device UID, and the controller performs device discovery for each partition by configuring a response timer that each device will use. From numerical simulations, we can see that there is an optimal number of partitions to minimize the device discovery time for a given number of devices in the proposed scheme, and also that the proposed partition-based scheme can reduce the device discovery time, as compared to the existing binary search scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.4B
• /
• pp.403-418
• /
• 2009

IP version 6 (IPv6) is a new If addressing scheme that has 128-bit address space. IPv6 is proposed to solve the address space problem of IP version 4 (IPv4) which has 32-bit address space. For a given IPv6 routing set, if a forwarding table is built using a trio structure, the trio has a lot more levels than that for IPv4. Hence, for IPv6 address lookup, the binary search on trio levels would be more appropriate and give better search performance than linear search on trio levels. This paper proposes a new IPv6 address lookup algorithm performing binary search on trio levels. The proposed algorithm uses a Bloom filter in pre-filtering levels which do not have matching nodes, and hence it reduces the number of off-chip memory accesses. Simulation has been performed using actual IPv6 routing sets, and the result shows that an IPv6 address lookup can be performed with 1-3 memory accesses in average for a routing data set with 1096 prefixes.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.11
• /
• pp.1635-1641
• /
• 2021

Portable systems with built-in active noise control is required low power operation. Excessive anti noise search operation can lead to rapid battery consumption. A method that can adaptively cancel noise according to the operating conditions of the system is required and the methods of reducing power are becoming very important key feature in today's portable systems. In this paper, we propose the method of active noise control(ANC) using binary search algorithm in noisy systems. The implemented architecture detects a frequency component considered as noise from the input signal and by using the binary search algorithm, the system find out an appropriate amplitude value for anti-noise in a much faster time than the general linear search algorithm. Through the experimental results, it was confirmed that the proposed algorithm performs a successful functional operation.

• Journal of Sensor Science and Technology
• /
• v.25 no.2
• /
• pp.91-102
• /
• 2016

The objective of this paper is to propose a heuristic algorithm to optimize the railway track maintenance scheduling, a NP-hard problem, by reflecting conditions of the actual field more quickly and easily. We develop the mechanism based on Binary Artificial Bee Colony (BABC) and Binary Harmony Search (BHS), and verify their performance through simulation experiments. Our proposed BABC and BHS mechanisms were applied to problems composed of 30, 60, 100, and 200 operations for railway track maintenance scheduling to carry out experiments and analysis. On comparing it with the results solved by CPLEX, it is found that the mechanism could present an optimal solution within limited time by user.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.369-370
• /
• 2006

This paper presents a new method for Huffman decoding specially designed for the MPEG-2 AAC audio. The method significantly enhances the processing efficiency of the conventional Huffman decoding realized with the ordinary binary tree search method. A data structure is newly designed based on the numerical interpretation of the incoming bit stream and its utilization for the offset oriented nodes allocation. The experimental results show the average performance enhancement of 54% and 665%, compared to those of the conventional binary tree search method and the sequential search method, respectively.

• Journal of Astronomy and Space Sciences
• /
• v.20 no.4
• /
• pp.239-248
• /
• 2003

We completed the light curves of near-contact binary system AX Dra for 11 nights from March 2001 to May using the 61-cm reflector and VR filters at Sobaeksan Optical Astronomy Observatory. From our observations, seven new times of minimum light (three timings to. primary eclipse, four. for. secondary) and the light elements consistent with recent observations were determined. Using the Wilson-Devinney binary code and the q-search method, we analyzed our VR light curves for various Roche configurations and mass ratios. As the results, we found the eclipsing binary AX Dra to be the FO Vir-type near-contact binary system interpreted as a detached or a semi-detached system, with the secondary filling its Roche lobe and the primary almost. Unlike the statistical study(Shaw 1994) of the FO Vir-type near-contact binary system, our VR light curves showed the O'Connell effect of all the same type and it's dimensions was about $0^{m}.008$.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.22 no.3
• /
• pp.557-561
• /
• 1997

In this paper, we present three new classes of binary pseudorandom sequences of period ${2_n}-1$ with ideal autocorrelation. These sequences are newly found by an extensive computer search, and the conjectures on the construction of these sequences are formulated. We also classify the binary sequences of period ${2_n}-1$ with ideal autocorrelation, and enumerate them.

• Journal of Broadcast Engineering
• /
• v.16 no.4
• /
• pp.647-656
• /
• 2011

Motion estimation using one-bit transform and two-bit transform reduces the complexity for computation of matching error; however, the peak signal-to-noise ratio (PSNR) is degraded. Modified 1BT (M1BT) and modified 2BT (M2BT) have been proposed to compensate degraded PSNR by adding conditional local search. However, these algorithms require many additional search points in fast moving sequences with a block size of $16{\times}16$. This paper provides more efficient search method by preparing candidate blocks using the number of non-matching points (NNMP) than the conditional local search. With this NNMP-based search, we can easily obtain candidate blocks with small NNMP and efficiently search final motion vector. Experimental results show that the proposed algorithm not only reduces computational complexity, but also improves PSNR on average compared with conventional search algorithm used in M1BT, M2BT and AM2BT.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.5 s.335
• /
• pp.47-54
• /
• 2005

This paper proposes and analyzes a Tag Anti-collision algorithm in RFID system. We mathematically compare the performance of the proposed algorithm with existing binary algorithms(binary search algorithm, slotted binary tree algorithm using time slot, and bit-by-bit binary tree algorithm proposed by Auto-ID center). We also validated analytic results using OPNET simulation. Based on analytic result, comparing the proposed Improved bit-by-bit binary tree algerian with bit-by-bit binary tree algorithm which is the best of existing algorithms, the performance of Improved bit-by-bit binary tree algorithm is about $304\%$ higher when the number of tags is 20, and $839\%$ higher when the number of tags is 200.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5C
• /
• pp.382-390
• /
• 2005

Huffman codes are widely used for image and video data transmission. As the increase of real-time data, a lot of studies on effective decoding algorithms and architectures have been done. In this paper, we proposed a balanced binary search tree for Huffman decoding and compared the performance of the proposed architecture with that of previous works. Based on definitions of the comparison of codewords with different lengths, the proposed architecture constructs a balanced binary tree which does not include empty internal nodes, and hence it is very efficient in the memory requirement. Performance evaluation results using actual image data show that the proposed architecture requires small number of table entries, and the decoding time is 1, 5, and 2.41 memory accesses in minimum, maximum, and average, respectively.