• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2018.06a
• /
• pp.182-184
• /
• 2018

본 논문에서는 HDR 영상 신호의 고속 광전변환을 위한 파라미터 룩업 테이블 기반 구간 선형 근사 방법을 제안한다. 제안하는 방법은 고속화하기 위한 광전변환함수의 입력 값의 범위를 다수개의 구간으로 나누고 각 구간마다 별도의 선형 근사함수를 구하여 광전변환함수를 근사하고 각 구간별로 필요한 선형 근사함수의 파라미터를 룩업 테이블에 미리 저장하고 사용함으로써 보다 빠른 근사 값 계산이 가능하다. 제안한 방법의 성능 평가를 위해 MPEG 에서 제공하는 참조 소프트웨어인 HDRTools 를 기반으로 실험을 수행했고 이를 통해 참조 소프트웨어에 구현되어 있는 기존의 고속화 방법과 비교하여 더 적은 연산 수를 가지며 평균 24% 빠른 처리속도와 약 0.05dB 의 평균 PSNR 손실을 보임을 확인하였다.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.17 no.4
• /
• pp.671-678
• /
• 2022

Approximate computing is an computational technique that is acceptable degree of inaccurate results of accurate results. Approximate multiplication is one of the approximate computing methods for high-performance and low-power computing. In this paper, we propose a high-density, low-power, and high-speed approximate multiplier using approximate 4-2 compressor and improved full adder. The approximate multiplier with approximate 4-2 compressor consists of three regions of the exact, approximate and constant correction regions, and we compared them by adjusting the size of region by applying an efficient partial product reduction. The proposed approximate multiplier was designed with Verilog HDL and was analyzed for area, power and delay time using Synopsys Design Compiler (DC) on a 25nm CMOS process. As a result of the experiment, the proposed multiplier reduced area by 10.47%, power by 26.11%, and delay time by 13% compared to the conventional approximate multiplier.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.05a
• /
• pp.809-811
• /
• 2010

In most floating-point operations related with 3D graphic applications for mobile devices, properly approximated data calculations with reduced complexity and low power are preferable to exactly rounded floating-point operations with unnecessary preciseness with cost. Among all the sophisticated floating-point arithmetic operations, multiplication and division are the most complicated and time-consuming, and they can be transformed into addition and subtraction repectively by adopting the logarithmic conversion. In this process, the most important factor for performance is how high we can make an approximation of the logarithm conversion. In this paper, we cover the trends in studying the logarithm conversion circuit designs. We also discuss the important factor in design issues and the applicable fields in detail.

• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2002.10a
• /
• pp.567-574
• /
• 2002

새로운 자유격자 관사를 이용한 점별 계산법을 제안한다 이동 최소 자승법을 이용한 기저의 생성과 기저의 근사적 미분을 동시에 구해내는 자유격자 근사를 유도하여, 직접 점별 계산법을 고안하였다. 기존의 자유 격자 법에서는 기저의 직접 미분을 사용하므로 높은 계산 비용이 필요하지만, 이 논문에서 제안된 방법은 기저의 생성과 동시에 기저의 근사적 미분을 구하게 된다. 또한 기존의 방법에서 필요하였던, 창 함수(window function)의 미분가능성을 연속성으로 대치할 수 있으므로, 주어진 문제에 따라 다양한 창 함수를 이용할 수 있다. 기저의 재생성과 interpolation의 수렴성을 소개하고, 수치 예제로서, Poisson 문제를 통해 이 방법의 유효함을 보인다.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.10
• /
• pp.2403-2408
• /
• 2015

For image data the discrete cosine transform (DCT) has comparable energy compaction capability to Karhunen-Loeve transform (KLT) which is optimal. Hence DCT has been widely accepted in various image and video compression standard such as JPEG, MPEG-2, and MPEG-4. Recently some approximate DCT's have been reported, which can be computed much faster than the original DCT because their coefficients are either zero or the power of 2. Although the level of energy compaction is slightly degraded, the approximate DCT's can be utilized in real time implementation of image or visual compression applications. In this paper, an approximate 8-point DCT which contains 17 non-zero power-of-2 coefficients and high energy compaction capability comparable to DCT is proposed. Transform coding experiments with several images show that the proposed transform outperforms the published works.

• Proceedings of the Korean Nuclear Society Conference
• /
• 1996.05a
• /
• pp.251-256
• /
• 1996

