• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.16 no.10
• /
• pp.2207-2216
• /
• 2012

Recently, wireless Internet environment with mobile phones and wireless sensor networks with severe resource restrictions have been actively studied. Moreover, an overall security issues are essential to build a reliable and secure sensor network. One of secure solution is to develop a fast cryptographic algorithm for data encryption. Therefore, we propose a 128-bit stream cipher, AA128 which has efficient implementation of software and hardware and is suitable for real-time applications such as wireless Internet environment with mobile phones, wireless sensor networks and Digital Right Management (DRM). AA128 is stream cipher which consists of 278-bit ASR and non-linear transformation. Non-linear transformation consists of Confusion Function, Nonlinear transformation(SF0 ~ SF3) and Whitening. We show that the proposed stream cipher AA128 is faster than AES and Salsa20, and it satisfies the appropriate security requirements. Our hardware simulation result indicates that the proposed cipher algorithm can satisfy the speed requirements of real-time processing applications.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.4
• /
• pp.727-736
• /
• 2009

In this paper, the $arccos(cos^{-1})$ arithmetic unit for mobile graphics accelerator is designed. The mobile vector graphics applications need tight area, execution time, power dissipation, and accuracy constraints compared to desktop PC applications. The designed processor adopts 2nd-order polynomial approximation scheme based on IEEE floating point data format to satisfy speed and accuracy conditions and reduces area via hardware sharing structure. The arccosine processor consists of 15,280 gates and its estimated operating frequency is about 125Mhz at operating condition of $0.35{\mu}m$ CMOS technology. Because the processor can execute arccosine function within 7 clock cycles, it has about 17 MOPS(million arccos operations per second) execution rate and can be applicable to mobile OpenVG processor. And because of its flexible architecture, it can be applicable to the various transcendental functions such as exponential, trigonometric and logarithmic functions via replacement of ROM and minor hardware modification.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.25 no.4
• /
• pp.508-514
• /
• 2021

In this paper, to propose a classifier based on supervised learning, three types of fuzzy membership functions that determine the membership of each feature of classification data are proposed. In addition, the possibility of improving the classifier performance was suggested by using the average value calculation method used in the process of deriving the classification result using the average value of the membership degrees for each feature, not by using a simple arithmetic average, but by using a weighted average using various weights. To experiment with the proposed methods, three standard data sets were used: Iris, Ecoli, and Yeast. As a result of the experiment, it was confirmed that evenly excellent classification performance can be obtained for data sets of different characteristics. It was confirmed that better classification performance is possible through improvement of fuzzy membership functions and the weighted average methods.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.45 no.4
• /
• pp.94-104
• /
• 2008

In this paper, we propose a new architecture of multiplier-and-accumulator (MAC) for high speed multiplication and accumulation arithmetic. By combining multiplication with accumulation and devising a hybrid type of carry save adder (CSA), the performance was improved. Since the accumulator which has the largest delay in MAC was removed and its function was included into CSA, the overall performance becomes to be elevated. The proposed CSA tree uses 1's complement-based radix-2 modified booth algorithm (MBA) and has the modified array for the sign extension in order to increase the bit density of operands. The CSA propagates the carries by the least significant bits of the partial products and generates the least significant bits in advance for decreasing the number of the input bits of the final adder. Also, the proposed MAC accumulates the intermediate results in the type of sum and carry bits not the output of the final adder for improving the performance by optimizing the efficiency of pipeline scheme. The proposed architecture was synthesized with $250{\mu}m,\;180{\mu}m,\;130{\mu}m$ and 90nm standard CMOS library after designing it. We analyzed the results such as hardware resource, delay, and pipeline which are based on the theoretical and experimental estimation. We used Sakurai's alpha power low for the delay modeling. The proposed MAC has the superior properties to the standard design in many ways and its performance is twice as much than the previous research in the similar clock frequency.

• Journal of Korea Spatial Information System Society
• /
• v.4 no.2 s.8
• /
• pp.65-74
• /
• 2002

The CBD(component based development) method has recently been on the rise as the main current among all fields of developing Information Systems. The developing system by building and integrating of components is encouraged in GIS sphere. Business domain which considerably identifies components occupies GIS shpere rather then any other sphere. Arithmetic function is quite needed in GIS sphere but non-arithmetic functions are also used in GIS sphere as well as in enterprise sphere. Component is characterized by ensuring the reuse of itself. The efficiency of reusing component is promoted as the component is functionally simple and is packed to a minimum. The GIS Component Extraction Method has already been presented in several studies but this study is about the GIS Component Extraction by the Affinity Analysis Method. CBD uses UML on a basis and the core of the UML is consisted of the use case and the class. The purpose of the Affinity Analysis is a study how relate between the use case and the class in a certain business domain and then the results identify the component. The Affinity Analysis is useful not only in GIS but also in every business domain and is considered to be popular as the procedure of this method is not complex at all.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.6B
• /
• pp.954-961
• /
• 2010

