• Title/Summary/Keyword: computation

Search Result 8,025, Processing Time 0.032 seconds

Computation of the Mutual Radiation Impedance in the Acoustic Transducer Array: A Literature Survey

  • Paeng, Dong-Guk;Bok, Tae-Hoon;Lee, Jong-Kil
    • The Journal of the Acoustical Society of Korea
    • /
    • v.28 no.2E
    • /
    • pp.51-59
    • /
    • 2009
  • Mutual radiation impedance becomes more important in the design and analysis of acoustic transducers for higher power, better beam pattern, and wider bandwidth at low frequency sonar systems. This review paper focused on literature survey about the researches of mutual radiation impedance in the acoustic transducer arrays over 60 years. The papers of mutual radiation impedance were summarized in terms of transducer array structures on various baffle geometries such as planar, cylindrical, spherical, conformal, spheroidal, and elliptic cylindrical arrays. Then the computation schemes of solving conventional quadruple integral in the definition of mutual radiation impedance were surveyed including spatial convolution method, which reduces the quadruple integral to a double integral for efficient computation.

Multi-gradient learning algorithm for multilayer neural networks (다층 신경망을 위한 Multi-gradient 학습 알고리즘)

  • 고진욱
    • Proceedings of the IEEK Conference
    • /
    • 1999.06a
    • /
    • pp.1017-1020
    • /
    • 1999
  • Recently, a new learning algorithm for multilayer neural networks has been proposed 〔1〕. In the new learning algorithm, each output neuron is considered as a function of weights and the weights are adjusted so that the output neurons produce desired outputs. And the adjustment is accomplished by taking gradients. However, the gradient computation was performed numerically, resulting in a long computation time. In this paper, we derive the all necessary equations so that the gradient computation is performed analytically, resulting in a much faster learning time comparable to the backpropagation. Since the weight adjustments are accomplished by summing the gradients of the output neurons, we will call the new learning algorithm “multi-gradient.” Experiments show that the multi-gradient consistently outperforms the backpropagation.

  • PDF

Adaptive Matching Scan Algorithm Based on Gradient Magnitude and Sub-blocks in Fast Motion Estimation of Full Search (전영역 탐색의 고속 움직임 예측에서 기울기 크기와 부 블록을 이용한 적응 매칭 스캔 알고리즘)

  • 김종남;최태선
    • Proceedings of the IEEK Conference
    • /
    • 1999.11a
    • /
    • pp.1097-1100
    • /
    • 1999
  • Due to the significant computation of full search in motion estimation, extensive research in fast motion estimation algorithms has been carried out. However, most of the algorithms have the degradation in predicted images compared with the full search algorithm. To reduce an amount of significant computation while keeping the same prediction quality of the full search, we propose a fast block-matching algorithm based on gradient magnitude of reference block without any degradation of predicted image. By using Taylor series expansion, we show that the block matching errors between reference block and candidate block are proportional to the gradient magnitude of matching block. With the derived result, we propose fast full search algorithm with adaptively determined scan direction in the block matching. Experimentally, our proposed algorithm is very efficient in terms of computational speedup and has the smallest computation among all the conventional full search algorithms. Therefore, our algorithm is useful in VLSI implementation of video encoder requiring real-time application.

  • PDF

Efficient Image Specific Block Based LCD Backlight Nonideality and Cross-talk Compensation (Image에 따른 효과적인 LCD 백라이트 Block 단위 Nonideality 및 Cross-talk Compensation)

  • Han, Won-Jin;You, Jae-Hee
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.48 no.4
    • /
    • pp.38-48
    • /
    • 2011
  • Block based LCD backlight nonideality and crosstalk compensation methodologies are proposed based on the analysis of backlight profiles and image pixel homogeneity. Large computation complexity required in the conventional compensations is minimized without the degradation of image qualities by optimizing image block size, image area inside the block to be excluded from the compensation computation and the required backlight range to be computed. The optimization results of computation complexity as well as image qualities are verified for the proposed compensation by real image data simulations.

A Survey: application of geometric modeling techniques to ship modeling and design

  • Ko, Kwang-Hee
    • International Journal of Naval Architecture and Ocean Engineering
    • /
    • v.2 no.4
    • /
    • pp.177-184
    • /
    • 2010
  • In this study, geometric modeling techniques and their application to ship modeling and design are presented. Traditionally the hull shape is defined by using curves called the lines and various necessary computations are performed based on the discrete points obtained from the lines. However, some applications find difficulty in using the lines such as seakeeping analysis, which requires the computation of wetted part that is changing dynamically over time. To overcome such a problem and increase accuracy and efficiency in computation, two essential geometric modeling techniques, surface modeling and surface-to-surface intersection, are introduced and their application to ship modeling and analysis including hydrostatic computation, slamming and seakeeping analyses is presented.

