• 산업기술연구
• /
• 제24권B호
• /
• pp.143-148
• /
• 2004

We present a fast algorithm for CDMA (code division multiple access) multiuser detection using the gradient guided search. The fast algorithm calculates the maximum likelihood (ML) metric so efficiently that it needs only O(K) additions in the presence of K users once some initialization is completed. The computational advantages of the fast algorithm over the conventional method are more noticeable as more iterations are required to obtain a suboptimal solution as in the initialization with matched filters.

• Bulletin of the Korean Chemical Society
• /
• 제31권7호
• /
• pp.1902-1906
• /
• 2010

A microchip electrophoresis (ME) method was developed using a programmed field strength gradients (PFSG) for the single nucleotide polymorphism (SNP) based fast identification of cattle breeds. Four different Korean cattle (Hanwoo) and Holstein SNP markers amplified by allele-specific polymerase chain reaction were separated in a glass microchip filled with 0.5% poly(ethyleneoxide) ($M_r$ = 8 000 000) by PFSG as follows: 750 V/cm for 0 - 14 s, 166.7 V/cm for 14 - 31 s, 83.3 V/cm for 31 - 46 s, and 750 V/cm for 46 - 100 s. The cattle breeds were clearly distinguished within 45 s. The ME-PFSG method was 7 times and 5 times faster than the constant electric field ME method and the capillary electrophoresis- PFSG method, respectively, with a high resolving power ($R_s$ = 5.05 - 9.98). The proposed methodology could be a powerful tool for the fast and simultaneous determination of SNP markers for various cattle breeds with high accuracy.

• 대한전자공학회논문지TC
• /
• 제44권11호
• /
• pp.11-18
• /
• 2007

FFT(Fast Fourier Transform) 프로세서는 WiBro, DAB, UWB와 같은 OFDM 시스템의 구현에 있어 중요한 블록 중 하나이다. 현재, FFT 프로세서의 구현에 관한 연구는 계속 이루어지고 있으며 대부분의 연구들은 곱셈기의 수나 면적감소, 메모리 사이즈 감소, 제어회로를 감소시키는 것에 초점을 두어 진행되고 있다. 본 논문에서는 IFFT(Inverse Fast Fourier Transform)에서 요구되는 메모리를 감소시키기 위하여 mapping 방법을 토대로 한 새로운 IFFT 설계방법을 제안한다. WiBro를 위한 1024포인트 IFFT를 설계하기 위해 $Radix-2^4$ SDF(Single-Path Delay Feedback) 구조를 사용하여 시뮬레이션하였으며 제안된 IFFT 설계방법으로 구현했을 시 기존의 방법으로 설계했을 때와 비교하여 메모리가 차지하는 면적에서 60%이상의 감소와 입력비트별로 다양한 SQNR(Signal-to-Quantization-Noise Ratio) 이득을 보였다.

• 한국정보과학회논문지:시스템및이론
• /
• 제36권4호
• /
• pp.231-238
• /
• 2009

DNA 서열은 각 종을 나타내는 근본적인 정보이며, 다른 종 간의 DNA 서열 비교는 중요한 작업이다. DNA 서열은 길이가 매우 길며 또 종의 종류도 다양하기 때문에, DNA 서열 비교에서는 빠른 매칭 뿐만 아니라 효율적인 저장도 중요한 요소이다. 즉, 인코딩 된 DNA 서열에 적합한 빠른 문자열 매칭 방법이 필요하다. 본 논문에서는 매칭 시 디코딩이 필요하지 않은 인코딩 된 DNA 서열을 위한 빠른 매칭 알고리즘을 제시한다. 제시하는 알고리즘은 네 문자 한 바이트 인코딩을 이용하며 서픽스 기법과 다중 패턴 매칭 기법을 접목하고 있다. 실험 결과로는 본 논문에서 제시하는 방법이 AGREP보다 약 다섯배 빠름을 보이는데, 이는 알려진 알고리즘들 중에서 가장 빠른 결과이다.

• The Journal of the Acoustical Society of Korea
• /
• 제28권3E호
• /
• pp.118-135
• /
• 2009

