• Title/Summary/Keyword: Repealer

Search Result 2, Processing Time 0.015 seconds

Analysis of Field Test Results of Digital TV On-Channel Repeaters (지상파 DTV 동일채널 중계기 필드테스트 결과 분석)

  • 서영우;목하균;권태훈
    • Journal of Broadcast Engineering
    • /
    • v.7 no.1
    • /
    • pp.10-20
    • /
    • 2002
  • In order to fill the gaps in DTV coverage, KBS Technical Research Institute has researched on DTV on-channel repeating systems as well as DTV translators. The on-channel repeater can reuse frequency resources for expanding service coverage. but it has also many restricts in applications for ATSC DTV system. Thiss Paper compares two kinds of DTV on-channel repealer systems and also presents field test results of both systems. From these results, we Infer their characteristics and summarize the conditions and possibilities of the application for our broadcasting networks.

Efficient Allocation and Connection of Concentrators and Repeaters Using Approximate Steiner Minimum Tree in Automatic Meter Reading System (원격 검침 시스템에서 근사 최소 스타이너 트리를 이용한 집중기 및 중계기의 효율적인 배치와 연결)

  • Kim, Chae-Kak;Kim, In-Bum;Kim, Soo-In
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.34 no.10B
    • /
    • pp.994-1003
    • /
    • 2009
  • For Automatic Meter Reading System, good topology of check machines, concentrators, and repeaters in client field is important. Steiner Minimum Tree is a minimum cost tree connecting all given nodes with introducing Steiner points. In this paper, an efficient mechanism allocating and connecting check machines, concentrators and repeaters which are essential elements in automatic meter reading system is proposed, which conducts repeated applications of building approximate Minimum Steiner Trees. In the mechanism, input nodes and Steiner points might correspond to check machine, concentrators or repeaters and edges might do to the connections between them. Therefore, through suitable conversions and processes of them, an efficient network for automatic meter reading system with both wired and wireless communication techniques could be constructed. In our experiment, for 1000 input nodes and 200 max connections per node, the proposed mechanism shortened the length of produced network by 19.1% comparing with the length of Minimum Spanning Tree built by Prim's algorithm.