• Title/Summary/Keyword: 연산의 성질

Search Result 136, Processing Time 0.021 seconds

Transform Skip Mode Fast Decision Method for HEVC Encoding (HEVC 부호화를 위한 변환생략 모드 고속 선택 방법)

  • Yang, Seungha;Shim, Hiuk Jae;Lee, Dahee;Jeon, Byeungwoo
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.4
    • /
    • pp.172-179
    • /
    • 2014
  • HEVC (High Efficiency Video Coding) fine-tuned many existing coding tools and adopted also many new coding techniques. As a result, HEVC has accomplished about 2 times of compression efficiency enhancement compared to the existing video coding standard of H.264/AVC. One of the newly adopted tools in HEVC is the transform skip scheme which performs quantization without transform. This technique improves coding efficiency especially with computer-generated images. However, the unavailability of global or local properties of general video signals demands encoder to decide whether performing transform or not for each TU (Transform Unit). The necessity of computing rate-distortion costs for this decision is one reason to increase encoder complexity. In this paper, a fast transform skip mode decision method is proposed, which is based on the fast decision of rate-distortion cost calculation for transform skip mode, by considering frequency characteristics of residual signal. The proposed method can reduce $4{\times}4$ TU encoding time by about 27.1% with only about 0.03% consequential decrement in BDBR.

Improvement of Subspace Iteration Method with Shift (쉬프트를 갖는 부분공간 반복법의 개선)

  • Jung, Hyung Jo;Kim, Man Cheol;Park, Sun Kyu;Lee, In Won
    • Journal of Korean Society of Steel Construction
    • /
    • v.10 no.3 s.36
    • /
    • pp.473-486
    • /
    • 1998
  • A numerically stable technique to remove the limitation in choosing a shift in the subspace iteration method with shift is presented. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. This study solves the above singularity problem using side conditions without sacrifice of convergence. The method is always nonsingular even if a shift is an eigenvalue itself. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

  • PDF

An Improved Subspace Iteration Method for Structures with Multiple Natural Frequencies (중복근을 갖는 구조물에 대한 개선된 부분공간 반복법)

  • Jung, Hyung-Jo;Park, Sun-Kyu;Lee, In-Won
    • Journal of the Computational Structural Engineering Institute of Korea
    • /
    • v.12 no.3
    • /
    • pp.371-383
    • /
    • 1999
  • An efficient and numerically stable eigensolution method for structures with multiple natural frequencies is presented. The proposed method is developed by improving the well-known subspace iteration method with shift. A major difficulty of the subspace iteration method with shift is that because of singularity problem, a shift close to an eigenvalue can not be used, resulting in slower convergence. In this paper, the above singularity problem has been solved by introducing side conditions without sacrifice of convergence. The proposed method is always nonsingular even if a shift is on a distinct eigenvalue or multiple ones. This is one of the significant characteristics of the proposed method. The nonsingularity is proved analytically. The convergence of the proposed method is at least equal to that of the subspace iteration method with shift, and the operation counts of above two methods are almost the same when a large number of eigenpairs are required. To show the effectiveness of the proposed method, two numerical examples are considered.

  • PDF

A Mixed Variational Principle of Fully Anisotropic Linear Elasticity (이방성탄성문제의 혼합형변분원리)

  • 홍순조
    • Computational Structural Engineering
    • /
    • v.4 no.2
    • /
    • pp.87-94
    • /
    • 1991
  • In this paper, a mixed variational principle applicable to the linear elasticity of inhomogeneous anisotropic materials is presented. For derivation of the general variational principle, a systematic procedure for the variational formulation of linear coupled boundary value problems developed by Sandhu et al. is employed. Consistency condition of the field operators with the boundary operators results in explicit inclusion of boundary conditions in the governing functional. Extensions of admissible state function spaces and specialization to a certain relation in the general governing functional lead to the desired mixed variational principle. In the physical sense, the present variational principle is analogous to the Reissner's recent formulation obtained by applying Lagrange multiplier technique followed by partial Legendre transform to the classical minimum potential energy principle. However, the present one is more advantageous for the application to the general anisotropic materials since Reissner's principle contains an implicit function which is not easily converted to an explicit form.

  • PDF

For new Duality Structure and its Application in the NCV-|v1 > Library (NCV-|v1 >라이브러리의 새로운 쌍대 구조와 응용)

  • Park, Dong-Young;Jeong, Yeon-Man
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.11 no.2
    • /
    • pp.165-170
    • /
    • 2016
  • The characteristic and application of a new duality structure in the $NCV-{\mid}v_1$ > library is studied in this paper. All unitary operations on arbitrarily many qudit's n can be expressed as composition of one- and two-qudit $NCV-{\mid}v_1$ > libraries if their state vectors are eigenvectors. This research provides an extended realization from Barenco's many bits n operator(U(2n)) which is applicable to only all positive polarity statevectors to whole polarity ones. At the control gate synthesis of a unitary operator, such an enhanced expansion is possible due to their symmetric duality property in the case of using both $NCV-{\mid}v_1$ > and $NCV^{\dag}-{\mid}v_1$ > libraries which make the AND predominantly dependent cascade synthesis possible.

