• 제목/요약/키워드: Processing Path

Search Result 1,204, Processing Time 0.026 seconds

Design of R=1/2, K=7 Type High Speed Viterbi Decoder with Circularly Connected 2-D Analog Parallel Processing Cell Array (아날로그 2차원 셀의 순환형 배열을 이용한 R=l/2. K=7형 고속 비터비 디코더 설계)

  • 손홍락;김형석
    • The Transactions of the Korean Institute of Electrical Engineers D
    • /
    • v.52 no.11
    • /
    • pp.650-656
    • /
    • 2003
  • A high speed Viterbi decoder with a circularly connected 2-dimensional analog processing ceil array Is proposed. The proposed Viterbi .decoder has a 2-dimensional parallel processing structure in which an analog processing cell is placed at each node of a trellis diagram, the output column of the analog processing cells is connected to the decoding column, and thus, the output(last) column becomes a column right before the decoding(first) column. The reference input signal given at a decoding column is propagated to the whole network while Its magnitude is reduced by the amount of a error metric on each branch. The circuit-based decoding is done by adding a trigger signals of same magnitudes to disconnect the path corresponding to logic 0 (or 1) and by observing its effect at an output column (the former column of the decoding column). The proposed Viterbi decoder has advantages in that it is operated with better performance of error correction, has a shorter latency and requires no path memories. The performance of error correction with the proposed Viterbi decoder is tested via the software simulation.

An Extended Scan Path Architecture Based on IEEE 1149.1 (IEEE 1149.1을 이용한 확장된 스캔 경로 구조)

  • Son, U-Jeong;Yun, Tae-Jin;An, Gwang-Seon
    • The Transactions of the Korea Information Processing Society
    • /
    • v.3 no.7
    • /
    • pp.1924-1937
    • /
    • 1996
  • In this paper, we propose a ESP(Extended Scan Path) architecture for multi- board testing. The conventional architectures for board testing are single scan path and multi-scan path. In the single scan path architecture, the scan path for test data is just one chain. If the scan path is faulty due to short or open, the test data is not valid. In the multi-scan path architecture, there are additional signals in multi-board testing. So conventional architectures are not adopted to multi-board testing. In the case of the ESP architecture, even though scan paths either short or open, it doesn't affect remaining other scan paths. As a result of executing parallel BIST and IEEE 1149.1 boundary scan test by using, he proposed ESP architecture, we observed to the test time is short compared with the single scan path architecture. Because the ESP architecture uses the common bus, there are not additional signals in multi-board testing. By comparing the ESP architecture with conventional one using ISCAS '85 bench mark circuit, we showed that the architecture has improved results.

  • PDF

A Flow Control Scheme based on Queue Priority (큐의 우선순위에 근거한 흐름제어방식)

  • Lee, Gwang-Jun;Son, Ji-Yeon;Son, Chang-Won
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.1
    • /
    • pp.237-245
    • /
    • 1997
  • In this paper, a flow control mechanism is proposed which is based on the priority control between communication path of a node. In this scheme, demanding length of a data queue for any pre-defined, then each node in that path is forced to maintains buffer size under the limit by controlling priority level of the path. The communication path which requires higher bandwidth sets its demanding queue length smaller. By providing relationship between the priority of a path and length of its queue, the high bandwidth requesting path has a better chance to get high bandwidth by defining the smaller demanding queue size. And also, by forcing a path which has high flow rate to maintain small queue size in the path of the communication, the scheme keep the transmission delay of the path small. The size of the demanding queue of a path is regularly adjusted to meet the applications requirement, and the load status of the network during the life time of the communication. The priority control based on the demanding queue size is also provided in the intermediate nodes as well as the end nodes. By that the flow control can provide a quicker result than end to-end flow control, it provides better performance advantage especially for the high speed network.

  • PDF

