• Title/Summary/Keyword: Size Computation

Search Result 627, Processing Time 0.034 seconds

An Efficient Algorithm for Sparse Code Motion (희소코드모션을 위한 효율적인 알고리즘)

  • Shin Hyun-Deok;Yu Heui-Jong;Ahn Heui-Hak
    • The KIPS Transactions:PartA
    • /
    • v.12A no.1 s.91
    • /
    • pp.79-86
    • /
    • 2005
  • This paper suggests that sparse code motion algorithm should be used to make the code optimal in the respect of computation and lifetime. This algorithm Is SpCM algorithm, which expand BCM and LCM algorithm. BCM algorithm carries out the optimal code motion computationally and LCM algorithm reduces the register pressure in SpCM algorithm. Generally, code motion algorithm accomplishes the run-time optimal connected with the optimum of computation and the register pressure. Computational cost and consideration of the code size in the register pressure are also added in the paper. The optimum of code motion could be obtained through SpCM algorithm, which considers the code size, in audition to computational optimal and lifetime optimal. The algorithm presented in this paper is the most optimal algorithm in the respect of computation and lifetime, as all the unnecessary code motions are restrained.

Fast Frame Selection Method for Multi-Reference and Variable Block Motion Estimation (다중참조 및 가변블록 움직임 추정을 위한 고속 참조영상 선택 방법)

  • Kim, Sung-Dae;SunWoo, Myung-Hoon
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.45 no.6
    • /
    • pp.1-8
    • /
    • 2008
  • This paper introduces three efficient frame selection schemes to reduce the computation complexity for the multi-reference and variable block size Motion Estimation (ME). The proposed RSP (Reference Selection Pass) scheme can minimize the overhead of frame selection. The MFS (Modified Frame Selection) scheme can reduce the number of search points about 18% compared with existing schemes considering the motion of image during the reference frame selection process. In addition, the TPRFS (Two Pass Reference frame Selection) scheme can minimize the frame selection operation for the variable block size ME in H.264/AVC using the character of selected reference frame according to the block size. The simulation results show the proposed schemes can save up to 50% of the ME computation without degradation of image Qualify. Because the proposed schemes can be separated from the block matching process, they can be used with any existing single reference fast search algorithms.

A Numerical Study on the Improvement of Performance for the 2 Vane Pump Impeller (2 Vane 펌프 임펠러의 성능 개선에 관한 수치해석적 연구)

  • KIM, SUNG;MA, SANG-BUM;CHOI, YOUNG-SEOK;KIM, JIN-HYUK
    • Transactions of the Korean hydrogen and new energy society
    • /
    • v.31 no.3
    • /
    • pp.293-301
    • /
    • 2020
  • This paper describes a numerical study on the improvement of performance of the 2 vane pump impellers. The design of these impellers was optimized using a commercial computation fluid dynamics code and design of experiments. Geometric design variables were defined by the impeller blade angle distribution. The objective functions were defined as the total head, total efficiency and solid material size of the impellers. The importance of the geometric design variables was analyzed using 2k factorial designs. The interaction between the total head, total efficiency and solid material size, according to the impeller blade angle distribution, is discussed by analyzing the 2k factorial design results.

TS-FVTD Techniques for Electromagnetic Field Computation by Dielectric Boundary with Rough Surface (굴곡 표면을 가진 유전체 경계면에서의 전자계 계산을 위한 TS-FVTD 기법)

  • Yoon, Kwang-Yeol
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.5 no.4
    • /
    • pp.345-351
    • /
    • 2010
  • The finite volume time domain (FVTD) method gives accurate results for the calculation of electromagnetic wave propagation but it requires large amount of computer memory. In this paper we propose a modified FVTD that employs a time subdivision. The time-subdivided FVTD (TS-FVTD) method is enough to divide the space domain grid with a large step size. This method can reduce computation time and memory resources. We check the effectiveness of the proposed method in order to apply to the analysis of electromagnetic field from rough surface with dielectric waveguide.

Magnetic Field Gradient Optimization for Electronic Anti-Fouling Effect in Heat Exchanger

  • Han, Yong;Wang, Shu-Tao
    • Journal of Electrical Engineering and Technology
    • /
    • v.9 no.6
    • /
    • pp.1921-1927
    • /
    • 2014
  • A new method for optimizing the magnetic field gradient in the exciting coil of electronic anti-fouling (EAF) system is presented based on changing exciting coil size. In the proposed method, two optimization expressions are deduced based on biot-savart law. The optimization expressions, which can describe the distribution of the magnetic field gradient in the coil, are the function of coil radius and coil length. These optimization expressions can be used to obtain an accurate coil size if the magnetic field gradient on a certain point on the coil's axis of symmetry is needed to be the maximum value. Comparing with the experimental results and the computation results using Finite Element Method simulation to the magnetic field gradient on the coil's axis of symmetry, the computation results obtained by the optimization expression in this article can fit the experimental results and the Finite Element Method results very well. This new method can optimize the EAF system's anti-fouling performance based on improving the magnetic field gradient distribution in the exciting coil.