The level set based approach is one of active methods for contour extraction in image segmentation. Since Osher and Sethian introduced the level set framework in 1988, the method has made the great impact on image segmentation. However, there are some problems to be solved; such as multi-objects segmentation, noise filtering and much calculation amount. In this paper we address the drawbacks of the previous level set methods and propose an extension of the traditional fast level set to cope with the limitations. We introduce a relationship matrix, a new split-and-merge criterion, a modified Chan-Vese criterion and a novel filtering criterion into the traditional fast level set approach. With the segmentation experiments we evaluate the proposed method and show the promising results of the proposed method.

• Journal of Electrical Engineering and Technology
• /
• 제4권2호
• /
• pp.272-276
• /
• 2009

In this paper, the arc region of a gas circuit breaker (GCB) is analyzed using the fast moving least square reproducing kernel method (FMLSRKM) which can simultaneously calculate an approximated solution and its derivatives. For this problem, an axisymmetric and inhomogeneous formulation of the FMLSRKM is used and applied. The field distribution obtained by the FMLSRKM is compared to that of the finite element method. Then, a whole breaking period of a GCB is simulated, including analysis of the arc gas flow by finite volume fluid in the cell, and the electric field of the arc region using the FMLSRKM.

• The Journal of the Acoustical Society of Korea
• /
• 제20권4E호
• /
• pp.24-30
• /
• 2001

This paper describes a fast harmonic estimation, referred to as Delta Adjustment (DA), using a low resolution pitch. The presented DA method is based on modification of the Generalized Dual Excitation (GDE) technique[1] which was proposed to improve speech enhancement performance. We introduce the GDE technique and modify it to be suitable for low bit rate harmonic coding that uses only an integer pitch estimate. Unlike the GDE, the DA matches a frequency-warped version of the original spectrum that conforms to a fixed pitch at all harmonic bands. In addition, complexity and performance of the presented method are described in comparison with those of the conventional Fractional Pitch (FP) based harmonic estimation. Experimental results showed that the DA algorithm significantly reduces the complexity of the FP method while maintaining the performance.

• 전자공학회논문지
• /
• 제50권6호
• /
• pp.260-264
• /
• 2013

This paper proposes a fast enhancement layer coding method to reduce computational complexity for Scalable HEVC (SHVC) which is based on High Efficiency Video Coding (HEVC). The proposed method decreases encoding time by simplifying Rate Distortion Optimization (RDO)for enhancement layers (EL). The simplification is achieved by restricting CU depths based on the correlation of coding unit (CU) depths between adjacent layers and scalability (spatial or quality) of EL. Comparing with the performance of SHM 1.0 software encoder, the proposed method reduces the encoding time by up to 31.5%.

• Journal of information and communication convergence engineering
• /
• 제8권6호
• /
• pp.697-701
• /
• 2010

The numbers of digital video cameras are fast increased. Accordingly, digital video data management is becoming more important. Efficient storing method and fast browsing method still remains to be one of significant issue. In this paper, an optimized data storing process without losing information and an organized appearance features indexing method are proposed. Also, the data removing policy could be used to reduce large amount of space and it facilitates fast sequential search. The appearance features index constructs key information of moving objects to answer queries about what people are doing, particularly when, where and who they move. The evaluation results showed better performance in the transfer time and the saving in storage space.

• ETRI Journal
• /
• 제45권6호
• /
• pp.1035-1045
• /
• 2023

We propose a novel graphics processing unit (GPU) algorithm that can handle a large-scale 3D fast Fourier transform (i.e., 3D-FFT) problem whose data size is larger than the GPU's memory. A 1D FFT-based 3D-FFT computational approach is used to solve the limited device memory issue. Moreover, to reduce the communication overhead between the CPU and GPU, we propose a 3D data-transposition method that converts the target 1D vector into a contiguous memory layout and improves data transfer efficiency. The transposed data are communicated between the host and device memories efficiently through the pinned buffer and multiple streams. We apply our method to various large-scale benchmarks and compare its performance with the state-of-the-art multicore CPU FFT library (i.e., fastest Fourier transform in the West [FFTW]) and a prior GPU-based 3D-FFT algorithm. Our method achieves a higher performance (up to 2.89 times) than FFTW; it yields more performance gaps as the data size increases. The performance of the prior GPU algorithm decreases considerably in massive-scale problems, whereas our method's performance is stable.