• Journal of the Institute of Convergence Signal Processing
• /
• v.2 no.3
• /
• pp.39-44
• /
• 2001

In frequency hopping spread spectrum(FHSS) communication systems, exact frequency synchronization is required due to the random hopping of carrier frequencies between transmitter and receiver even under harsh channel conditions. For synchronization of FHSS communications, multi-frequency hopping synchronization(MFHS) method has been used in which a small set of frequencies are repeatedly sent several times for long duration. But this long duration resulted in being easily detected by the unauthorized users as well as long duration of acquisition time. In this paper, motivated by these problems, an adaptive synchronization method(ASM) is proposed. ASM is technics to reduce the synchronization time where the number of synchronization frequencies and repetition numbers is adaptively changed (increased or decreased) according to the channel conditions. The performance analysis showed that the time duration of synchronization was reduced to 0.2sec, and the influence of jamming or interference was decreased to 46% in ASM.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.2
• /
• pp.123-132
• /
• 2014

In this paper, an IEEE1588 based clock synchronization technique for CAN (Controller Area Network) is presented. Clock synchronization plays a key role to the success of a networked embedded system. Recently, the IEEE1588 algorithm making use of dedicated chipsets has been widely adopted for the synchronization of various industrial applications using Ethernet. However, there is no chipset available for CAN. This paper presents the implementation of IEEE1588 for CAN, which is implemented using only software and CAN packets without any dedicated chipset. The proposed approach is verified by the comparison between the estimated synchronization precision with a simple model and the measured precision with experimental setup.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.1B
• /
• pp.24-33
• /
• 2002

The cell search scheme for W-CDMA consists of the following three stages: slot synchronization(1st stage), group identification and frame boundary detection(2nd stage), and long code identification(3rd stage). The performance of the cell search when a mobile station is switched on, which is referred to as initial cell search, is decreased by the initial frequency and timing error. In this paper, we propose the pipeline structured initial cell search scheme using time trackers to compensate for the impact of the initial timing error in the stage 2 and stage 3. The simulation results show that the performance of the proposed scheme is maximal 1.5dB better than that of the conventional one when the initial timing error is near ${\pm}T_c$/2.

• Proceedings of the KIPE Conference
• /
• 2006.06a
• /
• pp.316-318
• /
• 2006

현재 변전소 자동화의 국제표준으로 대두되고 있는 IEC61850은 스테이션 버스뿐만 아니라 프로세서 버스까지도 표준화된 통신 기술을 채용하였고, 자동화에 필요한 모델을 제시하고 있다. 본 연구에서는 IEC61850 프로세서 레벨에서 정밀한 시간동기화를 구현하기 위해 필요한 동기화 기술을 고찰하였다. 이와 더불어 전통적인 시간동기화 프로토콜인 NTP 및 최근 새롭게 개발된 시간동기화 프로토콜인 IEEE1588 프로토콜을 분석하고 실제로 이더넷 기반의 IEC61850 프로세서 레벨에서의 시간 동기화를 수행하였다.

• The KIPS Transactions:PartA
• /
• v.19A no.4
• /
• pp.181-186
• /
• 2012

The distributed measurement and control system require technology to solve complex synchronization problem among distributed devices. It can be solved by using IEEE Standard for a Precision Clock Synchronization Protocol for Networked Measurement and Control Systems to synchronize real-time clocks incorporated within each component of the system. In this paper, we implemented the IEEE 1588v2 PTP emulator on BlueScope BL6000A using a delay request-response mechanism to measure clock synchronization.

• The KIPS Transactions:PartC
• /
• v.18C no.1
• /
• pp.15-22
• /
• 2011

Usually time synchronization is performed after routing tree is constructed. This thesis proposes a time synchronization algorithm combined with single-flooding routing tree construction algorithm in a single path. TSRA (Time Synchronization Routing Algorithm) uses routing packets to construct a routing tree. Two types of time information are added to the routing packet: one is the packet receiving time, and the other is the packet sending time. Time offset and transmission time-delay between parent node and child node could be retrieved from the added time information using LTS (Lightweight Time Synchronization) algorithm. Then parent node sends the time offset and transmission time to children nodes and children nodes can synchronize their time to the parent node time along the routing tree. The performance of proposed algorithm is compared to the TPSN (Timing-sync Protocol for Sensor Networks) which is known to have high accuracy using NS2 simulation tool. The simulation result shows that the accuracy of time synchronization is comparable to TPSN, the synchronization time of all sensor nodes is faster than TPSN, and the energy consumption is less than TPSN.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.8
• /
• pp.1543-1548
• /
• 2009

