• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.10C
• /
• pp.948-955
• /
• 2006

In this paper, we propose motion estimation and compensation using Low-Band-Shift(LBS) with Integer Lifting Shift property. To overcome shift-variant property on wavelet coefficients, the LBS was previously proposed. This method which is applied to reference frame in video coding technique has superior performance in terms of rate-distortion characteristic. However, this method needs more memory and computational complexity. For the enhancement of those disadvantages, we propose motion estimation using Low-Band-Shift with Integer Lifting. The Integer Lifting implementation gives us good efficiency of calculation and storage.

• Journal of the Korean Institute of Telematics and Electronics B
• /
• v.32B no.9
• /
• pp.1207-1214
• /
• 1995

We present an optimized integer cosine transform(OICT) as an alternative approach to the conventional discrete cosine transform(DCT), and its fast computational algorithm. In the actual implementation of the OICT, we have used the techniques similar to those of the orthogonal integer transform(OIT). The normalization factors are approximated to single one while keeping the reconstruction error at the best tolerable level. By obtaining a single normalization factor, both forward and inverse transform are performed using only the integers. However, there are so many sets of integers that are selected in the above manner, the best OICT matrix obtained through value minimizing the Hibert-Schmidt norm and achieving fast computational algorithm. Using matrix decomposing, a fast algorithm for efficient computation of the order-8 OICT is developed, which is minimized to 20 integer multiplications. This enables us to implement a high performance 2-D DCT processor by replacing the floating point operations by the integer number operations. We have also run the simulation to test the performance of the order-8 OICT with the transform efficiency, maximum reducible bits, and mean square error for the Wiener filter. When the results are compared to those of the DCT and OIT, the OICT has out-performed them all. Furthermore, when the conventional DCT coefficients are reduced to 7-bit as those of the OICT, the resulting reconstructed images were critically impaired losing the orthogonal property of the original DCT. However, the 7-bit OICT maintains a zero mean square reconstruction error.

• Proceedings of the IEEK Conference
• /
• 1998.10a
• /
• pp.763-766
• /
• 1998

This paper describes the microarchitecture of the integer processor unit of RAPTOR which is an on-chip multiprocessor. The integer processor unit implements the 64-bit SPARC-V9 architecture and supports by hardware out-of-order instruction execution. The unit is designed to be handy so that multiple copies of the unit cn be integrated with cache memories into a single chip. The design was proceeded in a top-down manner. The hardware description and its verfication were performed using Verilog-HDL.

• Journal of the Korean Mathematical Society
• /
• v.37 no.6
• /
• pp.1021-1030
• /
• 2000

We formulate a pair of symmetric dual mixed integer programs with a square root term and establish the weak, strong and converse duality theorems under suitable invexity conditions. Moreover, the self duality theorem for our pair is obtained by assuming the kernel function to be skew symmetric.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.24 no.2
• /
• pp.109-119
• /
• 1999

The average shadow price is a substitute for the traditional marginal shadow price. It can serve as a standard for decision making problems about the economic resources where the marginal analysis gives no useful information. This paper treats the average shadow price in pure integer programming and shows some stability properties of it. This implies that the values of the average shadow prices once computed are reliable within some extent of the data perturbations of the integer programming model.

• Communications of the Korean Mathematical Society
• /
• v.33 no.2
• /
• pp.485-494
• /
• 2018

In this paper some newly developed results based on the growth properties of relative order (relative lower order), relative type (relative lower type) and relative weak type of entire and meromorphic functions on the basis of integer translation applied upon them are investigated.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.21 no.3
• /
• pp.227-236
• /
• 1996

In this paper an algorithm based on cutting plane approach is developed which constructs all the efficient p-tuples of multiobjective integer linear fractional programming problem. The integer solution is constrained to satisfy and h out of n additional constraint sets. A numerical illustration in support of the proposed algorithm is developed.

• Communications of the Korean Mathematical Society
• /
• v.25 no.2
• /
• pp.167-171
• /
• 2010

We will show that if d is a cubefree integer and n is an integer, then with some suitable conditions, there are no primes p and a positive integer m such that d is a cubic residue (mod p), $3\;{\nmid}\;m$, p || n if and only if there are integers x, y, z such that $$x^3\;+\;dy^3\;+\;d^2z^3\;-\;3dxyz\;=\;n$$.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.8
• /
• pp.1221-1230
• /
• 1990

This paper presents a code generation method and an effective handling algorithm of ingeger constant multiplication for RISC machines in compiler design. As RISC Architectures usually use faster and more simply formed instructions than CISC's and most RISC processors do not have an integer multiplication instruction, it is required an effective algorithm to process integer multiplication. For the proposed code generator, Portable C Compiler(PCC) is redesigned to be suitable for an RISC machine, and composed an addition chain is built up to allow fast execution of constant multiplication, a part of integer one whicch appears very frequency in code generation phase.

• Journal of the Korean Data and Information Science Society
• /
• v.18 no.4
• /
• pp.1115-1121
• /
• 2007

In this paper, we consider cooperative games arising from integer total domination problem on graphs. We introduce two games, rigid integer total domination game and its relaxed game, and focus on their cores. We give characterizations of the cores and the relationship between them.