• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.37 no.5
• /
• pp.115-123
• /
• 2000

In this paper, a block FIR(Finite Impulse Response) filtering architecture is proposed for IF digital down converter. Digital down converter consists of digital mixers. decimation filters and down samplers. In this proposed structure, it is shown that a efficient parallel decimation filter architecture can be produced by cancellation of inherent up sampling of the block filter and following down sampler Furthermore. it is shown that computational complexity of the proposed architecture is reduced by exploiting the block FIR structure and zero values of the digital mixers.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.743-750
• /
• 2000

In this paper, low-power block filtering architecture for digital If down sampler and up sampler is proposed. Software radio technology requires low power and cost effective digital If down and up sampler. Digital If down sampler and up sampler are accompanied with decimation filter and interpolation filter, respectively. In the proposed down sampler architecture, it is shown that the parallel and low-speed processing architecture can be produced by cancellation of inherent up sampler of block filter and down sampler. Proposed up sampler also utilizes cancellation of up sampler and inherent down sampler of block filtering structure. The proposed architecture is compared with the conventional polyphase architecture.

• The Journal of the Korea Contents Association
• /
• v.10 no.10
• /
• pp.9-18
• /
• 2010

As digital contents become vast in quantity, it takes long time for users to search the digital contents they want, which is a problem that has arisen. Therefore, it is required to have the technology that analyzes vast digital contents and extracts the appropriate contents for users in order to provide them with contents they want. For a fast searching of digital contents suitable for users, it is necessary to have the technology of filtering for digital contents. In this paper, we propose a method of filtering digital contents suitable for individual users. The method suggested in this paper is to analyze case-based information in digital contents and provide the digital contents suitable for individual users. The case for using digital contents is used for analysis of users' preference. Various simulations were conducted to confirm the effectiveness of the proposed method.

• Journal of the Institute of Convergence Signal Processing
• /
• v.19 no.4
• /
• pp.153-161
• /
• 2018

This paper describes the performance improvement of Software (SW) digital filter using GPU (Graphical Processing Unit). The previous developed SW digital filter has a problem that it operates on a CPU (Central Processing Unit) basis and has a slow speed. The GPU was introduced to filter the data of the EAVN (East Asian VLBI Network) observation to improve the operation speed and to process data with other stations through filtering, respectively. In order to enhance the computational speed of the SW digital filter, NVIDIA Titan V GPU board with built-in Tensor Core is used. The processing speed of about 0.78 (1Gbps, 16MHz BW, 16-IF) and 1.1 (2Gbps, 32MHz BW, 16-IF) times for the observing time was achieved by filtering the 95 second observation data of 2 Gbps (512 MHz BW, 1-IF), respectively. In addition, 2Gbps data is digitally filtered for the 1 and 2Gbps simultaneously observed with KVN (Korean VLBI Network), and compared with the 1Gbps, we obtained similar values such as cross power spectrum, phase, and SNR (Signal to Noise Ratio). As a result, the effectiveness of developed SW digital filter using GPU in this research was confirmed for utilizing the data processing and analysis. In the future, it is expected that the observation data will be able to be filtered in real time when the distributed processing optimization of source code for using multiple GPU boards.

• The Journal of the Acoustical Society of Korea
• /
• v.12 no.6
• /
• pp.13-20
• /
• 1993

