• The Journal of Korea Institute of Information, Electronics, and Communication Technology
• /
• v.9 no.2
• /
• pp.205-212
• /
• 2016

In this paper, we implement the development platform of multichannel digital hearing aid algorithm using Simulink provided by Matlab. The digital hearing aids are considered medical devices designed to compensate for hearing loss, they need to be correctly selected, to help a person who has difficulty in hearing. The development platform that implemented in this paper, includes WOLA filterbank for analysis/synthesis of input signal, Wide dynamic range compression for hearing loss compensation and adaptive filter for feedback cancellation. Using the development platform, algorithm parameters for each block can be set depending on the hearing aid user. Thus it is possible to test the algorithm before the machine language. As a result, the time for algorithm development can be saved and performance and computational complexity can be optimized.

• Journal of the Korea Society of Computer and Information
• /
• v.25 no.1
• /
• pp.79-86
• /
• 2020

In this paper, we analyzed the case vulnerable to the power analysis attack of the ARIA algorithm and AES algorithm. Through this, we propose an algorithm with a safe structure for power analysis and prove through experiment. The proposed technique is a masking method using LFSR with a cyclic structure. To verify this, 1000, 2000, and 4000 power traces were collected, and the corresponding results are shown and proved. We used ATmega328 Chip for Arduino Uno for the experiment and mounted each algorithm. In order to measure the power consumption, a resistor was inserted and then proceeded. The analysis results show that the proposed structure has a safe structure for power analysis. In the future, we will study ways to lead to performance enhancement.

• Journal of Power Electronics
• /
• v.11 no.2
• /
• pp.228-236
• /
• 2011

The ${\Delta}\;V_{10}$ or 10-Hz flicker index, as a common method of measurement of voltage flicker severity in power systems, requires a high computational cost and a large amount of memory. In this paper, for measuring the ${\Delta}\;V_{10}$ index, a new method based on the Adaline (adaptive linear neuron) system, the FFT (fast Fourier transform), and the PSO (particle swarm optimization) algorithm is proposed. In this method, for reducing the sampling frequency, calculations are carried out on the envelope of a power system voltage that contains a flicker component. Extracting the envelope of the voltage is implemented by the Adaline system. In addition, in order to increase the accuracy in computing the flicker components, the PSO algorithm is used for reducing the spectral leakage error in the FFT calculations. Therefore, the proposed method has a lower computational cost in FFT computation due to the use of a smaller sampling window. It also requires less memory since it uses the envelope of the power system voltage. Moreover, it shows more accuracy because the PSO algorithm is used in the determination of the flicker frequency and the corresponding amplitude. The sensitivity of the proposed method with respect to the main frequency drift is very low. The proposed algorithm is evaluated by simulations. The validity of the simulations is proven by the implementation of the algorithm with an ARM microcontroller-based digital system. Finally, its function is evaluated with real-time measurements.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.8 no.8
• /
• pp.1155-1160
• /
• 2013

The rapid growth of smart phones has made location-based services (LBSs) widely available. However, the use of LBS can raise privacy issues, as LBS can allow adversaries to violate the location privacy of users. There has been a considerable amount of research on preserving user location privacy. Most of these studies try to preserve location privacy by achieving what is known as location K-anonymity. In this paper, we propose a hierarchical clustering-based spatial cloaking algorithm for LBSs. The proposed algorithm constructs a tree using a modified version of agglomerative hierarchical clustering. The experimental results show, in terms of the ASR size, that the proposed algorithm is better than Hilbert Cloak and comparable to RC-AR (R-tree Cloak implementation of Reciprocal with an Asymmetric R-tree split). In terms of the ASR generation time, the proposed algorithm is much better in its performance than RC-AR and similar in performance to Hilbert Cloak.

• Journal of Korea Multimedia Society
• /
• v.14 no.7
• /
• pp.917-923
• /
• 2011

In this paper, a new prediction based embedded compression (EC) codec algorithm for the JPEG2000 encoder system is proposed to reduce excessive memory requirements. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform (DWT) stages compared with direct implementation of the DWT engine of this paper. The LOCO-I predictor and MAP are widely used in many lossless picture compression codec. The proposed EC algorithm use these predictor which are very simple but surprisingly effective. The predictive EC scheme adopts a forward adaptive quantization and fixed length coding to encoding the prediction error. Simulation results show that our LOCO-I and MAP based EC codecs present only PSNR degradation of 0.48 and 0.26 dB in average, respectively. The proposed algorithm improves the average PSNR by 1.39 dB compared to the previous work in [9].

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.135-148
• /
• 2000

