• Title/Summary/Keyword: 계산시간 비교

Search Result 2,446, Processing Time 0.035 seconds

An Intra Prediction Hardware Architecture Design for Computational Complexity Reduction of HEVC Decoder (HEVC 복호기의 연산 복잡도 감소를 위한 화면내 예측 하드웨어 구조 설계)

  • Jung, Hongkyun;Ryoo, Kwangki
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.17 no.5
    • /
    • pp.1203-1212
    • /
    • 2013
  • In this paper, an intra prediction hardware architecture is proposed to reduce computational complexity of intra prediction in HEVC decoder. The architecture uses shared operation units and common operation units and adopts a fast smoothing decision algorithm and a fast algorithm to generate coefficients of a filter. The shared operation unit shares adders processing common equations to remove the computational redundancy. The unit computes an average value in DC mode for reducing the number of execution cycles in DC mode. In order to reduce operation units, the common operation unit uses one operation unit generating predicted pixels and filtered pixels in all prediction modes. In order to reduce processing time and operators, the decision algorithm uses only bit-comparators and the fast algorithm uses LUT instead of multiplication operators. The proposed architecture using four shared operation units and eight common operation units which can reduce execution cycles of intra prediction. The architecture is synthesized using TSMC 0.13um CMOS technology. The gate count and the maximum operating frequency are 40.5k and 164MHz, respectively. As the result of measuring the performance of the proposed architecture using the extracted data from HM 7.1, the execution cycle of the architecture is about 93.7% less than the previous design.

Impacts of Chemical Heterogeneities in Landfill Subsurface Formations on the Transport of Leachate (매립지반의 화학적 불균질성이 침출수 이동에 미치는 영향)

  • Lee Kun-Sang
    • Journal of Soil and Groundwater Environment
    • /
    • v.11 no.5
    • /
    • pp.1-8
    • /
    • 2006
  • The objective of this study is to assess impacts of sorption heterogeneity on the transport of leachate leaked from unlined landfill sites and is accomplished by examining the results from a series of Monte-Carlo simulations. For random distribution coefficient ($K_{d}$) fields with four different levels of heterogeneity ranging from homogeneous to highly heterogeneous, the transport of leachate was investigated by linking a saturated flow model with a contaminant transport model. Impacts of a chemical heterogeneity were evaluated using point statistics values such as mean, standard deviation, and coefficient of variation of the concentration obtained at monitoring wells from 100 Monte-Carlo trials. Inspection of point statistics shows that the distribution of distribution coefficient in the landfill site proves to be an important parameter in controlling leachate concentrations. In comparison to homogeneous sorption, heterogeneous $K_{d^-}$ fields produce the variability in the leachate concentration for different realizations. The variability increases significantly as the variance in the $K_{d^-}$ field and the travel time between source and monitoring well increase. These outcomes indicate that use of a constant homogeneous $K_{d}$ value for predicting the transport of leachate can result in significant error, especially when variability in $K_{d}$ is high.

A study on simplification of SWMM for prime time of urban flood forecasting -a case study of Daerim basin- (도시홍수예보 골든타임확보를 위한 SWMM유출모형 단순화 연구 -대림배수분구를 중심으로-)

  • Lee, Jung-Hwan;Kim, Min-Seok;Yuk, Gi-Moon;Moon, Young-Il
    • Journal of Korea Water Resources Association
    • /
    • v.51 no.1
    • /
    • pp.81-88
    • /
    • 2018
  • The rainfall-runoff model made of sewer networks in the urban area is vast and complex, making it unsuitable for real-time urban flood forecasting. Therefore, the rainfall-runoff model is constructed and simplified using the sewer network of Daerim baisn. The network simplification process was composed of 5 steps based on cumulative drainage area and all parameters of SWMM were calculated using weighted area. Also, in order to estimate the optimal simplification range of the sewage network, runoff and flood analysis was carried out by 5 simplification ranges. As a result, the number of nodes, conduits and the simulation time were constantly reduced to 50~90% according to the simplification ranges. The runoff results of simplified models show the same result before the simplification. In the 2D flood analysis, as the simplification range increases by cumulative drainage area, the number of overflow nodes significantly decreased and the positions were changed, but similar flooding pattern was appeared. However, in the case of more than 6 ha cumulative drainage area, some inundation areas could not be occurred because of deleted nodes from upstream. As a result of comparing flood area and flood depth, it was analyzed that the flood result based on simplification range of 1 ha cumulative drainage area is most similar to the analysis result before simplification. It is expected that this study can be used as reliable data suitable for real-time urban flood forecasting by simplifying sewer network considering SWMM parameters.

