• 제어로봇시스템학회:학술대회논문집
• /
• 2000.10a
• /
• pp.504-504
• /
• 2000

The flow ratio in the industrial process is usually accomplished by using PID controller with series type ratio. But always the large overshoot and a long rise time may be achieved from this conventional control. These problems are involved to the inexact flow ratio control. In order to avoid this poor performance. the paper presents a designing of the two controller modes for the flow ratio plants. This proposed controller combine the lookup table technique and the well-known PID controller to obtain the fast response and low overshoot of flow ratio control. The PID controller mode will be operated when the flow ratio reaches the preset value while the lookup table technique mode is applied for initial operation. The data in tile table is calculated by the valve sizing equation and convened to the valve position control signal. The experimental results show that the transient and steady state responses of the control systems using the proposed technique can be efficiently obtained when compared with tile conventional controller.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.8B
• /
• pp.541-548
• /
• 2005

IP lookup and forwarding process becomes the bottleneck of packet transmission as IP traffic increases. Previous hardware-based IP address lookup schemes using an index-based table are not memory-efficient due to sparse distribution of the routing prefixes. In this paper, we propose memory-efficient hardware based IP lookup scheme called set-associative IP address lookup scheme, which provides the same IP lookup speed with much smaller memory requirement. In the proposed scheme, an NHA entry stores the prefix and next hop together. The IP lookup procedure compares a destination IP address with eight entries in a corresponding set simultaneously and finds the longest matched prefix. The memory requirement of the proposed scheme is about $42\%$ of that of Lin's scheme. Thus, the set-associative IP address lookup scheme is a memory-efficient hardware based IP address lookup scheme.

• Proceedings of the IEEK Conference
• /
• 2000.09a
• /
• pp.907-910
• /
• 2000

QPSK 복조기는 위상 오차에 따른 문제점을 극복하기 위해 수신단에서는 반송파의 주파수와 위상을 tracking 하는 Carrier recovery loop부분이 필요하다〔1〕. Carrier recovery loop는 multiplier, arm filter, matched filter, decimator, loop filter, NCO로 구성이 된다〔2〕.기존 Carrier recovery loop의 NCO는 sine과 cosine의 lookup table을 갖는 구조로 되어있어, 전력소모가 크다는 문제점을 가지고 있다. 따라서 본 논문에서는 lookup table을 사용하지 않는 저 전력 구조의 QPSK복조기의 Carrier recovery loop의 NCO를 설계했다.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.31B no.4
• /
• pp.123-128
• /
• 1994

Hardware realization of a digital 2-D homomorphic filter for real time contrast enhancement of video signal is presented. In homomorphic filter, logarithmic and exponential conversion used the memory lookup table method and because the hardware is implemented by multiplierless TTL devices, it can be designed to specific IC. The contrast gain can be controlled externally and the transfer function of homomorphic filter can be easily varied by the change of lookup table memory data.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2014.05a
• /
• pp.599-602
• /
• 2014

FPGA상에 AES 복호화 코어를 FIPS-197사양에 기술된 AES 알고리즘의 복호화부분을 구현하였다. 키값의 길이는 128/192/256비트를 지원하며, 별도의 코어 로직은 FPGA의 6-input lookup table의 이점을 살리도록 설계되었으며, 이결과로 2000개의 lookup table만을 이용하여 256비트 키에서 3Gbps의 처리가 가능하게 되었다. 코어는 난수 및 FIPS-197, SP-800a와 AESAVS사양의 테스트 벡터를 통해서 검증하였다.

• International journal of advanced smart convergence
• /
• v.5 no.3
• /
• pp.47-55
• /
• 2016

Router main task is to provide routing of Internet Protocol (IP) packets. Routing is achieved with help of the IP lookup. Router stores information about the networks and interfaces in data structures commonly called as routing tables. Comparison of IP from incoming packet with the IPs stored in routing table for the information about route is IP Lookup. IP lookup performs by longest IP prefix matching. The performance of the IP router is based on the speed of prefix matching. IP lookup is a major bottle neck in the performance of Router. Various algorithms and data structures are available for IP lookup. This paper is about reviewing various tree based structure and its performance evaluation.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.1
• /
• pp.7-12
• /
• 2007

In this paper, we introduce an approach to design multi-fuzzy controllers for the superheat and the low pressure that have an influence on energy efficiency and stabilization of aft conditioning system. Air conditioning system is composed of compressor, condenser several evaporators and several expansion valves. It is quite difficult to control the air conditioning system because the change of the refrigerant condition give an impact on the overall air conditioning system. In order to solve the drawback, we design multi-fuzzy controllers which control simultaneously both three expansion valve and one compressor for the superheat and the low pressure of air conditioning system. The proposed multi fuzzy controllers are given as two kinds of controller types such as a continuous simplified fuzzy inference type and a discrete fuzzy lookup_table type. Here the scaling factors of each fuzzy controller ate efficiently adjusted by veal coding type Genetic Algorithms. The values of performance index of the conventional type are compared with the simulation results of discrete lookup_table type and continuous simplified inference type.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.4
• /
• pp.773-778
• /
• 2007

In order to resolve problems with the phase error in QPSK demodulator of the digital satellite broadcasting 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 Inter 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 structure is $24.65{\mu}W$. 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.

• Journal of KIISE:Information Networking
• /
• v.35 no.1
• /
• pp.67-75
• /
• 2008

In this paper, we propose an efficient URL lookup algorithm for URL list-based web contents filtering systems. Converting a URL list into URL prefix form and building a hash tree representation of them, the proposed algorithm performs tree searches for URL lookups. It eliminates redundant searches of hash table method. Experimental results show that proposed algorithm is $62%{\sim}210%$ faster, depending on the number of segment, than conventional hash table method.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.40 no.9
• /
• pp.724-733
• /
• 2003

Generally, dividers have been designed to use iteration, but recently the research on the pipelined divider is underway. It is a difficult point in the known pipelined division unit that a large lookup table is required. In this paper, the cost-effective pipelined divider is proposed, that needs a lookup table smaller than that of the other pipelined divider. The latency of the proposed divider is 3 cycles. We obtain a 30% reduced area than that of P. Hung.