• Title/Summary/Keyword: number and arithmetic

Search Result 309, Processing Time 0.027 seconds

A Simple Method to Reduce the Splitting Error in the LOD-FDTD Method

  • Kong, Ki-Bok;Jeong, Myung-Hun;Lee, Hyung-Soo;Park, Seong-Ook
    • Journal of electromagnetic engineering and science
    • /
    • v.9 no.1
    • /
    • pp.12-16
    • /
    • 2009
  • This paper presents a new iterative locally one-dimensional [mite-difference time-domain(LOD-FDTD) method that has a simpler formula than the original iterative LOD-FDTD formula[l]. There are fewer arithmetic operations than in the original LOD-FDTD scheme. This leads to a reduction of CPU time compared to the original LOD-FDTD method while the new method exhibits the same numerical accuracy as the iterative ADI-FDTD scheme. The number of arithmetic operations shows that the efficiency of this method has been improved approximately 20 % over the original iterative LOD-FDTD method.

GENERALIZED PADOVAN SEQUENCES

  • Bravo, Jhon J.;Herrera, Jose L.
    • Communications of the Korean Mathematical Society
    • /
    • v.37 no.4
    • /
    • pp.977-988
    • /
    • 2022
  • The Padovan sequence is the third-order linear recurrence (𝓟n)n≥0 defined by 𝓟n = 𝓟n-2 + 𝓟n-3 for all n ≥ 3 with initial conditions 𝓟0 = 0 and 𝓟1 = 𝓟2 = 1. In this paper, we investigate a generalization of the Padovan sequence called the k-generalized Padovan sequence which is generated by a linear recurrence sequence of order k ≥ 3. We present recurrence relations, the generalized Binet formula and different arithmetic properties for the above family of sequences.

Complexity Reduction Method for BSAC Decoder

  • Jeong, Gyu-Hyeok;Ahn, Yeong-Uk;Lee, In-Sung
    • ETRI Journal
    • /
    • v.31 no.3
    • /
    • pp.336-338
    • /
    • 2009
  • This letter proposes a complexity reduction method to speed up the noiseless decoding of a bit-sliced arithmetic coding (BSAC) decoder. This scheme fully utilizes the group of consecutive arithmetic-coded symbols known as the decoding band and the significance tree structure sorted in order of significance at every decoding band. With the same audio quality, the proposed method reduces the number of calculations that are performed during the noiseless decoding in BSAC to about 22% of the amount of calculations with the conventional full-search method.

  • PDF

Effect of Injector Energizing Duration on the Atomization Characteristics of Biodiesel Fuel (인젝터 통전기간이 바이오디젤 연료 미립화에 미치는 영향)

  • Suh, Hyun-Kyu;Park, Su-Han;Lee, Chang-Sik
    • Journal of ILASS-Korea
    • /
    • v.12 no.2
    • /
    • pp.108-114
    • /
    • 2007
  • This study investigates the influence of energizing duration on the fuel atomization characteristics of biodiesel injected through a high pressure common-rail injector. In order to analyze the effect of energizing duration on the fuel injection rate performance, the injection rate of biodiesel fuel is obtained from the pressure variation in the tube filled with fuel in injection measuring system. On the other hand, the atomization characteristics of biodiesel was measured and compared in terms of Sauter mean diameter(SMD), arithmetic mean diameter(AMD), droplet mean velocity, and detected droplets number by applying a phase Doppler particle analyzer(PDPA). It was revealed that the injection mass and maximum injection rate increase with increase of the energizing duration. Moreover, the increase of energizing duration improves the atomization performance of biodiesel fuel because it induces higher droplets momentum and velocity.

  • PDF

Nulling algorithm design using approximated gradient method (근사화된 Gradient 방법을 사용한 널링 알고리즘 설계)

  • Shin, Chang Eui;Choi, Seung Won
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.9 no.1
    • /
    • pp.95-102
    • /
    • 2013
  • This paper covers nulling algorithm. In this algorithm, we assume that nulling points are already known. In general, nulling algorithm using matrix equation was utilized. But, this algorithm is pointed out that computational complexity is disadvantage. So, we choose gradient method to reduce the computational complexity. In order to further reduce the computational complexity, we propose approximate gradient method using characteristic of trigonometric functions. The proposed method has same performance compared with conventional method while having half the amount of computation when the number of antenna and nulling point are 20 and 1, respectively. In addition, we could virtually eliminate the trigonometric functions arithmetic. Trigonometric functions arithmetic cause a big problem in actual implementation like FPGA processor(Field Programmable gate array). By utilizing the above algorithm in a multi-cell environment, beamforming gain can be obtained and interference can be reduced at same time. By the above results, the algorithm can show excellent performance in the cell boundary.

A Fixed-point Digital Signal Processor Development System Employing an Automatic Scaling (자동 스케일링 기능이 지원되는 고정 소수집 디지털 시그날 프로세서 개발 시스템)

  • 김시현;성원용
    • Journal of the Korean Institute of Telematics and Electronics A
    • /
    • v.29A no.3
    • /
    • pp.96-105
    • /
    • 1992
  • The use of fixed-point digital signal processors, such as the TMS 320C25, requires scaling of data at each arithmetic step to prevent overflows while keeping the accuracy. A software which automatizes this process is developed for TMS 320C25. The programmers use a model of a hypothetical floating-point digital signal processor and a floating-point format for data representation. However, the program and data are automatically translated to a fixed-point version by this software. Thus, the execution speed is not sacrificed. A fixed-point variable has a unique binary-point location, which is dependent on the range of the variable. The range is estimated from the floating-point simulation. The number of shifts needed for arithmetic or data transfer step is determined by the binary-points of the variables associated with the operation. A fixed-point code generator is also developed by using the proposed automatic scaling software. This code generator produces floating-point assembly programs from the specifiations of FIR, IIR, and adaptive transversal filters, then floating-point programs are transformed to fixed-point versions by the automatic scaling software.

  • PDF

A Study on the Simultaneous Linear Equations by Computer (전자계산기에 의한 다원연립 일차방정식의 해법에 관한 연구)

  • 이정복
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.8 no.12
    • /
    • pp.127-138
    • /
    • 1985
  • There are several methods which have been presented up to now in solving the simultaneous linear equations by computer. They are Gaussian Elimination Method, Gauss-Jordan Method, Inverse matrix Method and Gauss-Seidel iterative Method. This paper is not only discussed in their mechanisms compared with their algorithms, depicted flow charts, but also calculated the numbers of arithmetic operations and comparisons in order to criticize their availability. Inverse Matrix Method among em is founded out the smallest in the number of arithmetic operation, but is not the shortest operation time. This paper also indicates the many problems in using these methods and propose the new method which is able to applicate to even small or middle size computers.

  • PDF

DIVISIBILITY AND ARITHMETIC PROPERTIES OF CERTAIN ℓ-REGULAR OVERPARTITION PAIRS

  • ANUSREE ANAND;S.N. FATHIMA;M.A. SRIRAJ;P. SIVA KOTA REDDY
    • Journal of applied mathematics & informatics
    • /
    • v.42 no.4
    • /
    • pp.969-983
    • /
    • 2024
  • For an integer ℓ ≥ 1, let ${\bar{B}}_{\ell}(n)$ denotes the number of ℓ-regular over partition pairs of n. For certain conditions of ℓ, we study the divisibility of ${\bar{B}}_{\ell}(n)$ and arithmetic properties for ${\bar{B}}_{\ell}(n)$. We further obtain infinite family of congruences modulo 2t satisfied by ${\bar{B}}_3(n)$ employing a result of Ono and Taguchi (2005) on nilpotency of Hecke operators.

Ship Repair Workers' Exposure to Asbestos by a Systematic Review in Korea (문헌 조사를 통한 국내 선박 수리 작업자들의 석면 노출 특성 분석)

  • Choi, Sang-Jun;Kwon, Hyo-Jung;Gwak, Su-Gyeong
    • Journal of the Korea Safety Management & Science
    • /
    • v.14 no.3
    • /
    • pp.135-141
    • /
    • 2012
  • This study was conducted to evaluate the characteristics of exposure to asbestos for ship repair workers in Korea by a systematic review. The number of articles studying asbestos exposure levels from ship repair workplaces was found to be 4. All asbestos concentration reported as either geometric mean and geometric standard deviation or ranges were transformed to arithmetic mean to estimate exposure level. In addition, weighted arithmetic means(WAMs) were calculated by weighing of the different number of samples. The WAM concentrations were 2.746 f/cc during asbestos dismantling work, 0.034 f/cc before asbestos dismantling work and 0.065 f/cc after working respectively. The maximum airborne concentration of asbestos during asbestos removal work was 7.02 f/cc which was 70 times higher than the occupational exposure limit of Korea, 0.1 f/cc. This study recommends that retrospective exposure to asbestos based on various ship types and operations should be assessed.

An Improving Motion Estimator based on multi arithmetic Architecture (고밀도 성능향상을 위한 다중연산구조기반의 움직임추정 프로세서)

  • Lee, Kang-Whan
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.631-632
    • /
    • 2006
  • In this paper, acquiring the more desirable to adopt design SoC for the fast hierarchical motion estimation, we exploit foreground and background search algorithm (FBSA) base on the dual arithmetic processor element(DAPE). It is possible to estimate the large search area motion displacement using a half of number PE in general operation methods. And the proposed architecture of MHME improve the VLSI design hardware through the proposed FBSA structure with DAPE to remove the local memory. The proposed FBSA which use bit array processing in search area can improve structure as like multiple processor array unit(MPAU).

  • PDF