• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.11A
• /
• pp.1081-1091
• /
• 2005

Unlike conventional DVB-T transmission with the streaming method, DVB-H system based on the IPDC(IP Data Casting) method uses Time-slicing scheme to achieve the maximization of portability by reducing the power consumption of a receiver. To enhance the power efficiency of the receiver, Time-slicing scheme controls the receiver operation to perform only for corresponding burst in specific time slot. The additional power saving can also be achieved by reducing the required time for synchronization. In this paper, we propose a fast scattered pilot synchronization algorithm, which detects the pilot pattern of currently received OFDM symbol. The proposed scheme is based on the correlation between the adjacent subcarriers of potential scattered pilot position in two consecutively received OFDM symbols. Therefore, it can reduce the time for the scattered pilot synchronization within two symbols as com-pared with the conventional method used for DVB-T. And the proposed algorithm has better performance than the two schemes proposed by Nokia for DVB-H and the method using correlation with reference signal. Extensive com-puter simulation is performed based on ETSI EN300 744 ETSI and performance results show that the proposed algorithm has more efficient and stable operation than the conventional schemes.

• Journal of Positioning, Navigation, and Timing
• /
• v.13 no.3
• /
• pp.355-363
• /
• 2024

Time synchronization is crucial for ensuring the reliable operation of modern economic and social infrastructures. Techniques such as Global Navigation Satellite System (GNSS)-based methods and Two-Way Satellite Time and Frequency Transfer (TWSTFT) play key roles in precise time comparison and synchronization. TWSTFT, in particular, is recognized for its ability to achieve sub-nanosecond accuracy in time transfer, making it indispensable in fields such as satellite navigation. This paper proposes a comprehensive performance evaluation method for TWSTFT modems, emphasizing pre-validation in controlled environments to mitigate operational challenges. Using the proposed evaluation method, the study presents the standard deviation of RTT according to C/N₀ and compares it with the datasheet of a commercial TWSTFT modem. Through this approach, the aim of this study is to enhance the reliability and accuracy of TWSTFT-based time synchronization across diverse applications.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.24 no.2
• /
• pp.183-189
• /
• 1987

The performance of frame synchronization can be represented by the values of three characteristic variables-average misframe interval, average syncloss detection time, average reframe time. In this paper, we have analyzed the performance of frame synchronization of the standardized 90Mb/s optical transmission system by Markov chain method, with the suggestion of an extended algorithm for performance improvement. Maximum average reframe time of 1.18 ms can be obtained by the suggested algorithm, which is compared with that of 2.28 ms for the existing algorithm.

• International journal of advanced smart convergence
• /
• v.9 no.1
• /
• pp.109-112
• /
• 2020

Many devices are connected on the internet to give functionalities for interconnected services. In 2020', The number of devices connected to the internet will be reached 5.8 billion. Moreover, many connected service provider such as Google and Amazon, suggests edge computing and mesh networks to cope with this situation which the many devices completely connected on their networks. This paper introduces the current state of the introduction of the wireless mesh network and edge cloud in order to efficiently manage a large number of nodes in the exploding Internet of Things (IoT) network and introduces the existing Network Time Protocol (NTP). On the basis of this, we propose a relatively accurate time synchronization method, especially in heterogeneous mesh networks. Using this NTP, multiple time coordinators can be placed in a mesh network to find the delay error using the average delay time and the delay time of the time coordinator. Therefore, accurate time can be synchronized when implementing IoT, remote metering, and real-time media streaming using IoT mesh network.

• The Journal of Natural Sciences
• /
• v.9 no.1
• /
• pp.75-81
• /
• 1997

The method of synchronization by feedbacking a signal of master system to a corresponding variable of slave system is applied to the Lorenz which is autonomous system. The two Lorenz systems are synchronized and the synchronization occurs when the consisting of the variable differences of the two systems generates infinite period of laminar phase. The characteristics of synchronization is analyzed in time series and phase spaces.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.3
• /
• pp.731-740
• /
• 2015