Low Power Architecture of FIR Filter for 2D Image Filter (2D Image Filter에 적합한 저전력 FIR Filter의 구현)

  • Han, Chang-Yeong;Park, Hyeong-Jun;Kim, Lee-Seop
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.38 no.9
    • /
    • pp.663-670
    • /
    • 2001
  • This paper proposes a new power reduction method for 2D FIR (Finite Impulse Response) filters. We exploited the spatial redundancy of image data in order to reduce power dissipation in multiplication of FIR filters. Since the higher bits of input pixels are hardly changed, the redundant multiplication of higher bits is avoided by separating multiplication into higher and lower parts. The calculated values of higher bits are stored in memory cells, cache such that they can be reused when a cache hit occurs. Therefore, we can reduce power in 2D FIR Filter modules about 15% by using the proposed separated multiplication Technique (SMT).

  • PDF

A MIMO LTE Precoding Codebook Based on Fast Diagonal Weighted Matrices (고속 대각 하중 행렬을 이용한 MIMO LTE 프리코딩 코드북)

  • Park, Ju-Yong;Peng, Bu Shi;Lee, Moon-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.3
    • /
    • pp.14-26
    • /
    • 2012
  • In this paper, a fast diagonal-weighted Jacket matrices (DWJMs) is proposed to have the orthogonal architecture. We develop the successive DWJM to reduce the computational load while factorizing the large-order DWJMs into the low-order sparse matrices with the fast algorithms. The proposed DWJM is then applied to the precoding multiple-input and multiple output (MIMO) wireless communications because of its diagonal-weighted framework with element-wise inverse characteristics. Based on the properties of the DWJM, the DWJM can be used as alternative open loop cyclic delay diversity (CDD) precoding, which has recently become part of the cellular communications systems. Performance of the DWJM-based precoding system is verified for orthogonal space-time block code (OSTBC) MIMO LTE systems.

P-Version Model Based on Hierarchical Axisymmetric Element (계층적 축대칭요소에 의한 P-version모델)

  • Woo, Kwang Sung;Chang, Yong Chai;Jung, Woo Sung
    • KSCE Journal of Civil and Environmental Engineering Research
    • /
    • v.12 no.4_1
    • /
    • pp.67-76
    • /
    • 1992
  • A hierarchical formulation based on p-version of the finite element method for linear elastic axisymmetric stress analysis is presented. This is accomplished by introducing additional nodal variables in the element displacement approximation on the basis of integrals of Legendre polynomials. Since the displacement approximation is hierarchical, the resulting element stiffness matrix and equivalent nodal load vectors are hierarchical also. The merits of the propoosed element are as follow: i) improved conditioning, ii) ease of joining finite elements of different polynomial order, and iii) utilizing previous solutions and computation when attempting a refinement. Numerical examples are presented to demonstrate the accuracy, efficiency, modeling convenience, robustness and overall superiority of the present formulation. The results obtained from the present formulation are also compared with those available in the literature as well as with the analytical solutions.

  • PDF

Cycle Property in the (n,k)-star Graph ((n,k)-스타 그래프의 사이클 특성)

  • Chang, Jung-Hwan
    • The Transactions of the Korea Information Processing Society
    • /
    • v.7 no.5
    • /
    • pp.1464-1473
    • /
    • 2000
  • In this paper, we analyze the cycle property of the (n,k)-star graph that has an attention as an alternative interconnection network topology in recent years. Based on the graph-theoretic properties in (n,k)-star graphs, we show the pancyclic property of the graph and also present the corresponding algorithm. Based on the recursive structure of the graph, we present such top-down approach that the resulting cycle can be constructed by applying series of "dimension expansion" operations to a kind of cycles consisting of sub-graphs. This processing naturally leads to such property that the resulting cycles tend to be integrated compactly within some minimal subset of sub-graphs, and also means its applicability of another classes of the disjoint-style cycle problems. This result means not only the graph-theoretic contribution of analyzing the pancyclic property in the underlying graph model but also the parallel processing applications such a as message routing or resource allocation and scheduling in the multi-computer system with the corresponding interconnection network.

  • PDF

The analysis for mathematics education system, algebra curriculum and textbooks of Chinese Taipei and Korea by TIMSS 2007 results (대만과 우리나라의 수학 교육체계 및 대수 교육과정과 교과서 비교 -TIMSS 2007 결과를 중심으로-)

  • Kim, Sun-Hee;Kim, Kyeong-Hee
    • Journal for History of Mathematics
    • /
    • v.23 no.4
    • /
    • pp.101-122
    • /
    • 2010
  • Chinese Taipei won the first place at the mathematics achievement of TIMSS 2007. Especially, there was a significant difference in the percentage of correct answers between Chinese Taipei and Korea, and Chinese Taipei' percentage of correct answers was higher than Korea. This study compared the education system, mathematics instruction environment, and instructional activities of two countries. And for algebra, curriculum and textbooks were compared between two countries based on TIMSS 2007 framework. It was found that Chinese Taipei emphasized homework and test, and MCFL of that was low. Their textbook was formal, and induced the hasty abstraction, Also, some themes were introduced earlier than Korea and repeated across different grades.