An Efficient Sequence Matching Method for XML Query Processing (XML 질의 처리를 위한 효율적인 시퀀스 매칭 기법)

  • Seo, Dong-Min;Song, Seok-Il;Yoo, Jae-Soo
    • Journal of KIISE:Databases
    • /
    • v.35 no.4
    • /
    • pp.356-367
    • /
    • 2008
  • As XML is gaining unqualified success in being adopted as a universal data representation and exchange format, particularly in the World Wide Web, the problem of querying XML documents poses interesting challenges to database researcher. Several structural XML query processing methods, including XISS and XR-tree, for past years, have been proposed for fast query processing. However, structural XML query processing has the problem of requiring expensive Join cost for twig path query Recently, sequence matching based XML query processing methods, including ViST and PRIX, have been proposed to solve the problem of structural XML query processing methods. Through sequence matching based XML query processing methods match structured queries against structured data as a whole without breaking down the queries into sub queries of paths or nodes and relying on join operations to combine their results. However, determining the structural relationship of ViST is incorrect because its numbering scheme is not optimized. And PRIX requires many processing time for matching LPS and NPS about XML data trees and queries. Therefore, in this paper, we propose efficient sequence matching method u sing the bottom-up query processing for efficient XML query processing. Also, to verify the superiority of our index structure, we compare our sequence matching method with ViST and PRIX in terms of query processing with linear path or twig path including wild-card('*' and '//').

Development of an Improved Geometric Path Tracking Algorithm with Real Time Image Processing Methods (실시간 이미지 처리 방법을 이용한 개선된 차선 인식 경로 추종 알고리즘 개발)

  • Seo, Eunbin;Lee, Seunggi;Yeo, Hoyeong;Shin, Gwanjun;Choi, Gyeungho;Lim, Yongseob
    • Journal of Auto-vehicle Safety Association
    • /
    • v.13 no.2
    • /
    • pp.35-41
    • /
    • 2021
  • In this study, improved path tracking control algorithm based on pure pursuit algorithm is newly proposed by using improved lane detection algorithm through real time post-processing with interpolation methodology. Since the original pure pursuit works well only at speeds below 20 km/h, the look-ahead distance is implemented as a sigmoid function to work well at an average speed of 45 km/h to improve tracking performance. In addition, a smoothing filter was added to reduce the steering angle vibration of the original algorithm, and the stability of the steering angle was improved. The post-processing algorithm presented has implemented more robust lane recognition system using real-time pre/post processing method with deep learning and estimated interpolation. Real time processing is more cost-effective than the method using lots of computing resources and building abundant datasets for improving the performance of deep learning networks. Therefore, this paper also presents improved lane detection performance by using the final results with naive computer vision codes and pre/post processing. Firstly, the pre-processing was newly designed for real-time processing and robust recognition performance of augmentation. Secondly, the post-processing was designed to detect lanes by receiving the segmentation results based on the estimated interpolation in consideration of the properties of the continuous lanes. Consequently, experimental results by utilizing driving guidance line information from processing parts show that the improved lane detection algorithm is effective to minimize the lateral offset error in the diverse maneuvering roads.

Design of roller path for spinning of cylindrical cups of aluminum sheet metal (알루미늄 원통컵 스피닝 작업을 위한 롤러이송경로 설계)

  • Kim, Jong-Ho;Park, Gyu-Ho
    • Transactions of Materials Processing
    • /
    • v.7 no.5
    • /
    • pp.489-495
    • /
    • 1998
  • Spinning is a chipless forming method for producing axially symmetric parts by using axial-radial motions of a spinning roller. This process has still some advantages in such a view point that a variety of complex shapes which can not be formed in a press can be easily spun at a low cost although it is one of the oldest forming methods for spinning mainly cookware parts for a long time. This study is to investigate the optimum roller path in order to obtain the maximum spinnability in producing cylindrical cups of Aluminum(A1050-H16) sheet metal. Working conditions applicable to any size of blank were predetermined through preliminary spinning tests. 9 types of roller path were proposed and experiments were carried out. The modified involute curve was shown to give the maximum drawing ration and more uniform quality of spun cups as compared with other results of this study. in addition thickness distribution and dimensional accuracy of spun cups were examined and discussed.

  • PDF