In the recent days, interests in machine-to-machine communication schemes in small-scale networks has been increasing with growing demands. TDMA(Time Division Multiple Access) can be used as a multiple access method in small-scale networks. However, time synchronization for TDMA is complicated or needs additional equipments. Such a large cost is not suitable for small-scale networks. We propose, BC-DESYNC, a efficient time synchronization for small-scale networks by extending DESYNC(DESYNChronization). DESYNC takes a long time to complete synchronization and doesn't guarantee the synchronization delay. BC-DESYNC uses CU(Central Unit) that performs a centralized control to achieve the 2-hop communication and guarantees the synchronization completion time by using Mimic firing and C-DESYNC scheme.

• KIPS Transactions on Computer and Communication Systems
• /
• v.8 no.8
• /
• pp.191-200
• /
• 2019

In an Ad-hoc network, a method of time synchronizing all the nodes in a network centering on one reference node can be used. A representative algorithm based on a reference node is Flooding Time Synchronization Protocol (FTSP). In the process of sending and receiving messages, predictable and unpredictable delays occur, which should be removed because it hinders accurate time synchronization. In multi-hop communications, hop delays occur when a packet traverses a number of hops. These hop delays significantly degrade the synchronization performance among nodes. Therefore, we need to find a method to reduce these hop delays and increase synchronization performance. In the FTSP scheme, hop delays can be greatly increased depending on the position of a reference node. In addition, in FTSP, a node with the smallest node ID is elected as a reference node, hence, the position of a reference node is actually arbitrarily determined. In this paper, we propose an optimal reference node election algorithm to reduce hop delays, and compare the performance of the proposed scheme with FTSP using the network simulator OPNET. In addition, we verify that the proposed scheme has an improved synchronization performance, which is robust to topology changes.

• Journal of Korea Multimedia Society
• /
• v.12 no.5
• /
• pp.653-663
• /
• 2009

Synchronization between media is an important aspect in the design of multimedia communication-system. This paper proposes a precise media synchronization mechanism for video and audio transport over IP networks. To support synchronization between video and audio bitstreams transported over IP networks, RTP/RTCP protocol suite is usually employed. To provide a precise mechanism for media synchronization between video and audio, we suggest an efficient media synchronization algorithm based on NPT (Normal Play Time) which can be derivable from the timestamp information in the header part of RTP packet generated for the transport of video and audio. In the proposed method, we do not need to send and process any RTCP SR (sender report) packet which is required for conventional media synchronization scheme, and accordingly could reduce the number of required UDP ports and the amount of control traffic injected into the network.

• Journal of Institute of Control, Robotics and Systems
• /
• v.22 no.12
• /
• pp.1027-1033
• /
• 2016

There is an increasing need for manufacturing systems to produce batches in small quantities. Such manufacturing systems are significantly difficult to develop with conventional automation equipment. Recently, several research groups have applied industrial dual-arm robots to cell production lines. A synchronization method for robots is necessary for the cell production process when robots work in a shared workspace. Conventional automation factories do not need this method because the main control system operates all of the machines or robots. However, our intended application for the developed robot is in small manufacturing environments that cannot install an expensive main control system. We propose an inexpensive and high-performance method with a simple digital in/out channel using a real-time communication protocol. The developed method was validated in a pilot production line for cellular phone packing.

• Proceedings of the IEEK Conference
• /
• 2000.07b
• /
• pp.715-718
• /
• 2000

Although shared memory parallel programs are designed to be deterministic both in their final results and intermediate states, the races that occur when different processes access a common memory location in an order not guaranteed by synchronization could result in unintended non-deterministic executions of the program. So, Detecting races, particularly first data races, is important for debugging explicit shared memory parallel programs. It is possible that all data races reported by other on-the-fly algorithms would disappear once the first races were removed. To detect races parallel programs with nested loops and inter-thread coordination, it must guarantee the order of synchronization operations in an execution instance. In this paper, we propose an improved restructuring method that guarantee ordering execution instance and preserve the semantics of original program. This method requires O(np) time and (s + up) space, where n is the number of total operations, s is the number of synchronization operations and p is the number of parallelism in the execution. Also, this method makes on-the-fly detection of parallel program with nested loops and inter-thread coordination more easily in space and time complexity.