• Title/Summary/Keyword: Integer Operation

Search Result 204, Processing Time 0.024 seconds

Fast Block Matching Algorithm With Half-pel Accuracy for Video Compression (동영상 압축을 위한 고속 반화소 단위 블록 정합 알고리듬)

  • 이법기;정원식;김덕규
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.24 no.9B
    • /
    • pp.1697-1703
    • /
    • 1999
  • In this paper, we propose the fast block matching algorithm with half pel accuracy using the lower bound of mean absolute difference (MAD) at search point of half pel accuracy motion estimation. The proposed method uses the lower bound of MAD at search point of half pel accuracy which calculated from MAD's at search points of integer pel accuracy. We can reduce the computational complexity by executing the block matching operation only at the necessary search point. The points are selected when the lower bound of MAD at that point is smaller than reference MAD of integer pel motion estimation. Experimental results show that the proposed method can reduce the computational complexity considerably and keeping the same performance with conventional method.

  • PDF

A Study on a Fuzzy Berth Assignment Programming Problem (퍼지 반박시정계획 문제에 관한 연구)

  • 금종수;이홍걸;이철영
    • Journal of the Korean Institute of Navigation
    • /
    • v.20 no.4
    • /
    • pp.59-70
    • /
    • 1996
  • A berth assignment problem has a direct impact on assessment of charges made to ships and goods. In this paper, we concerned with of fuzzy mathematical programming models for a berth assignment problem to achieved an efficient berth operation in a fuzzy environment. In this paper, we focus on the berth assignment programming with fuzzy parameters which are based on personal opinions or subjective judgement. From the above point of view, assume that a goal and a constraint are given by fuzzy sets, respectively, which are characterized by membership functions. Let a fuzzy decision be defined as the fuzzy set resulting from the intersection of a goal and constraint. This paper deals with fuzziness in all parameters which are expressed by fuzzy numbers. A fuzzy parameter defined by a fuzzy number means a possibility distribution of the parameters. These fuzzy 0-1 integer programming problems are formulated by fuzzy functions whose concept is also called the extension principle. We deal with a berth assignment problem with triangular fuzzy coefficients and propose a branch and bound algorithm for solving the problem. We suggest three models of berth assignment to minimizing the objective functions such as total port time, total berthing time and maximum berthing time by using a revised Maximum Position Shift(MPS) concept. The berth assignment problem is formulated by min-max and fuzzy 0-1 integer programming. Finally, we gave the numerical solutions of the illustrative examples.

  • PDF

A Study on the Fast Computational Algorithm for the Discrete Cosine Transform(DCT) via Lifting Scheme (리프팅 구조를 경유한 고속의 DCT 계산 알고리즘에 관한 연구)

  • Inn-Ho Jee
    • The Journal of the Institute of Internet, Broadcasting and Communication
    • /
    • v.23 no.6
    • /
    • pp.75-80
    • /
    • 2023
  • We show the design of fast invertible block transforms that can replace the DCT in future wireless and portable computing application. This is called binDCT. In binDCT, both the forward and the inverse transforms can be implemented using only binary shift and addition operation. And the binDCT inherits all desirable DCT characteristics such as high coding gain, no DC leakage, symmetric basis functions, and recursive construction. The binDCT also inherits all lifting properties such as fast implementations, invertible integer-to-integer mapping, in-place computation. Thus, this method has advantage of fast implementation for complex DCT calculations. In this paper, we present computation costs and performance analysis between DCT and binDCT using Shapiro's EZW.

