• Title/Summary/Keyword: Fast Computation

Search Result 750, Processing Time 0.035 seconds

Research on Multi-precision Multiplication for Public Key Cryptography over Embedded Devices (임베디드 장비 상에서의 공개키 기반 암호를 위한 다중 곱셈기 최신 연구 동향)

  • Seo, Hwajeong;Kim, Howon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.22 no.5
    • /
    • pp.999-1007
    • /
    • 2012
  • Multi-precision multiplication over public key cryptography should be considered for performance enhancement due to its computational complexity. Particularly, embedded device is not suitable to execute high complex computation, public key cryptography, because of its limited computational power and capacity. To overcome this flaw, research on multi-precision multiplication with fast computation and small capacity is actively being conducted. In the paper, we explore the cutting-edge technology of multi-precision multiplication for efficient implementation of public key cryptography over sensor network. This survey report will be used for further research on implementation of public key cryptography over sensor network.

Efficient mesh-based realistic computer-generated hologram synthesis with polygon resolution adjustment

  • Yeom, Han-Ju;Cheon, Sanghoon;Choi, Kyunghee;Park, Joongki
    • ETRI Journal
    • /
    • v.44 no.1
    • /
    • pp.85-93
    • /
    • 2022
  • We propose an efficient method for synthesizing mesh-based realistic computer-generated hologram (CGH). In a previous nonanalytic mesh-based CGH synthesis, the angular spectrum of the two-dimensional (2D) plane is calculated using the fast Fourier transform (FFT) with the same size as the resolution of the final hologram. Because FFT increases the computation time as the size of the input matrix increases, the previous method has a problem: The higher the resolution of the hologram, the greater the computational load, thereby delaying synthesis time. In this study, when calculating the angular spectrum of the 2D plane in mesh-based CGH synthesis, we propose a method to calculate the angular spectrum by defining the 2D plane with an arbitrary size smaller than the resolution of the final hologram. The resolution adjustment method reduces the computation time and can be applied to occlusion culling and texturing for the realistic effect of mesh-based CGH. We describe the principle, error analysis, application of realistic effect, and experimental results of the proposed method.

Radix-2 16 Points FFT Algorithm Accelerator Implementation Using FPGA (FPGA를 사용한 radix-2 16 points FFT 알고리즘 가속기 구현)

  • Gyu Sup Lee;Seong-Min Cho;Seung-Hyun Seo
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.34 no.1
    • /
    • pp.11-19
    • /
    • 2024
  • The increased utilization of the FFT in signal processing, cryptography, and various other fields has highlighted the importance of optimization. In this paper, we propose the implementation of an accelerator that processes the radix-2 16 points FFT algorithm more rapidly and efficiently than FFT implementation of existing studies, using FPGA(Field Programmable Gate Array) hardware. Leveraging the hardware advantages of FPGA, such as parallel processing and pipelining, we design and implement the FFT logic in the PL (Programmable Logic) part using the Verilog language. We implement the FFT using only the Zynq processor in the PS (Processing System) part, and compare the computation times of the implementation in the PL and PS part. Additionally, we demonstrate the efficiency of our implementation in terms of computation time and resource usage, in comparison with related works.

