• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 2006.11a
• /
• pp.374-377
• /
• 2006

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

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.11 no.11
• /
• pp.2116-2120
• /
• 2007

A realization for image distortion correction processing system with DSP processor is presented in this paper. The image distortion correcting algorithm is realized by DSP processor for focusing on more real time processing than image quality. The lens and camera distortion coefficients are processed by the Lookup Tables and the correcting algorithm is applied to reverse mapping method for geometrical transform. The system experimentation results in the processing time about 31.3 msec $720{\times}480$ wide range image, and the image is stable and spontaneous to be about 8.3% average PSNR variation with changing a wide angle.

• The Journal of the Acoustical Society of Korea
• /
• v.38 no.3
• /
• pp.314-319
• /
• 2019

Computing chromagram similarity is indispensable in constructing cover song identification system. This paper proposes a code-based chromagram similarity to reduce the computational and the storage costs for cover song identification. By learning a song-specific codebook, a chromagram sequence is converted into a code sequence, which results in the reduction of the feature storage cost. We build a lookup table over the learned codebooks to compute chromagram similarity efficiently. Experiments on two music datasets were performed to compare the proposed code-based similarity with the conventional one in terms of cover song search accuracy, feature storage, and computational cost.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.31 no.3
• /
• pp.527-532
• /
• 2021

In this paper, we propose an efficient finite field computation method for Rainbow algorithm, which is the only multivariate quadratic-equation based digital signature among the current US NIST PQC standardization Final List algorithms. Recently, Chou et al. proposed a new efficient implementation method for Rainbow on the Cortex-M4 environment. This paper proposes a new multiplication method over the finite field that can reduce the number of XOR operations by more than 13.7% compared to the Chou et al. method. In addition, a multiplicative inversion over that can be performed by a 4x4 matrix inverse instead of the table lookup method is presented. In addition, the performance is measured by porting the software to which the new method was applied onto RaspberryPI 3B+.

• Convergence Security Journal
• /
• v.24 no.1
• /
• pp.69-76
• /
• 2024

The white-box implementation is a cryptographic technique used to protect the secret key of a cryptographic system. It is primarily employed for digital rights management for music and videos. Since 2002, numerous white-box implementations have been developed to ensure secure digital rights management. These have been applied to AES and DES. ARIA, a 128-bit block cipher with an involution substitution and permutation network (SPN), was selected as a South Korean standard in 2004. In this paper, we propose the first white-box ARIA implementation. Our implementation consists of 7,696 lookup tables, with a total size of 1,984 KB. We demonstrate that it also has considerable white-box diversity and white-box ambiguity from a security perspective.

• Journal of KIISE:Information Networking
• /
• v.28 no.2
• /
• pp.262-276
• /
• 2001

Recently much research for developing forwarding table that support fast router without employing both special hardware and new protocols. This article introduces a new forwarding data structure based on the software to enable forwarding lookup to be penormed at giga-bit speed. The forwarding table is known as a bottleneck of the routers penormance due to its high complexity proportional to the forwarding table size. The recent research that based on the software uses a Patricia trie and its variants. and also uses a hash function with prefix length key and others. The proposed forwarding table structure construct a forwarding table by the bit stream array in which it constructs trie from routing table prefix entries and it represents each pointer pointing the child node and the associated forwarding table entry with one bit The trie structure and routing prefix pointer need a large memory when representing those by linked-list or array. but in the proposed data structure, the needed memory size is small enough since it represents information with one bit. Additionally, by use a lookup method that start searching at desired middle level we can shorten the search path. The introduced data structure. called bit-map trie shows that we can implement a fast forwarding engine on the conventional Pentium processor by reducing the backbone routing table fits into Level 2 cache of Pentium II processor and shortens the searching path. Our experiments to evaluate the performance of proposed method show that this bit-map trie accomplishes 5.7 million lookups per second.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.2
• /
• pp.179-187
• /
• 2020