Stream cipher was worse than block cipher in terms of security, but faster in execution speed as an advantage. However, since so far there have been many algorithm researches about the execution speed of block cipher, these days, there is almost no difference between them in the execution speed of AES. Therefore an secure and fast stream cipher development is urgently needed. In this paper, we propose a 32bit output fast stream cipher, AA32, which is composed of ASR(Arithmetic Shifter Register) and simple logical operation. Proposed algorithm is a cipher algorithm which has been designed to be implemented by software easily. AA32 supports 128bit key and executes operations by word and byte unit. As Linear Feedback Sequencer, ASR 151bit is applied to AA32 and the reduction function is a very simple structure stream cipher, which consists of two major parts, using simple logical operations, instead of S-Box for a non-linear operation. The proposed stream cipher AA32 shows the result that it is faster than SSC2 and Salsa20 and satisfied with the security required for these days. Proposed cipher algorithm is a fast stream cipher algorithm which can be used in the field which requires wireless internet environment such as mobile phone system and real-time processing such as DRM(Digital Right Management) and limited computational environments such as WSN(Wireless Sensor Network).

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.1
• /
• pp.149-160
• /
• 1997

This paper is concerned with the problem of speaker-adaptive speech synthes is method using a mapped codebook designed by fuzzy mapping on FLVQ (Fuzzy Learning Vector Quantization). The FLVQ is used to design both input and reference speaker's codebook. This algorithm is incorporated fuzzy membership function into the LVQ(learning vector quantization) networks. Unlike the LVQ algorithm, this algorithm minimizes the network output errors which are the differences of clas s membership target and actual membership values, and results to minimize the distances between training patterns and competing neurons. Speaker Adaptation in speech synthesis is performed as follow;input speaker's codebook is mapped a reference speaker's codebook in fuzzy concepts. The Fuzzy VQ mapping replaces a codevector preserving its fuzzy membership function. The codevector correspondence histogram is obtained by accumulating the vector correspondence along the DTW optimal path. We use the Fuzzy VQ mapping to design a mapped codebook. The mapped codebook is defined as a linear combination of reference speaker's vectors using each fuzzy histogram as a weighting function with membership values. In adaptive-speech synthesis stage, input speech is fuzzy vector-quantized by the mapped codcbook, and then FCM arithmetic is used to synthesize speech adapted to input speaker. The speaker adaption experiments are carried out using speech of males in their thirties as input speaker's speech, and a female in her twenties as reference speaker's speech. Speeches used in experiments are sentences /anyoung hasim nika/ and /good morning/. As a results of experiments, we obtained a synthesized speech adapted to input speaker.

• Korean Journal of Biological Psychiatry
• /
• v.24 no.2
• /
• pp.75-81
• /
• 2017

Objectives Obsessive-compulsive disorder (OCD) is a chronic and disabling psychiatric disorder. The duration of untreated illness (DUI) has been suggested as one of the predictors of clinical course and outcome in various psychiatric disorders. There is increasing evidence that cognitive dysfunction is associated with the prognosis of OCD. The aim of this study was to investigate the influence of DUI on the neurocognitive functions in patients with OCD. Methods Sixty-two patients with a DSM-IV diagnosis of OCD from the outpatient clinic were included in this study. We defined the short DUI if the DUI was 2-year or less and the long DUI if it was longer than 2-year. Neurocognitive functions were assessed by visuospatial memory function test and 4 subsets of K-WAIS such as vocabulary, arithmetic, block design and picture arrangement. Differences in neurocognitive functions as well as clinical variables between OCD patients with short DUI and those with long DUI were investigated. Correlation analyses were also performed to determine the correlation between DUI and neurocognitive functions. Results Compared with the short DUI group, the long DUI group performed worse in the block design test, which measures executive function. The long DUI group also had a higher level of compulsive symptom severity than the short DUI group. However, the DUI was not correlated with neurocognitive functions. Conclusions Findings in this preliminary study suggest that the long DUI in patients with OCD is associated with more severe executive dysfunction. Studies with larger samples and longitudinal design are needed to further confirm the prognostic role of the DUI in OCD.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.14 no.3
• /
• pp.715-722
• /
• 2010

This paper describes a hardware design of hash function processor which implements Korean Hash Algorithm Standard HAS-160. The HAS-160 processor compresses a message with arbitrary lengths into a hash code with a fixed length of 160-bit. To achieve high-speed operation with small-area, arithmetic operation for step-operation is implemented by using a hybrid structure of 5:3 and 3:2 carry-save adders and carry-select adder. It computes a 160-bit hash code from a message block of 512 bits in 82 clock cycles, and has 312 Mbps throughput at 50 MHz@3.3-V clock frequency. The designed HAS-160 processor is verified by FPGA implementation, and it has 17,600 gates on a layout area of about $1\;mm^2$ using a 0.35-${\mu}m$ CMOS cell library.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.15 no.1
• /
• pp.61-70
• /
• 2020

In this study, the IOT-based desk layout method was proposed to complement the existing seating method and to improve the work efficiency. The IoT system for the desk layout needs determining the function, type and network protocol of the sensor to find out the working status of the desk to reasonably assist the worker's seat placement. A collection method was proposed. The algorithm used in Block Stacking was used when deciding how to allocate seats using the acquired data. As a result, we could suggest an arithmetic basis for rational desk layout in IoT environment and show that it can be applied to an advanced flexible seating system based on working type in addition to the preferences of employees in the future.