• The Journal of the Acoustical Society of Korea
• /
• v.23 no.1
• /
• pp.54-60
• /
• 2004

In order to mitigate the problems in storage space and network bandwidth for the full CD quality audio, current digital audio is always restricted by sampling rate and bandwidth. This restriction normally results in low sample rate audio or calls for the data compression scheme such as MP3. However, they can only reproduce a lower frequency range than a regular CD quality because of the Nyquist sampling theory. Consequently they lose rich spatial information embedded in high frequency. The propose of this paper is to propose efficient high frequency enhancement of low sample rate audio using n adaptive filtering and DWT analysis and synthesis. The proposed algorithm uses the LMS adaptive algorithm to estimate the missing high frequency contents in DWT domain and it then reconstructs the spectrally enhanced audio by using the DWT synthesis procedure. Several experiments with real speech and audio are performed and compared with other algorithm. From the experimental results of spectrogram and sonic test, we confirm that the proposed algorithm outperforms the other algorithm and reasonably works well for the most of audio cases.

• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.4
• /
• pp.97-102
• /
• 2001

In computer-aided design, partitioning is task of clustering objects into groups to that a given objection function is optimized It is used at the layout level to fin strongly connected components that can be placed together in order to minimize the layout area and propagation delay. Partitioning can also be used to cluster variables and operation into groups for scheduling and unit selection in high-level synthesis. The most popular algorithms partitioning include the Kernighan-Lin algorithm Fiduccia-Mattheyses heuristic and simulated annealing In this paper we propose a genetic algorithm searching solution space for the circuit partitioning problem. and then compare it with simulated annealing by analyzing the results of implementation.

• Journal of the Korea Society of Computer and Information
• /
• v.18 no.8
• /
• pp.1-8
• /
• 2013

This paper proposes an effective parallel implementation of a physical modeling synthesis of guitar on the GPU environment. We used appropriate filter coefficients and adjusted the length of delay line for each open string to generate 44,100 six-polyphonic guitar sounds (E2, A2, D3, G4, B3, E4) by using physical modeling synthesis. In addition, we analyzed the physical modeling synthesis algorithm and observed that we can exploit parallelism inherent in the length of delay line. Thus, we assigned CUDA cores as many as the length of delay line and effectively implemented the physical modeling synthesis using GPU to achieve the highest performance. Experimental results indicated that synthetic guitar sounds using GPU were very similar to the original sounds when we compared their spectra. In addition, GPU achieved 68x and 3x better performance than high-performance TI DSP and CPU, respectively. Furthermore, this paper implemented and evaluated the performance of multi-GPU systems for the physical modeling algorithm.

• Speech Sciences
• /
• v.12 no.1
• /
• pp.55-63
• /
• 2005

This paper introduces a 'Hanmal' Korean language diphone database for speech synthesis, which has been publicly available since 1999 in the MBROLA web site and never been properly published in a journal. The diphone database is compatible with the MBROLA programme of high-quality multilingual speech synthesis systems. The usefulness of the diphone database is introduced in the paper. The paper also describes the phonetic and phonological structure of the database, showing the process of creating a text corpus. A machine-readable Korean SAMPA convention for the control data input to the MBROLA application is also suggested. Diphone concatenation and prosody manipulation are performed using the MBR-PSOLA algorithm. A set of segment duration models can be applied to the diphone synthesis of Korean.

• Journal of KSNVE
• /
• v.8 no.1
• /
• pp.139-145
• /
• 1998

A great deal of effort has been invested in upgrading the performance and the efficiency of dynamic analysis of mechanical structures. Using experimental modal analysis(EMA) or finite element analysis(FEA) data of mechanical structures, the performance and efficiency can be effectively evaluated. In order to analyze complex structures such as automobiles and aircrafts, for the sake of computing efficiency, the dynamic substructuring techniques that allow to predict the dynamic behavior of a structure are widely used. Through linking a modal model obtained from EMA and an analytical model obtained from FEA, the best conditioned strucutres can be proposed. In this study, a new algorithm of substructre synthesis method, Multi-FRF synthesis method, is proposed to analyze a structure composed of many substructures.

• Proceedings of the IEEK Conference
• /
• 1998.06a
• /
• pp.803-806
• /
• 1998

This thesis proposes a new heuristic algorithm of integrated allocation and binding for high level synthesis. The proposed algorithm simultaneously allocates binds functional units, interconnections and registers by considering interdependency between operations and storage elements in each control step, in order to share registers and interconnections connected to functional units, as much as possible. This thesis shows the effectiveness of the algorithm by comparing the results of out experiments with those of existing system.

• Proceedings of the IEEK Conference
• /
• 2003.07e
• /
• pp.2459-2462
• /
• 2003

In this paper, we Propose a wavelet based adaptive algorithm which improves the convergence speed and reduces computational complexity using the fast running FIR filtering efficiently. We compared the performance of the proposed algorithm with time and frequence domain adaptive algorithm using computer simulation of adaptive noise canceler based on synthesis speech.

• Proceedings of the IEEK Conference
• /
• 2000.07a
• /
• pp.302-305
• /
• 2000

This paper proposed an optimal register resource allocation algorithm using graph coloring for minimal register at high level synthesis. The proposed algorithm constructed interference graph consist of the intermediated representation CFG to description VHDL. and at interference graph fur the minimal select color selected a position node at stack, the next inserted spill code and the graph coloring process executes for optimal register allocation. The proposed algorithm proves to effect that result compare another allocation techniques through experiments of bench mark.

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• pp.103.2-103
• /
• 2002

1. Introduction 2. Structure of BNN 3. Decision of weight value and threshold value 4. Principle of Extension in the ETL algorithm 5. Approximation problem of one circular region 6. Problem of synthetic image having four class 7. Conclusion

• Journal of Integrative Natural Science
• /
• v.1 no.2
• /
• pp.149-159
• /
• 2008

We develop two algorithms that nd a minimal polynomial of a finite sequence. One uses Euclid's algorithm, and the other is in essence a minimal polynomial version of the Berlekamp-Massey algorithm. They are formulated naturally and proved algebraically using polynomial arithmetic. They connects up seamlessly with decoding procedure of alternant codes.