A Hierarchical Cluster Tree Based Fast Searching Algorithm for Raman Spectroscopic Identification (계층 클러스터 트리 기반 라만 스펙트럼 식별 고속 검색 알고리즘)

  • Kim, Sun-Keum;Ko, Dae-Young;Park, Jun-Kyu;Park, Aa-Ron;Baek, Sung-June
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.20 no.3
    • /
    • pp.562-569
    • /
    • 2019
  • Raman spectroscopy has been receiving increased attention as a standoff explosive detection technique. In addition, there is a growing need for a fast search method that can identify raman spectrum for measured chemical substances compared to known raman spectra in large database. By far the most simple and widely used method is to calculate and compare the Euclidean distance between the given spectrum and the spectra in a database. But it is non-trivial problem because of the inherent high dimensionality of the data. One of the most serious problems is the high computational complexity of searching for the closet spectra. To overcome this problem, we presented the MPS Sort with Sorted Variance+PDS method for the fast algorithm to search for the closet spectra in the last paper. the proposed algorithm uses two significant features of a vector, mean values and variance, to reject many unlikely spectra and save a great deal of computation time. In this paper, we present two new methods for the fast algorithm to search for the closet spectra. the PCA+PDS algorithm reduces the amount of computation by reducing the dimension of the data through PCA transformation with the same result as the distance calculation using the whole data. the Hierarchical Cluster Tree algorithm makes a binary hierarchical tree using PCA transformed spectra data. then it start searching from the clusters closest to the input spectrum and do not calculate many spectra that can not be candidates, which save a great deal of computation time. As the Experiment results, PCA+PDS shows about 60.06% performance improvement for the MPS Sort with Sorted Variance+PDS. also, Hierarchical Tree shows about 17.74% performance improvement for the PCA+PDS. The results obtained confirm the effectiveness of the proposed algorithm.

A Fast Motion Estimation Scheme using Spatial and Temporal Characteristics (시공간 특성을 이용한 고속 움직임 백터 예측 방법)

  • 노대영;장호연;오승준;석민수
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.40 no.4
    • /
    • pp.237-247
    • /
    • 2003
  • The Motion Estimation (ME) process is an important part of a video encoding systems since they can significantly reduce bitrate with keeping the output quality of an encoded sequence. Unfortunately this process may dominate the encoding time using straightforward full search algorithm (FS). Up to now, many fast algorithms can reduce the computation complexity by limiting the number of searching locations. This is accomplished at the expense of less accuracy of motion estimation. In this paper, we introduce a new fast motion estimation method based on the spatio-temporal correlation of adjacent blocks. A reliable predicted motion vector (RPMV) is defined. The reliability of RPMV is shown on the basis of motion vectors achieved by FS. The scalar and the direction of RPMV are used in our proposed scheme. The experimental results show that the proposed method Is about l1~14% faster than the nearest neighbor method which is a wellknown conventional fast scheme.

Effective Robot Path Planning Method based on Fast Convergence Genetic Algorithm (유전자 알고리즘의 수렴 속도 향상을 통한 효과적인 로봇 길 찾기 알고리즘)

  • Seo, Min-Gwan;Lee, Jae-Sung;Kim, Dae-Won
    • Journal of the Korea Society of Computer and Information
    • /
    • v.20 no.4
    • /
    • pp.25-32
    • /
    • 2015
  • The Genetic algorithm is a search algorithm using evaluation, genetic operator, natural selection to populational solution iteratively. The convergence and divergence characteristic of genetic algorithm are affected by selection strategy, generation replacement method, genetic operator when genetic algorithm is designed. This paper proposes fast convergence genetic algorithm for time-limited robot path planning. In urgent situation, genetic algorithm for robot path planning does not have enough time for computation, resulting in quality degradation of found path. Proposed genetic algorithm uses fast converging selection strategy and generation replacement method. Proposed genetic algorithm also uses not only traditional crossover and mutation operator but additional genetic operator for shortening the distance of found path. In this way, proposed genetic algorithm find reasonable path in time-limited situation.

MLFMA for Computation of TM Scattering from Near Resonant Object (유사 공진형 물체에 대한 TM 전자파의 산란계산을 위한 MLFMA방법)

  • ;W. C. Chew
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.9 no.6
    • /
    • pp.735-745
    • /
    • 1998
  • The method of moments has been widely used in the analysis of TM scattering problems. Recently, significant advances in the development of fast and efficient techniques for solving large problems have been reported. In such methods, iterative matrix solvers are preferred by virtue of their speed and low memory requirements. But for near resonant and strong multiple scattering problems, e.g., involving an aircraft engine inlet, a large number of iterations is required for convergence. In this paper, an efficient approximate inverse based preconditioner is used to reduce this number of iterations. By using the matrix partitioning method, the computational is used to reduce this number of iterations. By using the matrix partitioning method, the computational cost for obtaining the approximate inverse is reduced to O(N). We apply this preconditioner to an O(NlogN) algorithm, the multilevel fast multipole algorithm, for the aircraft engine inlet problem. The numerical results show the efficiency of this preconditioner.

  • PDF