Analysis on Intersection Traffic Signal Locations Change and Characteristics of Dilemma Zone (교차로 신호기 위치 조정과 딜레마존 특성 분석)

  • Lim, Sam Jin;Lee, Young-Ihn;Kim, Kyung Hee
    • Journal of Korean Society of Transportation
    • /
    • v.31 no.1
    • /
    • pp.3-13
    • /
    • 2013
  • This paper reviews the characteristics of dilemma zone by analysing the influence exerted by actual location of intersection traffic signal on behaviour of drivers approaching signalized intersection in urban area. The analysis of approach speed was based upon a 'before and after' comparison, measured at three sites where the locations of traffic signals were changed. The study demonstrated that, when traffic signal changed to yellow, the scales of dilemma zone were narrowed in case of stopping cars by moving up the starting point of the dilemma zone due to lowered spot speed. On the other hand, in case of passing cars, the end points of dilemma zone were moved further out to the rear due to increased spot speed. Therefore, changing traffic signal locations could make an impact to increase intersection safety through reducing the scales of dilemma zone. This study also found that, in cases involving vehicles with similar approach speeds, spot speeds could be differentiated following the change of signal locations due to the fact that there can be greater differences in both braking point and deceleration rate. Thus, when considering the appropriate measuring of dilemma zone, 'spot speed' rather than 'approach speed' appeared to be more appropriate criterion.

Clogging Potential in Constructed Vertical Flow Wetlands Employing Different Filter Materials for First-flush Urban Stormwater Runoff Treatment (도시 초기 강우유출수 처리를 위한 수직흐름습지에서 여재별 폐색 잠재성 분석)

  • Chen, Yaoping;Guerra, Heidi B.;Kim, Youngchul
    • Journal of Wetlands Research
    • /
    • v.20 no.3
    • /
    • pp.235-242
    • /
    • 2018
  • The function of vertical subsurface flow wetlands can potentially be reduced with time due to clogging and are often assumed to be occurring when ponding and overflow is observed during rainfall. To investigate their clogging potential, three pilot-scale vertical subsurface flow (VSF) wetland systems were constructed employing woodchip, pumice, and volcanic gravel as main media. The systems received stormwater runoff from a highway bridge for seven months, after which the media were taken out and divided into layers to determine the amount and characteristics of the accumulated clogging matters. Findings revealed that the main clogging mechanism was the deposition of suspended solids. This is followed by the growth of biofilm in the media which is more evident in the wetland employing woodchip. Up to more than 30% of the clogging matter were found in the upper 20 cm of the media suggesting that this layer will need replacement once clogging occurs. Moreover, no signs of clogging were observed in all the wetlands during the operation period even though an estimation of at least 2 months without clogging was calculated. This was attributed to the intermittent loading mode of operation that gave way for the decomposition of organic matters during the resting period and potentially restored the pore volume.

