• Title/Summary/Keyword: Way

Search Result 38,079, Processing Time 0.052 seconds

A new 4-way search window for improve memory bandwidth by 2-D data reuse for ME in H.264 (H.264의 움직임추정에서 2차원 데이터재사용으로 메모리대역폭을 개선하기 위한 4방향 검색윈도우)

  • Lee, Kyung-Ho;Lee, Seng-Kwon;Kong, Jin-Hyeung
    • Proceedings of the IEEK Conference
    • /
    • 2008.06a
    • /
    • pp.403-404
    • /
    • 2008
  • In this paper, a new 4-way search window is developed for H.264 Motion Estimation(ME) to improve the memory bandwidth. The proposed 4-way(up, down, left, right) search window could improve the reuse of overlapped window data to reduce the redundancy access factor by 1.4, though the 1/3-way search window requires $7.7{\sim}11$ times of data retrieval redundantly. In experiments, the new implementation of 4-way search window on Altera Stratix-III could deal with CIF ($352{\times}288$) video of 3 reference frame, $48{\times}48$ search area and $16{\times}16$ macroblock by 30fps real time at 55.2MHz.

  • PDF

Design of Cache Memory System for Next Generation CPU (차세대 CPU를 위한 캐시 메모리 시스템 설계)

  • Jo, Ok-Rae;Lee, Jung-Hoon
    • IEMEK Journal of Embedded Systems and Applications
    • /
    • v.11 no.6
    • /
    • pp.353-359
    • /
    • 2016
  • In this paper, we propose a high performance L1 cache structure for the high clock CPU. The proposed cache memory consists of three parts, i.e., a direct-mapped cache to support fast access time, a two-way set associative buffer to reduce miss ratio, and a way-select table. The most recently accessed data is stored in the direct-mapped cache. If a data has a high probability of a repeated reference, when the data is replaced from the direct-mapped cache, the data is stored into the two-way set associative buffer. For the high performance and fast access time, we propose an one way among two ways set associative buffer is selectively accessed based on the way-select table (WST). According to simulation results, access time can be reduced by about 7% and 40% comparing with a direct cache and Intel i7-6700 with two times more space respectively.

A Study on Way-Point Tracking of AUV using State Feedback (상태 궤환을 사용한 AUV의 경우점 추적 연구)

  • Kwon, Soon-Tae;Baek, Woon-Kyung;Kang, In-Pil;Choi, Hyeung-Sik;Joo, Moon-G.
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.17 no.12
    • /
    • pp.1266-1272
    • /
    • 2011
  • For way-point tracking of an autonomous underwater vehicle, a state feedback controller was designed by using pole placement scheme in discrete time domain. In the controller, 4 state variables were used for regulating the depth of the vehicle in z direction, and 3 state variables, for steering the vehicle in xy plane. Assuming constant speed of AUV, we simplified the design of the way-point tracking system. The proposed controller was simulated by MATLAB/Simulink using 6 degree-of-freedom nonlinear model and its performance of way point tracking was shown to be fulfilled within 1 m, nevertheless the proposed controller is quite simple and easy to implement compared to sliding mode controller.

IP Prefix Update of Routing Protocol in the Multi-way Search Tree (멀티웨이 트리에서의 IP Prefix 업데이트 방안)

  • 이상연;이강복;이형섭
    • Proceedings of the IEEK Conference
    • /
    • 2001.06a
    • /
    • pp.269-272
    • /
    • 2001
  • Since Multi-way Search Tree reduces the number of the memory access by increasing the branch factor, it is considered a method to archive the high-speed IP address lookup. Using the combination of initial 16 bit may and Multi-way Search Tree, it also reduces the search time of If address lookup. Multi-way Search Tree consists of K keys and K+1 key pointers. This paper shows how the E update of Multi-way Search Tree which consists of the one pointer within a node can be performed. Using the one pointer within a node, it increases the number of keys within a node and reduces the search time of IP lookup. We also describes IP updating methods such as modification, Insertion and Deletion of address entries. Our update scheme performs better than the method which rebuilds the entire IP routing table when IP update processes.

  • PDF

2way 가드레일의 형상에 관한 연구

  • Yang, Seon-Ung;Kim, Se-Il;Sin, Sang-Jun
    • Proceeding of EDISON Challenge
    • /
    • 2017.03a
    • /
    • pp.346-350
    • /
    • 2017
  • 고속도로에서 자주 사용되고 있는 2way 가드레일 형상의 효율성을 탐구해보기 위하여 가드레일 형상과 이와 단면적이 같은 여러 종류의 단면을 가진 보들과 응력 값을 비교하였다. vonMises stress값의 비교를 통해 기존 가드레일의 W모양 단면과 경제적으로는 동일하고 형태는 상이하며 구조적으로 더 안정적인 단면 형상을 찾아보고자 한다. 그 결과 2way 단면의 가드레일 보다는 반원 단면의 가드레일이, 두께가 4T인 2way 모델 보다는 3T인 모델의 안전계수가 더 높음을 확인하였다. 이를 통해 향후 가정이 없는 실제 상황에서는 어떠한 이유 때문에 2way 가드레일 형상을 사용하고 3T보단 4T, 5T를 보편적으로 사용하는지 연구해보면 좋을 듯 하다.

  • PDF

