• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.5
• /
• pp.39-48
• /
• 2002

long with the rapid spread of the Internet, a new class of commercial applications which process transactions with respect to electronic dictionaries become popular Typical examples are Internet search engines. In this paper, we present a new approach to achieving high performance electronic dictionaries. Different from the conventional approach which use Trie data structures for the implementation of electronic dictionaries, our approach used multi-dimensional binary trees. In this paper, we present the implementation of our electronic dictionary ED-MBT(Electronic Dictionary based on Multidimensional Binary Tree). Exhaustive performance study is also presented to assess the performance impact of ED-MBT on the real world applications.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.10B
• /
• pp.1732-1743
• /
• 2000

In this paper a fixed-delay trellis search with decision feedback (FDTrS/DF) for high-density DVD systems (4.7-15GB) is proposed and implemented with FPGA. The proposed FDTrS/DF is derived by transforming the binary tree search structure into trellis search structure implying that FDTrS/DF performs better than the singnal detection techniques based on tree search structure such as FDTS/DF and SSD/DF. Advantages of FDTrS/DF are significant reductions in hardware complexity due to the unique structure of FDTrS composed of only one trellis stage requiring no traceback procedure usually implemented in the Viterbi detector. Also in this paper the PDFS/DF and SSD/DF orginally proposed for high-density magnetic recording systems are modified for the DVD system and compared with the proposed FDTrS/DF. In order to increase speed in the FPGA implementation the pipelining technique and absolute branch metric (instead of square branch metric) are applied. The proposed FDTrS/DF is shown to provide the best performance among various signal detection techniques such as PRML, DFE, FDTS/DF and SSD/DF even with a small hardware complexity.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.24 no.2
• /
• pp.99-104
• /
• 2024

In the deficiency of an exact solution yielding algorithm, approximate algorithms remain as a solely viable option to the Minimum Linear Arrangement(MinLA) problem of Binary tree. Despite repeated attempts by a number of algorithm on k = 10, only two of them have been successful in yielding the optimal solution of 3,696. This paper therefore proposes an algorithm of O(n) complexity that delivers the exact solution to the binary tree. The proposed algorithm firstly employs an In-order search method by which n = 2^k - 1 number of nodes are assigned with a distinct number. Then it reassigns the number of all nodes that occur on level 2 ≤ 𝑙 ≤ k-2, (k = 5) and 2 ≤ 𝑙 ≤ k-3, (k = 6), including that of child of leaf node. When applied to k=5,6,7, the proposed algorithm has proven Chung[14]'s S^(k)_min=2^k-1+4+S^(k-1)_min+2S^(k-2)_min conjecture and obtained a superior result. Moreover, on the contrary to existing algorithms, the proposed algorithm illustrates a detailed assignment method. Capable of expeditiously obtaining the optimal solution for the binary tree of k > 10, the proposed algorithm could replace the existing approximate algorithms.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.11
• /
• pp.25-32
• /
• 2007

In this paper, we propose the Group Separation Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Group Separation algorithm identify each Tag_ID bit#s sum of bit #1#. In other words, Group Separation algorithm had standard of selection by collision table, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Group Separation algorithm had performance test that criterions were reader#s number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Group Separation algorithm better than exisiting algorithm.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.4
• /
• pp.1-9
• /
• 2007

in this paper, we propose the Adaptive Decision Algorithm for RFID Tag Anti-Collision. We study the RFID Tag anti-collision technique of ALOHA and the anti-collision algorithm of binary search. The existing technique is several problems; the transmitted data rate included of data, the recognition time and energy efficiency. For distinction of all tags, the Adaptive Decision algorithm identify smaller one ,each Tag_ID bit's sum of bit '1'. In other words, Adaptive Decision algorithm had standard of selection by actively, the algorithm can reduce unnecessary number of search even than the exisiting algorithm. The Adaptive Decision algorithm had performance test that criterions were reader's number of repetition and number of transmitted bits for understanding tag. We showed the good performance of Adaptive Decision algorithm better than exisiting algorithm.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.7 no.2
• /
• pp.235-242
• /
• 2012