An Optimal Circuit Structure for Implementing SEED Cipher Algorithm with Verilog HDL (SEED 암호알고리즘의 Verilog HDL 구현을 위한 최적화 회로구조)

  • Lee, Haeng Woo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.8 no.1
    • /
    • pp.107-115
    • /
    • 2012
  • This paper proposes on the structure for reducing the circuit area and increasing the computation speed in implementing to hardware using the SEED algorithm of a 128-bit block cipher. SEED cipher can be implemented with S/W or H/W method. It should be important that we have minimize the area and computation time in H/W implementation. To increase the computation speed, we used the structure of the pipelined systolic array, and this structure is a simple thing without including any buffer at the input and output circuit. This circuit can record the encryption rate of 320 Mbps at 10 MHz clock. We have designed the circuit with the Verilog HDL coding showing the circuit performances in the figures and the table.

Vibration Analysis of Structures Using the Transfer Stiffness Coefficient Method and the Substructure Synthesis Method (전달강성계수법과 부분구조합성법을 이용한 구조물의 진동해석)

  • Choi, Myung-Soo
    • Journal of Power System Engineering
    • /
    • v.5 no.4
    • /
    • pp.24-30
    • /
    • 2001
  • The substructure synthesis method(SSM) is developed for overcoming disadvantages of the Finite Element Method(FEM). The concept of the SSM is as follows. After dividing a whole structure into several substructures, every substructures are analyzed by the FEM or experiment. The whole structure is analyzed by using connecting condition and the results of substructures. The concept of the transfer stiffness coefficient method(TSCM) is based on the transfer of the nodal stiffness coefficients which are related to force vectors and displacement vectors at each node of analytical mode1. The superiority of the TSCM to the FEM in the computation accuracy, cost and convenience was confirmed by the numerical computation results. In this paper, the author suggests an efficient vibration analysis method of structures by using the TSCM and the SSM. The trust and the validity of the present method is demonstrated through the numerical results for computation models.

  • PDF

A New Algorithm for An Efficient Implementation of the MDCT/IMDCT (MDCT/IMDCT의 효율적인 구현을 위한 새로운 알고리즘)

  • 조양기;이원표;인치호;김희석
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2471-2474
    • /
    • 2003
  • The modified discrete cosine transform (MDCT) and its inverse transform (IMDCT) are employed in subband/transform coding schemes as the analysis/synthesis filter bank based on time domain aliasing cancellation (TDAC). And they are the most computational intensive operations in layer III of the MPEG audio coding standard. In this paper, we propose a new efficient algorithm for the MDCT/IMDCT computation. It is based on the MDCT/IMDCT computation algorithm using the discrete cosine transforms (DCTs), and it employs two discrete cosine transform of type II(DCT-II) to compute the MDCT/IMDCT. In addition to, it takes advantage of ability in calculating the MDCT/IMDCT computation, where the length of a data block is divisible by 4. The proposed algorithm in this paper requires less calculation complexity than the existing methods. Also, it can be implemented by the parallel structure,, and its structure is particularly suitable for VLSI realization.

  • PDF

Wavelet Image Data Compression Using Vector Quantization (벡터양자화를 이용한 웨이브렛 영상데이터 압축)

  • 최유일;조창호;이상효;조도현;이종용
    • Proceedings of the IEEK Conference
    • /
    • 2003.07e
    • /
    • pp.2287-2290
    • /
    • 2003
  • In this paper, an image vector quantization method is proposed not only to improve the compression ratio but also to reduce the computation cost. The proposed method could save the computation cost of codebook generation and encoding by using the modified LBG algorithm of Partial Search Partial Distortion (PSPD) in wavelet domain, by which the code book was constructed together with the partial codebook search, the partial code vector elements, and the interruption criterion. We have designed and implemented the vector quantizer to verify the improvement in reducing compression ratio in encoding processing and reducing the computation cost.

  • PDF

A Study of CHMM Reducing Computational Load Using VQ with Multiple Streams (다중 Stream 구조를 가지는 VQ를 이용하여 연산량을 개선한 CHMM에 관한 연구)

  • Bang, Young Gue;Chung, IK Joo
    • Journal of Industrial Technology
    • /
    • v.26 no.B
    • /
    • pp.233-242
    • /
    • 2006
  • Continuous, discrete and semi continuous HMM systems are used for the speech recognition. Discrete systems have the advantage of low run-time computation. However, vector quantization reduces accuracy and this can lead to poor performance. Continuous systems let us get good correctness but they need much calculation so that occasionally they are unable to be used for practice. Although there are semi-continuous systems which apply advantage of continuous and discrete systems, they also require much computation. In this paper, we proposed the way which reduces calculation for continuous systems. The proposed method has the same computational load as discrete systems but can give better recognition accuracy than discrete systems.

  • PDF