A Study on the K-way Partition Minimizing Maxcut (최대컷값을 최소화하는 k-way 분할 연구)

  • Kim, Kyung-Sik;Lee, Chul-Dong;Yu, Young-Uk;Jhon, Chu-Shik;Hwang, Hee-Yung
    • Proceedings of the KIEE Conference
    • /
    • 1988.07a
    • /
    • pp.557-560
    • /
    • 1988
  • In this paper, we present a new k-way partitioning algorithm for a graph of an electrical circuit wherein nodes and edges are regarded as cells (modules) and nets, respectively. In contrast to the previous work, our method is based upon a linearly ordered partition paradigm. We also claim that the maximum number of netcuts mostly governs the performance of k-way partitioning, thus having influence on the construction of a new cost function. In addition, our approach elaborates upon balancing the partition size. Our experiments show excellent results in comparison with previous k-way partitioning algorithms.

  • PDF

SER-Based Relay Selection for Two-Way Relaying with Physical Layer Network Coding

  • Li, Dandan;Xiong, Ke;Qiu, Zhengding;Du, Guanyao
    • ETRI Journal
    • /
    • v.35 no.2
    • /
    • pp.336-339
    • /
    • 2013
  • To enhance the symbol error rate (SER) performance of the two-way relay channels with physical layer network coding, this letter proposes a relay selection scheme, in which the relay with the maximal minimum distance between different points in its constellation among all relays is selected to assist two-way transmissions. We give the closed-form expression of minimum distance for binary phase-shift keying and quadrature phase-shift keying. Additionally, we design a low-complexity method for higher-order modulations based on look-up tables. Simulation results show that the proposed scheme improves the SER performance for two-way relay networks.

Effect of Dark Matter on the Collision of High Velocity Clouds with the Galactic Disk

  • Gwak, Gyu-Jin;Kim, Jong-Su
    • The Bulletin of The Korean Astronomical Society
    • /
    • v.38 no.1
    • /
    • pp.46.1-46.1
    • /
    • 2013
  • High velocity clouds (HVCs) are H I clouds that move with large speed (${\mid}V_{LSR}{\mid}$ >100 km/s) in the halo of the Milky Way. It is now evident that at least some populations of HVCs originated from extragalactic sources, either primordial gas left over from the galaxy formation or gaseous material stripped off from other galaxies closely passing by the Milky Way. HVCs with extragalactic origin play an important role in the star formation of the Milky Way when they eventually collide with the disk of the Milky Way. Although it is still observationally controversial whether HVCs are surrounded by dark matter or not, it is theoretically interesting to investigate the effect of dark matter on the collision of HVCs with the disk of the Milky Way. We model this scenario by using hydrodynamic simulations and search for proper parameters that explain the currently available observations such as the Smith Cloud that is thought to have collided with the Galactic disk already.

  • PDF

A Bayesian uncertainty analysis for nonignorable nonresponse in two-way contingency table

  • Woo, Namkyo;Kim, Dal Ho
    • Journal of the Korean Data and Information Science Society
    • /
    • v.26 no.6
    • /
    • pp.1547-1555
    • /
    • 2015
  • We study the problem of nonignorable nonresponse in a two-way contingency table and there may be one or two missing categories. We describe a nonignorable nonresponse model for the analysis of two-way categorical table. One approach to analyze these data is to construct several tables (one complete and the others incomplete). There are nonidentifiable parameters in incomplete tables. We describe a hierarchical Bayesian model to analyze two-way categorical data. We use a nonignorable nonresponse model with Bayesian uncertainty analysis by placing priors in nonidentifiable parameters instead of a sensitivity analysis for nonidentifiable parameters. To reduce the effects of nonidentifiable parameters, we project the parameters to a lower dimensional space and we allow the reduced set of parameters to share a common distribution. We use the griddy Gibbs sampler to fit our models and compute DIC and BPP for model diagnostics. We illustrate our method using data from NHANES III data to obtain the finite population proportions.

A Study on Expression of Exhibition Space according to the Application to a Way of Symbols' Meaning (기호의 의미작용 방식 적용에 따른 전시공간연출에 관한 연구)

  • 윤현정;윤재은
    • Proceedings of the Korean Institute of Interior Design Conference
    • /
    • 2002.04a
    • /
    • pp.141-145
    • /
    • 2002
  • The purpose of this study is to express display space according to a way of symbols' meanings, to apply and study the way that systemizes, specifies and objectifies the approaches to designs when the space is expressed. The study will present applicable characteristics in expressing the display space by analyzing visitors' symbolic nature prior to the specification of space expression. The study way is to analyze the definition, structure, system, characteristic and meaning-applied ways of the symbols through symbolic theoretical considerations, to show communication's accessibility applying the symbol-produced ways to the relationship between the conception and the components in expressing the exhibition space and finally to present the way to express the exhibition space through the symbols' meaning-produced ways.

  • PDF