The FBC(Fixed-Base Comb) is a method to efficiently operate scalar multiplication, a core operation for signature generations of the ECDSA(Elliptic Curve Digital Signature Algorithm), utilizing precomputed lookup tables. Since the FBC refers to the table depending on the secret information and the values of the table are publicly known, an adversary can perform HCA(Horizontal Correlation Analysis), one of the single trace side channel attacks, to reveal the secret. However, HCA is a statistical analysis that requires a sufficient number of unit operation traces extracted from one scalar multiplication trace for a successful attack. In the case of the scalar multiplication for signature generations of ECDSA, the number of unit operation traces available for HCA is significantly fewer than the case of the RSA exponentiation, possibly resulting in an unsuccessful attack. In this paper, we propose an improved HCA on lookup table based scalar multiplication algorithms such as FBC. The proposed attack improves HCA by increasing the number of unit operation traces by determining such traces for the same intermediate value through collision analysis. The performance of the proposed attack increases as more secure elliptic curve parameters are used.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.1
• /
• pp.88-95
• /
• 2009

This paper presents a traffic pattern matching hardware that can be used in high performance network applications. The presented hardware is designed for a contents security system which is to block various kinds of information drain or intrusion activities. The hardware consists of two parts: the header lookup and string pattern matching parts. For implementing the header lookup part in hardware, the TCAMs(ternary CAMs) are popularly used. Since the TCAM approach is inefficient in terms of the hardware and memory costs and the power consumption, however, we adopt and modify an alternative approach based on the comparator arrays and the HiCuts tree. Our implementation results, using Xilinx FPGA XC4VSX55, show that our design can reduce the usage of the FPGA slices by about 26%, and the Block RAM by about 58%. In the design of string pattern matching part, we design and use a hashing module based on cellular automata, which is hardware efficient and consumes less power by adaptively changing its configuration to reduce the collision rates.

• Journal of the Korean Institute of Gas
• /
• v.24 no.2
• /
• pp.44-49
• /
• 2020

In this paper, a measuring circuit is designed through analyzing manufacture specification of the sensor based on MOS. And the best input-output polynomial are induced that really gas sensors are used in gas safety management industrial fields. Response characteristics of a MOS gas sensor is analysed by through sensor's output voltages are measured after standard gases with six kinds of concentrations are manufactured and are injected to the sensor. A lookup table is created by relations of sensor's output voltages by injecting gases with other concentrations. Because data of the formed lookup table are equal interval, a polynomial can be induced of method of approximation function. So the 5th polynomial of input-output for a sensor is defined, coefficients are calculated by using least squares method, and the 5th polynomial is completed for representing characteristics of the sensor. If the proposed polynomial is applied to gas leak detectors, an inverse transformation of polynomial and programing of array codes are recreated. In this research, polynomial is implemented with array types that intervals of values of a lookup table are one-fifth sampled and interpolated. The performance of proposed 5th calibration equation is verified that errors are reduced than a linear expression when tests are performed by measurement of concentrations against injection of standard gases.

• Journal of Broadcast Engineering
• /
• v.10 no.3
• /
• pp.413-421
• /
• 2005

As the population of HDTV is growing, among many useful features of modern set top boxes (STBs) or digital video recorders (DVRs), video browsing, visual bookmark, and picture-in-picture capabilities are very frequently required. These features typically employ reduced-size versions of video frames, or thumbnail images. Most thumbnail generation approaches generate DC images directly from a compressed video stream. A discrete cosine transform (DCT) coefficient for which the frequency is zero in both dimensions in a compressed block is called a DC coefficient and is simply used to construct a DC image. If a block has been encoded with field DCT, a few AC coefficients are needed to generate the DC image in addition to a DC coefficient. However, the bit length of a codeword coded with variable length coding (VLC) cannot be determined until the previous VLC codeword has been decoded, thus it is required that all codewords should be fully decoded regardless of their necessary for DC image generation. In this paper, we propose a method especially for fast DC image generation from an I-frame using multiple-symbol lookup table (mLUT). The experimental results show that the method using the mLUT improves the performance greatly by reducing LUT count by 50$\%$.