Design of a ECC arithmetic engine for Digital Transmission Contents Protection (DTCP) (컨텐츠 보호를 위한 DTCP용 타원곡선 암호(ECC) 연산기의 구현)

  • Kim Eui seek;Jeong Yong jin
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.3C
    • /
    • pp.176-184
    • /
    • 2005
  • In this paper, we implemented an Elliptic Curve Cryptography(ECC) processor for Digital Transmission Contents Protection (DTCP), which is a standard for protecting various digital contents in the network. Unlikely to other applications, DTCP uses ECC algorithm which is defined over GF(p), where p is a 160-bit prime integer. The core arithmetic operation of ECC is a scalar multiplication, and it involves large amount of very long integer modular multiplications and additions. In this paper, the modular multiplier was designed using the well-known Montgomery algorithm which was implemented with CSA(Carry-save Adder) and 4-level CLA(Carry-lookahead Adder). Our new ECC processor has been synthesized using Samsung 0.18 m CMOS standard cell library, and the maximum operation frequency was estimated 98 MHz, with the size about 65,000 gates. The resulting performance was 29.6 kbps, that is, it took 5.4 msec to process a 160-bit data frame. We assure that this performance is enough to be used for digital signature, encryption and decryption, and key exchanges in real time environments.

A 521-bit high-performance modular multiplier using 3-way Toom-Cook multiplication and fast reduction algorithm (3-way Toom-Cook 곱셈과 고속 축약 알고리듬을 이용한 521-비트 고성능 모듈러 곱셈기)

  • Yang, Hyeon-Jun;Shin, Kyung-Wook
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.25 no.12
    • /
    • pp.1882-1889
    • /
    • 2021
  • This paper describes a high-performance hardware implementation of modular multiplication used as a core operation in elliptic curve cryptography. A 521-bit high-performance modular multiplier for NIST P-521 curve was designed by adopting 3-way Toom-Cook integer multiplication and fast reduction algorithm. Considering the property of the 3-way Toom-Cook algorithm in which the result of integer multiplication is multiplied by 1/3, modular multiplication was implemented on the Toom-Cook domain where the operands were multiplied by 3. The modular multiplier was implemented in the xczu7ev FPGA device to verify its hardware operation, and hardware resources of 69,958 LUTs, 4,991 flip-flops, and 101 DSP blocks were used. The maximum operating frequency on the Zynq7 FPGA device was 50 MHz, and it was estimated that about 4.16 million modular multiplications per second could be achieved.

Optimization of Multi-reservoir Operation with a Hedging Rule: Case Study of the Han River Basin (Hedging Rule을 이용한 댐 연계 운영 최적화: 한강수계 사례연구)

  • Ryu, Gwan-Hyeong;Chung, Gun-Hui;Lee, Jung-Ho;Kim, Joong-Hoon
    • Journal of Korea Water Resources Association
    • /
    • v.42 no.8
    • /
    • pp.643-657
    • /
    • 2009
  • The major reason to construct large dams is to store surplus water during rainy seasons and utilize it for water supply in dry seasons. Reservoir storage has to meet a pre-defined target to satisfy water demands and cope with a dry season when the availability of water resources are limited temporally as well as spatially. In this study, a Hedging rule that reduces total reservoir outflow as drought starts is applied to alleviate severe water shortages. Five stages for reducing outflow based on the current reservoir storage are proposed as the Hedging rule. The objective function is to minimize the total discrepancies between the target and actual reservoir storage, water supply and demand, and required minimum river discharge and actual river flow. Mixed Integer Linear Programming (MILP) is used to develop a multi-reservoir operation system with the Hedging rule. The developed system is applied for the Han River basin that includes four multi-purpose dams and one water supplying reservoir. One of the fours dams is primarily for power generation. Ten-day-based runoff from subbasins and water demand in 2003 and water supply plan to water users from the reservoirs are used from "Long Term Comprehensive Plan for Water Resources in Korea" and "Practical Handbook of Dam Operation in Korea", respectively. The model was optimized by GAMS/CPLEX which is LP/MIP solver using a branch-and-cut algorithm. As results, 99.99% of municipal demand, 99.91% of agricultural demand and 100.00% of minimum river discharge were satisfied and, at the same time, dam storage compared to the storage efficiency increased 10.04% which is a real operation data in 2003.