In this paper, a high speed code synchronization circuit is proposed. for fast code synchronization, matched filler method is used for initial code acquisition with two channel correlators. Particular frequency patterns of the limited number having the information about PN code start time are composed and transmitted repeatedly to increase the probability of accurate initial synchronization. And digital frequency synthesizer is proposed. And it's performance is analyzed theoretically. The analysis show that fast frequency hopping is possible in frequency hopping system that use digital frequency synthesizer.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39A no.8
• /
• pp.488-490
• /
• 2014

This paper deals with distributed time and frequency synchronization algorithms using the flocking technique for OFDMA-based wireless mesh networks. We propose a time and frequency synchronization model taking into account channel propagation delays existing in wireless mesh networks, and analyze the convergence condition of the proposed synchronization algorithm. Convergence performance of the proposed synchronization algorithm is analyzed via computer simulation in terms of synchronization parameters in the time and frequency synchronization model.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2017.06a
• /
• pp.109-110
• /
• 2017

파노라마 영상은 $360^{\circ}$ 방향의 모든 경치를 담는 기법을 말한다. 파노라마 영상은 전문적 기술자들이 여러 영상을 정합하여 제작되었지만, 기술이 점차 발전하여 현재는 일반 사용자들도 스마트 폰을 이용하여 손쉽게 파노라마 영상을 제작할 수 있다. 하지만 이는 파노라마 정지영상에 한해있으며 아직까지 파노라마 동영상은 제작에 있어서 기술적 어려움이 있다. 최근 들어서 파노라마 동영상 제작을 위한 여러 동영상 간의 시간축 동기화는 연구되었는데 연속되는 프레임들을 하나의 시퀀스로 묶어 시퀀스 단위로 키포인트 및 디스크립터를 추출 및 비교를 통해 동영상 간의 시간축을 동기화시키는 방향으로 나갔다. 하지만 동영상 시퀀스 간의 간격이 좁아 중복되는 데이터의 양이 많아 디스크립터 비교 연산 시간이 오래 걸리고, 동영상 간의 시퀀스 단위만으로 비교하기 인해 프레임 단위의 정확한 시간축 동기화에 어려움이 있었다. 본 논문에서는 이전 연구의 단점을 개선하여 여러 동영상 간의 시간축을 하나로 동기화시키는 기술을 최적화하는 방법을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.10d
• /
• pp.142-144
• /
• 2002

MPEG-4 시스템 표준은 오디오, 비디오, 이미지 등 다양한 멀티미디어 객체들을 통합하여 관리하고 전송하며 BIFS는 이러한 객체들의 표시 방법과 특성을 지정하고 하나의 장면을 구성할 수 있도록 해주는 기술 언어이다. 멀티미디어 데이터는 시간과 밀접한 관계를 가지고 있어서 객체들간의 시간 관계가 명확히 기술되어야 한다. 그러나 BIFS 명세에서는 하나의 객체에 대한 시간정보만 기술 할 수 있고 객체간 관계는 정의하고 있지 않다. 이에 본 논문은 객체간 동기화를 위한 시간관계 정보를 저장하는 노드를 BIFS에 추가하여 각 객체를 동기화 할 수 있도록 하는 확장된 BIFS를 정의하고 이를 기반으로 MPEG-4 저작 시스템을 구성하였다. 이로써 객체 동기화를 위한 별도의 구조를 추가해야하는 부담을 줄이고 MPEG-4 시스템 자체가 동기화 문제를 해결할 수 있다. MPEG-4 저작도구의 타임라인 바는 제작되는 컨텐츠 내의 멀티미디어 데이터들의 시간관계를 시각적으로 표현하고 시간관계 모델 조건에 따른 Group 노드를 생성한다.