In this paper, we present a linear scheduling method for homogeneous multiprocessor systems using genetic algorithms. In general, genetic algorithms randomly generate initial strings, which leads to long operation time and slow convergence due to an inappropriate initialization. The proposed algorithm considers communication costs among processors and generates initial strings such that successive nodes are grouped into the same cluster. In the crossover and mutation operations, the algorithm maintains linearity in scheduling by associating a node with its immediate successor or predecessor. Linear scheduling can fully utilize the inherent parallelism of a given program and has been proven to be superior to nonlinear scheduling on a coarse grain DAG (directed acyclic graph). This paper emphasizes the usability of the genetic algorithm for real-time applications. Simulation results show that the proposed algorithm rapidly converges within 50 generations in most DAGs.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.1
• /
• pp.13-22
• /
• 2000

We present a method that enhances the rendering speed of z-buffer algorithm using temporal coherence between two contiguous frames on fixed viewing conditions. Conventional z-buffer algorithm stores depth value for each pixel on a view plane while rendering some polygons, then it determines the visibility of the remaining polygons based on the stored depth values. If we can get color and depth information for some polygons without rendering, it is possible to generate an image by rendering only the remaining ones. In case of high frame rate, we can find the fact that sets of static polygons of the two contiguous frames are almost the same. This temporal coherence enables us to get the color and depth information of static polygons efficiently. Our algorithm stores color and depth information of static polygons and reuses it for generating the next frame. This method can be easily implemented since it does not require complex data structure and modification for conventional z-buffer algorithm. Also it is adequate for hardware implementation.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.23 no.10
• /
• pp.115-120
• /
• 2009

In this parer, we design the artificial intelligent direction escape light control system to improve/complete the defects of the existing fire fighting system, and sketch an optimum escape guide algorithm for its implementation. It intends to minimize human casualties and injuries by calculating/predicting moving line of the optimum emergency escape, by means of interlocking the sensor and the reception group and analyzing the data of the combustion point and the smoke movement. The optimum escape algorithm is designed by FLOYD algorithm which calculates the shortest distance. It consists of the measuring method which calculates the shortest distance by using hazardous factors for each condition in danger which is judged by the sensor installed in each area.

• The Journal of the Korea Contents Association
• /
• v.12 no.3
• /
• pp.77-83
• /
• 2012

In this paper, a low-complexity embedded compression (EC) Codec algorithm for the wavelet video coder is applied to reduce excessive external memory requirements. The EC algorithm is used to achieve a fixed compression ratio of 50 % under the near-lossless-compression constraint. The EC technique can reduce the 50 % memory requirement for intermediate low-frequency coefficients during multiple discrete wavelet transform stages compared with direct implementation of the wavelet video encoder of this paper. Furthermore, the EC scheme based on a forward adaptive quantization and fixed length coding can save bandwidth and size of buffer between DWT and SPIHT to 50 %. Simulation results show that our EC algorithm present only PSNR degradation of 0.179 and 0.162 dB in average when the target bit-rate of the video coder are 1 and 0.5 bpp, respectively.

• Journal of Biosystems Engineering
• /
• v.31 no.1 s.114
• /
• pp.59-64
• /
• 2006

Application of herbicide for rice cropping is inevitable but notorious for its side effect of environmental pollution. Precision fanning will be one of important tools for the least input and sustainable fanning and could be achieved by implementation of the variable rating technology. If a device to detect weeds in rice field is available, herbicide could be applied only to the places where it is needed by the manner of the variable rating technology. The study was carried out to develop an algorithm of image processing to detect weeds in rice field using a machine vision system of multi-spectral digital images. A series of multi-spectral rice field picture of 560, 680 and 800 nm of center wavelengths were acquired from the 27th day to the 39th day after transplanting in the ineffective tillering stage of a rice growing period. A discrimination model to distinguish pixels of weeds from those of rice plant and weed image was developed. The model was proved as having accuracies of 83.6% and 58.9% for identifying the rice plant and the weed, respectively. The model was used in the algorithm to differentiate weed images from mingled images of rice plant and weed in a frame of rice field picture. The developed algorithm was tested with the acquired rice field pictures and resulted that 82.7%, 11.9% and 5.4% of weeds in the pictures were noted as the correctly detected, the undetected and the misclassified as rice, respectively, and 81.9% and 18.0% of rice plants in the pictures were marked as the correctly detected and the misclassified as weed, respectively.