충격 응답 시간이 긴 시스템을 모델링하기 위한 실시간 적응 디지털 필터를 구현하였다. 대상 시스템의 충격 응답 시간이 길 때, 일반적인 적응 디지털 필터를 사용하는 경우 발생하는 수렴 속도 저하와 계산량 증가 문제를 해결하기 위해서 서브밴드 구조를 갖는 적응 디지털 필터를 구성하였다. 실시간 처리 시스템에서는 GQMF을 사용하여 입력 신호를 4개 대역으로 분할하여 각 대역별로 적응 필터링을 수행함으로써 수렴 속도를 향상시킨다. 또한 대역별 신호를 동시에 분산 처리하기 때문에 계산량 면에서 효율적이므로 시스템의 충격 응답이 긴 경우에는 실시간 처리가 가능하다. 하드웨어 구성은 범용 신호 처리 프로세서인 DSP56001을 호스트 프로세서로 사용하며, 적응 디지털 필터 칩 DSP56200을 사용하여 각 대역 적응 필터를 구성하였다. 실험은 충격 응답 시간이 16 kHz 필터링 시 2000 탭 길이로 가정된 시스템을 대상으로 부동 소수점 시뮬레이션 결과와 실시간 처리 시스템의 결과를 비교하였다. 밴드를 나누지 않은 기존의 방법과 서브밴드 시스템의 비교 실험 결과 입력이 백색 잡음인 경우 대역별 간섭에 의한 성능 저하가 있었으나, 음성과 유사한 특성을 갖는 유색 잡음인 경우 서브밴드 시스템이 단일 시스템에 비해 성능 향상을 보였다.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.8
• /
• pp.81-90
• /
• 2012

For digital TV, the recommendation of u-health personalized service of semantic environment should be done after evaluating individual physical condition, illness and health condition. The existing recommendation method of u-health personalized service of semantic environment had low user satisfaction because its recommendation was dependent on ontology for analyzing significance. We propose the personalized service recommendation method based on Naive Bayesian Classifier for u-health service of semantic environment in digital TV. In accordance with the proposed method, the condition data is inferred by using ontology, and the transaction is saved. By applying naive bayesian classifier that uses preference information, the service is provided after inferring based on user preference information and transaction formed from ontology. The service inferred based on naive bayesian classifier shows higher precision and recall ratio of the contents recommendation rather than the existing method.

• Proceedings of the Korean Society of Tribologists and Lubrication Engineers Conference
• /
• 1999.11a
• /
• pp.200-207
• /
• 1999

A new method for the calculation of a wear amount was suggested. The amount of wear was calculated by the comparison of worn out profile with an estimated original profile. An original profile of wear track was estimated by comparing with outside of wear track. An estimated surface profile was well fitted to the original profile assumed unknown.

• Journal of Digital Convergence
• /
• v.12 no.8
• /
• pp.329-335
• /
• 2014

Collaborative filtering has been popular in commercial recommender systems, as it successfully implements social behavior of customers by suggesting items that might fit to the interests of a user. So far, most common method to find proper items for recommendation is by searching for similar users and consulting their ratings. This paper suggests a new similarity measure for movie recommendation that is based on genre interest, instead of differences between ratings made by two users as in previous similarity measures. From extensive experiments, the proposed measure is proved to perform significantly better than classic similarity measures in terms of both prediction and recommendation qualities.

• Journal of KIISE:Computing Practices and Letters
• /
• v.16 no.4
• /
• pp.497-501
• /
• 2010

A software montage means information that can be extracted quickly from software and includes inherent characteristics. If a montage is made from well-known programs, we can filter candidates of similar programs among the group of programs based on the montage. In this paper, we suggest software montages based on two characteristics: API calls and strings. To evaluate the proposed montages, we performed experiments to filter candidates of some similar programs to instant messenger programs. From the experiments, we confirmed that the proposed montages can be used as a forensic tool that filters a group of similar programs even when their functions are not known in advance.

• Journal of Digital Contents Society
• /
• v.17 no.6
• /
• pp.523-529
• /
• 2016

Stereo matching algorithm is an essential part in computer vision and photography. Accuracy and computational complexity are challenges of stereo matching algorithm. Much research has been devoted to stereo matching based on cost volume filtering of matching costs. Local stereo matching based guided image filtering (GIF) has a computational complexity of O(N), but is still not enough to provide real-time 3-dimensional (3-D) video services. The proposed algorithm concentrates reduction of computational complexity using the concept of fast guided image filter, which increase the speed up to $O(N/\small{s}^2)$ with a sub-sampling ratio $\small{s}$. Experimental results indicated that the proposed algorithm achieves effective local stereo matching as well as a fast execution time for 3-D video service.