• 제목/요약/키워드: Critical path tracing

검색결과 6건 처리시간 0.024초

NAND회로망의 시험패턴발생을 위한 D-알고리듬의 효율개선에 관한 연구 (A Study of Efficiency Improvement of the D-algorithm for NAND Circuits)

  • 노정호;강병욱;안광선
    • 대한전자공학회논문지
    • /
    • 제25권7호
    • /
    • pp.734-745
    • /
    • 1988
  • In this paper, it is tried to improve efficiency of the D-algorithm by assigning the logic values effectively on the nodes related to the critical path for back tracing to reduce the number of search nodes when acyclic combinational logic circuits are composed of NAND gates only. For that purpose, LASAR algorithm which is suitable for determining a critical path for back tracing is applied to the D-algorithm and it is implemented by IBM-PC with APL language. The test results on a number of NAND circuits which have multi-fanout, reconvergent and symetric characteristics show that the modified D-algorihtm reduces the number of search nodes in forward and backward tracing and decreases the run time of CPU about 10 percents.

  • PDF

고장 대상 후보를 줄이기 위한 패턴 비교 알고리즘 (A Pattern Comparison Algorithm for Pruning Fault Candidates)

  • 조형준;강성호
    • 대한전자공학회논문지SD
    • /
    • 제44권11호
    • /
    • pp.82-88
    • /
    • 2007
  • 본 논문에서는 패턴 비교를 통해 고장 대상 후보를 줄이는 알고리즘을 제안한다. 고장 대상 후보의 개수는 고장 진단을 위한 고장 시뮬레이션 시간을 결정한다. 그렇기 때문에 전체 고장 진단 시간을 줄이기 위해서는 고장 대상 수를 줄이는 것이 필수적이다. 임계 경로 추적은 회로의 최종 출력에서부터 시작해 후방 추적을 통해 고장 대상 후보를 결정한다. 제안하는 알고리즘은 이러한 임계 경로 추적을 하는 동안에 고장이 발견되지 않은 패턴에서와 고장이 발견된 패턴에서의 논리 값을 비교하여 고장 대상 후보를 줄이는 알고리즘이다. 고장 진단을 하는데 있어서 고장 대상 후보를 줄이는 것은 전체 고장 진단 시간에 있어 가장 큰 부분을 차지한다. 때문에 제안하는 알고리즘은 기존의 후방 추적을 이용한 방식보다 고장 진단 시 매우 빠른 성능을 보인다. 또한 조합회로와 순차회로의 모든 경우에 적용이 가능하다. 본 논문에서는 ISCAS#85회로와 ISCAS#89의 회로들을 가지고 실험을 하여 기존의 고장 진단 방식의 경우보다 얼마나 성능이 좋아졌는지 보이도록 하겠다.

병렬처리를 위한 고속 Ray Tracing 프로세서의 설계 (Implementation of Ray Tracing Processor for the Parallel Processing)

  • 최규열;정덕진
    • 대한전기학회논문지:전력기술부문A
    • /
    • 제48권5호
    • /
    • pp.636-642
    • /
    • 1999
  • The synthesis of the 3D images is the most important part of the virtual reality. The ray tracing is the best method for reality in the 3D graphics. But the ray tracing requires long computation time for the synthesis of the 3D images. So, we implement the ray tracing with software and hardware. Specially we design the hit-test unit with FPGA tool for the ray tracing. Hit-test unit is a very important part of ray tracing to improve the speed. In this paper, we proposed a new hit-test algorithm and apply the parallel architecture for hit-test unit to improve the speed. We optimized the arithmetic unit because the critical path of hit-test unit is in the multiplication part. We used the booth algorithm and the baugh-wooley algorithm to reduce the partial product and adapted the CSA and CLA to improve the efficiency of the partial product addition. Our new Ray tracing processor can produce the image about 512ms/F and can be adapted to real-time application with only 10 parallel processors.

  • PDF

호장법을 이용한 공간구조의 기하학적 비선형 해석에 관한 연구 (A Study on the Geometrically Nonlinear Analysis of Spatial Structures by Using Arc Length Method)

  • 한상을;이상주;이경수
    • 한국전산구조공학회:학술대회논문집
    • /
    • 한국전산구조공학회 2007년도 정기 학술대회 논문집
    • /
    • pp.381-386
    • /
    • 2007
  • The present study is concerned with the application of Constant arc-length method that proposed by Crisfield in the investigation of the geometrically nonlinear behaviour of spatial structures composed by truss or beam element. The arc-length method can trace the full nonlinear equilibrium path of Spatial structure far beyond the critical point such as limit or bifurcation point. So, we have developed the constant arc-length method of Crisfield to analysis spatial structure. The finite element formulation is used to develop the 3d truss/beam element including the geometrical nonlinear effect. In an effort to evaluate the merits of the methods, extensive numerical studies were carried out on a number of selected structural systems. The advantages of Constant arc length method in tracing the post-buckling behavior of spatial structures, are demonstrated.

  • PDF

물류정보를 활용한 텔레매틱스 기술 개선방안 (Improvement of Telematics Technology Utilizing Logistics Information)

  • 변의석
    • 산업경영시스템학회지
    • /
    • 제32권2호
    • /
    • pp.38-44
    • /
    • 2009
  • Recently, automobile industry expands from mechatronics area through intelligent information area, and the telematics technology is one of the greatest developing points. The telematics is utilizing the on-board-unit of vehicle's communication system, and it provides necessary information and value-added service to vehicles as well as drivers. Most of the telematics offers the solution of searching a route or generates an optimal path. This paper investigates telematics with the logistics point of view, such as freight location tracking, vehicle emergency information, etc. The telematics is a core technology of automobile industry, and it becomes new business paradigm of IP(information provider). Especially, ETA(estimated arrival time) of freight and distribution tracing information are critical issues in the logistics industry. The successful integration with telematics is introduced in the paper.

Evaluation of Artificial Intelligence-Based Denoising Methods for Global Illumination

  • Faradounbeh, Soroor Malekmohammadi;Kim, SeongKi
    • Journal of Information Processing Systems
    • /
    • 제17권4호
    • /
    • pp.737-753
    • /
    • 2021
  • As the demand for high-quality rendering for mixed reality, videogame, and simulation has increased, global illumination has been actively researched. Monte Carlo path tracing can realize global illumination and produce photorealistic scenes that include critical effects such as color bleeding, caustics, multiple light, and shadows. If the sampling rate is insufficient, however, the rendered results have a large amount of noise. The most successful approach to eliminating or reducing Monte Carlo noise uses a feature-based filter. It exploits the scene characteristics such as a position within a world coordinate and a shading normal. In general, the techniques are based on the denoised pixel or sample and are computationally expensive. However, the main challenge for all of them is to find the appropriate weights for every feature while preserving the details of the scene. In this paper, we compare the recent algorithms for removing Monte Carlo noise in terms of their performance and quality. We also describe their advantages and disadvantages. As far as we know, this study is the first in the world to compare the artificial intelligence-based denoising methods for Monte Carlo rendering.