AE-CORDIC: Angle Encoding based High Speed CORDIC Architecture (AE-CORDIC: 각도 인코딩 기반 고속 CORDIC 구조)

  • Cho Yongkwon;Kwak Seoungho;Lee Moonkey
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.41 no.12
    • /
    • pp.75-81
    • /
    • 2004
  • AE-CORDIC improves the CORDIC operation speed with a rotation direction pre-computation algorithm. Its CORDIC iteration stages consist of non-predictable rotation direction states and predictable rotation stages. The non-predictable stages are replaced with lookup-table which has smaller hardware size than CORDIC iteration stages. The predictable stages can determine rotation direction with the input angle and simple encoder. In this paper, a rotation direction pre-computation algorithm with input angle encoder is proposed. and AE-CORDIC which have optimized Lookup-table is compared with the P-CORDIC algorithm. Hardware size, delay, and SQNR of the AE-CORDIC are verified with Samsung 0.18㎛ technology and Synopsys design compiler when input angle bit length is 16.

Calculation of Electron concentration and Electrostatic potential profile for $Al_{x}Gal{-x}As/Ga_{x}In1$_{-x}$As/GaAs HEMT device by 2-Dimensional Quantum Mechanical analysis) (2차원 양자 역학적 해석에 의한 고속 통신용 $Al_{x}Gal{-x}As/Ga_{x}In1$_{-x}$As/GaAs HEMT 소자의 전자 농도 및 전위분포 계산)

  • 송영진;황호정
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.30A no.3
    • /
    • pp.76-87
    • /
    • 1993
  • We present a self-consistent, 2-dimensional solution of the Poisson and Sch rodinger equation based on the finite difference method with a nonuniform mesh size for a AlGaAs/GaInAs/GaAs HEMT devide. During the interative self-consistent calculation, however, we calculate Schrodinger equation only a some region of device, not a fully region in order to save the moemory and the speed-up of computation, and then use the approximated data for the other region using by a interpolation method with a given values. Also we adopt the proper matrix transformation method that allows preservation of the symmetric, form of the discretized Schrodinger equation, even with the use of a nonumiform mesh size, therefor, can reduce the computation time. We calculate the wavefunction, eigenstates and the electron concentration uat channel layer nder the thermal equilibrium and the biased conditions, respectively. Also,these parameters are used to solve 2-dimensional tdistribution of potential in he entire region of device. It is proved that the method is very efficient in finding eigenstages extending over relatively large spatial area without loss of accuracy. So, it can be used rather easily in any sarbitrary modulation doped utucture.

  • PDF

High Speed Wavelet Algorithm for Computation Reduction of Adaptive Signal Processing (적응신호처리의 계산량감소에 적합한 고속웨이블렛 알고리즘에 관한연구)

  • 오신범;이채욱
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.4
    • /
    • pp.17-21
    • /
    • 2002
  • Least mean square(LMS) algorithm one of the most popular algorithm in adaptive signal processing because of the simplicity and the small computation. But the convergence speed of time domain adaptive algorithm is slow when the spread width of eigen values is wide. Moreover we have to choose the step size well for convergency. in this paper, ie use adaptive algorithm of wavelet transform. And we propose a new wavelet based adaptive algorithm of wavelet transform. And we propose a high speed wavelet based adaptive algorithm with variable step size, which is linear to absolute value of error signal. We applied this algorithm to adaptive noise canceler. Simulation results are presented to compare the performance of the proposed algorithm with the usual algorithms.

  • PDF

A Study on Data Sharing Scheme using ECP-ABSC that Provides Data User Traceability in the Cloud

  • Hwang, Yong-Woon;Kim, Taehoon;Seo, Daehee;Lee, Im-Yeong
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.16 no.12
    • /
    • pp.4042-4061
    • /
    • 2022
  • Recently, various security threats such as data leakage and data forgery have been possible in the communication and storage of data shared in the cloud environment. This paper conducted a study on the CP-ABSC scheme to solve these security threats. In the existing CP-ABSC scheme, if the data is obtained by the unsigncryption of the data user incorrectly, the identity of the data owner who uploaded the ciphertext cannot be known. Also, when verifying the leaked secret key, the identity information of the data user who leaked the secret key cannot be known. In terms of efficiency, the number of attributes can affect the ciphertext. In addition, a large amount of computation is required for the user to unsigncrypt the ciphertext. In this paper, we propose ECP-ABSC that provides data user traceability, and use it in a cloud environment to provide an efficient and secure data sharing scheme. The proposed ECP-ABSC scheme can trace and verify the identity of the data owner who uploaded the ciphertext incorrectly and the data user who leaked the secret key for the first time. In addition, the ciphertext of a constant size is output and the efficiency of the user's unsigncryption computation were improved.

