The present invention relates to wireless data input devices, particularly relatively low-cost, low data rate wireless data input devices such as computer mice, trackballs, touchpads, keyboards, etc. More specifically, the invention relates to approaches for allowing the coexistence of such collocated wireless devices sharing the same RF channel.
Due to specific design requirements, cost constraints, and international regulations, low-cost, low-data rate user input devices, e.g., mice and keyboards, for use with a host computer, use a limited number of RF channels, very often only one or two. Consequently, especially in an office environment, RF interference generated by collocated devices is potentially a serious problem. Some users of wireless input devices in an office environment complain of coexistence issues which, in the case of a computer mouse or the like, usually manifest as missed button presses.
An exemplary data encoding scheme often utilized for transmission of data by wireless data input devices, such as mouse 1 and keyboard 11, is known as Data Difference Modulation (DDM). The Data Difference Modulation (DDM) scheme consists of four symbols, expressed as the time difference between state transitions. The encoded signal appears as a series of “0”-“1” or “1”-“0” transitions separated in time. Each transition represents a symbol, which is identified by dividing the elapsed time from the preceding transition by the basic time unit. The basic time unit is denoted with T and represents the shortest symbol duration. The time lengths of each symbol are fractional multiples of this basic unit of time.
The following symbols are used in DDM (see also Table 1 below).
This symbol is used to mark the beginning of a data transmission packet. It is assigned the longest time length of all the symbols in the symbol set because it occurs only once per packet. The SYNC symbol also initializes the last bit state to a binary “0” for data difference calculations
This symbol represents a bit that is the complement of the previous bit. If the previous symbol was a SYNC symbol, the bit represented is “1”.
This symbol is used to encode two bits: the first bit is equal and the second bit is the complement of the last bit. If the previous symbol was a SYNC symbol, then the bits represented by this symbol are “01”.
This symbol is used to encode two bits, each equal to the value of the last bit. If the last symbol was a SYNC symbol, the bits represented by this symbol are “00”.
When a finite-length bit stream is DDM encoded, there is a possibility that the last message bit will fall on a new symbol boundary but be of the same value as the last bit (the trailing “same” bit). An ambiguity exists as to which symbol should be used to encode the bit, since both the Same-Different and Same-Same symbols would accurately describe the trailing bit, but each would suggest the existence of an additional bit. This is generally not an issue, because the length of the message to be received is known and the additional bit, if present, can be ignored.
Header and Packet Format
Data packets generally start with a header, e.g., as shown in
As stated above, the data encoding is based on symbol duration and not on symbol level. The logic levels corresponding to the idle state or various symbols cannot be guaranteed. Depending on the specific hardware implementation, the required idle level (i.e., no data to transmit) may be either “Low” or “High,” depending on the specific hardware implementation; for power saving reasons, the idle level should be chosen so that the power drawn from the batteries is negligible. After the last valid transition in the data packet, the DATA line may be either “High” or “Low”. If more data is available to be sent, the transmission continues from this state, with the first header pulse. If no data is available and the transmitter is to be turned OFF, the data line may have to be toggled to the idle state by an extra pulse. This extra pulse, between the last valid transition in the data packet and the return to idle state transition, should be from 0.5 T to T wide. A long pulse is undesirable because it would lengthen the packet and thus have a negative impact on latency and power consumption. The pulse should be long enough to ensure it is transmitted correctly over the radio link; otherwise the receiver could miss it, causing an error in the packet. This pulse does not have to be decoded in the receiver; it simply serves to ensure that a first edge is not missed.
The Logical Layer of the Protocol
The length and format of the useful data block in the packet (the “payload” data) depend on the application's specific requirements and are not directly relevant to the matter discussed here. Besides the payload data, the data packet includes an ID code—a unique address associated with the transmitter and the receiver paired together. The ID code is typically not truly unique, as this would require using a large number of bits. For typical applications, only 8 to 12 bits are used for the ID code. This is enough to ensure that the probability of two collocated devices, e.g., computer mice or keyboards, having the same ID is reasonably low.
When several wireless data input devices are collocated and share the same RF channel, one receiver can receive the “desired” signal (the signal coming from the paired transmitter) but also “perturbations” (signals coming from other collocated transmitters). When a packet is received, the receiver will check packet's ID and decide whether the packet is a perturbation or desired signal. With a typical arrangement, the receiver listens to all the traffic on the RF channel and processes the packets sent on that channel, at least up to the point where the receiver can identify the ID code.
In addition to the ID code, the data block typically includes some kind of checksum or CRC to verify that the received packet has no errors. For relatively simple device applications, such as computer pointing devices and keyboards, simple error detection is usually sufficient and error correction is generally not employed. (Error correction flit would require redundant bits in the data packet and more processing power in the receiver.)
Signal Processing in Receiver
Receiver 5 typically includes a radio and a microprocessor for controlling the radio, decoding the demodulating signal, and interfacing with the host PC. Data decoding in the receiver is done by the microprocessor which measures the demodulated data pulse width and compares the results against some fixed thresholds (e.g., 0.75 T, 1.25 T, 1.75 T, 2.25 T, 2.75 T). Thresholds as mentioned allow for ±0.25 T margin for pulse width error (jitter) across the RF link (this includes pulse generation, RF modulation, propagation over air, RF demodulation, digital data recovery, and pulse width measurement). For example, if the measured pulse width is between 1.25 T and 1.75 T, then the pulse is decoded as 1.5 T wide. If the measured pulse width is less then 0.75 T or larger than 2.75 T, then the current symbol is not a valid symbol.
In the absence of the RF signal, the microprocessor monitors the demodulated data line, waiting for valid header pulses (0.75 T–1.25 T duration). Although, for the example considered above nine header pulses are transmitted, several of the initial pulses (typically, the first one or two) could be missed by the receiver due to transient effects. Consequently, the receiver waits for only several consecutive valid header pulses (e.g., four or five in the example considered here) before starting the packet decoding process.
Once started, the packet decoding continues until a complete packet is received or until an invalid symbol aborts the decoding process. Note that an invalid symbol may be a symbol narrower than 0.75 T or wider than 2.75 T, but also a symbol wider than 2.25 T if contained in the body of the data block (a SYNC pulse in the middle of the data packet is an invalid symbol).
If a complete packet is received, it is checked for errors and ID. Packets with errors or non-matching ID are rejected. If there are no errors and the packet's ID matches the expected ID, then the data is processed and sent to the host. Finally, the microprocessor returns to the waiting state, waiting for a new packet header.
If the packet is aborted due to an invalid symbol, then no action is taken and the microprocessor reinitializes, e.g., returns immediately to the waiting state.
FSK Modulation and the FM Capture Effect
For relatively low cost, low data rate data communication systems, FSK (Frequency Shift Keying) modulation provides the best cost-performance tradeoff. An important advantage of frequency modulation as compared to amplitude modulation is its relative insensitivity to noise and interference. Of particular interest for the subject discussed here is the phenomenon of “capture” in FM receivers: the stronger of two co-channel signals tends to suppress the output from the weaker one, except when the two are almost identical in signal strength. Typically, a difference of 5–8 dB is enough to ensure the weak signal is suppressed.
The capture phenomenon allows simultaneous FM radio links to be established in the same physical area on the same RF channel if the relative positioning of the transmitters and receivers is such that the “desired” signal for each receiver is stronger than the “perturbations”.
The example in
For Receiver #1, Transmitter #1 transmits the desired signal while Transmitter #2 is the perturbation. For Receiver #2, Transmitter #2 transmits the desired signal while Transmitter #1 is the perturbation. If at a given moment, Transmitter #1 is OFF, then Receiver #1 is able to receive and decode the signal transmitted by Transmitter #2 (the perturbation). But of course, because the ID codes are different, Receiver #1 will ignore the packets received from Transmitter #2. When Transmitter #1 is turned ON, if D11<D12, the desired signal at Receiver #1 is stronger than the perturbation and can be received due to the FM capture effect. In conclusion, if D11<D12 and D22<D21, then the desired signal is stronger than the perturbation and both radio links can be operated simultaneously.
The Problem
The FM capture effect discussed above will allow simultaneous links on the same channel, as long as the transmitters transmit continuously. However, if the transmitters are turned OFF when the wireless device is in standby, and turned ON only when data is available (which is desirable, for power saving reasons), the first packet in the RF transmission may be lost if at least one of the collocated transmitters is ON at that moment.
In both of the examples illustrated in
In the first example illustrated in
In the example of
The waveforms shown in
The present invention addresses the above-described problem of interference between collocated wireless devices sharing the same RF channel. According to the invention, a new header format is provided for the first data packet in a transmission. By inclusion of trigger data, e.g., an “invalid” pulse, in the header of each isolated packet, the receiver is caused to reinitialize and is then able to properly process the first packet in the desired transmission.
In a first aspect, the invention is embodied in a wireless data input device system. The system includes an input data generator; a first processor for packetizing input data received from the input data generator into data packets comprising header data and payload data; a transmitter for wirelessly transmitting the data packets; a receiver for receiving the data packets transmitted by the transmitter; and a second processor for processing the data packets received by the receiver. The header data comprises trigger data serving to trigger a reinitialization of the processing of data packets by the second processor.
In a second aspect, the invention is embodied in a method of wireless data packet transmission. The method includes the steps of: generating input data; packetizing the input data into data packets comprising header data and payload data; wirelessly transmitting the data packets; receiving the transmitted data packets; and processing the received data packets. The header data comprises trigger data serving to trigger a reinitialization of the processing of the data packets.
The above and other objects, features and advantages of the present invention will be readily apparent and fully understood from the following detailed description of preferred embodiments, taken in connection with the appended drawings.
An implementation of the present invention in connection with a Data Difference Modulation (DDM) encoding scheme is described by way of example and to provide a discussion frame. For a more detailed discussion of DDM encoding and its advantages relative to other encoding schemes, reference is made to commonly owned Del Castillo et al. U.S. Pat. No. 6,317,714.
The invention may be advantageously applied to various types of wireless data input devices, including but not limited to mouse 1 and computer keyboard 11, which may be used in collocation, i.e., within signal range of each other. In the case of a computer pointing device, the payload data of the transmitted data packets comprise, e.g., data indicative of displacement of the device itself or an operation instrumentality thereof, which is used to control cursor position. The payload data may further be indicative of button press activity and scroll wheel displacement, for example. In the case of a keyboard, the payload data includes, but is not necessarily limited to, data indicative of character and function key-press information.
Various means may be utilized for generating this payload data, as are known in the art. For example, in the case of a computer mouse, an optical controller IC may form part of an optical tracking engine, controlling illumination of a LED light source which is used to illuminate a trackable surface (e.g., a desktop). The IC may also process signals received from an image detector (which may be included as part of the IC) that receives light reflected from the trackable surface. The images may be processed by the IC using spatial correlation to determine relative displacement values, in pixel or sub-pixel intervals. A stream of relative displacement values may be communicated by the IC to a μP of the mouse, for further processing of the signals into data packets used by the host computer to control the movement of a displayed mouse cursor. The μP may also control the RF transmission section of the mouse to transmit the data packets to the host computer.
In a typical implementation, mouse 1 may have right and left buttons and a depressible, rotatable scroll wheel located therebetween. Obviously, mouse I may have more actuators (such as thumb actuation buttons or more finger actuation buttons), fewer actuators (such as only a single button or two buttons) or different types of actuators (such as triggers, rollers, etc.). Mouse 1 may instead be another type of cursor control (pointing) device, such as a trackball or touch pad device.
As another example, in the case of a keyboard as the data input device, the computer industry has largely settled on using a n×m matrix of sense lines/drive lines for carrying out keyboard key switch discrimination. Such a matrix provides a means for an integrated circuit (IC) micro-controller device provided as part of the keyboard to decode (n×m) keyboard keys, with (n+m) electrical interface pins. The micro-controller device sequentially drives a voltage on a plurality of drive lines of the matrix. Keyboard key depression will effect a closure of an associated switch creating an electrical connection between a particular drive line and one of a plurality of sense lines, with the result that the micro-controller device will detect this voltage on the sense line and be able to determine therefrom a corresponding alphanumeric character or function.
Other types of wireless input devices to which the present invention may be applied include gaming devices, pens, tablets, etc.
A processor associated with the wireless data input device, e.g., mouse 1 or keyboard 11, encapsulates the data into packets, and an RF transmitter sends the packets to receiver 5 serially utilizing a known encoding scheme, such as DDM or the other techniques mentioned below. As is well known in the art, each data packet that is transmitted has at its front end a header which identifies the beginning of a new data packet. As has been described, with DDM encoding, the header comprises a series of pulses having a duration T.
In accordance with the invention, a unique header format addresses the problem discussed in Background section. A basic principle of the invention is to introduce, into the first header of a (preferably each) continuous data transmission, a signal component that will trigger reinitialization of the receiver's signal processor. This is done in such a manner that the receiver can restart its processing with a sufficient amount of header data remaining in the desired signal to permit that signal to be properly identified and processed. In this manner, the undesirable drop of an initial data packet (as may otherwise occur with collocated devices, notwithstanding the FM capture effect and use of unique transmission identifying codes) may be avoided. The particular format of the header modification may vary dependent on the encoding scheme that is utilized.
While it is foreseen that the invention will have its most useful application in short range, low data rate, low cost devices employing frequency modulation (FM), the invention is not so limited. Potentially, the invention could be used with any form of modulation, such as amplitude modulation (AM) or phase modulation (PM). PM is to some extent similar to FM, but AM systems do not benefit from the capture effect, so the desired transmitter would generally have to be much closer to the receiver than the sources of perturbation, in order to allow for simultaneous radio links. Even so, the same basic principle will work in this case too.
As a result of the above-described header modification, the length of the first packet is increased by 2 T. This is normally not of significant consequence, as the additional RF latency and power consumption is minimal. As an alternate approach, two pulses can be eliminated (usually, without any negative effect) from the header of the first packet to keep the same packet length. The basic idea here is to start the header of every isolated packet with a pulse that causes the receiver to reinitialize (i.e., an “invalid” pulse). Placing the invalid pulse after the first two header pulses allow the transient regime in the receiver to stabilize, so that the receiver can process correctly the invalid 3 T pulse. If necessary, more than two pulses can be placed before the invalid pulse to allow the transient regime in the receiver to stabilize, although this would lengthen the data packet.
In the example shown in
Various pulse durations or other signal characteristics which are resolvable as an error condition, or a reinitialization flag, may be utilized as the “invalid” pulse, depending on the particular encoding scheme and RF transmission system being utilized. As applied to a DDM encoding scheme, a pulse duration of 3 T can be easily recognized as an invalid pulse, without extending the header length substantially. Alternatively, a 0.5 T pulse may be utilized as the invalid pulse, as shown in
It will be understood that the principles of the invention are applicable to various other encoding techniques, including but not limited to NRZ encoding and the encoding schemes described in commonly owned Odinak et al. U.S. Pat. No. 6,144,291. With respect to the Manchester II and Miller encoding techniques mentioned in the background section of the '291 patent, assuming the bit time is “T”, then the longest time between two subsequent transitions is T (Manchester II) or 2 T (Miller). In these cases, e.g., the invalid symbol could be 2 T (Manchester II) or 3 T (Miller). When NRZ encoding is used, synchronization may be lost after a long string of ones or zeros. To prevent this, after a given number of consecutive ones or zeros, the other bit is inserted in the data sequence to force a transition. As an example, assume that a transition is forced after four consecutive identical bits. In this case, a 5 T symbol could be used as the invalid symbol. The same idea could be used for NRZI encoding (NRZI=non return to zero invert; a “1” is represented by no change in level and a “0” is represented by a change in level). A string of ones causes long periods with no transition in the data. In order to ensure adequate signal transitions, a “bit stuffing” technique similar to that employed with NRZ encoding is employed by the transmitting device. A zero is inserted after every “N” consecutive ones in the data stream before the data is NRZI encoded, to force a transition in the NRZI data stream. (Of course, the receiver must recognize the stuffed bits and discard them.) In this case, a symbol which is (N+1)*T long can be used as the invalid symbol.
The present invention has been described in terms of preferred and exemplary embodiments thereof. Numerous other embodiments, modifications and variations within the scope and spirit of the appended claims will occur to persons of ordinary skill in the art from a review of this disclosure.
Number | Name | Date | Kind |
---|---|---|---|
4099437 | Stavrou et al. | Jul 1978 | A |
4124778 | Amass et al. | Nov 1978 | A |
4422171 | Wortley et al. | Dec 1983 | A |
4578674 | Baker et al. | Mar 1986 | A |
4631695 | Kozlik et al. | Dec 1986 | A |
4752841 | Syracuse et al. | Jun 1988 | A |
4754268 | Mori | Jun 1988 | A |
5001653 | Buchanan et al. | Mar 1991 | A |
5440502 | Register | Aug 1995 | A |
5537414 | Takiyasu et al. | Jul 1996 | A |
5541621 | Nmngani | Jul 1996 | A |
5677918 | Tran et al. | Oct 1997 | A |
5786983 | Brenner et al. | Jul 1998 | A |
5861822 | Park et al. | Jan 1999 | A |
5886686 | Chen | Mar 1999 | A |
5920306 | Kikinis | Jul 1999 | A |
5958023 | Klein | Sep 1999 | A |
6144291 | Odinak et al. | Nov 2000 | A |
6172972 | Birdwell et al. | Jan 2001 | B1 |
6304250 | Yang et al. | Oct 2001 | B1 |
6317714 | Del Castillo et al. | Nov 2001 | B1 |
6335933 | Mallory | Jan 2002 | B1 |
6421387 | Rhee | Jul 2002 | B1 |
6476795 | Derocher et al. | Nov 2002 | B1 |
6680955 | Le | Jan 2004 | B1 |
6684337 | Kuo et al. | Jan 2004 | B1 |
6907460 | Loguinov et al. | Jun 2005 | B2 |
7031945 | Donner | Apr 2006 | B1 |
20020107830 | Nanja | Aug 2002 | A1 |
20030106067 | Hoskins et al. | Jun 2003 | A1 |
20030210662 | Rensberger et al. | Nov 2003 | A1 |
Number | Date | Country | |
---|---|---|---|
20030210662 A1 | Nov 2003 | US |