Analysis and comparison of the water supply adjustment guide and a hedging rule of reservoir operation derived from mixed-integer programming for water supply operation of a multi-purpose reservoir (다목적댐의 가뭄 대비 용수공급 조정기준과 혼합 정수계획법에 의한 용수 감량 공급 기준의 비교 및 분석)

  • Jin, Youngkyu;Jeong, Taekmun;Lee, Sangho
    • Journal of Korea Water Resources Association
    • /
    • v.54 no.6
    • /
    • pp.443-452
    • /
    • 2021
  • The authors obtained the discrete hedging rule for a reservoir's water supply operation by applying mixed-integer programming to save more water by earlier rationing of water supply for a drought period. The 'water supply adjustment guide' is the current operational method applied to the multipurpose reservoirs, and it was derived by a simulation method. Applying the two rules to the Hapcheon multipurpose dam's reservoir simulations with the inflow record from 2003 to 2018, the water supply deficit occurred for the long drought from 2015 to 2018. Especially, the no water supply or intermittent water supply persisted for the second half of 2017. The water supply adjustment guide had the 'normal water supply recovery threshold on storage,' which resulted in the water supply being unavailable in July 2017; then, the water supply suspension occurred until January 2018, when the reservoir storage was greater than the normal water supply recovery threshold. Despite the storage increasing due to the inflow of water into the reservoir, the suspension occurrence needs to be improved in practice. The current water supply adjustment guide and the discrete hedging rule for a reservoir's water supply operation are useful and realistic as the reservoir operation guide, which shows the concept of reducing water supply during the drought phase as scientific figures. However, to improve the reservoir simulation results, which do not provide any or intermittent water for several months, it is necessary to increase the current water supply reduction for drought phases.

MILP model for short-term scheduling of multi-purpose batch plants with batch distillation process

  • Ha, Jin-Juk;Lee, Euy-Soo
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2003.10a
    • /
    • pp.1826-1829
    • /
    • 2003
  • Fine chemical production must assure high-standard product quality as well as characterized as multi-product production in small volumes. Installing high-precision batch distillation is one of the common elements in the successful manufacturing of fine chemicals, and the importance of the process operation strategy with quality assurance cannot be overemphasized. In this study, we investigate the optimal operation strategy and production planning of a sequential multi-purpose plants consisting of batch processes and batch distillation with unlimited intermediate storage. We formulated this problem as an MILP model. A mixed-integer linear programming model is developed based on the time slot, which is used to determine the production sequence and the production path of each batch. Illustrative examples show the effectiveness of the approach.

  • PDF

A Truck Dispatching Problem in the Inland Container Transportation with Empty Container (공 컨테이너를 고려한 컨테이너 내륙수송에서의 차량배차문제)

  • 윤원영;안창근;최용석
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.24 no.4
    • /
    • pp.63-80
    • /
    • 1999
  • In the container transportation of inland depots the empty container is an important issue. The truck dispatching problem in this paper is considered under restriction about empty containers. When a full container arrives in a depot by truck, after unloading operation the full container is changed to an empty container. After loading operation an empty container is changed to a full container. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We suggest an integrated approach to the problem of simultaneously managing empty truck and container movements. We would like to find the truck dispatching method minimizing empty truck movements and empty container movements. In this paper, a mixed integer programming model is developed to obtain the optimal truck dispatching in container transportation and heuristic is developed to give a good solution in much shorter time. The numerical examples are studied and the proposed heuristic is also compared with the result of numerical examples.

  • PDF

Export Container Remarshaling Planning in Automated Container Terminals Considering Time Value (시간가치를 고려한 자동화 컨테이너 터미널의 수출 컨테이너 이적계획)

  • Bae, Jong-Wook;Park, Young-Man;Kim, Kap-Hwan
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.2
    • /
    • pp.75-86
    • /
    • 2008
  • A remarshalling is one of the operational strategies considered importantly at a port container terminal for the fast ship operations and heighten efficiency of slacking yard. The remarshalling rearranges the containers scattered at a yard block in order to reduce the transfer time and the rehandling time of container handling equipments. This Paper deals with the rearrangement problem, which decides to where containers are transported considering time value of each operations. We propose the mixed integer programming model minimizing the weighted total operation cost. This model is a NP-hard problem. Therefore we develope the heuristic algorithm for rearrangement problem to real world adaption. We compare the heuristic algorithm with the optimum model in terms of the computation times and total cost. For the sensitivity analysis of configuration of storage and cost weight, a variety of scenarios are experimented.