• Journal of KIISE:Computer Systems and Theory
• /
• v.30 no.9
• /
• pp.454-460
• /
• 2003

In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

• Proceedings of the IEEK Conference
• /
• 2001.06a
• /
• pp.269-272
• /
• 2001

Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K＋1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

• Journal of the Korean Society of Radiology
• /
• v.15 no.4
• /
• pp.409-414
• /
• 2021

In order to acquire an image from a gamma camera, linearity correction must be performed. To this end, digital coordinates are acquired by using a linearity map to accurately specify the location where the scintillator and gamma rays interact. In this study, a method for acquiring undistorted images and digital coordinates was developed using a lookup table and maximum likelihood position estimation without using a linearity map. The proposed method was verified by configuring a small gamma camera through DETECT2000 simulation. A gamma camera was constructed using a GAGG scintillator and a SiPM optical sensor, and a gamma-ray interaction was generated at the center of the scintillator, and a lookup table was prepared using the ratio of the signals obtained from the SiPM. Through the prepared lookup table and the maximum likelihood position estimation, the position of the signal obtained by the gamma-ray interaction was acquired as digital coordinates to compose an image. As a result, the linearity was maintained compared to the generally acquired image, the accuracy of the location where the gamma-ray interaction was generated was excellent, and the distance between the locations was uniform. Since the lookup table obtained through simulation is created using the ratio of the signal, it can be directly used in the experiment, and the position of the signal can be conveniently obtained with digital coordinates with corrected linearity without creating a linearity map.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.129-142
• /
• 2004

As the Internet gets faster, the demand for high-speed routers that are capable of forwarding more than giga bits of data per second keeps increasing. In the previous research, Bitmap Trie algorithm was developed to rapidly execute LPM(longest prefix matching) process which is Well known as the Severe performance bottleneck. In this paper, we introduce a novel algorithm that drastically enhanced the performance of Bitmap. Trie algorithm by applying three techniques. First, a new table called the Count Table was devised. Owing to this table, we successfully eliminated shift operations that was the main cause of performance degradation in Bitmap Trie algorithm. Second, memory utilization was improved by removing redundant forwarding information from the Transfer Table. Lastly. the range of prefix lookup was diversified to optimize data accesses. On the other hand, the processing delays were classified into three categories according to their causes. They were, then, measured through the execution-driven simulation that provides the higher quality of the results than any other simulation techniques. We tried to assure the reliability of the experimental results by comparing with those that collected from the real system. Finally the Enhanced Bitmap Trie algorithm reduced 82% of time spent in previous algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.42 no.3
• /
• pp.566-576
• /
• 2017

Key-value stores proved its superiority by being applied to various NoSQL databases such as Redis, Memcached. Lookup performance is important because key-value store applications performs more lookup than insert operations in most environments. However, in traditional applications, lookup may be slow because hash tables are constructed out of linked-list. Therefore, cuckoo hashing has been getting attention from the academia for constant lookup time, and bucketized cuckoo hashing (BCH) has been proposed since it can achieve high load factor. In this paper, we introduce Sorting Cuckoo which inserts data using insertion sort in BCH structure. Sorting Cuckoo determines the existence of a key with a relatively small memory access because data are sorted in each buckets. In particular, the higher memory load factor, the better lookup performance than BCH's. Experimental results show that Sorting Cuckoo has smaller memory access than BCH's as many as about 19 million (25%) in 10 million negative lookup operations (key is not in the table), about 4 million times (10%) in 10 million positive lookup operations (where it is) with load factor 95%.

• Journal of KIISE:Information Networking
• /
• v.36 no.1
• /
• pp.57-67
• /
• 2009

Packet forwarding in the Internet routers is to find out the longest prefix that matches the destination address of an input packet and to forward the input packet to the output port designated by the longest matched prefix. The IP address lookup is the key of the packet forwarding, and it is required to have efficient data structures and search algorithms to provide the high-speed lookup performance. In this paper, an efficient IP address lookup algorithm using binary search is investigated. Most of the existing binary search algorithms are not efficient in search performance since they do not provide a balanced search. The proposed binary search algorithm performs perfectly balanced binary search using switch pointers. The performance of the proposed algorithm is evaluated using actual backbone routing data and it is shown that the proposed algorithm provides very good search performance without increasing the memory amount storing the forwarding table. The proposed algorithm also provides very good scalability since it can be easily extended for multi-way search and for large forwarding tables

