The Subject matter described herein relates generally to methods and apparatus for long range wireless radio frequency identification (RFID) devices. More particularly, but not exclusively, the subject matter described herein relates to algorithms used to extend the range of RFID tags, locate RFID tags and systems and methods for the use of GPS satellite signals for time and frequency synchronization of RFID tags.
Early work related to range extension in wireless communication and positioning networks can be found in US Application No. 20100039326, published on Feb. 18, 2010, “Variable Coherence Integration for the Location of Weak Signals,” the contents of which are hereby incorporated by reference in their entirety. In that invention, a known input sequence is broken up into smaller segments. Each segment is matched filtered, and the outputs of the matched filters are combined non-coherently. This technique was proposed due to the fact that the transmitter and receiver are never perfectly frequency synchronized, consequently attempting to match filter over a long segment would result in poor performance. Furthermore, the required complexity to matched filter over long periods of time increases linearly with the correlation time, making it cost prohibitive to implement very long matched filters. The disadvantage of this approach is that one cannot obtain the full coherent processing gain. For example, matched filtering to a sequence of length 1000 samples in theory can produce a processing gain of 30 dB compared to a single sample. By breaking up the sequence into 10 segments of 100 samples each, and non-coherently combining the samples, a processing gain of 25 dB is achievable.
This disclosure describes systems and methods for construction of long range radio frequency identification systems. Described is an approach using the global positioning system (GPS) to frequency synchronize oscillators in RFID tags and RFID readers which enables very large coherent processing gains to be achieved, thus maximizing the wireless range. The construction of signals called Block Pseudo Noise sequences is described which allow for the efficient implementation of decoders to decode very weak signals. Furthermore, in long range RFID systems, it is important to be able to locate RFID tags in an efficient manner. A new approach called Asynchronous Time Difference of Arrival (ATDOA) is described which allow for precise positioning of RFID tags without the need for precise time synchronization amongst readers. In RFID systems with multiple readers and tags, it is important to reduce interference between tags and readers, new techniques are described which efficiently minimize interference. The subject matter includes a system for long-range RFID communication, including one or more RFID readers and one or more RFID tags. Some or all of the readers and tags may have an oscillator frequency synchronization circuit.
The foregoing summary as well as the following detailed description is better understood when read in conjunction with the appended drawings. For the purpose of illustrating the invention, there is shown in the drawings exemplary constructions of the invention; however, the invention is not limited to the specific methods and instrumentalities disclosed. In the drawings:
a depicts the inner matched filter structure.
b depicts the outer matched filter structure.
c depicts the outer matched filter structure with frequency correction circuitry.
Some of the terms used within the application are described here.
AC—Alternating Current
Amplitude Modulation—The variation of the signal strength of the transmit signal in relation to the information being sent.
Coherent Processing—Matched Filtering when the unknown signal is in frequency and phase synchronization with the known template signal.
GPS—Global Positioning System
Matched Filter—The correlation of a known signal, or template with an unknown signal to detect the presence of the known template in the unknown signal.
Pseudo Noise Sequence—A sequence of numbers with pseudorandom properties intended to simulate white noise.
Pulse Position Modulation—A form of signal modulation in which M message bits are encoded by transmitting a single pulse in one of 2M possible time-shifts.
For detecting weak signals in very long range communication systems it is pivotal for the receiver local oscillator and the transmitter local oscillator frequency to be very tightly synchronized. One approach for making sure that the transmitter local oscillators are tightly synchronized is to use atomic clocks. Atomic clocks are very stable and do not vary much in frequency. However, atomic clocks are very expensive, making them impractical to implement in low cost tags and receivers. To allow for inexpensive local oscillator synchronization, a clock synchronization circuit is used at the tag and at the receiver.
The synchronization circuit 51 in
To obtain very high receiver sensitivity, and consequently ultra long communication range from the tag to the RFID reader, novel digital signal processing techniques are used at the RFID reader receiver. To transmit data, a tag transmits a novel signal called a block pseudo noise sequence during multiple time slots and possibly different phases. A pseudo noise (PN) sequence is a deterministic sequence picked from a white noise process. A longer PN sequence can be detected at a lower receiver signal to noise ratio because more energy can be integrated. However, using very long PN sequences have 2 drawbacks that are addressed in this invention. The first drawback is that the frequency synchronization between transmitter and receiver needs to be tighter. For example, consider a transmitter operating at 900 MHz and a receiver operating at 900 MHz±2 KHz which is a typical difference in frequency even for a temperature compensated crystal oscillator based system. The size of the frequency offset will limit the maximum time that the PN sequence can be coherently integrated. The frequency calibration procedure discussed in the previous section aims to mitigate this problem. The second problem is that longer PN sequences substantially increase the complexity of the receiver decoder circuit. To reduce the complexity, a data sequence in this invention called a block PN sequence is transmitted for every symbol.
Where p(n) is defined as the “inner PN sequence” which is a length T PN sequence, α is defined as the “outer PN sequence” which is a length M PN sequence. A block PN sequence consists of the same PN sequence 53 multiplied by a scalar value 54, where each scalar value is an element of the outer PN sequence.
Decoding a block PN sequence consists of 2 steps. The first step is to create a matched filter structure matched to the inner PN sequence which is called the inner matched filter. The structure of this filter is shown in
In practice, the frequency synchronization approached discussed previously will not perfectly synchronize the transmitter and receiver local oscillator frequency. In order to correct for small frequency offsets between the RFID reader and RFID tag, a modified outer matched filter structure can be used.
In order for the tag to send data to an RFID reader, data is encoded in one of several ways. In one embodiment, the tag sends a block PN sequence multiple times, where the times are selected such that the data is encoded in the absolute or relative times between PN code transmissions. This is similar to pulse position modulation used in standard digital communication systems. In an alternate embodiment, block PN sequences can be sent back to back, where each block is phase shifted to indicate which bit is being sent. Any other standard digital communication technique such as amplitude modulation can also be used to modulate the block PN code.
In many situations it is desirable to be able for the network of RFID readers to locate an RFID tag. In one embodiment, the tag acquires its position through its on board GPS receiver and transmits these coordinates to the nearest RFID reader. In an alternate embodiment, it may be necessary to locate the tag that does not have an on-board GPS receiver, or a tag that has an on-board GPS receiver but does not wish to turn the receiver on in order to save energy. In these cases, it is possible for a network of RFID readers to locate the tag. This invention discloses two methods for locating a tag using a network of RFID readers.
The first method for locating a tag consists of first time synchronizing the network of RFID readers. This can be done using GPS receivers that are integrated into the readers. The GPS receivers are synchronized to the atomic clock on the GPS satellites, and thus using the clock synchronization techniques described in the previous section can time synchronize the network of readers. When a tag signal is decoded at the reader, the reader records the time and reports this to a server. At the server the time of arrivals of the tag signal and the known reader locations are used to compute the tag location. This is called Time Difference of Arrival (TDOA) and is a well-known positioning technique.
In an alternate embodiment the tag location can be estimated even when time synchronization among RFID readers is not possible, or when synchronization cannot be made tight enough such as the case when sub 1 foot resolution is required in an ultra wideband positioning system. The new positioning technique disclosed in this invention is called Asynchronous Time Difference of Arrival and is illustrated in
Each reader will then compute the time difference between the arrival of the tag PN sequence and the arrival of the PN sequences from the other RFID readers. The computations are mathematically described as follows:
Δ13=(t3+t13)−t1,Δ12=(t2+t12)−t1, Reader1
Δ21=(t1+t12)−t2,Δ23=(t3+t23)−t2, Reader2
Δ31=(t1+t13)−t3,Δ12=(t2+t23)−t3, Reader3
The time differences, Δij are sent back to a server that computes the times t1, t2, t3. The computations for these times can be performed in a number of ways; one approach is to use the least squares algorithm to compute these times. It is straightforward to add the deterministic circuit delays for each reader in the above equations, and to extend the algorithm to incorporate more than 3 readers.
A flowchart depicting an embodiment of a tag operation 60 is shown in
It is important to reduce the tag power consumption and interference generated from a tag to an RFID reader that is not the intended receiver. To achieve this goal, a subset of deployed RFID reader locations is downloaded to the tag. In one embodiment, the download can occur when the tag is charging. In an alternate embodiment, the RFID reader transmits the set of locations to the RFID tag. When the tag obtains its location through its GPS chip, it computes the distance to the nearest RFID reader 62. Based on this, as well as potentially using information about terrain, it adjusts its transmit power 63 to the minimal level required for the nearest RFID reader to decode its message and then it sends its message 64. For each message, 62-64 are repeated.
Adjusting the RFID tag output power as a function of distance from the tag to RFID reader may not be very accurate in more heavy built out urban areas, due to the density of buildings. To improve the performance of the RFID tag power control, a learning approach is taken. Initially, each RFID tag can transmit at a fixed transmit power. Each RFID reader receives the tag's location as well as measures the received signal strength (RSS) of the RFID tag's transmit signal. Each set of (location, RSS) pair is stored into a database. The RFID network can thus learn the path loss profile of large regions using this database as it becomes populated with more measurements. To power control an RFID tag, the database is downloaded to the tag's memory. When a tag receives a GPS location, it searches the database for the (location, RSS) pair that has location coordinates that is closest to its location. It then uses the RSS value to adjust its transmit power to minimize the output power yet have a high probability of being heard by the nearest RFID reader.
For applications where it is important to be able to transmit RFID tag data to the RFID reader with high reliably, the RFID reader can transmit an acknowledgement signal back to the RFID tag after the data transmission from the tag. Since the RFID reader may be far away from the tag, it may need to transmit a block PN code to the RFID tag. Although this disclosure has mainly focused on implementing the highly sensitive receiver at the RFID reader, the previously described block PN decoder can also be implemented at the RFID tag. To reduce the decoding complexity, the decoding can be performed in a non real time fashion. This allows the decoding algorithms to be implemented in hardware or software, potentially reducing the implementation cost.
The scope of the present invention is not limited to the presently preferred embodiments disclosed herein. In many cases, the implementation described herein is merely a designer's preference and not a hard requirement. Accordingly, except as they may be expressly so limited, the scope of protection of the following claims is not intended to be limited to the specific embodiments described above. For instance, aspects of the invention that are described as implemented in hardware, such as special-purpose circuits, can be done in software on a general-purpose processor, or vice-versa, or both.
This application claims priority to U.S. Application No. 61/273,660 filed on Aug. 7, 2009, “Wireless asset tracking system” the contents of which are hereby incorporated by reference in their entirety.
Number | Name | Date | Kind |
---|---|---|---|
6411645 | Lee et al. | Jun 2002 | B1 |
6493376 | Harms et al. | Dec 2002 | B1 |
6700931 | Lee et al. | Mar 2004 | B1 |
7492316 | Ameti et al. | Feb 2009 | B1 |
7593383 | Myers | Sep 2009 | B1 |
20050007236 | Lane et al. | Jan 2005 | A1 |
20050275531 | Johnson | Dec 2005 | A1 |
20060109109 | Rajapakse et al. | May 2006 | A1 |
20070013516 | Freitag et al. | Jan 2007 | A1 |
20070126623 | Workman | Jun 2007 | A1 |
20070183370 | Wallace et al. | Aug 2007 | A1 |
20090180518 | Ishii et al. | Jul 2009 | A1 |
20090180524 | Wang et al. | Jul 2009 | A1 |
20090261971 | Viegers et al. | Oct 2009 | A1 |
20100039326 | LeFever et al. | Feb 2010 | A1 |
20110018691 | Park et al. | Jan 2011 | A1 |
20110193958 | Martin et al. | Aug 2011 | A1 |
Number | Date | Country | |
---|---|---|---|
20110032081 A1 | Feb 2011 | US |
Number | Date | Country | |
---|---|---|---|
61273660 | Aug 2009 | US |