• 제목/요약/키워드: SON Algorithm

검색결과 829건 처리시간 0.039초

저밀도 부호의 고속 부호화 알고리즘 (Fast Encoding Algorithm of Low Density Codes)

  • 이광재;손영수
    • 한국전자통신학회논문지
    • /
    • 제9권4호
    • /
    • pp.403-408
    • /
    • 2014
  • 본 논문에서 우리는 저밀도 부호의 부호화 문제를 고찰한다. 특히 순환 치환 행렬을 이용한 저밀도 부호의 고속 부호화 알고리즘을 제시하였다. 고속 부호화 알고리즘은 고속 Hadamard 변환과 유사하며 결과적으로 제안 기법은 저밀도 부호의 간단하며 고속화된 부호화 알고리즘임을 보여주고 있다.

무인자율차량의 실시간 충돌 회피 알고리즘 개발 (Development of a Real-Time Collision Avoidance Algorithm for eXperimental Autonomous Vehicle)

  • 최덕선
    • 전기학회논문지
    • /
    • 제56권7호
    • /
    • pp.1302-1308
    • /
    • 2007
  • In this paper, a real-time collision avoidance algorithm is proposed for experimental Autonomous Vehicle(XAV). To ensure real-time implementation, a virtual potential field is calculated in one dimensional space. The attractive force is generated by the steering command either transmitted in the remote control station or calculated in the Autonomous Navigation System(ANS) of the XAV. The repulsive force is generated by obstacle information obtained from Laser Range Finder(LRF) mounted on the XAV. Using these attractive and repulsive forces, modified steering, velocity and emergency stop commands are created to avoid obstacles and follow a planned path. The suggested algorithm is inserted as one component in the XAV system. Through various real experiments and technical demonstration using the XAV, the usefulness and practicality of the proposed algorithm are verified.

Blind Source Separation U sing Variable Step-Size Adaptive Algorithm in Frequency Domain

  • Park Keun-Soo;Lee Kwang-Jae;Park Jang-Sik;Son Kyung Sik
    • 한국멀티미디어학회논문지
    • /
    • 제8권6호
    • /
    • pp.753-760
    • /
    • 2005
  • This paper introduces a variable step-size adaptive algorithm for blind source separation. From the frequency characteristics of mixed input signals, we need to adjust the convergence speed regularly in each frequency bin. This algorithm varies a step-size according to the magnitude of input at each frequency bin. This guarantee of the regular convergence in each frequency bin would become more efficient in separation performances than conventional fixed step-size FDICA. Computer simulation results show the improvement of about 5 dB in signal to interference ratio (SIR) and the better separation quality.

  • PDF

새로운 변압기 보호용 디지털 계전 알고리즘 (A New Digital Relaying Algorithm for Transformer Protection)

  • 강용철;이병은;손진만;박종근
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2000년도 하계학술대회 논문집 A
    • /
    • pp.194-196
    • /
    • 2000
  • This paper presents a new digital relaying algorithm for protection of a two winding power transformer. The proposed algorithm calculates mutual flux linkages of primary and secondary windings from the currents and voltages of primary and secondary windings. The mutual flux linkage ratio of primary and secondary windings is equal to the turn ratio in case of the steady state and magnetic inrush. On the other hand, the ratio is different from the turn ratio in case of internal winding faults. The algorithm does not require B-H curve. The results of various tests are satisfactory.

  • PDF

청소 로봇을 위한 경로 계획의 새로운 알고리즘 (A New Algorithm for Complete Coverage Path-Planning of Cleaning Robots)

  • 유강;손영익;김갑일
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
    • /
    • pp.252-254
    • /
    • 2005
  • Completer coverage path planning requires the robot path to cover every part of the workspace, which is an essential issue in cleaning robots and many other robotic applications such as vacuum robots and painter robots. In this paper, a novel Water Flowing Algorithm (WFA) is proposed for cleaning robots to complete coverage path planning in unknown environment without obstacles. The robot covers the whole workspace just like that water fills up a container. First the robot goes to the lowest point in the workspace just like water flows to the bottom of the container. At last the robot will come to highest point in the workspace just like water overflows from the container and simultaneously the robot has covered the whole workspace. The computer simulation results show that the proposed algorithm enable the robot to plan complete coverage paths.

  • PDF

