CA2331913C - Base station transceiver to radio network controller synchronization filtering function - Google Patents
Base station transceiver to radio network controller synchronization filtering function Download PDFInfo
- Publication number
- CA2331913C CA2331913C CA002331913A CA2331913A CA2331913C CA 2331913 C CA2331913 C CA 2331913C CA 002331913 A CA002331913 A CA 002331913A CA 2331913 A CA2331913 A CA 2331913A CA 2331913 C CA2331913 C CA 2331913C
- Authority
- CA
- Canada
- Prior art keywords
- delay
- clock
- transmission delay
- calculated transmission
- time
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Expired - Fee Related
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04B—TRANSMISSION
- H04B7/00—Radio transmission systems, i.e. using radiation field
- H04B7/24—Radio transmission systems, i.e. using radiation field for communication between two or more posts
- H04B7/26—Radio transmission systems, i.e. using radiation field for communication between two or more posts at least one of which is mobile
- H04B7/2662—Arrangements for Wireless System Synchronisation
- H04B7/2671—Arrangements for Wireless Time-Division Multiple Access [TDMA] System Synchronisation
- H04B7/2678—Time synchronisation
- H04B7/2687—Inter base stations synchronisation
- H04B7/269—Master/slave synchronisation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04J—MULTIPLEX COMMUNICATION
- H04J3/00—Time-division multiplex systems
- H04J3/02—Details
- H04J3/06—Synchronising arrangements
- H04J3/0635—Clock or time synchronisation in a network
- H04J3/0638—Clock or time synchronisation among nodes; Internode synchronisation
- H04J3/0658—Clock or time synchronisation among packet nodes
- H04J3/0661—Clock or time synchronisation among packet nodes using timestamps
- H04J3/0667—Bidirectional timestamps, e.g. NTP or PTP for compensation of clock drift and for compensation of propagation delays
Abstract
A method that initiates several time synchronization passes between clock slave components and a clock master component in a wireless telecommunications system is provided. For every pass, each clock slave component generates and transmits a first timing cell to the clock master. The first timing cell contains a transmission time based on the clock slave component's clock. Upon receipt of the first timing cell, the clock master generates and transmits to the clock slave component a second timing cell containing the time the clock master received the first timing cell and the time the master transmitted the second timing cell. Upon receipt of the second timing cell, the clock slave component will obtain its reception time and calculate a transmission delay based on the reception time and the timing information contained in the timing cells. Each clock slave component utilizes a filtering function to drop information from a synchronization pass that may have undesirable data due to processing and other delays. The filtering function will also restart the synchronization process whenever a calculated transmission delay is smaller than the best delay. This allows the process to accurately hone in on the proper delay experienced between each clock slave component and the clock master. After timing information from a predetermined number of time synchronization passes has been obtained, each clock slave component uses an average transmission delay to synchronize its time to the clock master time.
Description
Stichter 3 BASE STATION TRANSCEIVER TO RADIO NETWORK CONTROLLER
SYNCHRONIZATION FILTERING FUNCTION
Field Of The Invention The present invention relates generally to the field of telecommunications and, more particularly, to an accurate time ~~ nchronization method having a filtering function for a wireless telecommunications system.
Description Of The Related Art Fig. 1 illustrates a schematic diagram of a portion of a typical wireless telecommunications system 100. The system 100 provides wireless communication service to a number of wireless terminals 101-1, 101-2, 101-3 that are situated within a graphical region. The heart of a typical wireless telecommunications system 100 is the Radio Network Controller (lRIVC) 120, which may also be known as a Mobile Switching Center (MSC) or Mobile Telephone Switching Oflice (MTSO). Typically, the RNC
120 is connected to a plurality of base station transceivers 103-I, 103-2, 103-3, 103-4, 103-5 that are dispersed throughout the geographic area serviced by the system 100 and to local-offices (L.O.) 130, 138 and toll offices (T.O.) 140. The IRNC 120 is responsible for, among other things, establishing and maintaining calls between wireless terminals and between a wireless terminal and a wireline terminal 150, which is connected to the system through local and/or long distance networks.
'?0 The geographic area serviced by the system 100 is partitioned into a number of spatially distinct areas called "cells." In Fig. 1 each cell is schematically represented by a hexagon; in practice, however, each cell usually has an irregular shape that depends on the topology of the terrain serviced by the system 100. Typically, each cell contains a base station transceiver (BTS), such as for example BTS 103-I, which includes the radios and antennas that the BTS uses to communicate with the wireless terminals in that cell and also comprises the transmission equipment that the BTS uses to communicate with the 1ZNC 120 Stichter 3 2 For example, when wireless terminal 101-1 desires to communicate with wireless terminal 101-2, wireless terminal 101-1 transmits the desired information to base station transceiver 103-1, which relays the information to RNC 120. Upon receipt of the information, and with the knowledge that the information is intended for wireless terminal 101-2, the ItNC 120 returns the information back to base station transceiver 103-l, which relays the information tc ~he wireless terminal 101-2.
Often times, telecommunications systems, such as the system 100 illustrated in Fig. 1, schedule events that are to take place at specified times. This means that each BTS 103-l, 103-2, 103-3, 103-4, 103-5 within the system 100 must have their time synchronized to each other and to the time of the ItNC 120. This is a problem because the components of the system 100, with the exception of the clock master (typically the IZNC 120 or an external component connected to the R1VC 120), do not know what the actual system time is and, more importantly, they do not know the time of the other components within the system 100. Thus, in order for each component to have the same time as each other and the clock master, a time synchronization method is typically executed when the components of the system 100 are powered-on or reset.
Current time synchronization techniques usually involve distributing a time reference throughout the system via a time synchronization message. Typically, each component in the telecommunications system has a clock that ticks, but the ticks do not '?0 correlate to a system time without a clock base. The components within the system store this time reference and begin to use it as a clock base. If all of the components use the same base and their clocks all operate at the same rate, the components should have their time synchronized to each other.
This type of time synchronization technique is not without its shortcomings For '?5 example, this technique does not account for delays that arise between the time the reference time was created by the clock master and the time the other components (i a , clock slaves) within the system receive the time reference. Thus, the clock slave components wilt have a base time that differs from the master clock time. The difference between the component time and the master clock time is known in the art as BO a time error. It is desirable to keep the time error to a minimum to prevent errors within Stichter 3 3 the system. In addition, there is usually a system specification requiring that the time error be kept to a minimum to guarantee customer satisfaction. Often times, however, this time error is very large because of processing delays experienced by the clock master or transmission delays. Moreover, the transmission delays experienced by each component may vary, which means that each component will have a different time error causing additional problems within th~ ~ystein. Accordingly, there is a need and desire for a method of accurately synchronizing the time between the components of a wireless telecommunications system.
Summary Of The Invention The present invention provides a method of accurately synchronizing the time between the components of a wireless telecommunications system.
The present invention also provides a method of accurately synchronizing the time between the components of a wireless telecommunications system that also filters out undesirable synchronization data.
1.5 The above and other features and advantages of the invention are achieved by initiating several time synchronization passes between clock slave components and a clock master component in a wireless telecommunications system. For every pass, each clock slave component generates and transmits a first timing cell to the clock master The first timing cell contains a transmission time based on the clock slave component's '?0 clock. Upon receipt of the first timing cell, the clock master generates and transmits to the clock slave component a second timing cell containing the time the clock master received the first timing cell and the time the master transmitted the second timing cell Upon receipt of the second timing cell, the clock slave component will obtain its reception time and calculate a transmission delay based on the reception time and the '?5 timing information contained in the timing cells. Each clock slave component utilizes a sliding window filtering function to drop information from a synchronization pass that may have undesirable data due to processing and other delays. The filtering function will also restart the synchronization process whenever a calculated transmission delay is smaller than the best transmission delay. This allows the process to accurately hone in Stichter 3 4 on the proper delay experienced between each clock slave component and the clock master. After timing information from a predetermined number of time synchronization passes has been obtained, each clock slave component uses an average transmission delay to synchronize its time to the clock master time.
Brief Description Of The Drawings The foregoing and other advantages and features of the invention will become more apparent from the detailed description of the preferred embodiments of the invention given below with reference to the accompanying drawings in which:
Fig. 1 is a schematic diagram illustrating a conventional wireless telecommunications system;
Fig. 2 is a block diagram illustrating an exemplary base station used in the wireless telecommunications system of the present invention;
Figs. 3a-3c illustrate in Ilow chart form an exemplary method of synchronizing the time between the components of a wireless telecommunications system that utilizes a filtering function in accordance with the present invention; and Fig. 4 illustrates the message transmission and timing information used by the method illustrated in Fig. 3.
Detailed Descriution Of Preferred Embodiments Another way to perform time synchronization would be to accumulate timing ?0 data samples from several time synchronization communications between the system clock master and the other components within the system (i.e., the clock slave components). Each data sample should represent a transmission delay experienced by the clock master and a slave component during the communication with each other. For example, when the clock master sends a message to a clock slave, the message is not '?5 received by the slave until after a transmission delay. Ifthe delay where known, than the delay could be added to the transmitted clock master time to calculate the current clock master time. This would improve the accuracy of the time synchronization process. The transmission delay may vary from communication to communication.
Thus, to get a better judge of the typical transmission delay experienced between the clock master and a clock slave, several samples are used and an average transmission delay is calculated. Each slave component then uses its computed average delay as a time offset during a final synchronization step which synchronizes its clock time to the master clock time. Once synchronized the clock master and the clock slave components should all have the same system time plus or minus the timing error.
Although the timing error should be smaller than the timing errors of other synchronization techniques, this scheme will also be effected by processing delays. Large processing delays or other errors can cause bad timing data to be used in the average transmission delay calculations. The bad data samples will corrupt the calculated transmission delay and cause an improper offset to be applied in the final synchronization step. Accordingly, there is a desire and need for a method of accurately synchronizing the time between the components of a wireless telecommunications system that also filters out undesirable synchronization data.
The present invention is implemented in software and is to be executed primarily within each base station transceiver of a Code Division Multiple Access (CDMA) system, such as the system 100 illustrated in Fig. 1. It is desirable that the CDMA
system utilize an asynchronous transfer mode (ATM) network protocol or like communications protocol so that timing information can be transmitted between the RNC and base station transceivers.
Using an ATM network protocol or like communications protocol allows clock information to be transmitted with each ATM message. In addition, each clock within the system operates at the same rate. Once the various clocks are synchronized by the present invention, all of the system components will have the same time plus or minus a minor timing error.
The present invention is designed to reduce the timing error to about four hundred microseconds. For example purposes only, the RNC will be used as the clock master and the base station transceivers (BTSs) will be used as the clock slave components.
Fig. 2 illustrates an exemplary BTS. The BTS includes at least one controller 150, memory circuit 152, antenna 154, radio module 156 and a clock 158 connected in Stichter 3 6 the conventional manner. It should be appreciated that a BTS may contain numerous controllers, but only one controller 150 is illustrated. The controller 150 is preferably a programmed microprocessor. Although Fig. 2 illustrates the controller 150 as a microprocessor (i.e., "gyp"), the controller 150 may be a digital signal processor or an application specific integrated circuit (ASIC). It is desirable that the controller 150 is a digital signal processor capable of bei: ~ programmed to execute the method 200 (Figs.
3a-3c) of the present invention. Similarly, the BTS may contain a controller 150 that includes an internal clock as opposed to the clock 158 illustrated in Fig. 2.
Moreover, the exact architecture of the BTS is not important as along as it can implement the method of the present invention (discussed below). The radio module 156 contains a plurality of radios 156-1, 156-2 . 156-n. As known in the art, the controller 150 is coupled to the memory 152, radio module 156 and clock 158. The controller 150 is also in communication with the RNC. As is also known in the art, the controller 150 controls and coordinates the operations of the BTS including, but not limited to, the call 1.5 processing and power control functions while also communicating with the RNC With the provision of some additional software, the controller 150 will also implement the method 200 of the present invention (described below with reference to Figs.
3a-3c).
Figs. 3a-3c illustrate an exemplary method 200 of synchronizing the time between the components of a wireless telecommunications system. As will be described below, the method 200 utilizes a sliding window filtering function to remove undesirable data caused by large processing delays or other errors. Removing the undesirable data prevents the synchronization process from being corrupted by the processing delays or other errors. Keeping with our example that the RNC is the clock master and each BTS in the system is a clock slave, the method 200 will be run on each '?5 BTS in the system (with the exception of steps 210 to 218, which are run by the RNC).
Initially, the method 200 begins when the BTS initializes any variables needed during the method 200 (step 202). In addition, the BTS will initialize a loop counter N, which will be used to determine the number of time synchronization iterations that have been performed. It is desirable to perform several time synchronization iterations to :U> obtain a good estimate of the actual transmission delays between the BTS
and R.NC
Stichter 3 7 Although any number of iterations can be used, the inventor has determined that approximately twenty iterations is sufficient to properly synchronize the time in the system. Thus, a maximum number of iterations counter N MAX is used and should be set to twenty. It should be appreciated that the number of iterations could be dynamic .5 and based on other conditions if so desired.
The number of iterations also indicates the number of data samples collected and is subsequently used to calculate the average transmission delay experienced by the BTS when it communicates with the RNC. The BTS will also generate a temporary clock that will be used as an initial time reference until the BTS has synchronized its time to the time of the RNC (i.e., the clock master). The generation of a temporary clock can usually be implemented in software and the exact manner in which it is performed will depend upon the software used to implement the method 200 It should be apparent that the exact manner in which the temporary clock is generated and maintained is not important and is application specific.
At step 204, the BTS reads its clock to obtain a transmission time for a first timing cell (also referred to herein as "TIMING CELL # 1") that is to be transmitted to the RNC. Referring to Fig. 4, it can be seen that the BTS will transmit TIMING
CELL
# 1 to the RNC at time SF BTS 1. The transmission time SF BTS 1 will be included in TIMING CELL # 1. T)IvvIING CELL # 1 is then received by the RNC (clock master) '?0 at time SF MCC_l, which is a time generated by the RNC clock (clock master clock) Note that there is a first transmission delay TI from the time TIMING CELL # 1 is transmitted by the BTS to the time it is received by the RNC. It should be noted that at this point, the RNC clock and the BTS clock are not synchronized. After a minor processing delay Td, the RNC generates and transmits a second timing cell (also '?5 referred to herein as "TIMING CELL # 2") at time SF MCC 2, which is also generated by the RNC clock. TIMING CELL # 2 will contain the SF MCC 1 and SF MCC 2 as well as the SF BTS-1. TIMING CELL # 2 is received by the BTS at SF BTS-?, a time generated by the BTS temporary clock, after a second transmission delay T~ .-~s will be described below, after several communications between the BTS and the RvC
30 (referred to herein as "passes") all of this time information (SF BTS-1, SF_MCC-1.
Stichter 3 8 SF MCC 2 and SF BTS 2) is used by the BTS to calculate an average communication delay between the BTS and the RNC. The average delay is subsequently used by the BTS to synchronize its temporary clock to the RNC clock (master clock).
Referring to Figs. 3a-3c and Fig. 4, once the transmission time SF BTS 1 is obtained in step 204, the BTS generates TI~'~IING CELL # 1 (step 206). As noted earlier, TIMING CELL # 1 will contain the transmission time SF BTS 1 obtained in step 204. At step 208, the BTS transmits TIMING CELL # 1 to the RNC.
The following steps are performed by the RNC (clock master), which is programmed to receive TIMING CELL # 1 (step 210), format TIMING CELL # 2 lU (steps 212-216) and transmit TIMING CELL. # 2 to the BTS (step 218). Thus, at step 210, the RNC receives TIMING CELL # 1. At step 212, the RNC obtains a reception time SF MCC-1 of TIMING CELL # 1. The reception time SF MCC_1 is a time generated by the RNC clock. At step 214, the RNC obtains a transmission time SF MCC 2 for TIMING CELL # 2. This transmission time SF MCC 2 is also generated using the RNC clock. At step 216 the RNC generates the second timing cell TIMING CELL # 2. TIMING CELL # 2 will contain the transmission and reception times SF BTS 1 and SF MCC 1 of TIMING CELL # 1 and the transmission time SF MCC 2 of TIWNG CELL # 2. At step 218, the RNC transmits TIMING CELL #
SYNCHRONIZATION FILTERING FUNCTION
Field Of The Invention The present invention relates generally to the field of telecommunications and, more particularly, to an accurate time ~~ nchronization method having a filtering function for a wireless telecommunications system.
Description Of The Related Art Fig. 1 illustrates a schematic diagram of a portion of a typical wireless telecommunications system 100. The system 100 provides wireless communication service to a number of wireless terminals 101-1, 101-2, 101-3 that are situated within a graphical region. The heart of a typical wireless telecommunications system 100 is the Radio Network Controller (lRIVC) 120, which may also be known as a Mobile Switching Center (MSC) or Mobile Telephone Switching Oflice (MTSO). Typically, the RNC
120 is connected to a plurality of base station transceivers 103-I, 103-2, 103-3, 103-4, 103-5 that are dispersed throughout the geographic area serviced by the system 100 and to local-offices (L.O.) 130, 138 and toll offices (T.O.) 140. The IRNC 120 is responsible for, among other things, establishing and maintaining calls between wireless terminals and between a wireless terminal and a wireline terminal 150, which is connected to the system through local and/or long distance networks.
'?0 The geographic area serviced by the system 100 is partitioned into a number of spatially distinct areas called "cells." In Fig. 1 each cell is schematically represented by a hexagon; in practice, however, each cell usually has an irregular shape that depends on the topology of the terrain serviced by the system 100. Typically, each cell contains a base station transceiver (BTS), such as for example BTS 103-I, which includes the radios and antennas that the BTS uses to communicate with the wireless terminals in that cell and also comprises the transmission equipment that the BTS uses to communicate with the 1ZNC 120 Stichter 3 2 For example, when wireless terminal 101-1 desires to communicate with wireless terminal 101-2, wireless terminal 101-1 transmits the desired information to base station transceiver 103-1, which relays the information to RNC 120. Upon receipt of the information, and with the knowledge that the information is intended for wireless terminal 101-2, the ItNC 120 returns the information back to base station transceiver 103-l, which relays the information tc ~he wireless terminal 101-2.
Often times, telecommunications systems, such as the system 100 illustrated in Fig. 1, schedule events that are to take place at specified times. This means that each BTS 103-l, 103-2, 103-3, 103-4, 103-5 within the system 100 must have their time synchronized to each other and to the time of the ItNC 120. This is a problem because the components of the system 100, with the exception of the clock master (typically the IZNC 120 or an external component connected to the R1VC 120), do not know what the actual system time is and, more importantly, they do not know the time of the other components within the system 100. Thus, in order for each component to have the same time as each other and the clock master, a time synchronization method is typically executed when the components of the system 100 are powered-on or reset.
Current time synchronization techniques usually involve distributing a time reference throughout the system via a time synchronization message. Typically, each component in the telecommunications system has a clock that ticks, but the ticks do not '?0 correlate to a system time without a clock base. The components within the system store this time reference and begin to use it as a clock base. If all of the components use the same base and their clocks all operate at the same rate, the components should have their time synchronized to each other.
This type of time synchronization technique is not without its shortcomings For '?5 example, this technique does not account for delays that arise between the time the reference time was created by the clock master and the time the other components (i a , clock slaves) within the system receive the time reference. Thus, the clock slave components wilt have a base time that differs from the master clock time. The difference between the component time and the master clock time is known in the art as BO a time error. It is desirable to keep the time error to a minimum to prevent errors within Stichter 3 3 the system. In addition, there is usually a system specification requiring that the time error be kept to a minimum to guarantee customer satisfaction. Often times, however, this time error is very large because of processing delays experienced by the clock master or transmission delays. Moreover, the transmission delays experienced by each component may vary, which means that each component will have a different time error causing additional problems within th~ ~ystein. Accordingly, there is a need and desire for a method of accurately synchronizing the time between the components of a wireless telecommunications system.
Summary Of The Invention The present invention provides a method of accurately synchronizing the time between the components of a wireless telecommunications system.
The present invention also provides a method of accurately synchronizing the time between the components of a wireless telecommunications system that also filters out undesirable synchronization data.
1.5 The above and other features and advantages of the invention are achieved by initiating several time synchronization passes between clock slave components and a clock master component in a wireless telecommunications system. For every pass, each clock slave component generates and transmits a first timing cell to the clock master The first timing cell contains a transmission time based on the clock slave component's '?0 clock. Upon receipt of the first timing cell, the clock master generates and transmits to the clock slave component a second timing cell containing the time the clock master received the first timing cell and the time the master transmitted the second timing cell Upon receipt of the second timing cell, the clock slave component will obtain its reception time and calculate a transmission delay based on the reception time and the '?5 timing information contained in the timing cells. Each clock slave component utilizes a sliding window filtering function to drop information from a synchronization pass that may have undesirable data due to processing and other delays. The filtering function will also restart the synchronization process whenever a calculated transmission delay is smaller than the best transmission delay. This allows the process to accurately hone in Stichter 3 4 on the proper delay experienced between each clock slave component and the clock master. After timing information from a predetermined number of time synchronization passes has been obtained, each clock slave component uses an average transmission delay to synchronize its time to the clock master time.
Brief Description Of The Drawings The foregoing and other advantages and features of the invention will become more apparent from the detailed description of the preferred embodiments of the invention given below with reference to the accompanying drawings in which:
Fig. 1 is a schematic diagram illustrating a conventional wireless telecommunications system;
Fig. 2 is a block diagram illustrating an exemplary base station used in the wireless telecommunications system of the present invention;
Figs. 3a-3c illustrate in Ilow chart form an exemplary method of synchronizing the time between the components of a wireless telecommunications system that utilizes a filtering function in accordance with the present invention; and Fig. 4 illustrates the message transmission and timing information used by the method illustrated in Fig. 3.
Detailed Descriution Of Preferred Embodiments Another way to perform time synchronization would be to accumulate timing ?0 data samples from several time synchronization communications between the system clock master and the other components within the system (i.e., the clock slave components). Each data sample should represent a transmission delay experienced by the clock master and a slave component during the communication with each other. For example, when the clock master sends a message to a clock slave, the message is not '?5 received by the slave until after a transmission delay. Ifthe delay where known, than the delay could be added to the transmitted clock master time to calculate the current clock master time. This would improve the accuracy of the time synchronization process. The transmission delay may vary from communication to communication.
Thus, to get a better judge of the typical transmission delay experienced between the clock master and a clock slave, several samples are used and an average transmission delay is calculated. Each slave component then uses its computed average delay as a time offset during a final synchronization step which synchronizes its clock time to the master clock time. Once synchronized the clock master and the clock slave components should all have the same system time plus or minus the timing error.
Although the timing error should be smaller than the timing errors of other synchronization techniques, this scheme will also be effected by processing delays. Large processing delays or other errors can cause bad timing data to be used in the average transmission delay calculations. The bad data samples will corrupt the calculated transmission delay and cause an improper offset to be applied in the final synchronization step. Accordingly, there is a desire and need for a method of accurately synchronizing the time between the components of a wireless telecommunications system that also filters out undesirable synchronization data.
The present invention is implemented in software and is to be executed primarily within each base station transceiver of a Code Division Multiple Access (CDMA) system, such as the system 100 illustrated in Fig. 1. It is desirable that the CDMA
system utilize an asynchronous transfer mode (ATM) network protocol or like communications protocol so that timing information can be transmitted between the RNC and base station transceivers.
Using an ATM network protocol or like communications protocol allows clock information to be transmitted with each ATM message. In addition, each clock within the system operates at the same rate. Once the various clocks are synchronized by the present invention, all of the system components will have the same time plus or minus a minor timing error.
The present invention is designed to reduce the timing error to about four hundred microseconds. For example purposes only, the RNC will be used as the clock master and the base station transceivers (BTSs) will be used as the clock slave components.
Fig. 2 illustrates an exemplary BTS. The BTS includes at least one controller 150, memory circuit 152, antenna 154, radio module 156 and a clock 158 connected in Stichter 3 6 the conventional manner. It should be appreciated that a BTS may contain numerous controllers, but only one controller 150 is illustrated. The controller 150 is preferably a programmed microprocessor. Although Fig. 2 illustrates the controller 150 as a microprocessor (i.e., "gyp"), the controller 150 may be a digital signal processor or an application specific integrated circuit (ASIC). It is desirable that the controller 150 is a digital signal processor capable of bei: ~ programmed to execute the method 200 (Figs.
3a-3c) of the present invention. Similarly, the BTS may contain a controller 150 that includes an internal clock as opposed to the clock 158 illustrated in Fig. 2.
Moreover, the exact architecture of the BTS is not important as along as it can implement the method of the present invention (discussed below). The radio module 156 contains a plurality of radios 156-1, 156-2 . 156-n. As known in the art, the controller 150 is coupled to the memory 152, radio module 156 and clock 158. The controller 150 is also in communication with the RNC. As is also known in the art, the controller 150 controls and coordinates the operations of the BTS including, but not limited to, the call 1.5 processing and power control functions while also communicating with the RNC With the provision of some additional software, the controller 150 will also implement the method 200 of the present invention (described below with reference to Figs.
3a-3c).
Figs. 3a-3c illustrate an exemplary method 200 of synchronizing the time between the components of a wireless telecommunications system. As will be described below, the method 200 utilizes a sliding window filtering function to remove undesirable data caused by large processing delays or other errors. Removing the undesirable data prevents the synchronization process from being corrupted by the processing delays or other errors. Keeping with our example that the RNC is the clock master and each BTS in the system is a clock slave, the method 200 will be run on each '?5 BTS in the system (with the exception of steps 210 to 218, which are run by the RNC).
Initially, the method 200 begins when the BTS initializes any variables needed during the method 200 (step 202). In addition, the BTS will initialize a loop counter N, which will be used to determine the number of time synchronization iterations that have been performed. It is desirable to perform several time synchronization iterations to :U> obtain a good estimate of the actual transmission delays between the BTS
and R.NC
Stichter 3 7 Although any number of iterations can be used, the inventor has determined that approximately twenty iterations is sufficient to properly synchronize the time in the system. Thus, a maximum number of iterations counter N MAX is used and should be set to twenty. It should be appreciated that the number of iterations could be dynamic .5 and based on other conditions if so desired.
The number of iterations also indicates the number of data samples collected and is subsequently used to calculate the average transmission delay experienced by the BTS when it communicates with the RNC. The BTS will also generate a temporary clock that will be used as an initial time reference until the BTS has synchronized its time to the time of the RNC (i.e., the clock master). The generation of a temporary clock can usually be implemented in software and the exact manner in which it is performed will depend upon the software used to implement the method 200 It should be apparent that the exact manner in which the temporary clock is generated and maintained is not important and is application specific.
At step 204, the BTS reads its clock to obtain a transmission time for a first timing cell (also referred to herein as "TIMING CELL # 1") that is to be transmitted to the RNC. Referring to Fig. 4, it can be seen that the BTS will transmit TIMING
CELL
# 1 to the RNC at time SF BTS 1. The transmission time SF BTS 1 will be included in TIMING CELL # 1. T)IvvIING CELL # 1 is then received by the RNC (clock master) '?0 at time SF MCC_l, which is a time generated by the RNC clock (clock master clock) Note that there is a first transmission delay TI from the time TIMING CELL # 1 is transmitted by the BTS to the time it is received by the RNC. It should be noted that at this point, the RNC clock and the BTS clock are not synchronized. After a minor processing delay Td, the RNC generates and transmits a second timing cell (also '?5 referred to herein as "TIMING CELL # 2") at time SF MCC 2, which is also generated by the RNC clock. TIMING CELL # 2 will contain the SF MCC 1 and SF MCC 2 as well as the SF BTS-1. TIMING CELL # 2 is received by the BTS at SF BTS-?, a time generated by the BTS temporary clock, after a second transmission delay T~ .-~s will be described below, after several communications between the BTS and the RvC
30 (referred to herein as "passes") all of this time information (SF BTS-1, SF_MCC-1.
Stichter 3 8 SF MCC 2 and SF BTS 2) is used by the BTS to calculate an average communication delay between the BTS and the RNC. The average delay is subsequently used by the BTS to synchronize its temporary clock to the RNC clock (master clock).
Referring to Figs. 3a-3c and Fig. 4, once the transmission time SF BTS 1 is obtained in step 204, the BTS generates TI~'~IING CELL # 1 (step 206). As noted earlier, TIMING CELL # 1 will contain the transmission time SF BTS 1 obtained in step 204. At step 208, the BTS transmits TIMING CELL # 1 to the RNC.
The following steps are performed by the RNC (clock master), which is programmed to receive TIMING CELL # 1 (step 210), format TIMING CELL # 2 lU (steps 212-216) and transmit TIMING CELL. # 2 to the BTS (step 218). Thus, at step 210, the RNC receives TIMING CELL # 1. At step 212, the RNC obtains a reception time SF MCC-1 of TIMING CELL # 1. The reception time SF MCC_1 is a time generated by the RNC clock. At step 214, the RNC obtains a transmission time SF MCC 2 for TIMING CELL # 2. This transmission time SF MCC 2 is also generated using the RNC clock. At step 216 the RNC generates the second timing cell TIMING CELL # 2. TIMING CELL # 2 will contain the transmission and reception times SF BTS 1 and SF MCC 1 of TIMING CELL # 1 and the transmission time SF MCC 2 of TIWNG CELL # 2. At step 218, the RNC transmits TIMING CELL #
2 to the BTS.
?U The remaining steps of method 200 are performed by the BTS. At step 220, the BTS receives TIIVQNG CELL # 2. Using its temporary clock, the BTS obtains a reception time SF BTS 2 of TIMING CELL # 2 (step 222) and increments the iteration loop counter N (step 224). The BTS uses all of the timing information concerning the transmission and reception of the two timing cells to calculate the transmission delay T
'?.5 for the current communication between the BTS and RNC. The transmission delay T
can be calculated as follows:
( 1 ) T = (SF BTS 2 - SF BTS_ I - Td)/2, where Td is:
(2) Td = SF MCC 2 - SF MCC I
Stichter 3 9 Once the transmission delay T is calculated and stored (step 226), the method continues at step 228 where the first portion of the sliding window filtering function is executed. Why the filtering function is described as a sliding window will be described below. This portion of the filtering function attempts to determine if this transmission delay T is the "best" transmission delay BEST T obtained during the method 200 The term ''best" is used to indicate the sm~':est delay computed between the BTS
and RNC
during the current execution of the method 200. It is desirable that every time a new transmission delay T that is better than the BEST T is obtained, that the new transmission delay T be stored and used as the BEST T. It is also desirable for the 1() method 200 to reset the number of time synchronization iterations and any accumulated transmission delay to zero. This way, the method 200 will perform the predetermined number of time synchronization iterations as if no data samples have been performed.
This is desirable, since the transmission delay between the BTS and RNC
appears to be getting better and is now beginning to settle into the typical delay. Thus, any 15 information up to this point may not accurately reflect the typical transmission delay and should be discarded to prevent the time synchronization results from being corrupted.
If at step 228 it is determined that the transmission delay T is less than the best transmission delay BEST T, then the method continues at step 230 where the BTS
30 saves the transmission delay T as the best transmission delay BEST T. At step 230 the BTS wilt also reset the iteration loop counter N and any variables used during the method 200 (except for BEST T). After step 230 or if it is determined that the transmission delay T is not less than the best transmission delay BEST T, the method continues at step 232 where the second portion of the filtering function is performed.
?5 At step 232, the BTS determines the difference T DIFF between the transmission delay T and the best transmission delay BEST T. It is desirable to filter out any samples that have a large transmission delay T with respect to the best transmission delay BEST T. Filtering out the data samples that have a transmission delay T that is much larger than the best transmission delay BEST T helps eliminate data samples that are skewed by an unusually large processing delay, communication Stichter 3 10 error or other type of error. By removing these "bad" data samples, the method 200 can hone in on the typical transmission delay experienced between the BTS and RNC
which allows the final synchronization step to synchronize the BTS to the RNC master clock that is much more accurate then prior synchronization schemes.
Thus, at step 234 the BTS determin;,s if the calculated T D1FF is greater than the best transmission delay BEST T plus a maximum allowed delay difference MAX-DLFF. The actual value used for the maximum allowed delay difference MAX-DIFF is application specific and can vary from system to system. It should be apparent that every time the best transmission BEST T is updated (step 230), the filtering function performed at step 234 is updated as well. That is, every time the BEST T is reduced by a better transmission delay T, the best transmission delay BEST T plus maximum allowed difference MAX-DIFF computation is also reduced Thus, the window in which a transmission delay T must fall within to be kept as a good data sample slides to a new range every time the best transmission delay BEST
T is to updated. The upper range of the window being BEST T plus MAX_DIFF, the lower range being BEST T. The window slides and a new range is used when BEST_T is updated with a better transmission delay T. As such, the filtering function is a sliding window filtering function. In essence, the sliding window allows the method 200 to use the minimum transmission delays experienced by the BTS and RNC. Using a sliding ?0 window and the minimum transmission delays allows the method 200 to continuously use better data samples in the synchronization process, which allows the present invention to reduce the timing error (i.e., difference in time between the BTS
and RNC) to approximately 400 microseconds. A feat that prior synchronization schemes cannot achieve.
?5 If at step 234 it is determined that the calculated T DIFF is greater than the best transmission delay BEST T plus the maximum allowed delay difference MAX_DIFF, then the method 200 continues at step 236. At step 236 the BTS drops the time samples obtained during the current pass and decrements the iteration loop counter N
The loop counter N is decremented at step 236 since it was incremented at step 224 (when the :3c) time samples where obtained). Once the information is dropped and the counter ~ m Stichter 3 11 decremented, the method 200 continues at step 240, where it will determine if another iteration is required.
If, however, at step 234 it is determined that the calculated T DIFF is not greater than the best transmission delay BEST T plus the maximum allowed delay difference MAX-DIFF, then the method 2C~ continues at step 238 where the BTS
adds the transmission delay T to the accumulated transmission delay ACCUM T. The accumulated transmission delay ACCLTM_T will be used to determine the average transmission delay after all of the iterations are performed. Thus, at step 240, the BTS
determines if the iteration loop counter N is less than the predetermined maximum number of allowed iterations N MAX. If it is determined that the iteration loop counter N is less than N MAX, the method 200 continues at step 204 where another iteration is performed (as described above). If at step 240 it is determined that the iteration loop counter N is not less than N MAX, the method 200 continues at step 242 where the BTS calculates the average transmission delay T AVG. T AVG is computed as 1 ~~ follows:
?U The remaining steps of method 200 are performed by the BTS. At step 220, the BTS receives TIIVQNG CELL # 2. Using its temporary clock, the BTS obtains a reception time SF BTS 2 of TIMING CELL # 2 (step 222) and increments the iteration loop counter N (step 224). The BTS uses all of the timing information concerning the transmission and reception of the two timing cells to calculate the transmission delay T
'?.5 for the current communication between the BTS and RNC. The transmission delay T
can be calculated as follows:
( 1 ) T = (SF BTS 2 - SF BTS_ I - Td)/2, where Td is:
(2) Td = SF MCC 2 - SF MCC I
Stichter 3 9 Once the transmission delay T is calculated and stored (step 226), the method continues at step 228 where the first portion of the sliding window filtering function is executed. Why the filtering function is described as a sliding window will be described below. This portion of the filtering function attempts to determine if this transmission delay T is the "best" transmission delay BEST T obtained during the method 200 The term ''best" is used to indicate the sm~':est delay computed between the BTS
and RNC
during the current execution of the method 200. It is desirable that every time a new transmission delay T that is better than the BEST T is obtained, that the new transmission delay T be stored and used as the BEST T. It is also desirable for the 1() method 200 to reset the number of time synchronization iterations and any accumulated transmission delay to zero. This way, the method 200 will perform the predetermined number of time synchronization iterations as if no data samples have been performed.
This is desirable, since the transmission delay between the BTS and RNC
appears to be getting better and is now beginning to settle into the typical delay. Thus, any 15 information up to this point may not accurately reflect the typical transmission delay and should be discarded to prevent the time synchronization results from being corrupted.
If at step 228 it is determined that the transmission delay T is less than the best transmission delay BEST T, then the method continues at step 230 where the BTS
30 saves the transmission delay T as the best transmission delay BEST T. At step 230 the BTS wilt also reset the iteration loop counter N and any variables used during the method 200 (except for BEST T). After step 230 or if it is determined that the transmission delay T is not less than the best transmission delay BEST T, the method continues at step 232 where the second portion of the filtering function is performed.
?5 At step 232, the BTS determines the difference T DIFF between the transmission delay T and the best transmission delay BEST T. It is desirable to filter out any samples that have a large transmission delay T with respect to the best transmission delay BEST T. Filtering out the data samples that have a transmission delay T that is much larger than the best transmission delay BEST T helps eliminate data samples that are skewed by an unusually large processing delay, communication Stichter 3 10 error or other type of error. By removing these "bad" data samples, the method 200 can hone in on the typical transmission delay experienced between the BTS and RNC
which allows the final synchronization step to synchronize the BTS to the RNC master clock that is much more accurate then prior synchronization schemes.
Thus, at step 234 the BTS determin;,s if the calculated T D1FF is greater than the best transmission delay BEST T plus a maximum allowed delay difference MAX-DLFF. The actual value used for the maximum allowed delay difference MAX-DIFF is application specific and can vary from system to system. It should be apparent that every time the best transmission BEST T is updated (step 230), the filtering function performed at step 234 is updated as well. That is, every time the BEST T is reduced by a better transmission delay T, the best transmission delay BEST T plus maximum allowed difference MAX-DIFF computation is also reduced Thus, the window in which a transmission delay T must fall within to be kept as a good data sample slides to a new range every time the best transmission delay BEST
T is to updated. The upper range of the window being BEST T plus MAX_DIFF, the lower range being BEST T. The window slides and a new range is used when BEST_T is updated with a better transmission delay T. As such, the filtering function is a sliding window filtering function. In essence, the sliding window allows the method 200 to use the minimum transmission delays experienced by the BTS and RNC. Using a sliding ?0 window and the minimum transmission delays allows the method 200 to continuously use better data samples in the synchronization process, which allows the present invention to reduce the timing error (i.e., difference in time between the BTS
and RNC) to approximately 400 microseconds. A feat that prior synchronization schemes cannot achieve.
?5 If at step 234 it is determined that the calculated T DIFF is greater than the best transmission delay BEST T plus the maximum allowed delay difference MAX_DIFF, then the method 200 continues at step 236. At step 236 the BTS drops the time samples obtained during the current pass and decrements the iteration loop counter N
The loop counter N is decremented at step 236 since it was incremented at step 224 (when the :3c) time samples where obtained). Once the information is dropped and the counter ~ m Stichter 3 11 decremented, the method 200 continues at step 240, where it will determine if another iteration is required.
If, however, at step 234 it is determined that the calculated T DIFF is not greater than the best transmission delay BEST T plus the maximum allowed delay difference MAX-DIFF, then the method 2C~ continues at step 238 where the BTS
adds the transmission delay T to the accumulated transmission delay ACCUM T. The accumulated transmission delay ACCLTM_T will be used to determine the average transmission delay after all of the iterations are performed. Thus, at step 240, the BTS
determines if the iteration loop counter N is less than the predetermined maximum number of allowed iterations N MAX. If it is determined that the iteration loop counter N is less than N MAX, the method 200 continues at step 204 where another iteration is performed (as described above). If at step 240 it is determined that the iteration loop counter N is not less than N MAX, the method 200 continues at step 242 where the BTS calculates the average transmission delay T AVG. T AVG is computed as 1 ~~ follows:
3 ) T AVG = ACCUM TIN MAX.
At step 244, the average transmission delay T AVG is used to synchronize the BTS clock to the RNC clock. One way this can be done is to add the last transmission time SF MCC 2 of TIMING CELL # 2 to the average transmission delay T-AVG.
'?0 The result of this addition can be stored away and used as a clock base which is updated by the clock ticks obtained from the BTS clock. Since the clocks of every BTS
and the RNC operate at the same rate, once the clocks are synchronized, the clocks should remain synchronized.
Thus, the present invention incorporates a sliding window filtering function into ?5 a time synchronization process. Using the sliding window allows the present invention to throw out synchronization data that is not an accurate reflection of the typical transmission delay between the clock master and the clock slave components.
The present invention uses the average of the minimum transmission delays to hone in on the typical delay between the clock master and a slave component; by doing so, the Stichter 3 12 present invention is able to accurately determine the time on the clock master's clock.
By accurately determining the time on the clock master's clock, the present invention reduces timing errors to approximately four hundred microseconds, which is at least one order of magnitude better than prior synchronization techniques. Moreover, the present invention uses a running total of the transmission delays and an average of the accumulated delays. This allows the ~~Pthod of the present invention to operate in a fast and efficient manner. Since the method 200 is implemented in software, it may be ported to other wireless communications systems or to any system that requires an accurate distribution of time between components having synchronous clocks.
The method of the present invention is implemented in software and the software instructions and data can be stored in PROM, EEPROM or other non-volatile memory connected to or contained within the controller. The software used in the present invention can be stored on a hard drive, floppy disc, CD-ROM or other permanent or semi-permanent storage medium and subsequently transferred to the memory of the controller. The program embodying the method of the present invention can also be divided into program code segments, downloaded, for example, from a server computer or transmitted as a data signal embodied in a carrier wave to the controller as is known in the art.
While the invention has been described in detail in connection with the preferred '?0 embodiments known at the time, it should be readily understood that the invention is not limited to such disclosed embodiments. Rather, the invention can be modified to incorporate any number of variations, alterations, substitutions or equivalent arrangements not heretofore described, but which are commensurate with the spirit and scope of the invention. Accordingly, the invention is not to be seen as limited by the '?5 foregoing description, but is only limited by the scope of the appended claims.
What is claimed as new and desired to be protected by Letters Patent of the United States is:
At step 244, the average transmission delay T AVG is used to synchronize the BTS clock to the RNC clock. One way this can be done is to add the last transmission time SF MCC 2 of TIMING CELL # 2 to the average transmission delay T-AVG.
'?0 The result of this addition can be stored away and used as a clock base which is updated by the clock ticks obtained from the BTS clock. Since the clocks of every BTS
and the RNC operate at the same rate, once the clocks are synchronized, the clocks should remain synchronized.
Thus, the present invention incorporates a sliding window filtering function into ?5 a time synchronization process. Using the sliding window allows the present invention to throw out synchronization data that is not an accurate reflection of the typical transmission delay between the clock master and the clock slave components.
The present invention uses the average of the minimum transmission delays to hone in on the typical delay between the clock master and a slave component; by doing so, the Stichter 3 12 present invention is able to accurately determine the time on the clock master's clock.
By accurately determining the time on the clock master's clock, the present invention reduces timing errors to approximately four hundred microseconds, which is at least one order of magnitude better than prior synchronization techniques. Moreover, the present invention uses a running total of the transmission delays and an average of the accumulated delays. This allows the ~~Pthod of the present invention to operate in a fast and efficient manner. Since the method 200 is implemented in software, it may be ported to other wireless communications systems or to any system that requires an accurate distribution of time between components having synchronous clocks.
The method of the present invention is implemented in software and the software instructions and data can be stored in PROM, EEPROM or other non-volatile memory connected to or contained within the controller. The software used in the present invention can be stored on a hard drive, floppy disc, CD-ROM or other permanent or semi-permanent storage medium and subsequently transferred to the memory of the controller. The program embodying the method of the present invention can also be divided into program code segments, downloaded, for example, from a server computer or transmitted as a data signal embodied in a carrier wave to the controller as is known in the art.
While the invention has been described in detail in connection with the preferred '?0 embodiments known at the time, it should be readily understood that the invention is not limited to such disclosed embodiments. Rather, the invention can be modified to incorporate any number of variations, alterations, substitutions or equivalent arrangements not heretofore described, but which are commensurate with the spirit and scope of the invention. Accordingly, the invention is not to be seen as limited by the '?5 foregoing description, but is only limited by the scope of the appended claims.
What is claimed as new and desired to be protected by Letters Patent of the United States is:
Claims (22)
1. A method of performing time synchronization between a clock master having a first clock and a clock slave having a second clock, said method comprising the steps of:
sending a first message to the clock master, the first message comprising information indicating a first transmission time of the first message;
receiving a second message from the clock master, the second message comprising information indicating a first reception time of the first message and a second transmission time of the second message;
obtaining at the clock slave a second reception time of the second message;
calculating a transmission delay between the clock slave and clock master from the first and second reception times and the first and second transmission times;
determining if the calculated transmission delay is within a window of acceptable delays and updating an accumulated delay with the calculated transmission delay if the calculated transmission delay is within the window; and repeating said first message sending step through said determining step until a termination condition is met.
sending a first message to the clock master, the first message comprising information indicating a first transmission time of the first message;
receiving a second message from the clock master, the second message comprising information indicating a first reception time of the first message and a second transmission time of the second message;
obtaining at the clock slave a second reception time of the second message;
calculating a transmission delay between the clock slave and clock master from the first and second reception times and the first and second transmission times;
determining if the calculated transmission delay is within a window of acceptable delays and updating an accumulated delay with the calculated transmission delay if the calculated transmission delay is within the window; and repeating said first message sending step through said determining step until a termination condition is met.
2. The method of claim 1, further comprising synchronizing the second clock to the first clock using the accumulated delay.
3. The method of claim 2, wherein said synchronizing step comprises:
computing an average delay from the accumulated delay; and applying the average delay as an offset to a time of the second clock.
computing an average delay from the accumulated delay; and applying the average delay as an offset to a time of the second clock.
4. The method of claim 3, wherein said average delay is computed by dividing the accumulated delay by a maximum number of times said first message sending step through said determining step are to be repeated.
5. The method of claim 1, wherein said method calculates a number of times said method executes said first message sending step through said determining step and terminates after said number of times equals a predefined number of times.
6. The method of claim 5, wherein said predefined number of times is twenty.
7. The method of claim 1, wherein said window is a sliding window such that thresholds of said window are adjusted whenever a minimum calculated transmission delay is obtained.
8. The method of claim 7, wherein the sliding window comprises a first threshold representing a best delay and a second threshold representing a maximum allowable difference from the best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays.
9. The method of claim 8, wherein said step of determining if the calculated transmission delay is within the window comprises:
determining if said calculated transmission delay is less than the best delay;
and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message sending step through said determining step an additional number of times.
determining if said calculated transmission delay is less than the best delay;
and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message sending step through said determining step an additional number of times.
10. The method of claim 1, wherein said step of determining if the calculated transmission delay is within the window comprises:
determining if said calculated transmission delay is less than a best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays; and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message sending step through said determining step an additional number of times.
determining if said calculated transmission delay is less than a best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays; and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message sending step through said determining step an additional number of times.
11. The method of claim 10, wherein said step of determining if the calculated transmission delay is within the window further comprises:
calculating a difference between said calculated transmission delay and the best delay;
determining if the calculated difference exceeds a maximum allowable difference; and if the calculated difference exceeds the maximum allowable difference, discarding the calculated transmission delay, and ensuring that said method executes said first message sending step through said determining step an additional time.
calculating a difference between said calculated transmission delay and the best delay;
determining if the calculated difference exceeds a maximum allowable difference; and if the calculated difference exceeds the maximum allowable difference, discarding the calculated transmission delay, and ensuring that said method executes said first message sending step through said determining step an additional time.
12. The method of claim 1, wherein the first transmission and first reception times of the first message are generated using the second clock.
13. The method of claim 1, wherein the second transmission and second reception times of the second message are generated using the first clock.
14. The method of claim 1, wherein the step of calculating the transmission delay comprises:
calculating a round trip delay by taking a difference between the second reception time and the first transmission time;
calculating a clock master delay by taking a difference between the second transmission time and the first reception time; and computing the transmission delay by halving a difference between the round trip delay and the clock master delay.
calculating a round trip delay by taking a difference between the second reception time and the first transmission time;
calculating a clock master delay by taking a difference between the second transmission time and the first reception time; and computing the transmission delay by halving a difference between the round trip delay and the clock master delay.
15. The method of claim 1, wherein the first and second clock are synchronous.
16. A method of performing time synchronization between a clock master and a clock slave, said method comprising the steps of:
receiving a first message from the clock slave;
sending a second message to the clock slave;
calculating a transmission delay between the clock slave and clock master from reception and transmission times of the first and second messages;
determining if the calculated transmission delay is within a window of acceptable delays and updating an accumulated delay with the calculated transmission delay if the calculated transmission delay is within the window; and repeating said first message receiving step through said determining step until a termination condition is met.
receiving a first message from the clock slave;
sending a second message to the clock slave;
calculating a transmission delay between the clock slave and clock master from reception and transmission times of the first and second messages;
determining if the calculated transmission delay is within a window of acceptable delays and updating an accumulated delay with the calculated transmission delay if the calculated transmission delay is within the window; and repeating said first message receiving step through said determining step until a termination condition is met.
17. The method of claim 16, further comprising synchronizing a clock of the clock slave to a clock of the clock master using the accumulated delay.
18. The method of claim 16, wherein said window is a sliding window such that thresholds of said window are adjusted whenever a minimum calculated transmission delay is obtained.
19. The method of claim 18, wherein the sliding window comprises a first threshold representing a best delay and a second threshold representing a maximum allowable difference from the best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays.
20. The method of claim 19, wherein said step of determining if the calculated transmission delay is within the window comprises:
determining if said calculated transmission delay is less than the best delay;
and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message receiving step through said determining step an additional number of times.
determining if said calculated transmission delay is less than the best delay;
and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message receiving step through said determining step an additional number of times.
21. The method of claim 16, wherein said step of determining if the calculated transmission delay is within the window comprises:
determining if said calculated transmission delay is less than a best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays; and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message receiving step through said determining step an additional number of times.
determining if said calculated transmission delay is less than a best delay, wherein the best delay represents a calculated transmission delay with a smallest delay in comparison to other calculated transmission delays; and if the calculated transmission delay is less than the best delay, storing the calculated transmission delay as the best delay, discarding the calculated transmission delay, resetting the accumulated delay and ensuring that said method executes said first message receiving step through said determining step an additional number of times.
22. The method of claim 21, wherein said step of determining if the calculated transmission delay is within the window further comprises:
calculating a difference between said calculated transmission delay and the best delay;
determining if the calculated difference exceeds a maximum allowable difference; and if the calculated difference exceeds the maximum allowable difference, discarding the calculated transmission delay, and ensuring that said method executes said first message receiving step through said determining step an additional time.
calculating a difference between said calculated transmission delay and the best delay;
determining if the calculated difference exceeds a maximum allowable difference; and if the calculated difference exceeds the maximum allowable difference, discarding the calculated transmission delay, and ensuring that said method executes said first message receiving step through said determining step an additional time.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US09/516,195 US7068746B1 (en) | 2000-03-01 | 2000-03-01 | Base station transceiver to radio network controller synchronization filtering function |
| US09/516,195 | 2000-03-01 |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CA2331913A1 CA2331913A1 (en) | 2001-09-01 |
| CA2331913C true CA2331913C (en) | 2005-04-05 |
Family
ID=24054534
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CA002331913A Expired - Fee Related CA2331913C (en) | 2000-03-01 | 2001-01-23 | Base station transceiver to radio network controller synchronization filtering function |
Country Status (8)
| Country | Link |
|---|---|
| US (1) | US7068746B1 (en) |
| EP (1) | EP1130801A3 (en) |
| JP (1) | JP4856319B2 (en) |
| KR (1) | KR100852608B1 (en) |
| CN (1) | CN1311611A (en) |
| AU (1) | AU2317301A (en) |
| BR (1) | BR0100683A (en) |
| CA (1) | CA2331913C (en) |
Families Citing this family (35)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100433593C (en) * | 2002-05-21 | 2008-11-12 | 中兴通讯股份有限公司 | Method of time synchronization in broad band CDMA |
| CH704101B1 (en) * | 2002-11-06 | 2012-05-31 | Barix Ag | Method and apparatus for synchronized playback of data streams. |
| CN100350763C (en) * | 2004-01-02 | 2007-11-21 | 上海欣泰通信技术有限公司 | Time supply and synchronizing system for telecommunication network |
| US7483448B2 (en) * | 2004-03-10 | 2009-01-27 | Alcatel-Lucent Usa Inc. | Method and system for the clock synchronization of network terminals |
| FR2871006B1 (en) * | 2004-05-28 | 2008-09-12 | Thales Sa | METHOD AND SYSTEM FOR DISTRIBUTED SYNCHRONIZATION |
| JP4527115B2 (en) * | 2004-06-25 | 2010-08-18 | 三菱電機株式会社 | Inter-base station time synchronization method, base station, and timing master device |
| CN1866814B (en) * | 2005-05-17 | 2011-02-02 | 上海华为技术有限公司 | Clock locking method and its system |
| US7711008B2 (en) * | 2006-01-23 | 2010-05-04 | Ipwireless, Inc. | Quasi synchronous transmission in cellular networks |
| US7839897B2 (en) * | 2006-09-29 | 2010-11-23 | Agere Systems Inc. | Methods and apparatus for unidirectional timing message transport over packet networks |
| KR101322841B1 (en) * | 2007-01-22 | 2013-10-25 | 삼성전자주식회사 | Method for executing time synchronization between nodes of network and appartus for executing the method |
| CN101022416B (en) * | 2007-03-06 | 2010-07-07 | 华为技术有限公司 | Method for regulating clock frequency, client and system |
| JP5243786B2 (en) * | 2007-12-28 | 2013-07-24 | サンリツオートメイション株式会社 | Remote I / O system and time synchronization method in remote I / O system |
| CN101494534A (en) * | 2008-01-21 | 2009-07-29 | 华为技术有限公司 | Method, apparatus and system for synchronizing data |
| JP2009284054A (en) * | 2008-05-20 | 2009-12-03 | Mitsubishi Electric Corp | Communication system, radio station, router, and time synchronizing method |
| KR101019170B1 (en) * | 2008-05-26 | 2011-03-03 | 광운대학교 산학협력단 | Method and Apparatus of Deciding an Initial Delay in Network Synchronization Systems |
| CN101783779B (en) | 2009-01-16 | 2014-07-16 | 华为技术有限公司 | Time synchronization method, device and system of xDSL |
| KR101705592B1 (en) * | 2009-05-18 | 2017-02-10 | 삼성전자주식회사 | Method and apparatus for performing time synchronization between nodes |
| JP5495323B2 (en) * | 2010-07-16 | 2014-05-21 | Ｋｄｄｉ株式会社 | Time synchronization device via network |
| US9515756B2 (en) * | 2010-11-29 | 2016-12-06 | Spidercloud Wireless, Inc. | Adaptive precision timing control in a communication system |
| CN102118211A (en) * | 2011-01-25 | 2011-07-06 | 西安电子科技大学 | Timing and synchronization method for media-sharing STDM system |
| JP5651251B2 (en) * | 2011-12-05 | 2015-01-07 | インターナショナル・ビジネス・マシーンズ・コーポレーションＩｎｔｅｒｎａｔｉｏｎａｌ Ｂｕｓｉｎｅｓｓ Ｍａｃｈｉｎｅｓ Ｃｏｒｐｏｒａｔｉｏｎ | Simulation execution method, program, and system |
| AT13701U1 (en) * | 2012-03-21 | 2014-06-15 | Bachmann Gmbh | Method for synchronizing time base and events in a branched interconnected network, e.g. in wind farm nets |
| KR101936657B1 (en) * | 2012-11-14 | 2019-01-10 | 한국전자통신연구원 | System and method for random access wireless communications |
| GB201310114D0 (en) * | 2013-06-06 | 2013-07-24 | Sec Dep For Business Innovation & Skills The | Time synchronisation control apparatus and method |
| JP6042287B2 (en) * | 2013-08-02 | 2016-12-14 | 株式会社Ｋｄｄｉ総合研究所 | Base station apparatus, control method thereof, and program |
| KR102093223B1 (en) * | 2013-09-30 | 2020-03-25 | 한국전력공사 | Apparatus and method for synchronizing time of power control system |
| TWI548294B (en) * | 2014-03-10 | 2016-09-01 | 鴻海精密工業股份有限公司 | Femtocell and method of adusting frequency |
| KR20150141055A (en) * | 2014-06-09 | 2015-12-17 | 엘에스산전 주식회사 | Method for time synchronization of watt-hour meter time synchronization system |
| CN104218677A (en) * | 2014-09-10 | 2014-12-17 | 广西电网公司电力科学研究院 | Method for synchronizing clocks of power distribution master stations and power distribution terminals |
| CN104219016B (en) * | 2014-09-10 | 2018-03-09 | 广西电网公司电力科学研究院 | The system of selection of distribution main website and distribution terminal clock synchronization point |
| CN104410481B (en) * | 2014-11-28 | 2018-01-19 | 国家电网公司 | A kind of setting means based on NTP networks and pair when system |
| CN108195533B (en) * | 2017-12-14 | 2019-07-19 | 北京理工大学 | A kind of system and method being accurately positioned the data acquisition moment |
| CN108495239B (en) * | 2018-01-17 | 2020-09-29 | 深圳聚点互动科技有限公司 | Method, device, equipment and storage medium for accurately and synchronously playing audio among multiple equipment |
| CN108259107A (en) * | 2018-01-17 | 2018-07-06 | 深圳聚点互动科技有限公司 | The method, apparatus of system time synchronization, equipment and storage medium between multiple wireless devices |
| CN108269570B (en) * | 2018-01-17 | 2020-09-11 | 深圳聚点互动科技有限公司 | Method, device, equipment and storage medium for voice control of background music host |
Family Cites Families (17)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| DE3751571T2 (en) | 1986-05-20 | 1996-04-11 | Mitsubishi Electric Corp | Method for synchronizing real-time clocks in a data transmission system. |
| US5613211A (en) | 1992-10-07 | 1997-03-18 | Nippon Steel Corporation | Method of establishing inter base-station synchronization and mobile radio communicaton system using the method |
| SE470037C (en) | 1992-10-27 | 1995-03-23 | Ericsson Telefon Ab L M | Device for mobile telecommunication systems to enable synchronization of the transmitters of the base stations |
| US5388102A (en) * | 1993-07-01 | 1995-02-07 | At&T Corp. | Arrangement for synchronizing a plurality of base stations |
| KR0129147B1 (en) * | 1994-12-23 | 1998-04-08 | 양승택 | Timing synchronization transfer method for digital cellular network |
| US5530704A (en) | 1995-02-16 | 1996-06-25 | Motorola, Inc. | Method and apparatus for synchronizing radio ports in a commnuication system |
| KR0140130B1 (en) * | 1995-03-07 | 1998-07-01 | 김주용 | Digital communication system |
| EP0868792A2 (en) * | 1996-10-24 | 1998-10-07 | Koninklijke Philips Electronics N.V. | A digital wireless communications system and a wireless radio station |
| SE509836C2 (en) | 1997-06-13 | 1999-03-15 | Ericsson Telefon Ab L M | Procedure and arrangement in a radio communication system |
| JP3615357B2 (en) * | 1997-07-01 | 2005-02-02 | 日本電信電話株式会社 | Clock synchronization method and apparatus, and recording medium |
| US5872774A (en) | 1997-09-19 | 1999-02-16 | Qualcomm Incorporated | Mobile station assisted timing synchronization in a CDMA communication system |
| US6373834B1 (en) | 1997-12-19 | 2002-04-16 | Telefonaktiebolaget Lm Ericsson | Synchronization for cellular telecommunications network |
| KR100281098B1 (en) * | 1997-12-30 | 2001-02-01 | 서평원 | System synchronizer using internal network of mobile communication system |
| US6199169B1 (en) * | 1998-03-31 | 2001-03-06 | Compaq Computer Corporation | System and method for synchronizing time across a computer cluster |
| JP4267092B2 (en) | 1998-07-07 | 2009-05-27 | 富士通株式会社 | Time synchronization method |
| US6236623B1 (en) * | 1998-10-16 | 2001-05-22 | Moore Industries | System and method for synchronizing clocks in a plurality of devices across a communication channel |
| JP3703990B2 (en) * | 1999-03-30 | 2005-10-05 | 日立ソフトウエアエンジニアリング株式会社 | Time adjustment method |
-
2000
- 2000-03-01 US US09/516,195 patent/US7068746B1/en not_active Expired - Lifetime
-
2001
- 2001-01-23 CA CA002331913A patent/CA2331913C/en not_active Expired - Fee Related
- 2001-02-19 EP EP01301460A patent/EP1130801A3/en not_active Withdrawn
- 2001-02-21 BR BR0100683-5A patent/BR0100683A/en not_active Application Discontinuation
- 2001-02-22 AU AU23173/01A patent/AU2317301A/en not_active Abandoned
- 2001-02-28 CN CN01108918A patent/CN1311611A/en active Pending
- 2001-03-01 JP JP2001056621A patent/JP4856319B2/en not_active Expired - Fee Related
- 2001-03-02 KR KR1020010010845A patent/KR100852608B1/en not_active IP Right Cessation
Also Published As
| Publication number | Publication date |
|---|---|
| JP4856319B2 (en) | 2012-01-18 |
| EP1130801A2 (en) | 2001-09-05 |
| US7068746B1 (en) | 2006-06-27 |
| AU2317301A (en) | 2001-09-06 |
| JP2001308837A (en) | 2001-11-02 |
| CA2331913A1 (en) | 2001-09-01 |
| CN1311611A (en) | 2001-09-05 |
| KR20010087284A (en) | 2001-09-15 |
| KR100852608B1 (en) | 2008-08-18 |
| EP1130801A3 (en) | 2003-09-03 |
| BR0100683A (en) | 2001-11-06 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CA2331913C (en) | Base station transceiver to radio network controller synchronization filtering function | |
| US6373834B1 (en) | Synchronization for cellular telecommunications network | |
| EP1863309B1 (en) | Mobile terminal of cdma system, mobile communication method of cdma system, and communication quality estimating method | |
| JPH06132879A (en) | Method for radio synchronism of base station of simultaneous broadcasting network | |
| CN101640927A (en) | Method and system for adjusting downlink outer loop power to control target SIR | |
| CN100361417C (en) | Adaptive RACH power determination for mobile telecommunications user equipment unit | |
| EP0539704A1 (en) | An architecture for the accurate distribution of a network wide time reference value on a ring topology local area network | |
| US6647026B1 (en) | Frame phase synchronous system and a method thereof | |
| WO1997020402A1 (en) | Signal acquisition via repeated access probe transmission | |
| US5436937A (en) | Multi-mode digital phase lock loop | |
| US6819685B1 (en) | Method of and system for controlling a frequency via an asynchronous transmission network and mobile telephone network including the system | |
| EP0872026B1 (en) | Apparatus and method of establishing and maintaining communication paths in a wireless telecommunications system | |
| EP1659717B1 (en) | Phase adjusting method and apparatus | |
| CA2278686C (en) | Method and apparatus for managing remote unit increased power transmission during location | |
| EP3111575B1 (en) | Clock synchronization with hysteresis state switching | |
| US8433784B2 (en) | Traffic generator with enhanced burst modeling feature | |
| US6956915B2 (en) | Method of correcting frequency error | |
| EP0872062A2 (en) | Apparatus and method of controlling transmitting power and transmit rate of a wireless telecommunications system | |
| US6687223B1 (en) | Delay-locked admission control scheme in communications networks | |
| US5873038A (en) | System and method for distributing channel port loading functionality | |
| EP1647157A1 (en) | Method for determining the geographical traffic load in a mobile telecommunication network. | |
| KR0170196B1 (en) | Overload control method of digital mobile communication network service control point | |
| RU2182402C2 (en) | Method for detecting channel-card alarm signal in digital communication system | |
| CN116979979A (en) | Communication signal processing method, device, electronic equipment and storage medium | |
| EP0991211A2 (en) | Device and method of determining quality of radio communication in a mobile communication system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| EEER | Examination request | ||
| MKLA | Lapsed | ||
| MKLA | Lapsed |
Effective date: 20090123 |