• 전기학회논문지
• /
• 제56권2호
• /
• pp.428-431
• /
• 2007

A floating-point number system is used to represent a wide range of real numbers using finite number of bits. The standard the IEEE adopted in 1987 divides the range of real numbers into intervals of [$2^E,2^{E+1}$), where E is an Integer represented with finite bits, and defines equally spaced equal counts of discrete numbers in each interval. Since the numbers are defined discretely, not only the number representation itself includes errors but in floating-point arithmetic some strange behaviors are observed which cannot be agreed with the real world arithmetic. In this paper errors with floating-point number representation, those with arithmetic operations, and those due to order of arithmetic operations are analyzed theoretically with help of and verification with the results of some MATLAB program executions.

• Journal of Information Processing Systems
• /
• 제13권3호
• /
• pp.573-589
• /
• 2017

Cloud computing is an attractive solution that can provide low cost storage and powerful processing capabilities for government agencies or enterprises of small and medium size. Yet the confidentiality of information should be considered by any organization migrating to cloud, which makes the research on relational database system based on encryption schemes to preserve the integrity and confidentiality of data in cloud be an interesting subject. So far there have been various solutions for realizing SQL queries on encrypted data in cloud without decryption in advance, where generally homomorphic encryption algorithm is applied to support queries with aggregate functions or numerical computation. But the existing homomorphic encryption algorithms cannot encrypt floating-point numbers. So in this paper, we present a mechanism to enable the trusted party to encrypt the floating-points by homomorphic encryption algorithm and partial trusty server to perform summation on their ciphertexts without revealing the data itself. In the first step, we encode floating-point numbers to hide the decimal points and the positive or negative signs. Then, the codes of floating-point numbers are encrypted by homomorphic encryption algorithm and stored as sequences in cloud. Finally, we use the data structure of DoubleListTree to implement the aggregate function of SUM and later do some extra processes to accomplish the summation.

• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.211-222
• /
• 1997

In this paper we present a probabilistic approach for the estimation of realistic error bounds appearing in the execution of basic algebraic floating point operations. Experimental results are carried out for the extended product the extended sum the inner product of random normalised numbers the product of random normalised ma-trices and the solution of lower triangular systems The ordinary and probabilistic bounds are calculated for all the above processes and gen-erally in all the executed examples the probabilistic bounds are much more realistic.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2000년도 하계종합학술대회 논문집(2)
• /
• pp.250-253
• /
• 2000

In this paper, we Implement a new arithmetic computation for MPEG audio data to overcome the limitations of real number processing in the fixed-point arithmetics, such as: overheads in processing time and power consumption. We aims at efficiently dealing with real numbers by extending the fixed-point arithmetic manipulation for floating-point numbers in MPEG audio data, and implementing the DSP libraries to support the manipulation and computation of real numbers with the fixed-point resources.

• 한국정보통신학회논문지
• /
• 제13권8호
• /
• pp.1593-1600
• /
• 2009

부동소수점 제곱근 연산은 곱셈을 반복하여 근사값을 계산하는 뉴턴-랍손 알고리즘 및 골드스미트 알고리즘과 뺄셈을 반복하여 정확한 간을 계산하는 SRT 알고리즘이 있다. 본 논문에서는 곱셈기를 사용하여 정확한 값을 계산하는 제곱근 알고리즘을 제안한다. 본 논문에서는 뉴턴-랍손 알고리즘을 이용하여 근사 역제곱근을 구하고, 이의 오차를 줄이면서 제곱근을 구하는 알고리즘과 계산된 제곱근을 보정하는 알고리즘을 제안한다. 제안한 알고리즘은 단정도 실수에서는 전수 조사를 통해서, 배정도 실수에서는 10억 개의 무작위 수를 계산하여 모두 정확한 값을 얻었다. 본 논문에서 제안한 알고리즘은 곱셈기만을 사용하므로 별도의 하드웨어가 필요하지 않다. 따라서 실장제어용기기, 휴대용기기 등 정확한 제곱근 연산을 요구하는 분야에서 사용될 수 있다.

• 시스템엔지니어링학술지
• /
• 제17권2호
• /
• pp.37-48
• /
• 2021

Improving the plant protection system against unforeseen changes/transients during operation is essential to maintain plant safety. Under this condition, it requires rapid and accurate signal processing. The use of an Intellectual Property (IP) core for floating point calculations for Safety Critical MMIS can make numerical computations easier and more precise, improving system accuracy. It can represent and manipulate rational numbers as well as a much broader range of values with dynamic range in nuclear power plant. Systems engineering approach (SE) is used through the development process, it helps to reduce complexity and avoid omissions and invalid assumptions as delivers a better understanding of the stakeholders needs. For the implementation on the FPGA target board, the 32-bit floating-point arithmetic with IEEE-754 standards has designed using Simulink model in Matlab for all operations of addition, subtraction, multiplication and division and VHDL code generated.

• Journal of Information Processing Systems
• /
• 제18권3호
• /
• pp.293-301
• /
• 2022

