• The KIPS Transactions:PartA
• /
• v.12A no.1 s.91
• /
• pp.79-86
• /
• 2005

This paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm Is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in audition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.

• IEMEK Journal of Embedded Systems and Applications
• /
• v.4 no.3
• /
• pp.103-111
• /
• 2009

Software update has been regarded as one of fundamental functions in wireless sensor networks. It can disseminate a delta-image between a current software image operating on a sensor node and its new image in order to reduce an update image(transmission data) size, resultantly saving energy. In addition, code-banking capability of micro-controllers can decrease the update image size. In order to maximize the efficiency of the software update, the proposed scheme exploits both the delta-image and the code-banking at the same time. Besides, it additionally delivers a recovery delta-image to properly handle abnormal conditions, such as message corruptions and unexpected power-off during the update.

• Journal of Communications and Networks
• /
• v.7 no.4
• /
• pp.489-498
• /
• 2005

For better performance over a noisy channel, mobile wireless networks transmit packets with forward error correction (FEC) code to recover corrupt bits without retransmission. The static determination of the FEC code size, however, degrades their performance since the evaluation of the underlying channel state is hardly accurate and even widely varied. Our measurements over a wireless sensor network, for example, show that the average bit error rate (BER) per second or per minute continuously changes from 0 up to $10^{-3}$. Under this environment, wireless networks waste their bandwidth since they can't deterministically select the appropriate size of FEC code matching to the fluctuating channel BER. This paper proposes an adaptive FEC technique called adaptive FEC code control (AFECCC), which dynamically tunes the amount of FEC code per packet based on the arrival of acknowl­edgement packets without any specific information such as signal to noise ratio (SNR) or BER from receivers. Our simulation experiments indicate that AFECCC performs better than any static FEC algorithm and some conventional dynamic hybrid FEC/ARQ algorithms when wireless channels are modeled with two-state Markov chain, chaotic map, and traces collected from real sensor networks. Finally, AFECCC implemented in sensor motes achieves better performance than any static FEC algorithm.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.30 no.5
• /
• pp.781-793
• /
• 2020

In this paper, we propose a new RLWE-based scheme named μ-Hope that exploits Error Correcting Code(ECC) on NewHope. The previous parameters of NewHope uses 12289 as a prime modulus, and the size of the public key, private key, and ciphertext is 928-byte, 1888-byte, and 1120-byte respectively, which can be said to be larger than other RLWE based algorithms. In this paper, we propose μ-Hope, which changes modulus 12289 to 769 to reduce the size of the public key, private key, and ciphertext. Also, we adopts XE1 as an Error Correcting Code(ECC) to solve the increased decryption failure rate caused by using a small prime modulus. As a result, the size of the public key, private key, and ciphertext decreased by 38%, 37%, and 37% respectively. As the computational efficiency caused by using a small prime modulus exceeds the performance degradation by exploiting ECC, this result in 25% performance improvement for a single key exchange.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 1995.04a
• /
• pp.187-194
• /
• 1995

Traditional genetic algorithms(GA) have mostly used binary code for representing design variable. The binary code GA has many difficulties to solve optimization problems with continuous design variables because of its targe computer core memory size, inefficiency of its computing time, and its bad performance on local search. In this paper, a real code GA is proposed for dealing with the above problems. So, new crossover and mutation processes of read code GA are developed to use continuous design variables directly. The results of real code GA are compared with those of binary code GA for several single and multiple objective optimization problems. As results of comparisons, it is found that the performance of the real code GA is better than that of the binary code GA, and concluded that the rent code GA developed here can be used for the general optimization problem.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.5
• /
• pp.1491-1499
• /
• 2000

This paper is designed and implemented the data recovery mechanism for 2-D (2-dimensional) bar code system. The data recovery algorithm used the modified Reed-Solomon algorithm and it is implemented into 2-D bar code system. There are 7 types of 2-D bar code system, which are 21x21, 25x25, 41x41, 73x73, 101x101, 177x177. This paper has been experimented that how many data is saved among several 2-D bar code types and how many data re recovered. In the first experiment, the big size 2-D bar code system has many ECC codeword. Therefore, original data cannot be assigned to 2-D bar code system. In the second experiment, even if 35∼40% loss dta for the 2-D bar code system, the 2-D bar code system could have been recovered to original data.

• Fashion & Textile Research Journal
• /
• v.13 no.2
• /
• pp.205-214
• /
• 2011

The purpose of this study is to develop a size information providing model which is easy recognition and utilization for customer. This study also implemented web page to apply the size-informational model. Web page implemented using Apache Web Server and JAVA client-side scripting. Research result on the actual condition of fashion electronic commerce, most of the firms are used the old named same with period of 1980. On the same named-code, they are used different sizing systems by firms or items. Size interval is used 2~5 cm, different by firms. In the size information, is provided only named-code(55, 66 etc.) or garment size, and is confusing whether the marked is body size or garment size. Many of the marked size information were wrong. The sizing system of KS K5001(2009) is not used well. These problems are increased a lose customer and firm by return, exchange, mending-cost, stock, etc. Therefore, the problems should be improved by providing correct and detailed information of size and garment, as well as standardization of sizing systems based on KS K5001.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.8 no.3
• /
• pp.122-130
• /
• 2009

The paper presents an algorithm which uses code vectors to represent comer geometry information for searching the similar images from a database. The comers have been extracted by finding the intersections of the detected lines found using Hough transform. Taking the comer as the center coordinate, the angles of the intersecting lines are determined and are represented using code vectors. A code book has been used to code each comer geometry information and indexes to the code book are generated. For similarity measurement, the histogram of the code book indexes is used. This result in a significant small size feature matrix compared to the algorithms using color features. Experimental results show that use of code vectors is computationally efficient in similarity measurement and the comers being noise invariant produce good results in noisy environments.

• Proceedings of the IEEK Conference
• /
• 2000.11b
• /
• pp.273-276
• /
• 2000

Recently, Turbo code has been considered for channel coding in IMT-2000(International Mobile Telecommunication-2000) system, because it offers better error correcting capability than the traditional convolution/viterbi coding . In this paper, a turbo code decoder for speech transmission in IMT-2000 system with frame size 192 bits, constrait length K=3, generator polynomials G(5,7) and code rate R=1/3 is designed using SOVA(Soft Output Viterbi Algorithm) and block interleaver

• Proceedings of the Earthquake Engineering Society of Korea Conference
• /
• 1998.10a
• /
• pp.188-195
• /
• 1998

The seismic design guidelines for the pile-supported marginal wharf structures are studied. Various design codes such as AASHTO code or UBC code, which are focused on general structures, may be referred for the design of the wharf structures. However, in developing domestic design code, special consideration should be made concerning the size of the earthquake and the type of the structure. This study aims at the comparison among the various design codes for a specific wharf structure in the process of developing a domestic design code.