A Numerical Study on the Generation and Propagation of Intake Noise in the Reciprocating Engine (엔진 흡기계의 소음발생 및 전파에 관한 수치연구)

  • 김용석;이덕주
    • Proceedings of the Korean Society for Noise and Vibration Engineering Conference
    • /
    • 1996.10a
    • /
    • pp.65-70
    • /
    • 1996
  • 엔진소음을 소음특성에 따라 분류하면 공력소음(Aerodynamic Noise), 연소소음(Combustion Noise), 기계적인 소음(Mechanical Noise)으로 나눌 수 있으며 소음원의 종류에 따라 분류하면 배기계소음(Exhaust System Noise)으로 나눌 수 있으며 소음원의 종류에 따라 분류하면 배기계소음(Exhaust System Noise), 흡기계소음(Intake System Noise), 냉각계소음(Cooling System Noise), 엔진표면소음(Engine System Noise)등으로 분류할 수 있다. 이러한 여러소음중 엔진 내부의 유동에 의한 흡배기계통으로의 소음방출은 자동차 실 내외 소음의 중요한 문제로 대두되는데, 이를 줄이기 위해 그 동안 소음기 등의 서브시스템의 형태와 그 위치조정에 관한 연구가 수행되어 왔다. 그러나 이것이 비용 또는 성능에 영향을 미치므로 본질적인 소음원을 규명해 내는 것이 필요하게 되었다. 흡배기계의 소음은 엔진의 흡입, 배기행 정시 피스톤의 운동에 의해 팽창 및 압축파 형태의 압력파(pressure wave)로 발생하게 되고, 밸브근방에서는 유동의 박리(separation)에 의해 발생하게 된다. 소음기 등의 서브시스템에서도 유동의 박리에 의해 발생하게 되며 특히 배기행정시 발생하는 압력파는 비선형영역에 있게된다. 흡기소음은 배기에 비해 그 크기가 작아서 그동안 등한시 되어왔으나 이것이 소비자의 불평요인으로 작용하므로써 이에 대한 연구도 활발히 수행되어야 한다. Bender, Bramer[1]는 흡배기계 소음의 외부 방사에 관하여 전반적으로 기술하였고 Sierens등[2]은 흡기계에서 1차원 MOC(Method of Characteristics)방법으로 비정상 유동해석을 하고 실험결과와 비교하였다. J.S.Lamancusa 등[3]은 흡기 소음원을 실험을 통해 예측하였고, 흡기소음도 비선형 거동을 보인다고 밝혔다. Yositaka Nishio 등[4]은 새로운 흡기실험장치를 고안하여 공명기(resonator)의 위치 변화에 의한 저소음 흡기계를 설계 초기단계에서부터 적용하려 하였다. 일반적으로 흡배기계의 복잡한 형상 때문에 대부분 실험을 통해 문제를 해결하려 하였고, 수치해석은 피스톤의 운동을 배제한 단순화한 흡배기계의 정상상태 유동해석이 주를 이루어왔다. Taghaui and Dupont 등[5]은 KIVA코드를 사용하여 흡기포트와 연소실 그리고 밸브의 움직임을 동시에 고려한 수치해석을 도입하였다. 하지만 이들이 밸브의 운동을 고려하기 위해 사용한 이동격자는 격자점은 시간에 따라 변화하지만 그 격자의 수가 일정하게 유지되어 있어서 밸브의 완전개폐를 해석할 수가 없다. 강희정[6]은 단일 실린더와 단일 배기밸브를 갖는 문제로 단순화하여 피스톤과 밸브의 움직임을 고려하므로써 배기행정 후 소음이 어떻게 전파해 나가는가를 연구하였다. 본 연구에서도 최소밸브간격과 최대밸브간격 사이에서만 계산이 가능하나 흡기의 경우는 밸브가 닫힐 때 생기는 압력파가 중요하므로 실린더와 밸브사이에 벽면조건을 주어 밸브의 개폐를 모사하였다.

  • PDF

Parallel Range Query processing on R-tree with Graphics Processing Units (GPU를 이용한 R-tree에서의 범위 질의의 병렬 처리)

  • Yu, Bo-Seon;Kim, Hyun-Duk;Choi, Won-Ik;Kwon, Dong-Seop
    • Journal of Korea Multimedia Society
    • /
    • v.14 no.5
    • /
    • pp.669-680
    • /
    • 2011
  • R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

