• KOREAN POULTRY JOURNAL
• /
• v.20 no.9 s.227
• /
• pp.60-61
• /
• 1988

철저하고 과학적인 제품관리와 기술투자 및 위생관리, 불편없는 서비스 및 편의제공과 더불어 치밀한 경영기법에서 신선한 새바람을 몰고 왔다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.9
• /
• pp.1166-1176
• /
• 1999

연속 매체, 특히 비디오 데이타에 대한 일반 사용자 연산에는 재생뿐만 아니라 임의 속도 탐색 연산, 정지 연산, 그리고 그 외 다양한 연산이 있다. 이 연산 중에서 원하는 화면을 빨리 찾는 데에 유용한 고속 전진(FF: fast-forward)과 고속 후진(FB: fast-backward)은 재생 연산과는 달리 비순차적인 디스크 접근을 요구한다. 이러한 경우에 디스크 부하가 균등하지 않으면 일부 디스크에 접근이 편중되어 서비스 품질이 떨어진다. 본 논문에서는 디스크 배열을 이용한 저장 시스템에서 디스크 접근을 고르게 분산시키기 위하여 '소수 라운드 로빈(PRR: Prime Round Robin)' 방식으로 연속 매체를 디스크에 배치하는 기법에서 문제가 됐던 낭비된 디스크 저장 공간을 신뢰도 향상을 위해서 사용하는 '그룹화된 패리티를 갖는 소수 라운드 로빈(PRRgp: PRR with Grouped Parities)' 방식을 제안한다. 이 기법은 PRR 기법처럼 임의 속도 검색 연산에 있어서 디스크 배열을 구성하는 모든 디스크의 부하를 균등하게 할뿐만 아니라 낭비됐던 디스크 저장 공간에 신뢰도를 높이기 위한 패리티 정보를 저장함으로서 신뢰도를 향상시킬 수 있다. 신뢰도 모델링 방법으로 조합 모델과 마르코프 모델을 이용해서 결함발생율과 결함복구율을 고려한 신뢰도를 산출하고 비교.분석한다. PRR 기법으로 연속 매체를 저장하고 낭비되는 공간에 패리티 정보를 저장할 경우에 동시에 두 개 이상의 결함 발생 시에 그 결함으로부터 복구가 불가능하지만 PRRgp 기법에서는 약 30% 이상의경우에 대해서 동시에 두 개의 결함 발생 시에 저장한 패리티 정보를 이용한 복구가 가능할 뿐만 아니라 패리티 그룹의 수가 두 개 이상인 경우에는 두 개 이상의 결함에 대해서도 복구가 가능하다.Abstract End-user operations on continuous media (say video data) consist of arbitrary-rate search, pause, and others as well as normal-rate play. FF(fast-forward) / FB(fast-backward) among those operations are desirable to find out the scene of interest but they require non-sequential access of disks. When accesses are clustered to several disks without considering load balance, high quality services in playback may not be available. In this paper, we propose a new disk placement scheme, called PRRgp(Prime Round Robin with Grouped Parities), with enhanced reliability by using the wasted disk storage space in an old one(PRR: Prime Round Robin), in which continuous media are placed on a disk array based storage systems to distribute disk accesses uniformly. The PRRgp can not only achieve load balance of disks consisting of a disk array under arbitrary-rate search like PRR, but also improve reliability by storing parity information on the wasted disk space appropriately. We use combinatorial and Markov models to evaluate the reliability for a disk array and to analyze the results. When continuous media like PRR are placed and parity information on the wasted disk space is stored, we cannot tolerate more than two simultaneous faults. But they can be recovered by using stored parity information for about 30 percent as a whole in case of PRRgp presented in this paper. In addition, more than two faults can be tolerated in case there are more than two parity groups.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.43 no.4 s.310
• /
• pp.55-65
• /
• 2006

Most of fast block motion estimation algorithms reported so far in literatures aim to reduce the computation in terms of the number of search points, thus do not fit well with multimedia processors due to their irregular data flow. For multimedia processors, proper reuse of data is more important than reducing number of absolute difference operations because the execution cycle performance strongly depends on the number of off-chip memory access. Therefore, in this paper, we propose a Hexagon-shape line search (HEXSLS) algorithm using line search pattern which can increase data reuse from on-chip local buffer, and check sub-sampling points in line search pattern to reduce unnecessary SAD operation. Our experimental results show that the prediction error (MAE) performance of the proposed HEXSLS is similar to that of the full search block matching algorithm (FSBMA), while compared with the hexagon-based search (HEXBS), the HEXSLS outperforms. Also the proposed HEXSLS requires much lesser off-chip memory access than the conventional fast motion estimation algorithm such as the hexagon-based search (HEXBS) and the predictive line search (PLS). As a result, the proposed HEXSLS algorithm requires smaller number of execution cycles on media processor.

• Journal of the Korea Society of Computer and Information
• /
• v.3 no.2
• /
• pp.155-160
• /
• 1998