• The Transactions of the Korean Institute of Power Electronics
• /
• v.9 no.3
• /
• pp.246-252
• /
• 2004

This paper presents a position sensorless control system of Switched Reluctance Motor (SRM) using neural network. The control of SRM depends on the commutation of the stator phases in synchronism with the rotor position. The position sensing requirement increases the overall cost and complexity. In this paper, the current-flux-rotor position lookup table based position sensorless operation of SRM is presented. Neural network is used to construct the current-flux-rotor position lookup table, and is trained by sufficient experimental data. Experimental results for a 1-hp SRM is presented for the verification of the proposed sensorless algorithm.

• Journal of electromagnetic engineering and science
• /
• v.9 no.3
• /
• pp.152-158
• /
• 2009

We have developed a novel digital feedback predistortion(DFBPD) linearization based on RF feedback PD for the wide bandwidth modulated signals. The wideband PD operation is carried out by combining the DFBPD and memory lookup table(LUT). To experimentally demonstrate the linearization performance of the proposed PD technique for wideband signal, a class-AB amplifier using an LDMOSFET MRF6S23140 with 140-W peak envelope power is employed at 2.345 GHz. For a forward-link 2FA wideband code-division multiple-access signal with 10 MHz carrier spacing, the proposed DFBPD with memory LUT delivers the adjacent channel leakage ratio at an 10 MHz offset of -56.8 dBc, while those of the amplifier with and without DFBPD are -43.2 dBc and -41.9 dBc, respectively, at an average output power of 40 dBm. The experimental result shows that the new DFBPD with memory LUT provides a good linearization performance for the signal with wide bandwidth.

• Proceedings of the KIEE Conference
• /
• 2006.10c
• /
• pp.303-305
• /
• 2006

본 논문은 HVAC(heating, ventilating, and air conditioning) 시스템의 효율성과 안정성에 기초하여, 과열도와 저압을 제어하는 Multi Fuzzy 제어기 설계를 제안한다. HVAC 시스템은 Compressor(압축기), Condenser(응축기), Evaporator(증발기), Expansion Valve(확장 밸브) 로 구성되며, 각각의 기기에 대한 제어가 독립적으로 이루어져 있다. 기존의 제어가 한 제어기를 사용한 단일방식으로 이루어지다보니 HVAC 시스템의 특성인 냉매의 상태가 달라지면 시스템 전반적으로 그 영향이 파급되는 부분까지 고려를 해 주지 못하고, 제어기의 성능이 효율적이고 안정적이지 못했다. 본 논문에서는 HVAC 시스템의 효율과 안정도에 결정적인 영향을 미치는 파열도와 저압을 제어하기 위해, 비선형성이 강하고 불확실하며 복잡한 시스템을 쉽게 제어할 수 있는 Fuzzy 제어기를 구성하여, 3대의 Expansion Valve 와 1대의 Compressor 에서 동시에 제어하는 Multi 제어기를 설계한다. 제안된 Fuzzy 제어기는 이산형 lookup_table 방식과 연속형 간략추론 방식을 사용하여 제어기를 설계하고, 유전자 알고리즘(GAs)을 이용하여 최적의 Fuzzy 제어기의 환산계수를 구한다. 그리고 시뮬레이션 결과를 통해 이산형 lookup_table 방식과 연속형 간략추론 방식의 각각의 제어기를 사용한 결과를 비교한다.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.12
• /
• pp.97-106
• /
• 1999

We propose a new watermarking method to embed a label in a video which is robust against the change of the group of picture. The proposed method embeds labels in the pixel domain, but detects the label in the DCT frequency domain. For embedding a label, the size of watermark based on the human visual system is calculated to keep a quality of videos. A lookup table haying the pixel patterns and the sequences of a sign of DCT coefficients is used for detecting a label in the DCT frequency domain. In this paper, we analyze bit error rates for labels of videos compressed by MPEG2 using the central limit theorem and compare the simulation results with previous methods.