• 제어로봇시스템학회:학술대회논문집
• /
• 2003.10a
• /
• pp.1088-1092
• /
• 2003

This paper presents a combined lookup table technique and PI-type controller. The purpose of the designed controller is applied to control the nonlinear system as thermal process. The proposed controller is easy and convenient to design based on a commercial controller. The performances of the proposed controller were studied using the thermal plant model under temperature control. The experimental results included demonstrate the good performance of the proposed controller.

• Proceedings of the IEEK Conference
• /
• 2000.11a
• /
• pp.85-88
• /
• 2000

In order to resolve problems according to the phase error in QPSK demodulator of the digital communication systems. The demodulator requires carrier recovery loop which searches for the frequency and phase of the carrier. In this paper the complexity of implementation is reduced by the reduction into half of the number of the multiplier in filter structure of the conventional carrier recovery loop, and as the drawback of NCO of the conventional carrier recovery loop wastes a amount of power for the structure of lookup table , We designed the structure of combinational logic without the lookup table. In the comparison with dynamic power of the proposed NCO, the power of NCO with the lookup table is 175㎼, NCO with the proposed structure is 24.65㎼. As the result, it is recognized that about one eight of loss power is reduced. In the simulation of carrier recovery loop designed QPSK demodulator, it is known that the carrier phase is compensated.

• Proceedings of the IEEK Conference
• /
• 2004.06b
• /
• pp.589-592
• /
• 2004

The CORDIC algorithm can be implemented very simple H/W, but needs a lot of latency to compute trigonometric function. The RA(Redundant Arithmetic) resolves this problem, but also has difficulty to determine the directions of micro-rotations. The pre-computed direction of micro-rotation algorithm relieves the RA of this matter. In this paper, we proposed the modified the pre-computed algorithm adopted with a table-lookup. Instead of reducing H/W complexity, its performance and calculation errors are improved.

• Journal of Navigation and Port Research
• /
• v.36 no.9
• /
• pp.699-706
• /
• 2012

This paper describes Declination interpolation method in the application of Digital Magnetic Compass(DMC) with small capacity memory for relatively low-priced system. The purpose of this study is to find accurate declination values using Declination Lookup Table(DLT) and Secular Variation Table(SVT) with the Bilinear interpolation method having four points data only. World Magnetic Model with Gauss coefficients produced by NOAA is used in the calculation of DLT and SVT at desired years. To verify the applicability of the proposed method, the simulation tests and the error analysis are carried out in this work. As results from tests, the interpolation error is within 0.01 degree that is much enough to implement high accurate DMC comparing with commercial DMCs on the market. In summary, the declination interpolation method, proposed in this study, can be useful in the application of DMC.

• Proceedings of the IEEK Conference
• /
• 2001.06e
• /
• pp.165-168
• /
• 2001

In this W the complexity of implementation is reduced by the reduction into half of the number of the multiplier in filter structure of the conventional carrier recovery loop, and as the drawback of NCO of the conventional carrier recovery loop wastes a amount of power for the structure of lookup table, We designed the structure of combinational logic without the lookup table. In the comparison with dynamic power of the proposed NCO, the power of NCO with the lookup table is 175${\mu}$W, NCO with the proposed of structure is 24,65${\mu}$W. As if result, it is recognized that about one eight of loss power is reduced In the simulation of carrier recovery loop designed QPSK demodulator, it is known that the carrier phase is compensated.

• 한국정보통신설비학회:학술대회논문집
• /
• 2008.08a
• /
• pp.323-326
• /
• 2008

This paper describes some field multiplication algorithm over GF($2^m$) on 8-bit processor. Through performance comparisons among algorithm, we show that our proposal is faster than existing algorithms. The proposed algorithm save 26.38% of running time compared with naive comb multiplication algorithm which is a kind of lookup-table (LUT) based algorithm. With the proposed algorithm, a scalar multiplication over GF($2^{163}$) can be computed within 1.04 secs on 8-bit MICAz sensor mote.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.333-340
• /
• 2004

In order that routers forward a packet to its destination, they perform IP address lookup which determines the next hop according to the packet's destination address. In designing high speed routers, IP address lookup is an important issue. In order to design high speed routers, this paper proposes a parallel IP lookup scheme which consists of several IP lookup engines without any modification of already fabricated indirect IP lookup chipsets. Also, we propose a simple rule for partitioning IP prefix entries In an overall forwarding table among several IP lookup engines. And we evaluate the performance of the proposed scheme in terms of the memory size required for storing lookup information and the number of memory accesses on constructing the forwarding table. With additional hardware logics, the proposed scheme can reduce about 30% of the required memory size and 80% of the memory access counts.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.49-56
• /
• 2016

Increasing Internet traffic and forwarding table size need high performance IP address lookup engine which is a crucial function of routers. For finding the longest matching prefix, trie-based or its variant schemes have been widely researched in software-based IP lookup. As a software router, we enhance the IP address lookup engine using GPU which is a device widely used in high performance applications. We propose a data structure for multibit trie to exploit GPU hardware efficiently. Also, we devise a novel scheme that the root subtrie is loaded on Shared Memory which is specialized for fast access in GPU. Since the root subtrie is accessed on every IP address lookup, its fast access improves the lookup performance. By means of the performance evaluation, our implemented GPU-based lookup engine shows 17~23 times better performance than CPU-based engine. Also, the fast access technique for the root subtrie gives 10% more improvement.

• Journal of KIISE:Databases
• /
• v.36 no.2
• /
• pp.84-98
• /
• 2009

Various algorithms and architectures for IP address lookup have been studied to improve forwarding performance in the Internet routers. Previous IP address lookup architecture using Bloom filter requires a separate Bloom filter as well as a separate hash table in each prefix length, and hence it is not efficient in implementation complexity. To reduce the number of hash tables, it applies controlled prefix expansion, but prefix duplication is inevitable in the controlled prefix expansion. Previous parallel multiple-hashing architecture shows very good search performance since it performs parallel search on tables constructed in each prefix length. However, it also has high implementation complexity because of the parallel search structure. In this paper, we propose a new IP address lookup architecture using all-length Bloom filter and all-length multiple hash table, in which various length prefixes are accomodated in a single Bloom filter and a single multiple hash table. Hence the proposed architecture is very good in terms of implementation complexity as well as search performance. Simulation results using actual backbone routing tables which have $15000{\sim}220000$ prefixes show that the proposed architecture requires 1.04-1.17 memory accesses in average for an IP address lookup.

• Journal of the Korean Institute of Electrical and Electronic Material Engineers
• /
• v.30 no.6
• /
• pp.393-400
• /
• 2017

For comparison to the Li-ion battery, evaluating a thermal battery must consider additional variables. The first one is the temperature difference between the battery and its unit cell. Thermal batteries and their unit cells have a temperature difference that is caused by the thermal battery activation mechanism and its shape. The second variable is the electrochemical reaction steps. Most Li-ion batteries have a constant electrochemical reaction at the electrode, and battery voltage is affected when the concentration of Li ions is changed. However, a thermal battery has several steps in its electrochemical reaction, and each step has a different potential. In this study, we used unit cell discharge tests based on interpolating a 4D lookup table to estimate the performance of a thermal battery. From the test results, we derived an estimation algorithm by interpolating the table, which is queried from specified profile groups. As a result, we found less than a 5 percent difference between estimation and experiment at the 1.3 V cut-off time.