A hybrid algorithm for the synthesis of computer-generated holograms

  • Nguyen The Anh;An Jun Won;Choe Jae Gwang;Kim Nam
    • Proceedings of the Optical Society of Korea Conference
    • /
    • 2003.07a
    • /
    • pp.60-61
    • /
    • 2003
  • A new approach to reduce the computation time of genetic algorithm (GA) for making binary phase holograms is described. Synthesized holograms having diffraction efficiency of 75.8% and uniformity of 5.8% are proven in computer simulation and experimentally demonstrated. Recently, computer-generated holograms (CGHs) having high diffraction efficiency and flexibility of design have been widely developed in many applications such as optical information processing, optical computing, optical interconnection, etc. Among proposed optimization methods, GA has become popular due to its capability of reaching nearly global. However, there exits a drawback to consider when we use the genetic algorithm. It is the large amount of computation time to construct desired holograms. One of the major reasons that the GA' s operation may be time intensive results from the expense of computing the cost function that must Fourier transform the parameters encoded on the hologram into the fitness value. In trying to remedy this drawback, Artificial Neural Network (ANN) has been put forward, allowing CGHs to be created easily and quickly (1), but the quality of reconstructed images is not high enough to use in applications of high preciseness. For that, we are in attempt to find a new approach of combiningthe good properties and performance of both the GA and ANN to make CGHs of high diffraction efficiency in a short time. The optimization of CGH using the genetic algorithm is merely a process of iteration, including selection, crossover, and mutation operators [2]. It is worth noting that the evaluation of the cost function with the aim of selecting better holograms plays an important role in the implementation of the GA. However, this evaluation process wastes much time for Fourier transforming the encoded parameters on the hologram into the value to be solved. Depending on the speed of computer, this process can even last up to ten minutes. It will be more effective if instead of merely generating random holograms in the initial process, a set of approximately desired holograms is employed. By doing so, the initial population will contain less trial holograms equivalent to the reduction of the computation time of GA's. Accordingly, a hybrid algorithm that utilizes a trained neural network to initiate the GA's procedure is proposed. Consequently, the initial population contains less random holograms and is compensated by approximately desired holograms. Figure 1 is the flowchart of the hybrid algorithm in comparison with the classical GA. The procedure of synthesizing a hologram on computer is divided into two steps. First the simulation of holograms based on ANN method [1] to acquire approximately desired holograms is carried. With a teaching data set of 9 characters obtained from the classical GA, the number of layer is 3, the number of hidden node is 100, learning rate is 0.3, and momentum is 0.5, the artificial neural network trained enables us to attain the approximately desired holograms, which are fairly good agreement with what we suggested in the theory. The second step, effect of several parameters on the operation of the hybrid algorithm is investigated. In principle, the operation of the hybrid algorithm and GA are the same except the modification of the initial step. Hence, the verified results in Ref [2] of the parameters such as the probability of crossover and mutation, the tournament size, and the crossover block size are remained unchanged, beside of the reduced population size. The reconstructed image of 76.4% diffraction efficiency and 5.4% uniformity is achieved when the population size is 30, the iteration number is 2000, the probability of crossover is 0.75, and the probability of mutation is 0.001. A comparison between the hybrid algorithm and GA in term of diffraction efficiency and computation time is also evaluated as shown in Fig. 2. With a 66.7% reduction in computation time and a 2% increase in diffraction efficiency compared to the GA method, the hybrid algorithm demonstrates its efficient performance. In the optical experiment, the phase holograms were displayed on a programmable phase modulator (model XGA). Figures 3 are pictures of diffracted patterns of the letter "0" from the holograms generated using the hybrid algorithm. Diffraction efficiency of 75.8% and uniformity of 5.8% are measured. We see that the simulation and experiment results are fairly good agreement with each other. In this paper, Genetic Algorithm and Neural Network have been successfully combined in designing CGHs. This method gives a significant reduction in computation time compared to the GA method while still allowing holograms of high diffraction efficiency and uniformity to be achieved. This work was supported by No.mOl-2001-000-00324-0 (2002)) from the Korea Science & Engineering Foundation.

  • PDF