In RFID System, one of the problem that we must slove is to devise a good anti-collision algorithms to improve the efficiency of tag identification which is usually low because of tag collision. Among of the existing RFID anti-collision algorithm, BS (Binary Search) algorithm, though simple, has a disadvantage that the stage of times used to identify the tags increase exponentially as the number of tags does. In this paper, I propose a new anti-collision algorithm called Multi-collision reflected frame which restricts the number of stages and decided bit. Since the proposal algorithm keep the length size of UID and density of total tag when have 100%. The simulation results showed that the proposed algorithm improves the efficiency by 30~50% compared to the existing algorithm.

• Journal of KIISE:Databases
• /
• v.34 no.2
• /
• pp.119-132
• /
• 2007

In molecular biology, approximate subsequence search is one of the most important operations. In this paper, we propose an accurate and efficient method for approximate subsequence search in large DNA databases. The proposed method basically adopts a binary trie as its primary structure and stores all the window subsequences extracted from a DNA sequence. For approximate subsequence search, it traverses the binary trie in a breadth-first fashion and retrieves all the matched subsequences from the traversed path within the trie by a dynamic programming technique. However, the proposed method stores only window subsequences of the pre-determined length, and thus suffers from large post-processing time in case of long query sequences. To overcome this problem, we divide a query sequence into shorter pieces, perform searching for those subsequences, and then merge their results. To verify the superiority of the proposed method, we conducted performance evaluation via a series of experiments. The results reveal that the proposed method, which requires smaller storage space, achieves 4 to 17 times improvement in performance over the suffix tree based method. Even when the length of a query sequence is large, our method is more than an order of magnitude faster than the suffix tree based method and the Smith-Waterman algorithm.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2006.11a
• /
• pp.312-315
• /
• 2006

Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like internet broadcasting are provided by overlay multicast technology due to the complex nature of IP multicast and the high cost to support multicast function. Since multicast members can dynamically join or leave their multicast group, it is necessary to keep a reliable overlay multicast tree to support real time service without delay. In this paper, we consider path level reliability that connects each member node. The problem is formulated as a binary integer programming which maximizes the reliability of multicast tree. Tabu search based algorithm is presented to solve the NP-hard problem.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.23 no.6
• /
• pp.711-718
• /
• 2019

BDD is a well-known alternative to the conventional Boolean logic method in fault tree analysis. As the size of fault tree increases, the calculation time and computer resources for BDD dramatically increase. A new failure path search and path restructure method is proposed for efficient calculation of CS and MCS from BDD. Failure path grouping and bottom-up path search is proved to be efficient in failure path search in BDD and path restructure is also proved to be used in order to reduce the number of CS comparisons for MCS extraction. With these newly proposed methods, the top event probability can be calculated using the probability by ASDMP(Approximate Sum of Disjoint MCS Products), which is shown to be equivalent to the result by the conventional MCUB(Minimal Cut Upper Bound) probability.

• Proceedings of the Korean Information Science Society Conference
• /
• 2000.10a
• /
• pp.551-553
• /
• 2000

VLSI 기술의 발전에 따라 프로세서의 속도는 빠르게 증가하고 있는 반면 메모리의 속도는 이를 뒷받침하지 못하여 속도의 차이를 줄이기 위해 캐쉬(cache) 메모리를 사용하고 있다. 캐쉬가 알고리즘의 실행시간에 미치는 영향이 점점 더 커지고 있으나 이제까지 개발된 대부분의 알고리즘들은 이러한 캐쉬의 중요성을 고려하지 않고 개발되었다. 본 논문에서는 캐쉬 효과를 고려한 확장된 이진 탐색 트리 알고리즘에 관해 연구하였고, 실험을 통하여 기존의 이진 탐색 트리와 제안된 알고리즘의 성능을 비교하였다.