Direction of arrival (DOA) estimation of space signals is a basic problem in array signal processing. DOA estimation based on the multiple signal classification (MUSIC) algorithm can theoretically overcome the Rayleigh limit and achieve super resolution. However, owing to its inadequate real-time performance and accuracy in practical engineering applications, its applications are limited. To address this problem, in this study, a DOA estimation algorithm with high parallelism and precision based on an analysis of the characteristics of complex matrix eigenvalue decomposition and the coordinate rotation digital computer (CORDIC) algorithm is proposed. For parallel and single precision, floating-point numbers are used to construct an orthogonal identity matrix. Thus, the efficiency and accuracy of the algorithm are guaranteed. Furthermore, the accuracy and computation of the fixed-point algorithm, double-precision floating-point algorithm, and proposed algorithm are compared. Without increasing complexity, the proposed algorithm can achieve remarkably higher accuracy and efficiency than the fixed-point algorithm and double-precision floating-point calculations, respectively.

• 전기전자학회논문지
• /
• 제26권2호
• /
• pp.240-248
• /
• 2022

픽셀의 정보를 실숫값으로 표현하는 부동소수점 형식 이미지는 HDR 이미지 등에서 사용된다. 효율적인 중간값 필터 알고리즘에 관한 연구는 다양하게 이뤄졌지만 대부분 8비트 깊이 이하의 이미지에 적용할 수 있고 부동소수점 형식 이미지에 적용할 수 있는 알고리즘은 Gil과 Werman의 알고리즘을 비롯하여 제한적으로만 존재한다. 본 논문에서는 Gil과 Werman의 알고리즘을 개선한 Kim의 알고리즘을 다시 개선하여 부동소수점 형식 이미지에 대해 효율적으로 동작하는 중간값 필터 알고리즘을 제안한다. 반복적으로 사용되는 이진 탐색 트리에 대한 중복 작업을 줄이고 역인덱스를 적용하여 실험 결과 Kim 알고리즘보다 약 10% 수행시간이 향상됨을 보인다.

• 전자공학회논문지B
• /
• 제31B권8호
• /
• pp.11-19
• /
• 1994

The matching probability P(ο/$\lambda$), of the signal sequence(ο) observed for a finite time interval with a HMM (Hidden Markov Model $\lambda$) indicates the probability that signal comes from the given model. By utilizing the fact that the probability represents matching score of the observed signal with the model we can recognize an unknown signal pattern by comparing the magnitudes of the matching probabilities with respect to the known models. Because the algorithm however uses floating point variables during the computing process hardware implementation of the algorithm requires floating point units. This paper proposes an integer algorithm which uses positive integer numbers rather than float point ones to compute the matching probability so that we can economically realize the algorithm into hardware. The algorithm makes the model parameters integer numbers by multiplying positive constants and prevents from divergence of data through the normalization of variables at each step. The final equation of matching probability is composed of constant terms and a variable term which contains logarithm operations. A scheme to make the log conversion table smaller is also presented. To analyze the qualitive characteristics of the proposed algorithm we attatch simulation result performed on two groups of 10 hypothetic models respectively and inspect the statistical properties with repect to the model order the magnitude of scaling constants and the effect of the observation length.

• 대한전자공학회논문지SD
• /
• 제48권10호
• /
• pp.72-81
• /
• 2011

본 논문에서는 IEEE754 표준의 단정도 및 배정도를 지원하는 새로운 부동소수점 변환기를 제안하고 설계하였다. 제안된 변환기는 부호 있는 정수(32비트/64비트)와 부동소수점(단정도/배정도) 간 변환, 부호 없는 정수(32비트/64비트)를 부동소수점(단정도/배정도)으로의 변환, 부동소수점 단정도와 배정도 간 변환뿐만 아니라 부호 있는 고정소수점(32비트 64비트)과 부동소수점(단정도 배정도) 간 변환을 지원한다. 모든 입력 형태를 하나의 형태로 만드는 새로운 내부 형태를 정의함으로써 출력 형태의 표현 범위에 따른 오버플로우 검사를 쉽게 하도록 하였다. 내부 형태는 IEEE754 2008 표준에서 정의된 부동소수점 배정도의 확장된 형태(extended format)와 유사하다. 이 표준에서는 부동소수점 배정도의 확장된 형태(extended format)의 최소 지수부 비트폭은 15비트라고 명시하지만 제안된 컨버터를 구현하는데 11비트만으로도 충분하다. 또한 덧셈기가 대신 +1 증가기를 사용하면서 라운딩 연산과 음수의 정확한 표현이 가능하도록 변환기의 라운딩 스테이지를 최적화하였다. 단일 클럭 사이클 데이터패스와 5단 파이프라인 데이터패스를 설계하였다. 변환기의 두 데이터패스에 대한 HDL 모델을 기술한 후에 Synopsys design compiler를 사용하여 TSMC 180nm 공정 라이브러리로 합성하였다. 합성 결과의 셀 면적은 12,886 게이트(2입력 NAND 게이트 기준)이고 최대 동작 주파수는 411MHz이다.