An intercomparison study between optimization algorithms for parameter estimation of microphysics in Unified model : Micro-genetic algorithm and Harmony search algorithm (통합모델의 강수물리과정 모수 최적화를 위한 알고리즘 비교 연구 : 마이크로 유전알고리즘과 하모니 탐색 알고리즘)

  • Jang, Jiyeon;Lee, Yong Hee;Joo, Sangwon
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.27 no.1
    • /
    • pp.79-87
    • /
    • 2017
  • The microphysical processes of the numerical weather prediction (NWP) model cover the following : fall speed, accretion, autoconversion, droplet size distribution, etc. However, the microphysical processes and parameters have a significant degree of uncertainty. Parameter estimation was generally used to reduce errors in NWP models associated with uncertainty. In this study, the micro- genetic algorithm and harmony search algorithm were used as an optimization algorithm for estimating parameters. And we estimate parameters of microphysics for the Unified model in the case of precipitation in Korea. The differences which occurred during the optimization process were due to different characteristics of the two algorithms. The micro-genetic algorithm converged to about 1.033 after 440 times. The harmony search algorithm converged to about 1.031 after 60 times. It shows that the harmony search algorithm estimated optimal parameters more quickly than the micro-genetic algorithm. Therefore, if you need to search for the optimal parameter within a faster time in the NWP model optimization problem with large calculation cost, the harmony search algorithm is more suitable.

A Study on the Hyperspectral Image Classification with the Iterative Self-Organizing Unsupervised Spectral Angle Classification (반복최적화 무감독 분광각 분류 기법을 이용한 하이퍼스펙트럴 영상 분류에 관한 연구)

  • Jo Hyun-Gee;Kim Dae-Sung;Yu Ki-Yun;Kim Yong-Il
    • Korean Journal of Remote Sensing
    • /
    • v.22 no.2
    • /
    • pp.111-121
    • /
    • 2006
  • The classification using spectral angle is a new approach based on the fact that the spectra of the same type of surface objects in RS data are approximately linearly scaled variations of one another due to atmospheric and topographic effects. There are many researches on the unsupervised classification using spectral angle recently. Nevertheless, there are only a few which consider the characteristics of Hyperspectral data. On this study, we propose the ISOMUSAC(Iterative Self-Organizing Modified Unsupervised Spectral Angle Classification) which can supplement the defects of previous unsupervised spectral angle classification. ISOMUSAC uses the Angle Division for the selection of seed points and calculates the center of clusters using spectral angle. In addition, ISOMUSAC perform the iterative merging and splitting clusters. As a result, the proposed algorithm can reduce the time of processing and generate better classification result than previous unsupervised classification algorithms by visual and quantitative analysis. For the comparison with previous unsupervised spectral angle classification by quantitative analysis, we propose Validity Index using spectral angle.

Statistical Analysis of Receding Horizon Particle Swarm Optimization for Multi-Robot Formation Control (다개체 로봇 편대 제어를 위한 이동 구간 입자 군집 최적화 알고리즘의 통계적 성능 분석)

  • Lee, Seung-Mok
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.24 no.5
    • /
    • pp.115-120
    • /
    • 2019
  • In this paper, we present the results of the performance statistical analysis of the multi-robot formation control based on receding horizon particle swarm optimization (RHPSO). The formation control problem of multi-robot system can be defined as a constrained nonlinear optimization problem when considering collision avoidance between robots. In general, the constrained nonlinear optimization problem has a problem that it takes a long time to find the optimal solution. The RHPSO algorithm was proposed to quickly find a suboptimal solution to the optimization problem of multi-robot formation control. The computational complexity of the RHPSO increases as the number of candidate solutions and generations increases. Therefore, it is important to find a suboptimal solution that can be used for real-time control with minimal candidate solutions and generations. In this paper, we compared the formation error according to the number of candidate solutions and the number of generations. Through numerical simulations under various conditions, the results are analyzed statistically and the minimum number of candidate solutions and the minimum number of generations of the RHPSO algorithm are derived within the allowable control error.