We applied a pilot symbol assisted modulation technique to QPSK system for improving BER performance over mobile communication channel. We demonstrate through computer simulation, that the proposed scheme achieves a prominent improvement comparison to that of conventional QPSK in a fast flat Rayleigh fading environment.

• Proceedings of the KIPE Conference
• /
• 2013.07a
• /
• pp.84-85
• /
• 2013

본 논문은 스파스 매트릭스 컨버터로 구동되는 유도전동기에 과도응답특성 개선을 위한 모델예측제어 기법을 제안한다. 제안하는 기법은 유도전동기의 파라미터를 이용하여 구한 예측 토크와 자속을 통하여 비용함수를 최소화하는 최적의 스위칭 상태를 결정한다. 시뮬레이션을 통해 제안한 제어 기법의 타당성을 검증한다.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.14 no.9
• /
• pp.4313-4319
• /
• 2013

The purpose of our study is to shorten the scanning time and minimize the inconveniences of the patients in acquisition of the black blood images using the signal void effect in the fast spin echo technique while keeping the diagnostic value of the test. Thirty-two consecutive patients who underwent black blood MR imaging were examed with additional double inversion recovery (DIR) sequence and the conventional fast spin echo (FSE) sequence. Signal to Noise Ratio (SNR) and Contrast to Noise Ratio (CNR) of the internal carotid arteries' lumen were compared in T1 and T2 weighted images to determine whether there are differences between the two techniques for depiction of the signal void effect inside the vessel wall. The FSE images showed lower SNR values than the DIR images in both of the T1 and T2 weighted images (11.49% and 13.66% respectively). While the CNR values were higher in the FSE images than in the DIR images in both of the T1 and T2 weighted images (8.69% and 7.55% respectively).There was no significant difference between the two techniques for either of the SNR or CNR (p>0.05, p>0.05 respectively). The DIR and the FSE images demonstrated almost identical imaging patterns. Therefore, it is anticipated that the use of FSE technique in acquisition of the black blood imaging could reduce the inconveniences of the patients during the scanning and minimize exam time while keeping the diagnostic value of the test.

• Journal of Broadcast Engineering
• /
• v.19 no.5
• /
• pp.627-630
• /
• 2014

The latest video coding standard, high efficiency video coding (HEVC) achieves high coding efficiency by employing a quadtree-based coding unit (CU) block partitioning structure which allows recursive splitting into four equally sized blocks. At each depth level, each CU is partitioned into variable sized blocks of prediction units (PUs). However, the determination of the best CU partition for each coding tree unit (CTU) and the best PU mode for each CU causes a dramatic increase in computational complexity. To reduce such computational complexity, we propose a fast PU decision algorithm that early terminates PU search. The proposed method skips the computation of R-D cost for certain PU modes in the current CU based on the best mode and the rate-distortion (RD) cost of the upper depth CU. Experimental results show that the proposed method reduces the computational complexity of HM12.0 to 18.1% with only 0.2% increases in BD-rate.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.43 no.9 s.351
• /
• pp.17-22
• /
• 2006

CMOS LC VCO with fast response adaptive frequency calibration (AFC) technique for IEEE 802.11a/b/g WLANs is designed in 1.8V $0.18{\mu}m$ CMOS process. The possible operation is verified for 5.8GHz band, 5.2GHz band, and 2.4GHz band using the switchable L-C resonators. To linearize its frequency-voltage gain (Kvco), optimized multiple MOS varactor biasing tecknique is used. In order to operate in each band frequency range with reduced VCO gain, 4-bit digitally controlled switched- capacitor bank is used and a wide-range digital logic quadricorrelator (WDLQ) is implemented for fast frequency detector.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.8
• /
• pp.114-125
• /
• 2014

In a conventional sonar system, which uses LFM signal for detecting targets with varying speed, the results of multiple LFM Doppler correlators are aligned and the maximum alined result are selected as a test cell for detecting targets. As the number of the LFM Doppler correlators are increased for accurate target detection, as the required computational complexity and the memory are also increased. This fact makes it difficult to implement the accurate LFM target detector. In this paper, we propose a new fast target detection which is robust for the variation of target speed. Because the proposed method uses the summation of alined results of large numbers of LFM Doppler correlators, the proposed method increase SNR and provide robust SNR for the variation of target speed. And the proposed method can provide very fast target detection by implementing the process, the summation of alined results of large numbers of LFM Doppler correlators, as one summation filter.

• Journal of KIISE
• /
• v.44 no.12
• /
• pp.1313-1318
• /
• 2017

Aggregating local features in a single vector is a fundamental problem in an image search. In this process, the image search process can be speeded up if binary features which are extracted almost two order of magnitude faster than gradient-based features are utilized. However, in order to utilize the binary features in an image search, it is necessary to study the techniques for clustering binary features to generate binary visual words. This investigation is necessary because traditional clustering techniques for gradient-based features are not compatible with binary features. To this end, this paper studies the techniques for clustering binary features for the purpose of generating binary visual words. Through experiments, we analyze the trade-off between the accuracy and computational efficiency of an image search using binary features, and we then compare the proposed techniques. This research is expected to be applied to mobile applications, real-time applications, and web scale applications that require a fast image search.