• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.10
• /
• pp.43-48
• /
• 2010

In general, in order to reduce an initial cell searching time, W-CDMA systems adopt a three-step cell search scheme: slot synchronization, frame synchronization, and primary scrambling code identification. We consider the second step (frame synchronization), in which a coherent detection using P-SCH (primary synchronization channel) is possible. In this paper, we propose a new coherent detection scheme, where a first order recursive filter is used to enhance channel estimation performance. Computer simulation results indicate that the detection performance of the proposed scheme can be robust over large range of frequency offset.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.1 no.2
• /
• pp.145-158
• /
• 1997

Method for synchronizing multimedia data is needed to support continuous transmission of multimedia data through a network in a bounded time and it also required for supporting continuous presentation of multimedia data with the required norminal playout rate in distributed network environments. This paper describes a new synchronization method for supporting delay-sensitive multimedia Presentation without degration of Quality of services of multimedia application. It mainly aims to support both intermedia and intermedia synchronization by absorbing network variations which may cause skew or jitter. In order to remove asynchonization problems, we make use of logical time system, dynamic buffer control method, and adjusting synchronization intervals based on the quality of services of a multimedia. It might be more suitable for working on distribute[1 multimedia systems where the network delay variation is changed from time to time and no global clock is supported. And it also can effectively reduce the amount of buffer requirements needed for transfering multimedia data between source and destination system by adjusting synchronization intervals with acceptable packet delay limits and packet loss rates.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.18 no.9
• /
• pp.1386-1394
• /
• 1993

It has been very difficult and inefficient to implement data synchronization in the multimedia information systems until now, because most data synchronizations have been implemented by ad hoc methodologies. In this paper, we propose a new synchroniation methodology implemented by scheduling using monitor. If users definece the temporal relationships of media data using high level user interface, then the monitor selects media data started at that time and controls setup time and precessing time. The scheduler determines the scheduling method or selected media data and adjusts the synchronization among them.

• 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.

• 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.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.9
• /
• pp.2208-2220
• /
• 1997

This paper presents a distributed multimedia synchronization algorithm that supports both intramedia and intermedia synchronizations. The intramedia synchronization is achieved by media scaling techniques, and the intermedia synchronization is achieved by variable service rates. We compute the check period between master media's and slave media's relative time stamps for intermedia synchronization. We also evaluate our algorithm through simulations. Simulation results show that our algorithm performs well in both intramedia and intermedia synchronizations.

• Proceedings of the IEEK Conference
• /
• 2002.07a
• /
• pp.413-416
• /
• 2002

On the TDD system, the uplink and downlink transmission share the same frequency but are seperated in time. In this paper we just consider the uplink transmission. The BWA system in this paper should be accepted the adaptive modulation. Each uplink burst shall begin with an uplink preamble. The reception of an uplink burst is the most challenging from a synchronization perspective. The burst detection, power estimation, symbol synchronization and carrier synchronization should be obtained from the preamble. It will be shown in this paper, how can get a burst detection by preambles and extract the synchronization parameter from preamble.

• Proceedings of the IEEK Conference
• /
• 2001.09a
• /
• pp.591-594
• /
• 2001

In the W-CDMA system, cell search is one of the imporant functions of the mobile station searching for a cell and achieving spreading code and time synchronization to its downlink scrembling code. For the methods of cell search to optimize codes, three stages are considered: 1) slot synchronization, 2) frame synchronization, and 3) scrambling code identification. Channels for cell search are Primary Synchronization Channel (P-SCH), Secondary Synchronization Channel(S-SCH), and Common Pilot Channel (CPICH). In this paper, cell search is analyzed based on simulation. Rake receiver provides improvement of Performance as an increase of bandwidth because there are more available multipaths. In this paper, the performance of W-CDMA system employing RAKE receiver is evaluated by computer simulation over the types of ITU_R wideband channel model and spreading rate. The result shows that the performance of CDMA adapting RAKE receiver is improved by the increase of multipath components in equal level of the received power.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.5
• /
• pp.31-43
• /
• 1996

In this paper, we analyze the delay characteristics of the multimdedia traffic in B-ISDN, and propose a weighted variable-size window estimator considering the QoS characteristics of the media and the variable delay characteristics of the networks, and present a delay estimator-based synchronization protocol for the efficient synchronization in ATM-based B-ISDN. The proposed estimator assigns a high weight value to recent cells arrived in the receiver, and suitably adjusts window size in order to efficiently adapt to delay variation by the prameter to detect the delay variation of the networks. The proposed synchronization protocol estimates end-to-end delay by the weighted variable-size window estimator, and dynamically schedules th evirtual channel of the transmitter to playout multimedia data on time in the receiver. Also, we evaluate the performance of the delay estimator, which is the most importnat functional element in our proposed synchronization protocol, by the simulation and analyze the results of the simulation.

• 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.