Fast Motion Estimation Algorithm Using Importance of Search Range and Adaptive Matching Criterion (탐색영역의 중요도와 적응적인 매칭기준을 이용한 고속 움직임 예측 알고리즘)

  • Choi, Hong-Seok;Kim, Jong-Nam;Jeong, Shin-Il
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.16 no.4
    • /
    • pp.129-133
    • /
    • 2015
  • In this paper, we propose a fast motion estimation algorithm which is important in the performance of video encoding. Conventional fast motion estimation algorithms have serious problems of low prediction quality in some frames and still much computation. In the paper, we propose an algorithm that reduces unnecessary computations only, while keeping prediction quality almost similar to that of the full search. The proposed algorithm uses distribution of probability of motion vectors, divides search range into several groups according to its importance, and applies adaptive block matching criteria for each group of search range. The proposed algorithm takes only 3~5% in computational amount and has decreased prediction quality about 0~0.01dB compared with the fast full search algorithm.

State of Art on Security Protocols for Fast Mobile IPv6 (고속의 이동 IPv6를 위한 보안 프로토콜 연구)

  • You, Il-Sun;Hori, Yoshiaki;Sakurai, Kouichi
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.20 no.3
    • /
    • pp.121-134
    • /
    • 2010
  • With the help of various Layer 2 triggers, Fast Handover for Mobile IPv6 (FMIPv6) considerably reduces the latency and the signaling messages incurred by the handover. Obviously, if not secured, the protocol is exposed to various security threats and attacks. In order to protect FMIPv6, several security protocols have been proposed. To our best knowledge, there is lack of analysis and comparison study on them though the security in FMIPv6 is recognized to be important. Motivated by this, we provide an overview of the security protocols for FMIPv6, followed by the comparison analysis on them. Also, the security threats and requirements are outlined before the protocols are explored. The comparison analysis result shows that the protocol presented by You, Sakurai and Hori is more secure than others while not resulting in high computation overhead. Finally, we introduce Proxy MIPv6 and its fast handover enhancements, then emphasizing the need for a proper security mechanism for them as a future work.

An Optimization on the Psychoacoustic Model for MPEG-2 AAC Encoder (MPEG-2 AAC Encoder의 심리음향 모델 최적화)

  • Park, Jong-Tae;Moon, Kyu-Sung;Rhee, Kang-Hyeon
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.38 no.2
    • /
    • pp.33-41
    • /
    • 2001
  • Currently, the compression is one of the most important technology in multimedia society. Audio files arc rapidly propagated throughout internet Among them, the most famous one is MP-3(MPEC-1 Laver3) which can obtain CD tone from 128Kbps, but tone quality is abruptly down below 64Kbps. MPEC-II AAC(Advanccd Audio Coding) is not compatible with MPEG 1, but it has high compression of 1.4 times than MP 3, has max. 7.1 and 96KHz sampling rate. In this paper, we propose an algorithm that decreased the capacity of AAC encoding computation but increased the processing speed by optimizing psychoacoustic model which has enormous amount of computation in MPEG 2 AAC encoder. The optimized psychoacoustic model algorithm was implemented by C++ language. The experiment shows that the psychoacoustic model carries out FFT(Fast Fourier Transform) computation of 3048 point with 44.1 KHz sampling rate for SMR(Signal to Masking Ratio), and each entropy value is inputted to the subband filters for the control of encoder block. The proposed psychoacoustic model is operated with high speed because of optimization of unpredictable value. Also, when we transform unpredictable value into a tonality index, the speed of operation process is increased by a tonality index optimized in high frequency range.

  • PDF