Patent Grant
11039408
A portion of the disclosure of this patent document contains material that is subject to copyright protection. The copyright owner has no objection to the facsimile reproduction by anyone of the patent document or the patent disclosure, as it appears in the Patent and Trademark Office patent files or records, but otherwise reserves all copyright rights whatsoever.
1. Technological Field
The present disclosure relates generally to the field of integrated circuit (IC) operation within wireless networks. More particularly, the present disclosure is directed to precisely synchronizing ICs within a wireless network.
2. Description of Related Technology
As is well known within electronic circuit design arts, high speed integrated circuit (IC) design typically requires consistent and accurate distribution of a time reference. Specifically, an accurate time reference is required to, inter aria, ensure that data is processed correctly and consistently throughout the integrated circuit.
Wireless networking introduces a myriad of problems not previously encountered within traditional “wired” circuit design. For example, unlike wired circuits, wireless networks must robustly handle changing radio environments, unknown propagation delays, etc. Generally, wireless devices utilize an internal free-running oscillator to generate internal clocking. Due to manufacturing variance and tolerances in oscillator components, wireless networks must assume that each device has an imperfect time reference. For this reason, a myriad of synchronization schemes and standards for synchronizing time between wireless devices have been developed. Typical solutions provide time information periodically across the wireless network, each device of the network determines an appropriate adjustment to its local free-running clock. Ideally, if each device adjusts itself correctly, the overall wireless network should be synchronized.
As is appreciated by those of ordinary skill, wireless devices generally contain multiple internal components (including ICs), where each component has distinct timing requirements. For reasons discussed hereinafter, existing schemes for synchronizing wireless devices are inefficient and/or unsuitable for supporting distinct timing requirements of a wireless device's internal components. Thus, improved methods and apparatus for synchronizing components within a station on a wireless network system are needed.
The present disclosure provides, inter alia, improved apparatus and methods for precisely synchronizing components within a wireless network.
A method for synchronization of integrated circuits (IC) within a wireless device is disclosed. In one embodiment, the method includes generating an edge signal; calculating a time value associated with the edge signal; and transmitting the time value associated with the edge signal.
A method for precisely determining a time reference within a wireless device is disclosed. In one embodiment, the method includes receiving an edge signal; receiving a data value associated with the edge signal; and calculating a time reference based on the edge signal and the data value.
A temporal protocol is disclosed. In one embodiment, the protocol is a serialized time protocol configured for unidirectional communication between a time-transmitter and a time-receiver.
A method distributing temporal information is disclosed. In one embodiment, the information is distributed unidirectionally from a time “source” without any need for reply or acknowledgement using a serial protocol.
A wireless device is disclosed. In one embodiment, the device includes a WLAN or other wireless air interface that is configured to synchronize one or more internal time bases according to a serial time protocol (STP).
A computer readable apparatus is disclosed. In one embodiment, the apparatus includes at least one computer program configured to, when executed, implement time synchronization with a wireless device of a wireless network (e.g., WLAN).
Computerized logic configured to implement time synchronization within a wireless device is disclosed.
A master/slave timing architecture is disclosed. In one embodiment, the master (transmitter) communicates with the slave (receiver) via a unidirectional serial time protocol via a two-wire interface.
Other features and advantages of the present disclosure will immediately be recognized by persons of ordinary skill in the art with reference to the attached drawings and detailed description of exemplary embodiments as given below.
All Figures © Copyright 2012-2013 Apple Inc. All rights reserved.
Reference is now made to the drawings, wherein like numerals refer to like parts throughout.
In one exemplary embodiment of the present disclosure, a temporal protocol (e.g., serial time protocol or STP) is disclosed for use within a wireless device of a wireless network. The disclosed protocol provides a common protocol for communicating precision time information from e.g., one time-transmitter integrated circuit (IC) to another time-receiver IC within a wireless device. Moreover, as described in greater detail hereinafter, the common protocol can be implemented within very low level firmware, and can provide significantly higher precision than existing software solutions without requiring expensive (or dedicated hardware).
In one exemplary embodiment, a time-transmitter and a time-receiver is implemented within the firmware of a wireless device. The time-transmitter/time-receiver communicate via at least two (2) input/outputs (IOs) (e.g., general purpose input output (GPIO), etc.), where at least one (1) IO can produce a signal edge based on an atomic operation executed within firmware. In one variant, the disclosed STP provides an edge signal for communicating time instants and a serial data signal for communicating time information.
Various schemes and implementations utilizing the disclosed exemplary STP for time synchronization are described in greater detail herein.
Exemplary embodiments of the present disclosure are now described in detail.
Methods—
The following discussion of
At step 102 of the method 100, an edge signal is generated with high precision. As a brief aside, unlike other forms of digital logic which are based on logical levels (e.g., logical high (“1”), and logical low (“0”)), so-called “edge”, “edge-triggered”, “edge signaling”, etc. refers to logic configured to identify/produce signal transitions to denote a precise moment in time. Edge-triggered circuitry is classified as so-called “rising edge” or “falling edge”. Rising edge circuitry is configured according to low-to-high signal transitions. Falling edge circuitry is configured according to high-to-low transitions. Still other implementations may be based on so-called “leading edge” or “following edge” logic. Various substitutions in edge-based logic are well within the skill of an artisan of ordinary skill in the arts.
In one embodiment, the edge signal is generated within firmware. As used herein, the term “firmware” relates generally and without limitation to very low-level software drivers configured to directly control the actual physical operation or mechanisms of the device. Generally, firmware is distinguished from higher-level software applications which leverage various degrees of abstraction and re-direction for operation. It is generally understood that the firmware provides only the most elementary and/or basic functions of device operation. Common examples of firmware instructions include e.g., writing a register, reading a register, asserting an output, reading an input, erasing a memory component, etc.
In various alternate embodiments, the edge signal may be generated within progressively higher layers of software, or by dedicated hardware elements. However, it should be appreciated that higher layers of software will generally detract from precision, as each layer of software abstraction adds significantly more flexibility in the resulting compiled instruction scheduling. Similarly, while dedicated hardware can be used to generate edges with very high precision, hardware solutions are fixed in function and generally cannot be re-programmed or changed once the device is fabricated. Typical examples of hardware solutions include for example: application specific integrated circuits (ASICs), field programmable gate arrays (FPGAs), programmable logic devices (PLDs), and even dedicated discrete logic gates.
In one embodiment of the method 100, the edge signal is generated according to an atomic operation. Within the related arts, the term “atomic” refers to a software operation or function that cannot be separated into component parts. Atomic operations are executed without compiler optimization. For example, an atomic operation to generate an edge transition ensures that the edge occurs at the moment of execution (i.e., the edge transition is not generated at a point selected by the compiler within a set of operations).
At step 104 of the method 100, a data value is provided with respect to the edge signal. In one exemplary embodiment, the data value is associated with the edge signal, but can be provided at a substantially later time. In some variants, the data value is provided substantially before the edge signal; alternatively, the data value can be provided substantially after the edge signal. One salient benefit of providing the data value at a substantially different time from the edge transition is that the data can be calculated by higher layers of software, which provides significantly more flexibility, but also takes significantly more time (and in some cases requires information which is not immediately available). For example, in one exemplary embodiment, a time-transmitter can issue an edge signal, and subsequently thereafter (after multiple processor cycles), provide a calculated absolute time value associated with the issued edge signal.
Moreover, common examples of useful data include without limitation, reference time values, delta values, relative values, modified values, instructions, etc. Moreover, it should also be appreciated that data values can span a wide range of data types. Common useful data types include e.g., incrementing counts, decrementing counts, as well as format specific data (e.g., HH:MM:SS, etc.).
For example, in one implementation, the data may be a reference time value. Reference time values are made with respect to a particular event, etc. Common examples of reference time values include e.g., countdowns, elapsed time values, time since an event, etc. In one such variant, a so-called “delta” time is used to represent a difference in time (i.e., an elapsed time between at least two events). In still other examples, data values may incorporate one or more modifications. For instance, a time-transmitter which is aware of a slight delta between its own reference clock and a time-receiver's reference clock may impute the delta into its reference clock values. This adjusted reference clock data represents the time-transmitter's adjustment for the time-receiver's reference clock domain for the issued edge event.
In still other embodiments, the data may be an instruction which is to be triggered at the edge event (or retroactively applied to the edge event). Common examples of instructions include, for example, resetting a time reference at the edge event, pre-setting a time reference at the edge event, advancing or retarding a time reference at the edge event, etc.
In one exemplary implementation of the present disclosure, the data comprises a formatted data frame. In one variant, the formatted data frame includes at least a header, and data. The data frame may additionally include a descriptor. Framed data provides multiple flexible capabilities, including e.g., flexibility in use, error checking, etc.
Referring again to
Exemplary Apparatus—
Referring now to
While a specific device configuration and layout is shown and discussed, it is recognized that many other implementations may be readily implemented by one of ordinary skill given the present disclosure, the exemplary wireless device 200 of
The processing subsystem 202 of the device 200 includes one or more of central processing units (CPU) or digital processors, such as a microprocessor, digital signal processor, field-programmable gate array, RISC core, or plurality of processing components mounted on one or more substrates. The processing subsystem is coupled to non-transitory computer-readable storage media such as memory 204, which may include for example SRAM, FLASH, SDRAM, and/or HDD (Hard Disk Drive) components. As used herein, the term “memory” includes any type of integrated circuit or other storage device adapted for storing digital data including, without limitation, ROM. PROM, EEPROM, DRAM, SDRAM, DDR/2 SDRAM, EDO/FPMS, RLDRAM, SRAM, “flash” memory (e.g., NAND/NOR), and PSRAM. The processing subsystem may also include additional co-processors, such as a dedicated graphics accelerator, network processor (NP), or audio/video processor. As shown the processing subsystem 202 includes discrete components; however, it is understood that in some embodiments they may be consolidated or fashioned in a SoC (system-on-chip) configuration. It can be appreciated that, in one particular implementation, one or more firmware and/or software running on the processing subsystem may perform one or more of the steps discussed above with respect to
The wireless device 200 further includes one or more wireless interfaces 206 which are configured to receive transmissions from a wireless network. The wireless interfaces may include virtually any wireless technology such as e.g., WLAN or WMAN networks (e.g. Wi-Fi-family, WiMAX, etc.), personal area networks (e.g. Bluetooth®, 802.15, etc.), or cellular (e.g. GSM, UMTS, CDMA, CDMA2000, WCDMA, EV-DO, 3GPP standards, LTE, LTE-A, EDGE, GPRS, HSPA, HSPA+, HSPDA, and/or HSPUA, etc.). In one exemplary embodiment, the wireless interface is a Wi-Fi family transceiver (802.11a, b, g, n, v, 802.11-2012, etc.), and includes a baseband processor.
In one embodiment, the wireless device further includes an internal time reference 206 such as a crystal oscillator (XO). Common examples of a crystal oscillator include voltage controlled XO (VCXO), temperature controlled XO (TCXO), voltage and temperature controlled XO (VCTCXO), etc. Still other forms of internal time references may be used including e.g., global positioning system (GPS) time, network time, etc. In still other embodiments, the wireless device may include one or more other discrete time references for constituent components and integrated circuits (IC).
The wireless device further includes at least one time-transmitter component 208 and at least one time-receiver component 210. Each of the at least one time-transmitter components 208 and at least one time-receiver components 210 are in this embodiment compliant with a commonly shared serial time protocol (STP). In one exemplary implementation, the STP interface includes two (2) general purpose input outputs (GPIO) which are configured to handle at least one edge signal and one or more logical data interfaces. For example, in one embodiment, the GPIO include at least a CLK and a DATA output. It is appreciated that yet other embodiments may utilize greater or fewer number of pins, the foregoing being purely illustrative.
In one exemplary embodiment, the time-transmitter apparatus 208 includes non-transitory computer-readable medium containing instructions which when executed are configured to generate an edge signal with high precision; calculate a time value associated with the edge signal, and provide the time value associated with the edge signal. In other embodiments, the time-transmitter apparatus includes logic configured to e.g., generate an edge signal with high precision, calculate a data value associated with the edge signal, and provide the data value.
In one exemplary embodiment of the apparatus 200, the time-receiver apparatus 210 includes non-transitory computer-readable media containing instructions which when executed are configured to receive an edge signal with high precision, receive a data value associated with the edge signal, and calculate a time reference based on the edge signal and the data value. In other embodiments, the time-transmitter apparatus includes logic configured to e.g., receive an edge signal with high precision, receive a data value associated with the edge signal, and calculate a time reference based on the edge signal and the data value.
Example Operation—
One exemplary serial time protocol (STP) useful for precise synchronization of integrated circuits within a wireless network is now discussed in greater detail.
Referring now to
The exemplary STP consists of a clock signal (CLK) and a data signal (DATA) which are transmitted via two (2) general purpose input outputs (GPIOs). While the following descriptions are provided within the context of unidirectional signaling from the time-transmitter to the one or more time-receivers, it should be appreciated by those of ordinary skill that such a topology is purely illustrative. In fact, a device may consist of one or more time-transmitters and one or more time-receivers, or some combination thereof. It should additionally be appreciated that unidirectional operation can be freely interchanged with bidirectional operation with equal success.
During normal operation, the time-transmitter transmits frames of data to the time-receiver. The time-receiver is configured to read (or clock in) DATA as a serial data stream on the rising edges of CLK. In some variants, the time-transmitter provides a continuous free-running clock; in other variants, the time-transmitter only provides a CLK signal during the frame.
Referring now to
The format of the exemplary implementation of the frame may be either: (i) an absolute timestamp, or (ii) a frame status descriptor (one (1) byte denoted bits [17:I0]) and associated data (up to thirty one (31) bytes). The exemplary frame header is further formatted according to specific rules: (i) the first bit of every frame is a logic low (i.e., H7=0); (ii) the length of the frame is specified by the frame length field included in the frame header (i.e., [H5:H0]); and (iii) each frame can have a valid edge (as shown in
Where the frame provides an absolute timestamp, the timestamp is provided immediately after the frame header. The format of the absolute timestamp can be selected to suit the components. Common examples include, without limitation: an incrementing or decrementing count, a running time with reference to an external clock (e.g., HH:MM:SS, etc.), a total running time, etc.
One exemplary frame status descriptor is provided in APPENDIX B hereto. The frame status descriptor is provided to enable flexibility for various timing synchronization architectures. Generally, the frame status descriptor will include: (i) an indication if the time-transmitter is the system master, (ii) if the system time synchronization has been established, (iii) if the system time has been disrupted, and (iv) a descriptor of the encapsulated data.
In one salient example, the exemplary serial time protocol (STP) described herein enables the firmware of the time-transmitter to transmit a standalone edge transition with a single atomic operation, and then transmit the data associated with the standalone edge at a later (non-critical) time.
A standalone edge (i.e., an edge transition which is followed by data at a later non-critical time) can be provided according to any number of different approaches, including at least one of the following three (3) schemes: (i) a standalone edge frame header, (ii) extending an H6 CLK edge, and (iii) using a frame timeout timer. As a brief aside, a time-receiver may implement a frame timeout timer that will automatically reset the bus state when the time between the rising edges of a CLK exceed a maximum value. In some instances, the frame timeout timer may have a default value (e.g., 1000 microseconds (us)) that can be adjusted (see APPENDIX B, data descriptor [0x28]). In the event of a frame timeout, the time-receiver will ignore any received DATA. In some cases, if the clock pulse H6 has not occurred before the frame timeout, then the time-receiver will treat the edge transition as a valid edge signal; if a frame timeout occurs later in the frame then the clock edge validity is determined by the H6 bit. However, if a clock edge has occurred, the edge validity is determined according to the frame header bit (i.e., valid if H6 is logic high (“1”), ignored if H6 is logic low “0”)).
Referring now to
Referring now to
Referring now to
IEEE 802.11v+IEEE 802.1as—
As shown in this example, each wireless device is configured to issue an edge and transmit an absolute time value corresponding to the issued edge. The time-transmitters of each wireless device synchronize to one another according to timestamp exchanges. APPENDIX C provides an example of so-called “pseudo-code”, configured to send a “time sync not established” status message until synchronization has been established, and then transmit an absolute timestamp every ten (10) milliseconds (ms) thereafter.
IEEE 802.11v Only—
As shown in this example, each wireless device is configured to issue an edge and transmit either: (i) a local clock value at the issued edge and a delta value, or (ii) a local clock value adjusted by a delta value at the issued edge, where the transmitted value(s) correspond to the issued edge. The delta values are determined according to for instance
For example, as shown in
APPENDIX D is a “pseudo-code” example for
In Packet Timestamp Signaling—
In this example, each time-transmitter is configured to perform one of: (i) issue an edge and the local clock counter value at the issued edge, and a delta value based on timestamps received from the master station, (ii) issue an edge at the local clock adjusted by the delta value, or (iii) issue an edge at the local value, but communicate the timestamp of when the master device had issued the timing measurement request.
SYNC and INDEX Signaling—
APPENDIX E is a “pseudo-code” example for
Time Sync Function (TSF) Signaling—
As a brief aside, many existing Wi-Fi systems provide a system TSF clock. The TSF counter is a 64-bit value that indicates a running time in microseconds (mS). In existing infrastructure systems, the AP contains the master TSF clock, and periodically sends the TSF counter in “Beacon Frames” (approximately 10 Beacon Frames are transmitted per second). Each associated wireless device updates its local TSF counter whenever a new Beacon Frame is received.
Accordingly, in one exemplary embodiment, the AP transmits an edge signal, and then transmits the TSF counter value that directly corresponds to that edge. In one variant, the TSF counter value is a “raw” value. A raw TSF counter value can be used if the receiver does not perform TSF filtering when Beacon Frames are received. In these scenarios, the receiver can expect the TSF counter value to significantly “jump” or “skip” whenever a new Beacon Frame is received. In some cases, where a Beacon Frame has been received and the TSF was properly updated, the receiver may additionally notify other software (e.g., via a register, etc.) that a jump in TSF is likely to, or has, occurred.
In another variant, the TSF counter value may be an “estimated” value. Estimated TSF values may be useful where the receiver performs TSF filtering on the local TSF clock to e.g., predict the master TSF clock. In some implementations, the receiver may notify other software that a Beacon Frame has been received. APPENDIX F is a “pseudo-code” example corresponding to
It will be recognized that while certain embodiments of the disclosure are described in terms of a specific sequence of steps of a method, these descriptions are only illustrative of the broader methods of the disclosure, and may be modified as required by the particular application. Certain steps may be rendered unnecessary or optional under certain circumstances. Additionally, certain steps or functionality may be added to the disclosed embodiments, or the order of performance of two or more steps permuted. All such variations are considered to be encompassed within the embodiments disclosed and claimed herein.
While the above detailed description has shown, described, and pointed out novel features applicable to various embodiments, it will be understood that various omissions, substitutions, and changes in the form and details of the device or process illustrated may be made by those skilled in the art without departing from the principles described herein. The foregoing description is of the best mode presently contemplated. This description is in no way meant to be limiting, but rather should be taken as illustrative of the general principles described herein. The scope of the disclosure should be determined with reference to the claims.
This application claims priority to co-owned, U.S. Provisional Patent Application Ser. No. 61/656,908 filed on Jun. 7, 2012 and entitled “METHODS AND APPARATUS FOR SYNCHRONIZATION AMONG INTEGRATED CIRCUITS WITHIN A WIRELESS NETWORK”, the foregoing being incorporated herein by reference in its entirety. This application is related to co-owned, U.S. Provisional Patent Application Ser. No. 61/646,207 filed May 11, 2012 and entitled “METHODS AND APPARATUS FOR SYNCHRONIZING CLOCK SIGNALS IN A WIRELESS TEST SYSTEM” (now U.S. patent application Ser. No. 13/604,275), the foregoing being incorporated herein by reference in its entirety.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3177292 | Ewin | Apr 1965 | A |
| 3755628 | Hughes et al. | Aug 1973 | A |
| 4083005 | Looschen | Apr 1978 | A |
| 4087643 | Joslow et al. | May 1978 | A |
| 4099028 | Towson | Jul 1978 | A |
| 4216426 | Flora | Aug 1980 | A |
| 4280221 | Chun et al. | Jul 1981 | A |
| 4500989 | Dahod | Feb 1985 | A |
| 4527266 | Bogan et al. | Jul 1985 | A |
| 4543654 | Jones | Sep 1985 | A |
| 4550400 | Henderson, Jr. et al. | Oct 1985 | A |
| 4554658 | Marten et al. | Nov 1985 | A |
| 4561118 | Thinschmidt et al. | Dec 1985 | A |
| 4701904 | Darcie | Oct 1987 | A |
| 4730268 | Marin | Mar 1988 | A |
| 4745597 | Morgan et al. | May 1988 | A |
| 4773065 | Kobayashi et al. | Sep 1988 | A |
| 4785396 | Murphy et al. | Nov 1988 | A |
| 4797877 | Pope et al. | Jan 1989 | A |
| 4860309 | Costello | Aug 1989 | A |
| 5160929 | Costello | Nov 1992 | A |
| 5210846 | Lee et al. | May 1993 | A |
| 5237322 | Heberle | Aug 1993 | A |
| 5357511 | Dinapoli et al. | Oct 1994 | A |
| 5448311 | White et al. | Sep 1995 | A |
| 5469431 | Wendorf et al. | Nov 1995 | A |
| 5487066 | McNamara et al. | Jan 1996 | A |
| 5621735 | Rochester, Jr. et al. | Apr 1997 | A |
| 5640399 | Rostoker et al. | Jun 1997 | A |
| 5661583 | Nhu | Aug 1997 | A |
| 5754764 | Davis et al. | May 1998 | A |
| 6061604 | Russ et al. | May 2000 | A |
| 6272130 | Panahi et al. | Aug 2001 | B1 |
| 6393020 | Patton | May 2002 | B1 |
| 6425009 | Parrish et al. | Jul 2002 | B1 |
| 6532274 | Ruffini | Mar 2003 | B1 |
| 6542754 | Sayers et al. | Apr 2003 | B1 |
| 6608571 | Delvaux | Aug 2003 | B1 |
| 6766381 | Barker et al. | Jul 2004 | B1 |
| 6965299 | Dally et al. | Nov 2005 | B1 |
| 7295578 | Lyle et al. | Nov 2007 | B1 |
| 7643595 | Aweya | Jan 2010 | B2 |
| 7792158 | Cho | Sep 2010 | B1 |
| 8095175 | Todd et al. | Jan 2012 | B2 |
| 8149880 | Cho et al. | Apr 2012 | B1 |
| 8521101 | Kadam et al. | Aug 2013 | B1 |
| 8811372 | Li | Aug 2014 | B2 |
| 20010004366 | Matsumura et al. | Jun 2001 | A1 |
| 20020012401 | Karolys et al. | Jan 2002 | A1 |
| 20020116468 | Ishikawa | Aug 2002 | A1 |
| 20020154647 | Potash | Oct 2002 | A1 |
| 20030078006 | Mahany et al. | Apr 2003 | A1 |
| 20030115369 | Walter | Jun 2003 | A1 |
| 20040001007 | Inoue et al. | Jan 2004 | A1 |
| 20040022210 | Frank | Feb 2004 | A1 |
| 20040208200 | Hejdeman et al. | Oct 2004 | A1 |
| 20040240404 | Ibrahim | Dec 2004 | A1 |
| 20050057307 | Zhang et al. | Mar 2005 | A1 |
| 20050069318 | Lee et al. | Mar 2005 | A1 |
| 20050088443 | Blanco et al. | Apr 2005 | A1 |
| 20050141565 | Forest et al. | Jun 2005 | A1 |
| 20060187969 | Kadowaki | Aug 2006 | A1 |
| 20070211686 | Belcea et al. | Sep 2007 | A1 |
| 20070291777 | Jamieson et al. | Dec 2007 | A1 |
| 20080240021 | Guo et al. | Oct 2008 | A1 |
| 20080287153 | Fullam | Nov 2008 | A1 |
| 20080298399 | Gou | Dec 2008 | A1 |
| 20080315934 | Engl | Dec 2008 | A1 |
| 20090077277 | Vidal et al. | Mar 2009 | A1 |
| 20090161655 | Uppala | Jun 2009 | A1 |
| 20100254345 | Raravi et al. | Oct 2010 | A1 |
| 20110191512 | Beccue | Aug 2011 | A1 |
| 20110216816 | Frenzel | Sep 2011 | A1 |
| 20110228888 | Gelter et al. | Sep 2011 | A1 |
| 20110231566 | Gelter et al. | Sep 2011 | A1 |
| 20110286442 | Maurice et al. | Nov 2011 | A1 |
| 20120001657 | Sullivan et al. | Jan 2012 | A1 |
| 20120020417 | Wei | Jan 2012 | A1 |
| 20120023255 | Edelman | Jan 2012 | A1 |
| 20120144078 | Poulsen | Jun 2012 | A1 |
| 20120326768 | Bhattacharya et al. | Dec 2012 | A1 |
| 20130188657 | Nedovic | Jul 2013 | A1 |
| 20130301634 | Ehlers | Nov 2013 | A1 |
| 20130301635 | Hollabaugh et al. | Nov 2013 | A1 |
| 20140068107 | Rajapakse | Mar 2014 | A1 |
| 20140247834 | Poulsen | Sep 2014 | A1 |
| Number | Date | Country |
|---|---|---|
| 0691617 | Jan 1996 | EP |
| 1427121 | Jun 2004 | EP |
| 2010083930 | Jul 2010 | WO |
| 2012065823 | May 2012 | WO |
| Entry |
|---|
| Moustafa Youssef, et al. “PinPoint: An Asynchronous Time-Based Location Determination System”, ACM 2 Penn Plaza, Jun. 2006. |
| H-P Loeb, et al.: “Implementing a Softawre-Based 802.11 MAC on a Customized Platform” CCNC 2009. 6th IEEE, Piscataway, NJ Jan. 2009. |
| IEEE Standard for information technology—Local and metropolitan area networks—Specific requirements—Part 11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) specifications Amendment 8: IEEE 802.11 Wireless Network Management. |
| IEEE Standard for Local and Metropolitan Area Networks—Timing and Synchronization for Time-Sensitive Applications in Bridged Local Area Networks. |
| Number | Date | Country | |
|---|---|---|---|
| 20130343365 A1 | Dec 2013 | US |
| Number | Date | Country | |
|---|---|---|---|
| 61656908 | Jun 2012 | US |