Design of Forming Path for Concave Steel Plate Using the Line Array Roll Set (선형 배열 롤 셋을 이용한 오목형상 강판 성형경로 설계)

  • Roh, H.J.;Kim, K.H.;Shim, D.S.;Yang, D.Y.;Chung, S.W.;Han, M.S.
    • Transactions of Materials Processing
    • /
    • v.17 no.7
    • /
    • pp.491-495
    • /
    • 2008
  • Incremental forming path to manufacture a thick concave steel plate using the line array roll set is designed. To find the optimum forming path, the forming processes are simulated by the finite element method. A general-purpose commercial software, MSC MARC is used. A modeling with 8-node hexahedral elastic-plastic solid is performed to predict accurate springback and the analysis process was composed of 18 passes. The proposed forming paths are verified through experiments carried out in the prototype line array roll set. It is found that the process can be successfully applied to the fabrication of the dual curvature ship hull plate.

Map building for path planning of an autonomous mobile robot using an ultrasonic sensor (초음파센서를 이용한 자율 주행 로봇의 경로 계획용 지도작성)

  • 이신제;오영선;김학일;김춘우
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1996.10b
    • /
    • pp.900-903
    • /
    • 1996
  • The objective of this paper is to make the weighted graph map for path planning using the ultrasonic sensor measurements that are acquired when an A.M.R (autonomous mobile robot) explores the unknown circumstance. First, The A.M.R navigates on unknown space with wall-following and gathers the sensor data from the environments. After this, we constructs the occupancy grid map by interpreting the gathered sensor data to occupancy probability. For the path planning of roadmap method, the weighted graph map is extracted from the occupancy grid map using morphological image processing and thinning algorithm. This methods is implemented on an A.M.R having a ultrasonic sensor.

  • PDF

Design of Robot Direct-Teaching Tool and its Application to Path Generation for Die Induction Hardening

  • Ahn, Jae-Hyung;Sungchul Kang;Changhyun Cho;Jisun Hwang;Mansuk Suh
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2002.10a
    • /
    • pp.118.5-118
    • /
    • 2002
  • To apply induction hardening method to a press die having 3-D free surface, the induction hardening tool moves on a press die above 1~2mm gap with constant velocity. Since the induction hardening process requires its own hardening path for each die, a direct teaching method which generates working path directly guided by operators is more suitable than an offline method using CAD/CAM data. The direct teaching apparatus in this work includes a teaching tool with a force/torque sensor and data processing computer to finally generate robot's Induction hardening program , in direct teaching operation, an operator teaches working path maintaining contact with surface of press die by holding...

  • PDF

Path Control of MR Fluid Jet Polishing System for the Polishing of an Aspherical Lens Mold Core (비구면 렌즈 몰드 코어 연마를 위한 MR Fluid Jet Polishing System의 경로 제어에 관한 연구)

  • Kim, K. B.;Cho, M. W.;Ha, S. J.;Cho, Y. K.;Song, K. H.;Yang, J. K.;Cai, Y.;Lee, J. W.
    • Transactions of Materials Processing
    • /
    • v.24 no.6
    • /
    • pp.431-436
    • /
    • 2015
  • MR fluid can change viscosity in the presence of a magnetic field. A characteristic of MR fluid is reduced scattering during jetting. For these reasons a MR fluid jet polishing system can be used for ultra-precision polishing. In the current paper, the polishing path was calculated considering the aspherical lens profile equation and the experimental conditions for the MR fluid jet polishing system. Then the polishing of an aspherical lens mold core using the MR fluid jet polishing system with the calculated path control was made and the results were compared before and after polishing.