• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.7
• /
• pp.1259-1265
• /
• 2006

In this paper, we propose a combined synthetic algorithm of the logic level for high speed FPGA design. The algorithm divides critical path to reduce delay time and generates a circuit which the divided circuits execute simultaneously. This kernel selection algorithm is made by C-langage of SUN UNIX. We compare this with the existing FlowMap algorithm. This proposed algorithm shows result on 33.3% reduction of delay time by comparison with the existing algorithm.

• Journal of Korea Society of Industrial Information Systems
• /
• v.10 no.4
• /
• pp.16-25
• /
• 2005

In this paper, we proposed a novel algorithm combined simulated annealing and genetic algorithms for designing optimal binary phase computer generated hologram. In the process of genetic algorithm searching by block units, after the crossover and mutation operations, simulated annealing algorithm searching by pixel units is inserted. So, the performance of BPCGH was improved. Computer simulations show that the proposed combined iterative algorithm has better performance than the simulated annealing algorithm in terms of diffraction efficiency

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.26 no.5
• /
• pp.127-136
• /
• 1989

A Symbolic cover Minimization Algorithm and State CHDL Description for Finite State Machine Synthesizer are Presented. State CHDL are used for design of PLA based finite state machine, also the symbolic cover minimization algorithms are based upon single cube containment and distance 1 merging algorithms. The procedure for state machine synthesizer has been applied to practical example, including traffic light controller by using Boulder Optimal Logic Design System.

• Proceedings of the Acoustical Society of Korea Conference
• /
• 1993.06a
• /
• pp.265-269
• /
• 1993

디지틀 피아노에서 PCM 방식의 음원 합성을 위한 압축 알고리듬을 제안하였다. 디지틀 피아노는 매우 높은 음질을 필요로 한다. 따라서 FM 방식보다는 PCM 방식의 음원 합성 알고리듬이 주로 사용되어져 왔다. 그러나 PCM 방식은 많은 메모리가 필요한 단점이 있다. 본 논문에서는 피아노 음원을 청각적으로 왜곡이 없도록 압축, 저장하여 음원 데이터를 줄였다. 또한 피아노 음의 시간 영역 특성에 따라 비트 할당을 달리하여 음질을 향상시킬 수 있었다. 이와 같이 부호화할 경우 약 15 : 1 ~ 20 :1로 원음을 압축하여도 지각적으로 원음과 동일한 복원음을 얻을 수 있었다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1999.11a
• /
• pp.525-529
• /
• 1999

본 논문에서는 고속 FPGA 설계를 위한 논리 수준의 조합회로 합성 알고리듬을 제안한다. 제안 된 알고리듬은 회로의 지연시간을 줄이기 위해 critical path를 분할한 후 분할된 회로를 동시에 수행하는 구조의 회로를 생성한다. MCNC 표준 테스트 회로에 대한 실험에서 제안된 지연시간 최적화 알고리듬이 기존 알고리듬에 비해 지연시간이 평균 33.3 % 감소된 회로를 생성함을 보였다.

• The Journal of the Acoustical Society of Korea
• /
• v.22 no.8
• /
• pp.703-710
• /
• 2003

Because of their human-like synthesized speech quality, recently Corpus-Based Text-To-Speech(CB-TTS) have been actively studied worldwide. However, due to their large size speech database (DB), their application is very restricted. In this paper we propose and evaluate three DB reduction algorithms to which are designed to solve the above drawback. The first method is based on a K-means clustering approach, which selects k-representatives among multiple instances. The second method is keeping only those unit instances that are selected during synthesis, using a domain-restricted text as input to the synthesizer. The third method is a kind of hybrid approach of the above two methods and is using a large text as input in the system. After synthesizing the given sentences, the used unit instances and their occurrence information is extracted. As next step a modified K-means clustering is applied, which takes into account also the occurrence information of the selected unit instances, Finally we compare three pruning methods by evaluating the synthesized speech quality for the similar DB reduction rate, Based on perceptual listening tests, we concluded that the last method shows the best performance among three algorithms. More than this, the results show that the last method is able to reduce DB size without speech quality looses.

• Journal of Broadcast Engineering
• /
• v.23 no.4
• /
• pp.484-494
• /
• 2018

The uniform motion blur removing algorithm of Cho et al. has the problem that the edge region of the image cannot be restored clearly. We propose the effective algorithm to overcome this problem by using shock filter that reconstructs a blurred step signal into a sharp edge, and convolutional neural network (CNN) that learns by extracting features from the image. Then uniform motion blur kernel is estimated from the latent sharp image to remove blur in the image. The proposed algorithm improved the disadvantages of the conventional algorithm by reconstructing the latent sharp image using shock filter and CNN. Through the experimental results, it was confirmed that the proposed algorithm shows excellent reconstruction performance in objective and subjective image quality than the conventional algorithm.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6C
• /
• pp.874-882
• /
• 2004

MPEG Audio compression algorithm is the international standard for the digital compression of high quality audio using mechanism of the perceptual coding based on psychoacoustic masking. It is necessary to discuss the constraints on designing of common filter banks for MPEG-2 BC and MPEG-2 AAC decoder system, which is not Down yet, mapping audio signals from the time domain into the frequency domain. In this paper, we present an architecture of common synthesis filter whcih can be used for MPEG-2 BC and MPEG-2 AAC decoder using recursive structure. The proposed algorithm is based on recursive architecture that effectively performs common compulsion.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.5C
• /
• pp.468-475
• /
• 2003

In this Paper, we design an optimal binary phase computer generated hologram for Pattern generation using combined genetic algorithm and simulated annealing algorithm together. To design an optimal binary phase computer generated hologram, in searching process of the proposed method, the simple genetic algorithm is used to get an initial random transmittance function of simulated annealing algorithm. Computer simulation shows that the proposed algorithm has better performance than the genetic algorithm or simulated annealing algorithm of terms of diffraction efficiency

• Journal of Broadcast Engineering
• /
• v.22 no.3
• /
• pp.327-338
• /
• 2017

Exposure fusion is a typical image fusion technique to generate a high dynamic range image by combining two or more different exposure images. In this paper, we propose block-based exposure adjustment considering unique characteristics of human visual system and improved saturation measure to get weight map. Proposed exposure adjustment artificially corrects intensity values of each input images considering human visual system, efficiently preserving details in the result image of exposure fusion. The improved saturation measure is used to make a weight map that effectively reflects the saturation region in the input images. We show the superiority of the proposed algorithm through subjective image quality, MEF-SSIM, and execution time comparison with the conventional exposure fusion algorithm.