Extension of Range Migration Algorithm for Airborne SAR Data Processing

  • Shin, Hee-Sub;Song, Won-Gyu;Son, Jun-Won;Jung, Yong-Hwan;Lim, Jong-Tae
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 제어로봇시스템학회 2005년도 ICCAS
    • /
    • pp.857-860
    • /
    • 2005
  • Several algorithms have been developed for the data processing of spotlight synthetic aperture radar (SAR). In particular, the range migration algorithm (RMA) does not assume that illuminating wavefronts are planar. Also, a high resolution image can be obtained by the RMA. This paper introduces an extension of the original RMA to enable a more efficient airborne SAR data processing. We consider more general motion and scene than the original RMA. The presented formulation is analyzed by using the principle of the stationary phase. Finally, the extended algorithm is tested with numerical simulations using the pulsed spotlight SAR.

  • PDF

감축 불가능한 유향그래프로부터 지배자 트리를 구성하기 위한 효과적인 알고리즘 (An Effective Algorithm for Constructing the Dominator Tree from Irreducible Directed Graphs)

  • 이대식;심손권;안희학
    • 한국정보처리학회논문지
    • /
    • 제7권8호
    • /
    • pp.2536-2542
    • /
    • 2000
  • 지배자 트리란 유향그래프에서 지배관계를 트리로 표현한 것이다. 임의의 유향그래프로부터 지배자 트리를 구성하기 위한 효과적인 알고리즘을 제시한다. 감축 가능한 흐름그래프는 지배자 계산을 한 후 지배자 트리로 감축된다. 감축 불가능한 흐름그래프는 정보 테이블의 연결가지 정보를 이용하여 지배자 연결그래프로 구성된다. 지배자 연결그래프에서 지배자 트리로 감축하기 위하여 효과적인 순차감축 알고리즘과 지연감축 알고리즘을 제안한다.

  • PDF

로봇의 위치계산을 위한 포인트 개수 알고리즘 (Point Number Algorithm for Position Identification of Mobile Robots)

  • 유강;손영익;김갑일
    • 대한전기학회:학술대회논문집
    • /
    • 대한전기학회 2005년도 학술대회 논문집 정보 및 제어부문
    • /
    • pp.427-429
    • /
    • 2005
  • This paper presents the use of Point Number Algorithm (PNA) for real-time image processing for position identification of mobile robot. PNA can get how many points in the image gotten from the robot vision and can calculate the distance between the robot and the wall by the number of the points. The algorithm can be applied to a robot vision system enable to identify where it is in the workspace. In the workspace, the walls are made up by white background with many black points on them evenly. The angle of the vision is set invariable. So the more black points in the vision, the longer the distance is from the robot to the wall. But when the robot does not face the wall directly, the number of the black points is different. When the robot faces the wall, the least number of the black points can be gotten. The simulation results are presented at the end of this paper.

  • PDF

배전선로 회선별단선도 자동생성 알고리즘 (An Auto-drawing Algorithm for the Single Line Diagram of Distribution Systems)

  • 손주환;임성일
    • 전기학회논문지
    • /
    • 제59권5호
    • /
    • pp.854-859
    • /
    • 2010
  • Distribution Automation System(DAS) is designed to improve operational efficiency by acquisition and control of remote data using its components such as central computation units, communication network and feeder remote terminal units. A conventional human machine interface of the DAS adopts a schematic diagram which is made by drawing power equipments on the geographic information system map. The single line diagram is more useful than the schematic diagram for the main tasks of distribution system operation such as protective relay coordination, service restoration and loss minimization. Since the configuration of the distribution line is changed according to the relocation of the open tie switches, the auto-drawing algorithm based on the connection between the sections and the switches is an essential technique. This paper proposes a new auto-drawing algorithm for a single line diagram of distribution systems based on tertiary tree and collision avoidance method. The feasibility of the proposed algorithm has been testified for various cases using practical distribution system with 12 feeders.

조선 산업의 블록 적치장 운영계획 휴리스틱 알고리즘 (A Heuristic Algorithm for Block Storage Planning in Shipbuilding)

  • 손정열;서흥원;하병현
    • 대한조선학회논문집
    • /
    • 제51권3호
    • /
    • pp.239-245
    • /
    • 2014
  • This paper deal with the block storage planning problem of storing and retrieving assembly blocks in a temporary storage yard with limited capacity, which is one of the critical managerial problems in shipbuilding. The block storage planning problem is required to minimize the number of relocations of blocks while the constraints for storage and retrieval time windows are satisfied. We first show NP-hardness of the block storage planning problem. Next we propose a heuristic algorithm to generate good quality solutions for larger instances in very short computational time. The proposed heuristic algorithm was validated by comparing the results with the mathematical model presented in the previous study.