일반화된 다군의 material 단면적 라이브러리 형식인 MATXS와 이를 각종 수송계산 코드에 적용할 수 있도록 하는 TRANSX 코드 체제를 소개하고 그 유용성을 검토하였다. 이를 위해 ENDF/B-VI.2를 이용하여 열 및 고속 임계노심 해석을 위한 각각의 라이브러리를 생산하고, 수송계산 코드인 ONEDANT를 이용하여 검증계산을 수행하였다. 열중성자 임계노심 해석결과 유효증배계수에서 약 0.3% 내외로 실험치에 근사한 결과를 얻었으며, 고속임계노심에서도 임계도 및 중심반응율비 결과가 실험치에 접근하고 있다.

• Proceedings of the Acoustical Society of Korea Conference
• /
• spring
• /
• pp.129-132
• /
• 1999

스테레오 음향 반향 제거기는 입력 신호로 사용되는 두 채널간의 강한 상관관계로 인하여 수렴특성이 악화되는 문제점을 갖는다. 따라서 수렴속도를 향상시키기 위해 RLS또는 Affine Projection(AP) 알고리즘 같은 Least Square (LS)계 열의적응 알고리즘을 사용하는 것이 필요하다. 그러나, 이러한 알고리즘은 LMS 알고리즘과 같은 통계적 미분계열 알고리 즘에 비하여 과도한 계산량을 요구하므로 고속 알고리즘에 대한 연구가 진행되어왔다. 본 논문에서는 스테레오 환경에서 Gram-Schmidt(GS) 직교화를 이용하여 LMS 알고리즘 수준의 계산량을 갖는 근사화된 AP 알고리즘을 제안하였다. 제안한 알고리즘은 AP 알고리즘의 후행오차 성질을 이용하여 GS 직교화 구조로 구성되며, 계산량 감소를 위해 샘플단위의 재귀적 GS 직교화를 사용하였다. 또한 GS직교화를 스테레오 채널에 적용함으로써 적은 계산량으로 AS 알고리즘과 대등한 수렴 성능을 갖는다.

• Journal of Broadcast Engineering
• /
• v.2 no.1
• /
• pp.65-73
• /
• 1997

This paper propose a new triangular mesh approximation method using wavelet coefficients for large terrain data. Using spatio-freguency localization characteristics of wavelet coefficients, we determine the complexity of terrain data and approximate the data according to the complexity. This proposed algorithm is simple and requires low computational cost due to its top-down approach. Because of the similarity between the mesh approximation and data compression procedures based on wavelet transform, we combine the mesh approximation scheme with the Embedded Zerotree Wavelet (EZW) coding scheme for the effective management of large terrain data. Computer simulation results demonstrate that the proposed algorithm is very prospective for the 3-D visualization of terrain data.

• Tribology and Lubricants
• /
• v.35 no.5
• /
• pp.310-316
• /
• 2019

This paper presents two methods for designing a high-speed air spindle operated over the rotational speed of 50,000 rpm. The first method is an approximate method, which assumes a symmetric spindle shape even though it is not symmetric in reality. The second is an analysis of rotordynamics using beam and solid models. The approximate method can be used to calculate the bearing load capacities, stiffness and damping coefficients, stability of the shaft system, and response of the forced excitation from the unbalanced mass. Designers can use this method to determine the dimensions of the desired spindle at the first stage of the design. The more detailed behavior of the spindle can be calculated using the rotordynamics theory using beam and solid models based on the Finite Element Method. In this paper, a spindle, with two air bearings, one motor at the end, and two air thrust bearings, is newly developed. The solutions from the two rotordynamics theories are compared with the solution obtained using the approximate method. The three calculations are in agreement, and the procedure for the design of a spindle system, supported on the externally pressurized air bearings, ispresented and discussed.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.49 no.12
• /
• pp.226-233
• /
• 2012

In this paper, we propose a 'linear approximation method' which is an accelerated BER (Bit Error Rate) test method for high speed interfaces, based on an analytical BER model. Both the conventional 'Q-factor estimation method' and 'linear approximation method' can predict a timing margin for $10^{-13}$ BER with an error of about 0.03UI. This linear approximation method is implemented on a hardware as an accelerated Built-In Self Test (BIST) with an internal BERT (BET Tester). While a direct measurement of a timing margin in a 3Gbps interface takes about 5.6 hours with $10^{-13}$ BER requirement and 95% confidence level, the accelerated BIST estimates a timing margin within 0.6 second without a considerable loss of accuracy. The test results show that the error between the estimated timing margin and the timing margin from an actual measurement using the internal BERT is less than 0.045UI.