Efficient error correction scheme for data transmission in a wireless in-band signaling system

Information

  • Patent Grant
  • 8418039
  • Patent Number
    8,418,039
  • Date Filed
    Tuesday, July 13, 2010
    14 years ago
  • Date Issued
    Tuesday, April 9, 2013
    11 years ago
Abstract
In one example, a mobile device segments a payload for transmission to a remote server and provides redundant data for each payload segment. The remote server examines the received payload on a per segment basis using the redundant data to identify segments associated with errors. The server then requests error correction bits for the identified segments using one or more exchanges with the mobile device. Thereafter, the server can perform error correction using the received error correction bits and then request re-transmission of the payload, if needed.
Description

This application is a non-provisional of U.S. Provisional Application No. 61/230,930 filed on Aug. 3, 2009, entitled: EFFICIENT ERROR CORRECTION SCHEME FOR DATA TRANSMISSION IN A WIRELESS IN-BAND SIGNALING SYSTEM which is herein incorporated by reference in its entirety.


COPYRIGHT NOTICE

©2009 Airbiquity, Inc. A portion of the disclosure of this patent document contains material which 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 file or records, but otherwise reserves all copyright rights whatsoever. 37 CFR §1.71(d).


BACKGROUND OF THE INVENTION

Wireless telecommunication coverage has become nearly ubiquitous in much of the world, especially in industrialized countries. In some developing countries as well, whole regions that lack traditional copper-wired telecom infrastructure have skipped over that technology to deploy wireless instead. Modern wireless networks provide a range of voice and data services. Technical details of those services can be found in many places, for example, the 3GPP standards group web site www.3gpp.org.


Some wireless data services, however, are slow, and coverage is spotty. “SMS” (short message service) is one example. Wireless voice services, by contrast, tend to be of generally good quality and are available almost everywhere people travel. Therefore, voice services are a good choice where reliable, broad coverage is important, for example in the implementation of emergency services, such as requests for police, fire, medical or other emergency services. When people are traveling, especially in motor vehicles, effective wireless communication to reach emergency services is essential.


We refer to “in-band” communications as meaning in the voice channel, as distinguished from a data channel, control channel or other non-voice wireless service. Importantly, voice channels, although optimized for efficient transmission of actual human voice traffic, in fact can be used to transmit relatively small amounts of data as well (e.g., tens or hundreds of bits, rather than megabits.) Voice channels are characterized by special performance characteristics. For example, only a relatively narrow range of audio frequencies needs to be transceived, based on the normal human voice. In fact, sophisticated compression and coding techniques are known to enable sending and receiving human voice very efficiently over digital wireless networks. However, these voice coders or “vocoders”—typically implemented in software, DSP chips and the like—do not transmit non-voice sounds well at all. To the contrary, they are carefully designed to filter out non-voice signals.



FIG. 1 is a simplified block diagram illustrating the typical speech path for a wireless voice call; i.e., a telephone call over the wireless telecommunications network. Analog voice signals from a microphone are digitized by an A/D converter, and then fed to a vocoder encoding algorithm (at 8000 samples/sec). The encoder produces packets of compressed data (typically one packet per 20-ms frame of audio) and feeds this data stream to a radio transceiver. On the other side, a radio receiver passes the packets to the decoding algorithm, which then reconstructs (imperfectly) the original voice signal as a PCM stream. This PCM stream is eventually converted back into an analog voltage which is then applied to a speaker.


Using this type of system, modest amounts of data (here we mean user data, not vocoder speech data) can be transmitted “in-band” through careful selection of frequencies, timing, and the use of special techniques that “trick” a vocoder into transmitting information by making that information “look like” human voice data. This type of data communication, using the voice channel of a wireless system, is sometimes called “in-band signaling.” It can be implemented in hardware and or software referred to as an “in-band signaling modem,” borrowing the old modem term (modulator-demodulator) familiar in traditional “land line” telecommunications.


Several issued patents disclose in-band signaling technology that communicates digital data over a voice channel of a wireless telecommunications network. In one example, an input receives digital data. An encoder converts the digital data into audio tones that synthesize frequency characteristics of human speech. The digital data is also encoded to prevent voice encoding circuitry in the telecommunications network from corrupting the synthesized audio tones representing the digital data. An output then outputs the synthesized audio tones to a voice channel of a digital wireless telecommunications network. In some cases, the data carrying “tones” are sent along with simultaneous voice. The tones can be made short and relatively unobtrusive. In other implementations, sometimes called “blank and burst,” the voice is cut off while data is transmitted through the voice channel. In still other implementations, portions of the audio frequency spectrum are used for voice, while other portions are reserved for data. This aides in decoding at the receiving side.


Today, many vehicles have some capability for communications over a wireless networks. We refer to these vehicle systems as a telematics client system. FIG. 2 is a simplified block diagram of an illustrative In-Vehicle System (IVS). It shows an example of the relevant portion of a typical telematics client system. This client system consists of embedded hardware and software designed to operate in an automobile environment.


In FIG. 2, the telematics software includes a “customer application,” which may be almost any application, in particular one that employs data transfer via the wireless network. For example, the customer application may relate to navigation or entertainment. In operation, the customer application conveys data (preferably data packets) to an in-band signaling modem. The in-band modem converts the data (along with packet headers and other overhead as appropriate) into audio frequency tones. The audio “data tones” are encoded, much like voice content, and transmitted to a remote receiver.


As in any communication system, errors can occur in the process of in-band signaling. Detection and correction of errors is challenging in the context of in-band signaling because the transfer bandwidth is very low. Typically, the amounts of data transferred (payload size) are small, on the order of tens or hundreds of bytes. Accordingly, adding significant overhead for error detection and or correction is difficult in this already narrow-band environment. A need remains for highly efficient forward error correction methods for use in in-band signaling data communication systems.


SUMMARY OF THE INVENTION

The following is a summary of the invention in order to provide a basic understanding of some aspects of the invention. This summary is not intended to identify key/critical elements of the invention or to delineate the scope of the invention. Its sole purpose is to present some concepts of the invention in a simplified form as a prelude to the more detailed description that is presented later.


In one example, a mobile device segments a payload for transmission to a remote server and provides redundant data for each payload segment. The remote server examines the received payload on a per segment basis using the redundant data to identify segments associated with errors. The server then requests error correction bits for the identified segments using one or more exchanges with the mobile device. Thereafter, the server can perform error correction using the received error correction bits and then request re-transmission of the payload, if needed. Additional aspects and advantages of this invention will be apparent from the following detailed description of preferred embodiments, which proceeds with reference to the accompanying drawings.





BRIEF DESCRIPTION OF THE DRAWINGS


FIG. 1 is a simplified block diagram illustrating the typical speech path for a wireless voice call.



FIG. 2 is a simplified block diagram of an illustrative In-Vehicle System (IVS) with an embedded mobile phone module.



FIG. 3 illustrates one example of a system using an efficient error correction scheme for an in-band signaling exchange.



FIG. 4 is a flow chart illustrating operation of the mobile device shown in FIG. 3.



FIG. 5 is a flow chart illustrating operation of the mobile device shown in FIG. 3.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS


FIG. 3 illustrates one example of a system using an efficient error correction scheme for an in-band signaling exchange.


The system 100 includes a mobile device 1 configured to operate an efficient error correction scheme over a voice band connection with the server 2. The software 8B identifies where additional error correction bits are likely to be needed to correct errors in the payload on a per segment basis using the error correction bits 13 and 15 attached thereto. The software 8B then requests 17 from the software 8A a subsequent transmission over the voice band connection of additional error correction overhead 18 for identified segments. These subsequent transmissions are sent prior to performing re-transmissions, a term generally used to refer to re-transmitting the payload data to which the error correction bits correspond.


This error correction scheme allows an administrator or designer to make aggressive assumptions about the underlying network between the MS modems 5 when setting the default for error correction overhead, without compromising the ultimate reliability of communications between the mobile device 1 and the server 2. This is particularly useful in combination with in-band signaling, where the underlying wireless networks that provide the nearly ubiquitous coverage for the in-band signaling use a wide variety of vocoders (and other signal processing components) that process signals in different ways.


To better understand why this error correction scheme is particularly useful in combination with in-band signaling, consider the conventional design tradeoffs made by an administrator or designer when setting a default amount of error correction overhead to go with the initial transmission of the payload in an in-band signaling context. Since the administrator or designer does not know beforehand all the vocoder combinations that could be operating between the IBS modems 5, the administrator or designer may use conservative default settings, e.g. high error correction overhead, to provide reliability in the majority of scenarios. However, the tradeoff for high error correction overhead as a default is that this high overhead will consume a significant portion of the relatively small available bandwidth in the voice band, adding latency to calls, which may not be needed in many of the scenarios. As a result, the default amount of error correction chosen by the administrator or designer is ultimately an undesirable compromise between reliability, latency, and available bandwidth.


Re-transmission schemes, e.g. where the payload is re-transmitted, can provide a partial solution to this problem; however, these schemes, if overly relied upon, can utilize too much of the relatively low bandwidth available in the voice band (by constantly re-transmitting the payload). Other existing re-transmission schemes can consume too much of the bandwidth of the relatively narrow voice band.


In contrast, the error correction scheme in system 100 allows the administrator or design to utilize relatively low error correction overhead by default, while still providing reliability in most scenarios. This is because the software 8A is configured to segment the payload of the packet (namely the packet having the header 11, the redundant data 13/15/16, and the payload data 12/14 to which the redundant data corresponds), and the software 8B is configured to request additional error correction to correct received/demodulated bits on a per segment basis. Where this initially transmitted overhead is not sufficient given a particular scenario, additional error correction bits can be particularly requested using subsequent transmission.


As compared to re-transmissions, e.g. of the payload data corresponding to the error correction bits, these subsequent transmissions may consume a relatively small amount of bandwidth. Of course, even in cases where these subsequent transmissions are large, such error correction scheme is generally a more effective use of bandwidth on a per-bit-basis for purposes of resolving transmission errors than re-transmitting the payload data. As will be described later in greater detail, re-transmission of the payload data 12/14 can be performed if an analysis of the entire packet according to the appended error detection bits 16 detects errors remaining after the exchange between the software 8A and 8B. In any case, if the system 100 does use re-transmissions after the transmitting of the additional error correction bits 18, it should be apparent that, due to the request(s)/response(s) 17/18, such re-transmissions will be needed less often in the system 100 than conventional systems utilizing a same default amount of error correction bits.


The server 2 described above operates in an Internet Protocol (IP) network in communication with a telecommunications network of the mobile device 1. In other examples, the server 2 can operate in any network in communication with the telecommunications network of the mobile device 1. The mobile device can be part of an In-Vehicle System (IVS) or any other type of mobile device capable of communicating with a wireless telecommunications network.


It should be apparent the principles described above can be utilized in other environments besides in-band signaling systems. For example, the principles described above are particularly useful in any environment where bandwidth is limited.



FIG. 4 is a flow chart illustrating operation of the mobile device shown in FIG. 3.


Referring to FIG. 3 and FIG. 4, in block 401, the mobile device 1 segments a payload containing non-voice data into fragments. In one example, the payload contains 200 or 300 bytes of data, which is divided into smaller segments, for example 10 or 12 bytes per segment, for a total of approximately 20 payload segments.


The mobile device 1 calculates error detection bits, for example Cyclic Redundancy Check (CRC) bits, and attaches such error detection bits to the end of the payload in block 402. The mobile device 1 calculates error correction bits, for example Forward Error Correction (FEC) bits and attaches such error correction bits corresponding to each segment to a respective one of the segments in block 403. It should be understood that the error correction bits do not necessarily need to be appended to their respective segment as shown in FIG. 3 and described in FIG. 4 as long as there is a mechanism for the receiver to associate the error correction bits with a respective segment. In block 404, the mobile device 1 attaches a header to the payload, forming a packet. It should be understood the processes 401-404 can occur in any order.


In block 405, the mobile device 1 uses its IBS modem to modulate the assembled packet into an in-band audio signal. The mobile device 1 transmits the modulated signals in block 406.


In block 407, the mobile device 1 determines whether it has received back any requests for additional error correction bits corresponding to one or more of the payload segments. If the mobile device 1 has received back such a request, in block 408 the mobile device 1 modulates and transmits additional error correction bits for segment(s) identified by the request(s). These transmissions include only redundant data, e.g. additional error correction bits, not the payload itself. Typically, these additional error correction bits will correspond to only a selected subset (selected by the server based on an analysis of the error correction bits in the original transmission) of the payload.


In any of the instances where the server 2 identifies segments to the mobile device 1 (or visa versa), such identification can be made in any fashion, such as using serial numbers assigned to the segments by the mobile device 1 when originally segmenting the payload.


In block 409, the mobile device 1 determines whether re-transmissions are needed. This typically includes determining whether a request is received to re-transmit some or all of the packet (this request is generated by the server and discussed in more detail with reference to FIG. 5). If the re-transmissions are for only some of the packet, such portions can be designated by identifying the corresponding segments, as discussed previously.



FIG. 5 is a flow chart illustrating operation of the server shown in FIG. 3.


Referring to FIG. 3 and FIG. 5, in block 501 the server 2 receives and demodulates audio tones into data having a plurality of payload segments with corresponding error correction bits using an MS modem. The payload segments correspond to a same packet having a header and a payload, and typically this packet is appended with error detection bits as well.


In block 502, the server 2 analyzes the error correction bits on a per segment basis. This includes examining a segment using the error correction bits corresponding to that segment to determine if bit corrections can be made.


With FEC and other error correction schemes, a bit correction does not necessarily indicate that all errors have been corrected. Typically, the more bit corrections are made, the greater the likelihood that the segment will contain uncorrected errors even after the bit correction; therefore, additional error correction bits can be requested for those segments reaching a threshold amount of error correction (this threshold can be any error correction in some examples). This threshold can be adjusted during operation according to whether subsequent error detection using the error detection bits (such as CRC bits) indicates errors or not. For example, the threshold may need to be reduced if previous error detection analyses resulted in too much re-transmission of the payload segments. The threshold can be set according to a number of corrections per segment, a percentage of corrected bits in the segment relative to total bits in the segment, a scheme that considers the position of the corrected bits adjacent to each other or relative to the ends of the segments, etc.


If any segments are identified as requiring more than a threshold amount of error correction in diamond 503, then in block 504 the server 2 requests additional error correction for the identified payload segments. In block 505, the server 2 uses the IBS modem to demodulate an in-band audio signal. In block 506, the server 2 corrects the identified payload segments according to the additional error correction bits.


It should be understood that the blocks 504-506 can be repeated any number of times before continuing to block 507. For example, the server 2 can re-examine identified segments using the additional error correction bits. According to this re-examination, the server 2 can request yet further error correction bits for any ones of these identified segments. In one example, the further error corrections bits are requested for any segment associated with more errors during the re-examination than the previous examination, which is an indication that the further error correction bits could yield even more corrections. This process could keep repeating until the most newly received error correction bits yield no addition errors with respect to a previous error correction.


In block 507, the server 2 performs error detection for the entire payload using error detection bits included in the original transmission. In block 508, the server 2 determines whether re-transmissions are needed. It should be understood that deferring any re-transmission of the payload data until completing the exchange discussed above can preserve bandwidth because such re-transmissions often will not be needed after completing the exchange discussed above.


Block 508 typically involves the server 2 performing error correction on all received segments using the initially transmitted error correction bits and the subsequently transmitted error correction bits (whether these subsequent transmissions are a single subsequent transmission or a series of subsequent transmissions). After performing error correction using the initially transmitted error correction bits and the subsequently transmitted error correction bits, the server 2 performs error detection on the entire payload using the error detection bits from the initial transmission. If the error detection on the entire payload indicates errors, the server 2 can generate a request for the mobile device 1 to re-transmit some or all of the payload. If the re-transmission is requested, the server 2 may exploit “time diversity”, which is explained in more detail in commonly-assigned application Ser. No. 11/442,705 filed May 26, 2006 and incorporated herein by this reference.


In the example described with references to FIGS. 3-5, the transmitter side segments a payload prior to transmission, which allows requests for redundant data to be made on a per-segment basis. In some examples, the per-packet payload is small enough that the segmenting discussed above provides fewer advantages. In such cases, the transmitter side may not perform segmenting and the receiver side can make requests for redundant data on a per-payload basis. Or, if a segmenting algorithm is still used in such cases, the small payloads make be no larger than the segment size, causing segmenting to result in a single segment per payload. The single segment is still associated with an identifier and the receiver side could still use such identifier to make requests for redundant data on a per-segment basis.


In the example described with reference to FIGS. 3-5, the initial transmission includes error correction bits associated with each segment and error detection bits for the entire payload. In other examples, there may be separate error detection bits associated with each segment in addition to, or instead of, the error correction bits for each segment. Subsequent transmissions provide error correction bits on a per segment basis.


The term “error correction bits” refers to any type of redundant data that can be used to correct errors occurring during transfer of the payload. A non-exhaustive list of examples includes FEC, Reed-Solomon error correction, etc. It should be understood that the error correction bits associated with each segment perform the error detection function in diamond 503 based on a threshold amount of error correction. The term “error detection bits” refers to any type of redundant data used for detecting errors occurring during transfer of the payload. A non-exhaustive list of examples types of error detection schemes includes parity schemes, checksum schemes, cyclic redundancy checks, etc. Many types of redundant data may be used for both error correction and error detection.


It should be understood that, in either of the above examples, there may be a series of per segment requests for error correction bits. For example, a first request or group of requests may be used to obtain error correction bits for a subset of the segments. Error identification can be repeated using the requested error correction bits, and if needed, a second request or group of requests for additional error correction bits can be sent. The second request or group of requests can be for the same subset of segments, or a reduced subset of segments.


The amount of error correction bits can be increased (per segment) at each successive request/response exchange. In such an example, the system gradually escalates the number of overhead bits transmitted via the in-band modem, so that overhead is minimized when the environment and system characteristics permit relatively error-free reception. On the other hand, as and when necessary, the overhead bits will “scale up” to meet the needs of a more challenging (error prone) environment. In this way, more efficient use of limited bandwidth can be achieved.


Also, in the example above, the request/response exchanges provided only redundant data for the identified segments of the packet. In other examples, the request/response exchanges could also re-transmit the segment itself with the request redundant data, and the error correction using the requested redundant data could be applied to the re-transmitted segment. It should be apparent that this example, while consuming greater bandwidth than the example above in many scenarios, can still realize bandwidth savings as compared to traditional re-transmission schemes that re-transmit entire packet communications.


In any of the examples discussed above, if successive request/response exchanges are used, there can be any number of request/response exchanges. The server can send as many requests as needed to correct errors, or the server can perform up to a fixed number of request/response exchanges and then fall back to re-transmission of the payload if uncorrected errors remain. Or, the server can perform as many request/response exchanges as needed until a predefined time period ends, and then fall back to re-transmission of the payload if uncorrected errors remain.


It will be obvious to those having skill in the art that many changes may be made to the details of the above-described embodiments without departing from the underlying principles of the invention. The scope of the present invention should, therefore, be determined only by the following claims.


Most of the equipment discussed above comprises hardware and associated software. For example, the typical mobile device or server is likely to include one or more processors and software executable on those processors to carry out the operations described. We use the term software herein in its commonly understood sense to refer to programs or routines (subroutines, objects, plug-ins, etc.), as well as data, usable by a machine or processor. As is well known, computer programs generally comprise instructions that are stored in machine-readable or computer-readable storage media. Some embodiments of the present invention may include executable programs or instructions that are stored in machine-readable or computer-readable storage media, such as a digital memory. We do not imply that a “computer” in the conventional sense is required in any particular embodiment. For example, various processors, embedded or otherwise, may be used in equipment such as the components described herein.


Memory for storing software again is well known. In some embodiments, memory associated with a given processor may be stored in the same physical device as the processor (“on-board” memory); for example, RAM or FLASH memory disposed within an integrated circuit microprocessor or the like. In other examples, the memory comprises an independent device, such as an external disk drive, storage array, or portable FLASH key fob. In such cases, the memory becomes “associated” with the digital processor when the two are operatively coupled together, or in communication with each other, for example by an I/O port, network connection, etc. such that the processor can read a file stored on the memory. Associated memory may be “read only” by design (ROM) or by virtue of permission settings, or not. Other examples include but are not limited to WORM, EPROM, EEPROM, FLASH, etc. Those technologies often are implemented in solid state semiconductor devices. Other memories may comprise moving parts, such as a conventional rotating disk drive. All such memories are “machine readable” or “computer-readable” and may be used to store executable instructions for implementing the functions described herein.


A “software product” refers to a memory device in which a series of executable instructions are stored in a machine-readable form so that a suitable machine or processor, with appropriate access to the software product, can execute the instructions to carry out a process implemented by the instructions. Software products are sometimes used to distribute software. Any type of machine-readable memory, including without limitation those summarized above, may be used to make a software product. That said, it is also known that software can be distributed via electronic transmission (“download”), in which case there will typically be a corresponding software product at the transmitting end of the transmission, or the receiving end, or both.


Having described and illustrated the principles of the invention in a preferred embodiment thereof, it should be apparent that the invention may be modified in arrangement and detail without departing from such principles. We claim all modifications and variations coming within the spirit and scope of the following claims.

Claims
  • 1. A memory device having instructions stored thereon that, in response to execution by a processing device, cause the processing device to perform operations comprising: recovering digital data from a voice band of a wireless telecommunications network, said recovering including demodulating audio tones from the voice band using an in-band signaling modem, wherein the digital data comprises a packet having a header and a payload, wherein the payload includes a plurality of segments each having redundant data corresponding thereto;examining the segments using their corresponding redundant data and identifying one(s) of the segments that are associated with error(s);transmitting a signal responsive to identifying the one(s) of the segments that are associated with the error(s);responsive to the transmitting the signal identifying the one(s) of the segments that are associated with the error(s), subsequently recovering additional digital data from the voice band of the wireless telecommunications network, said subsequent recovering including demodulating additional audio tones from the voice band using the in-band signaling modem, wherein the additional digital data comprises error correction bits;correcting the payload of the packet using the error correction bits;receiving via the voice band of the wireless telecommunications network a plurality of identifiers, each identifier corresponding to a different one of the segments of the plurality of segments;inserting into the signal only those identifiers of the recovered plurality of identifiers that correspond to the identified one(s) of the segments; andsubsequently recovering the additional digital data from the voice band of the wireless telecommunications network responsive to transmitting the signal containing only those identifiers of the recovered plurality of identifiers that correspond to the identified one(s) of the segments.
  • 2. The memory device of claim 1, wherein the operations further comprise: performing bit correction on the identified one(s) of the segments using respective ones of the error correction bits to identify any such segments that correspond with an increase in associated error(s); andgenerating and sending a request for additional error correction bits for the identified one(s) of the segments having the increase in the associated error(s).
  • 3. The memory device of claim 2, wherein the operations further comprise: repeating bit correction using the most recently received error correction bits as well as the generating and sending in response thereto until a current correction indicates no new error(s) with respect to a previous correction; andexamining a result of the repetition using error detection bits received with the packet to determine whether there are uncorrected error(s) remaining.
  • 4. The memory device of claim 1, wherein the operations further comprise: when error(s) are discovered, deferring any requests for re-transmission of content to which the error correction bits correspond until receiving a series of responses to a series of requests for additional error correction bits.
  • 5. The memory device of claim 4, wherein the series of responses provide gradually increasing amounts of error correction information for a particular one of the segments.
  • 6. The memory device of claim 1, wherein the error correction bits comprise Forward Error Correction (FEC) information.
  • 7. The memory device of claim 6, wherein the operations further comprise: examining the corrected payload using error detection bits included with the packet to determine whether there are uncorrected error(s) remaining; andrequesting re-transmission of the payload if the examination using the error detection bits indicates uncorrected error(s) remaining.
  • 8. The memory device of claim 7, wherein the error detection bits comprise Cyclic Redundancy Check (CRC) information.
  • 9. The memory device of claim 1, wherein said redundant data comprises at least one of error detection bits and error correction bits.
  • 10. A memory device having instructions stored thereon that, in response to execution by a processing device, cause the processing device to perform operations comprising: generating redundant data corresponding to each segment of a segmented packet payload;modulating the segmented packet payload and the generated redundant data using an In-Band Signaling (IBS) modem and transmitting signals resulting therefrom over a voice band of a wireless telecommunications network;receiving back a response requesting error correction bits for an identified segment;modulating the error correction bits for the segment identified in the request and transmitting signals resulting therefrom over the voice band of the wireless telecommunications network;transmitting via the voice band of the wireless telecommunications network a plurality of identifiers, each identifier corresponding to a different one of the segments of the segmented packet payload;examining the received response to ascertain which one(s) of the plurality of identifiers is included therein; andmodulating the error correction bits for the segment identified in the request responsive to ascertaining which one(s) of the plurality of identifiers is included in the received response.
  • 11. The memory device of claim 10, wherein the operations further comprise: after transmitting the signals resulting from the modulation of the error correction bits, receiving back another response requesting additional error correction bits for a subsequently identified segment; andmodulating the additional error correction bits for the subsequently identified segment and transmitting signals resulting therefrom over the voice band of the wireless telecommunications network.
  • 12. The memory device of claim 11, wherein the additional error correction bits corresponding to the segment comprise more information than the error correction bits corresponding to the segment.
  • 13. The memory device of claim 11, wherein the operations further comprise: generating reference identifiers for all the segments and transmitting information mapping the generated reference identifiers with their associated segments along with the segmented packet payload.
  • 14. The memory device of claim 13, wherein the request identifies the portion of the segments using the reference identifiers.
  • 15. A method, comprising: recovering digital data from a voice channel of a wireless telecommunications network, said recovering including demodulating audio tones from the voice band using an in-band signaling modem, wherein the digital data comprises a packet having a header and a payload, wherein the payload includes data and redundant data corresponding thereto;examining the payload using the corresponding redundant data to identify a portion of the payload as being associated with error(s);generating and sending a request for error correction bits for the identified portion;responsive to sending the request for the error correction bits for the identified portion, subsequently recovering additional digital data from the voice band of the wireless telecommunications network, said subsequent recovering including demodulating additional audio tones from the voice channel using the in-band signaling modem, wherein the additional digital data comprises error correction bits;correcting the payload using the error correction bits;receiving via the voice channel of the wireless telecommunications network a plurality of identifiers, each identifier corresponding to a different segment of the packet;inserting into the request only those identifiers of the recovered plurality of identifiers that correspond to segment(s) of the identified portion; andsubsequently recovering the additional digital data from the voice channel of the wireless telecommunications network responsive to sending the request containing only those identifiers of the recovered plurality of identifiers that correspond to the segment(s) of the identified portion.
  • 16. The method of claim 15, further comprising generating and sending the request for the error correction bits for only a subset of the payload.
  • 17. The method of claim 15, further comprising: detecting error(s) in the corrected payload using error detection bits included in the packet; andif error(s) are detected, requesting re-transmission of the packet.
  • 18. The method of claim 15, wherein the redundant data comprises Forward Error Correction (FEC) information or Cyclic Redundancy Check (CRC) information.
  • 19. A method, comprising: generating redundant data corresponding to a packet payload;modulating a packet containing the payload data and the redundant data using an In-Band Signaling (IBS) modem and transmitting initial signals resulting therefrom over a voice channel of a wireless telecommunications network;receiving back a response requesting error correction bits for an identified portion of the payload data;modulating the error correction bits for the identified portion of the payload data and transmitting signals resulting therefrom over the voice channel of the wireless telecommunications network;transmitting via the voice channel of the wireless telecommunications network a plurality of identifiers, each identifier corresponding to a different segment of the packet payload;examining the received response to ascertain which one(s) of the plurality of identifiers is included therein; andmodulating the error correction bits for the identified portion responsive to ascertaining which one(s) of the plurality of identifiers is included in the received response.
  • 20. The method of claim 19, wherein the redundant data comprises error correction information or error detection information.
  • 21. The method of claim 19, further comprising: performing a series of transmissions providing Forward Error Correction (FEC) bits for a particular portion of the payload data, wherein each transmission increments the number of FEC bits included therein for the particular payload data.
  • 22. The method of claim 19, wherein the initially transmitted signals represent both payload data and the redundant data, and wherein the subsequently transmitted signals represent only redundant data, and the method further comprises: transmitting signals representing the payload data after providing the error correction bits.
US Referenced Citations (450)
Number Name Date Kind
3742197 Pommerening Jun 1973 A
3742463 Haselwood Jun 1973 A
3971888 Chiang Jul 1976 A
3984814 Bailey, Jr. Oct 1976 A
3985965 Field Oct 1976 A
4158748 En Jun 1979 A
4218654 Ogawa Aug 1980 A
4310722 Schaible Jan 1982 A
4355310 Belaigues Oct 1982 A
4368987 Waters Jan 1983 A
4494114 Kaish Jan 1985 A
4494211 Schwartz Jan 1985 A
4539557 Redshaw Sep 1985 A
4577343 Oura Mar 1986 A
4595950 Lofberg Jun 1986 A
4598272 Cox Jul 1986 A
4599583 Shimozono Jul 1986 A
4607257 Noguchi Aug 1986 A
4630301 Hohl Dec 1986 A
4641323 Tsang Feb 1987 A
4651157 Gray Mar 1987 A
4656463 Anders Apr 1987 A
4675656 Narcisse Jun 1987 A
4685131 Horne Aug 1987 A
4750197 Denekamp Jun 1988 A
4754255 Sanders Jun 1988 A
4766589 Fisher Aug 1988 A
4776003 Harris Oct 1988 A
4817089 Paneth Mar 1989 A
4831647 D'Avello May 1989 A
4860336 D'Avello Aug 1989 A
4914651 Lusignan Apr 1990 A
4918425 Greenberg Apr 1990 A
4918717 Bissonnette Apr 1990 A
4926444 Hamilton May 1990 A
4941155 Chuang Jul 1990 A
4965821 Bishop Oct 1990 A
4977609 McClure Dec 1990 A
4984238 Watanabe Jan 1991 A
5014344 Goldberg May 1991 A
5025455 Nguyen Jun 1991 A
5036537 Jeffers Jul 1991 A
5040214 Grossberg et al. Aug 1991 A
5043736 Darnell et al. Aug 1991 A
5081667 Drori Jan 1992 A
5095307 Shimura Mar 1992 A
5119403 Krishnan Jun 1992 A
5119504 Durboraw, III Jun 1992 A
5134644 Garton Jul 1992 A
5155689 Wortham Oct 1992 A
5191611 Lang Mar 1993 A
5201071 Webb Apr 1993 A
5203012 Patsiokas Apr 1993 A
5208446 Martinez May 1993 A
5212831 Chuang May 1993 A
5214556 Kilbel May 1993 A
5218618 Sagey Jun 1993 A
5223844 Mansell Jun 1993 A
5227776 Starefoss Jul 1993 A
5235633 Dennison Aug 1993 A
5245634 Averbuch Sep 1993 A
5245647 Grouffal Sep 1993 A
5272747 Meads Dec 1993 A
5282204 Shpancer Jan 1994 A
5289372 Guthrie Feb 1994 A
5301353 Borras Apr 1994 A
5301359 Van Den Heuvel Apr 1994 A
5305384 Ashby, III Apr 1994 A
5317309 Vercellotti May 1994 A
5331635 Ota Jul 1994 A
5333175 Ariyavisitakul Jul 1994 A
5334974 Simms Aug 1994 A
5347272 Ota Sep 1994 A
5363375 Chuang Nov 1994 A
5363376 Chuang Nov 1994 A
5365450 Schuchman Nov 1994 A
5365577 Davis Nov 1994 A
5379224 Brown Jan 1995 A
5381129 Boardman Jan 1995 A
5388147 Grimes Feb 1995 A
5388247 Goodwin Feb 1995 A
5389934 Kass Feb 1995 A
5390216 Bilitza Feb 1995 A
5396539 Slekys Mar 1995 A
5396653 Kivari Mar 1995 A
5408684 Yunoki Apr 1995 A
5410541 Hotto Apr 1995 A
5410739 Hart Apr 1995 A
5414432 Penny, Jr. May 1995 A
5418537 Bird May 1995 A
5420592 Johnson May 1995 A
5422816 Sprague Jun 1995 A
5428636 Meier Jun 1995 A
5438337 Aguado Aug 1995 A
5440491 Kawano Aug 1995 A
5448622 Huttunen Sep 1995 A
5450130 Foley Sep 1995 A
5459469 Schuchman Oct 1995 A
5461390 Hoshen Oct 1995 A
5475864 Hamabe Dec 1995 A
5475868 Duque-Anton Dec 1995 A
5479480 Scott Dec 1995 A
5479482 Grimes Dec 1995 A
5483549 Weinberg Jan 1996 A
5491690 Alfonsi Feb 1996 A
5497149 Fast Mar 1996 A
5504491 Chapman Apr 1996 A
5506888 Hayes Apr 1996 A
5509035 Teidemann, Jr. Apr 1996 A
5510797 Abraham Apr 1996 A
5513111 Wortham Apr 1996 A
5515043 Berard May 1996 A
5519403 Bickley May 1996 A
5519621 Wortham May 1996 A
5528232 Verma Jun 1996 A
5530701 Stillman Jun 1996 A
5533121 Suzuki Jul 1996 A
5537458 Suomi Jul 1996 A
5539810 Kennedy, III Jul 1996 A
5543789 Behr Aug 1996 A
5544222 Robinson Aug 1996 A
5544225 Kennedy, III Aug 1996 A
5546445 Dennison Aug 1996 A
5550551 Alesio Aug 1996 A
5551066 Stillman Aug 1996 A
5555286 Tendler Sep 1996 A
5555520 Sudo Sep 1996 A
5557254 Johnson Sep 1996 A
5565858 Guthrie Oct 1996 A
5566173 Steinbrecher Oct 1996 A
5572204 Timm Nov 1996 A
5576716 Sadler Nov 1996 A
5587715 Lewis Dec 1996 A
5590396 Henry Dec 1996 A
5594425 Ladner Jan 1997 A
RE35498 Barnard Apr 1997 E
5619684 Goodwin Apr 1997 A
5621388 Sherburne Apr 1997 A
5625668 Loomis Apr 1997 A
5627517 Theimer May 1997 A
5630206 Urban May 1997 A
5635450 Mayer Jun 1997 A
5637355 Stanforth Jun 1997 A
5640444 O'Sullivan Jun 1997 A
5650770 Schlager Jul 1997 A
5663734 Krasner Sep 1997 A
5666357 Jangi Sep 1997 A
5668803 Tymes Sep 1997 A
5673305 Ross Sep 1997 A
5680439 Aguilera Oct 1997 A
5686910 Timm Nov 1997 A
5687215 Timm Nov 1997 A
5687216 Svensson Nov 1997 A
5691980 Welles, II Nov 1997 A
5703598 Emmons Dec 1997 A
5711013 Collett Jan 1998 A
5712619 Simkin Jan 1998 A
5712899 Pace, II Jan 1998 A
5724243 Westerlage Mar 1998 A
5726893 Schuchman Mar 1998 A
5726984 Kubler Mar 1998 A
5731757 Layson, Jr. Mar 1998 A
5732326 Maruyama Mar 1998 A
5734981 Kennedy, III Mar 1998 A
5742233 Hoffman Apr 1998 A
5748083 Rietkerk May 1998 A
5748084 Isikoff May 1998 A
5751246 Hertel May 1998 A
5752186 Malackowski May 1998 A
5752193 Scholefield May 1998 A
5752195 Tsuji May 1998 A
5754554 Nakahara May 1998 A
D395250 Kabler Jun 1998 S
5761204 Grob Jun 1998 A
5761292 Wagner Jun 1998 A
5771001 Cobb Jun 1998 A
5771455 Kennedy, III Jun 1998 A
5774876 Woolley Jun 1998 A
5778024 McDonough Jul 1998 A
5781156 Krasner Jul 1998 A
5784422 Heermann Jul 1998 A
5786789 Janky Jul 1998 A
5790842 Charles Aug 1998 A
5794124 Ito Aug 1998 A
5796808 Scott Aug 1998 A
5797091 Clise Aug 1998 A
5804810 Woolley Sep 1998 A
5805576 Worley, III Sep 1998 A
5812087 Krasner Sep 1998 A
5812522 Lee Sep 1998 A
5815114 Speasl Sep 1998 A
RE35916 Dennison Oct 1998 E
5825283 Camhi Oct 1998 A
5825327 Krasner Oct 1998 A
5826188 Tayloe Oct 1998 A
5831574 Krasner Nov 1998 A
5832394 Wortham Nov 1998 A
5835907 Newman Nov 1998 A
5838237 Revell Nov 1998 A
5841396 Krasner Nov 1998 A
5841842 Baum Nov 1998 A
5842141 Vaihoja Nov 1998 A
5850392 Wang Dec 1998 A
5856986 Sobey Jan 1999 A
5864578 Yuen Jan 1999 A
5864763 Leung Jan 1999 A
5870675 Tuutijarvi Feb 1999 A
5874914 Krasner Feb 1999 A
5881069 Cannon Mar 1999 A
5881373 Elofsson Mar 1999 A
5884214 Krasner Mar 1999 A
5886634 Muhme Mar 1999 A
5890108 Yeldener Mar 1999 A
5892441 Woolley Apr 1999 A
5892454 Schipper Apr 1999 A
5901179 Urabe May 1999 A
5911129 Towell Jun 1999 A
5912886 Takahashi Jun 1999 A
5913170 Wortham Jun 1999 A
5915210 Cameron Jun 1999 A
5917449 Sanderford Jun 1999 A
5918180 Dimino Jun 1999 A
5930340 Bell Jul 1999 A
5930722 Han Jul 1999 A
5933468 Kingdon Aug 1999 A
5936526 Klein Aug 1999 A
5937355 Joong Aug 1999 A
5940598 Strauss Aug 1999 A
5945944 Krasner Aug 1999 A
5946304 Chapman Aug 1999 A
5946611 Dennison Aug 1999 A
5949335 Maynard Sep 1999 A
5953694 Pillekamp Sep 1999 A
5960363 Mizikovsky Sep 1999 A
5961608 Onosaka Oct 1999 A
5963130 Schlager Oct 1999 A
5963134 Bowers Oct 1999 A
5970130 Katko Oct 1999 A
5978676 Guidri Nov 1999 A
5991279 Haugli Nov 1999 A
5999124 Sheynblat Dec 1999 A
5999126 Ito Dec 1999 A
6002363 Krasner Dec 1999 A
6006189 Strawczynski Dec 1999 A
6009325 Retzer Dec 1999 A
6009338 Iwata Dec 1999 A
6011973 Valentine Jan 2000 A
6014089 Tracy Jan 2000 A
6014090 Rosen Jan 2000 A
6014376 Abreu Jan 2000 A
6018654 Valentine Jan 2000 A
6021163 Hoshi Feb 2000 A
6024142 Bates Feb 2000 A
6031489 Wyrwas Feb 2000 A
6032037 Jeffers Feb 2000 A
6038310 Hollywood Mar 2000 A
6038595 Ortony Mar 2000 A
6041124 Sugita Mar 2000 A
6044257 Boling Mar 2000 A
6049971 Petit Apr 2000 A
6055434 Seraj Apr 2000 A
6057756 Engellenner May 2000 A
6067044 Whelan May 2000 A
6067457 Erickson May 2000 A
6069570 Herring May 2000 A
6070089 Brophy May 2000 A
6075458 Ladner Jun 2000 A
6076099 Chen Jun 2000 A
6081523 Merchant Jun 2000 A
6091969 Brophy Jul 2000 A
6097760 Spicer Aug 2000 A
6101395 Keshavachar Aug 2000 A
6121922 Mohan Sep 2000 A
6122271 McDonald Sep 2000 A
6122514 Spaur Sep 2000 A
6131067 Girerd Oct 2000 A
6131366 Fukuda Oct 2000 A
6133874 Krasner Oct 2000 A
6140956 Hillman Oct 2000 A
6144336 Preston Nov 2000 A
6151493 Sasakura Nov 2000 A
6154658 Caci Nov 2000 A
6166688 Cromer Dec 2000 A
6169497 Robert Jan 2001 B1
6173194 Vanttila Jan 2001 B1
6175307 Peterson Jan 2001 B1
6181253 Eschenbach Jan 2001 B1
6195736 Lisle Feb 2001 B1
6208959 Jonsson Mar 2001 B1
6212207 Nichols Apr 2001 B1
6226529 Bruno May 2001 B1
6236652 Preston May 2001 B1
6249227 Brady Jun 2001 B1
6266008 Huston Jul 2001 B1
6269392 Cotichini Jul 2001 B1
6272315 Chang Aug 2001 B1
6275990 Dapper Aug 2001 B1
6282430 Young Aug 2001 B1
6288645 McCall Sep 2001 B1
6295461 Palmer Sep 2001 B1
6300863 Cotichini Oct 2001 B1
6300875 Schafer Oct 2001 B1
6301480 Kennedy, III Oct 2001 B1
6304186 Rabanne Oct 2001 B1
6304637 Mirashrafi Oct 2001 B1
6307471 Xydis Oct 2001 B1
6308060 Wortham Oct 2001 B2
6320535 Hillman Nov 2001 B1
6321091 Holland Nov 2001 B1
6326736 Kang Dec 2001 B1
6327533 Chou Dec 2001 B1
6343217 Borland Jan 2002 B1
6345251 Jansson Feb 2002 B1
6351495 Tarraf Feb 2002 B1
6358145 Wong Mar 2002 B1
6359923 Agee Mar 2002 B1
6362736 Gehlot Mar 2002 B1
6373842 Coverdale Apr 2002 B1
6405033 Kennedy, III Jun 2002 B1
6430162 Reese Aug 2002 B1
6430176 Christie, IV Aug 2002 B1
6434198 Tarraf Aug 2002 B1
6466582 Venters Oct 2002 B2
6470046 Scott Oct 2002 B1
6477633 Grimmett Nov 2002 B1
6493338 Preston Dec 2002 B1
6516198 Tendler Feb 2003 B1
6519260 Galyas Feb 2003 B1
6522265 Hillman Feb 2003 B1
6526026 Menon Feb 2003 B1
6529744 Birkler Mar 2003 B1
6545988 Skog Apr 2003 B1
6611804 Dörbecker Aug 2003 B1
6614349 Proctor Sep 2003 B1
6617979 Yoshioka Sep 2003 B2
6628967 Yue Sep 2003 B1
6665333 McCrady Dec 2003 B2
6677894 Sheynblat Jan 2004 B2
6681121 Preston Jan 2004 B1
6683855 Bordogna Jan 2004 B1
6690681 Preston et al. Feb 2004 B1
6690922 Lindemann Feb 2004 B1
6697987 Lee Feb 2004 B2
6700867 Classon Mar 2004 B2
6707421 Drury Mar 2004 B1
6747571 Fierro et al. Jun 2004 B2
6754265 Lindemann Jun 2004 B1
6771629 Preston Aug 2004 B1
6778645 Rao Aug 2004 B1
6799050 Krasner Sep 2004 B1
6836515 Kay Dec 2004 B1
6845153 Tiburtius Jan 2005 B2
6917449 Nakajima Jul 2005 B2
6940809 Sun Sep 2005 B2
6981022 Boundy Dec 2005 B2
6993362 Aberg Jan 2006 B1
7092370 Jiang Aug 2006 B2
7103550 Gallagher Sep 2006 B2
7151768 Preston Dec 2006 B2
7164662 Preston Jan 2007 B2
7206305 Preston Apr 2007 B2
7206574 Bright Apr 2007 B2
7215965 Fournier May 2007 B2
7221669 Preston May 2007 B2
7269188 Smith Sep 2007 B2
7283904 Benjamin Oct 2007 B2
7286522 Preston Oct 2007 B2
7317696 Preston Jan 2008 B2
7372833 Kyrönaho May 2008 B2
7398100 Harris Jul 2008 B2
7426466 Ananthapadmanabhan Sep 2008 B2
7430428 Van Bosch Sep 2008 B2
7477906 Radic Jan 2009 B2
7483418 Maurer Jan 2009 B2
7508810 Moinzadeh Mar 2009 B2
7511611 Sabino Mar 2009 B2
7512098 Jiang Mar 2009 B2
7562393 Buddhikot Jul 2009 B2
7583959 Holmes Sep 2009 B2
7586240 Tsuda Sep 2009 B2
7593449 Shattil Sep 2009 B2
7606555 Walsh Oct 2009 B2
7653383 Natarajan Jan 2010 B2
7688260 Pomerantz Mar 2010 B2
7701954 Rabenko Apr 2010 B2
7733853 Moinzadeh Jun 2010 B2
7747281 Preston Jun 2010 B2
7809367 Hellaker Oct 2010 B2
7848763 Fournier Dec 2010 B2
7856240 Gunn Dec 2010 B2
7924934 Birmingham Apr 2011 B2
7979095 Birmingham Jul 2011 B2
7983310 Hirano Jul 2011 B2
8036201 Moinzadeh Oct 2011 B2
8036600 Garrett Oct 2011 B2
8068792 Preston Nov 2011 B2
20020022465 McCullagh Feb 2002 A1
20020071432 Soderberg et al. Jun 2002 A1
20020097706 Preston Jul 2002 A1
20020111167 Nguyen Aug 2002 A1
20020122401 Xiang Sep 2002 A1
20030016639 Kransmo Jan 2003 A1
20030206625 Ahmad Nov 2003 A9
20030212562 Patel Nov 2003 A1
20030227939 Yukie Dec 2003 A1
20040034529 Hooper, III Feb 2004 A1
20040192345 Osborn Sep 2004 A1
20050090225 Muehleisen Apr 2005 A1
20050111563 Tseng May 2005 A1
20050147057 LaDue Jul 2005 A1
20050187882 Sovio Aug 2005 A1
20050207511 Madhavan Sep 2005 A1
20050215228 Fostick Sep 2005 A1
20050226202 Zhang Oct 2005 A1
20050278169 Hardwick Dec 2005 A1
20060059261 Finkenzeller Mar 2006 A1
20060246910 Petermann Nov 2006 A1
20060287003 Moinzadeh Dec 2006 A1
20070087756 Hoffberg Apr 2007 A1
20070124625 Hassan May 2007 A1
20070155360 An Jul 2007 A1
20070162834 Banerjee Jul 2007 A1
20070211624 Schmidt Sep 2007 A1
20070258398 Chestnutt Nov 2007 A1
20070264964 Birmingham Nov 2007 A1
20080025295 Elliott Jan 2008 A1
20080039017 Kim Feb 2008 A1
20080056469 Preston Mar 2008 A1
20080107094 Borella May 2008 A1
20080132200 Shinoda Jun 2008 A1
20080140394 Holmes Jun 2008 A1
20080143497 Wasson Jun 2008 A1
20080182570 Kuhl Jul 2008 A1
20080212820 Park Sep 2008 A1
20080266064 Curran Oct 2008 A1
20080294340 Schmidt Nov 2008 A1
20090055516 Zhodzishsky Feb 2009 A1
20090077407 Akimoto Mar 2009 A1
20090088180 LaMance Apr 2009 A1
20090110033 Shattil Apr 2009 A1
20090265173 Madhavan Oct 2009 A1
20090298428 Shin Dec 2009 A1
20090304057 Werner Dec 2009 A1
20090306976 Joetten Dec 2009 A1
20100197322 Preston Aug 2010 A1
20100211660 Kiss Aug 2010 A1
20110211625 Birmingham Sep 2011 A1
20110287736 Hirano Nov 2011 A1
20110312322 Garrett Dec 2011 A1
20120040651 Quimby Feb 2012 A1
Foreign Referenced Citations (58)
Number Date Country
2242495 Jan 2000 CA
44 24 412 Jan 1996 DE
199 48 966 Apr 2000 DE
0 242 099 Oct 1987 EP
0 528 090 Aug 1991 EP
0 512 789 May 1992 EP
0 501 058 Sep 1992 EP
0 545 753 Jun 1993 EP
0 545 783 Jun 1993 EP
0 580 397 Jan 1994 EP
0 889 610 Jan 1999 EP
0 896 442 Feb 1999 EP
1 093 253 Apr 2001 EP
1 329 693 Jul 2003 EP
01 950 402 Dec 2004 EP
1 843 503 Oct 2007 EP
2 290 005 May 1994 GB
03232349 Oct 1991 JP
5130008 May 1993 JP
05-207107 Aug 1993 JP
5252099 Sep 1993 JP
6077887 Mar 1994 JP
8-293832 Nov 1996 JP
09-259391 Sep 1997 JP
10-215328 Jul 1998 JP
10-232138 Aug 1998 JP
11109062 Apr 1999 JP
11-312285 Nov 1999 JP
2002-68925 Mar 2000 JP
P3044064 Mar 2000 JP
2001-211189 Jul 2001 JP
2001-238256 Aug 2001 JP
2002-181921 Jun 2002 JP
201018163 May 2010 TW
WO 8912835 Dec 1989 WO
WO 9107044 May 1991 WO
WO 9521511 Aug 1995 WO
WO 9607110 Mar 1996 WO
WO 9615636 May 1996 WO
WO 9618275 Jun 1996 WO
WO 9834164 Aug 1998 WO
WO 9834359 Aug 1998 WO
WO 9853573 Nov 1998 WO
WO 9859256 Dec 1998 WO
WO 9859257 Dec 1998 WO
WO 9914885 Mar 1999 WO
WO 9956143 Apr 1999 WO
WO 9956144 Apr 1999 WO
WO 9936795 Jul 1999 WO
WO 9949677 Sep 1999 WO
WO 0011893 Mar 2000 WO
WO 0178249 Oct 2001 WO
WO 0199295 Dec 2001 WO
WO 02054694 Jul 2002 WO
WO 03034235 Apr 2003 WO
WO 03081373 Oct 2003 WO
2004095818 Apr 2004 WO
WO 2009149356 Dec 2009 WO
Non-Patent Literature Citations (55)
Entry
Digital Cellular Telecommunications System (Phase 2+); GSM 06.31 version 8.0.1 Release 1999. ETSI EN 300 964 V8.01 (Nov. 2000), pp. 1-13. European Standard (Telecommunications serier). (http://www.etsi.org).
Coleman, A., et al., “Subjective Performance Evaluation of the RPE-LTP Codec for the Pan-European Cellular Digital Radio System,” Globecom '89, IEEE Global Telecommunications Conference and Exhibition, vol. 2, Nov. 27-30, 1989, pp. 758-761, IEEE, New York, New York.
Coleman, A., et al., “Subjective Performance Evaluation of the RPE-LTP Codec for the Pan-European Cellular Digital Mobile Radio System,” Globecom '89, IEEE Global Telecommunications Conference and Exhibition, vol. 2, Nov. 27-30, 1989, pp. 1075-1079, IEEE, New York, New York.
Lin, D., et al., “Data Compression of Voiceband Modem Signals,” 40th sup. th IEEE Vehicular Technology Conference: On the Move in the 90's. May 6-9, 1990, pp. 323-325, IEEE, New York, New York.
Feher, “Modems for Emerging Digital Cellular-Mobile Radio System,” IEEE Trans. on Vehicular Technology, vol. 40, No. 2, May 1991, pp. 355-365.
Christ, Thomas W., “A Prison Guard Duress Alarm Location System,” Proceedings of the IEEE 1993 International Carnahan Conference on Security Technology: Security Technology, Oct. 13-15, 1993, Copyright 1993 IEEE.
Brian W. Martin, “WatchIt: A Fully Supervised Identification, Location and Tracking System,” Proceedings of the IEEE, 29th Annual 1995 International Carnahan Conference on Security Technology, Oct. 1995.
Reut, Anton B., “Remote Monitoring of Military Assets Using Commercial Leo Satellites,” IEEE Universal Communications Conference Record, Nov. 6-8, 1995, Copyright 1995 IEEE.
Ayanoglu, E., “Adaptive ARQ/FEC for Multitone Transmission in Wireless Networks” Global Telecommunications Conference, 1995. Conference Record. Communication Theory Mini-Conference, Globecom '95., IEEE Singapore Nov. 13-17, 1995, New York, NY, USA, IEEE, US Lnkd. vol. 3. Whole Document.
Brown, et al., “A Reconfigurable Modem for Increased Network . . . ” IEEE Trans. on Circuits & Systems for Video Technology, vol. 6, No. 2, Apr. 1996, pp. 215-224.
Jain et al, Potential Networking Applications of Global Positioning Systems (GPS), downloadable at http://www.cis.ohio-state.edu/˜jain/papers/gps.htm, pp. 1-40, Apr. 1996.
U.S. Appl. No. 60/047,034; dated May 19, 1997; Applicant: Preston.
U.S. Appl. No. 60/047,140; dated May 20, 1997; Applicant: Preston.
U.S. Appl. No. 60/048,369; dated Jun. 3, 1997; Applicant: Preston.
U.S. Appl. No. 60/048,385; dated Jun. 3, 1997; Applicant: Preston.
U.S. Appl. No. 60/055,497; dated Aug. 13, 1997; Applicant: Preston.
Mueller, A.J. et al., “A DSP Implemented dual 9600/7200 BPS TCM Modem for Mobile Communications Over FM Voice Radios,” Proceedings of the 1997 6th IEEE Pacific rim Conference on Communications, Computers and Signal Processing, vol. 2, 20-22, Aug. 1997, pp. 758-761, IEEE, New York, New York.
Werb, Jay and Colin Lanzl, “Designing a Positioning System for Finding Things and People Indoors,” IEEE Spectrum, Sep. 1998.
FCC E911 Order, dated Nov. 23, 1998-Jul. 1, 1999.
Werb, Jay and Colin Lanzl, “The Next Generation of Control: Local Positioning,” abstract, Feb. 1999, vol. 26.
Lemke A. C., et al.: “Voice Over Data and Data Over Voice: Evolution of the Alcatel 1000. Seamless Evolution of the Alcatel 1000 Switching System will Support the Move to Voice and Data Convergence.” Electrical Communication, Alcatel. Brussels, BE, Apr. 1, 1999. Abstract; Figure 2.
Benelli G., et al.: “A Coding and Retransmission Protocol for Mobile Radio Data Transmission.” Vehicular Technology Conference, 1999. VTC 1999—Fall. IEEE VTS 50th Amsterdam Netherlands Sep. 19-22, 1999. Abstract Section II.
Vaha-Sipila, A., URLs for Telephone Calls, Request for Comments: 2806, Network Working Group, Apr. 2000, 16 pages.
International Search Report PCT/US00/13288; dated May 15, 2000; Applicant: Integrated Data Communications Inc.
International Search Report PCT/US00/01157; dated May 23, 2000; Applicant: Integrated Data Communications Inc.
Lavigne, R.E. and P. Eng, “Trunking Versus Conventional Radio System,” Proceedings of the IEEE, 34th Annual 2000 International Carnahan Conference on Security Technology, Oct. 23-25, 2000.
International Search Report PCT/US01/19845; dated Jun. 22, 2001; Applicant: Airbiquity, Inc.
International Search Report PCT/US01/20021, dated Aug. 21, 2001; Applicant: Airbiquity, Inc.
International Search Report PCT/US01/27238; dated Aug. 30, 2001; Applicant: Airbiquity, Inc.
Bilbao, Alfonso, m-Security (Security and Mobile Telephony), Proceedings of the IEEE 35th Annual 2001, International Carnahan Conference on Security Technology, Oct. 16-19, 2001.
Office Action in U.S. Appl. No. 09/677,486 dated Oct. 16, 2001; 9 pages.
McNichols, Shawn, “Keeping Your Assets Safe,” published on the Internet at http://www.securitymagazine.com,CDA/ArticleInformation/features/BNP—Features, posted Feb. 14, 2002, Copyright 2001-2002 by Business News Publishing Co.
“Tracking,” published on the Internet at http://www.wisetrack.com/tracking.html, posted May 29, 2002, Copyright 2001 by TVL, Inc.
Janus Technologies, Inc., “ProxTrak Asset Tracking Interface,” copyright 2000 Janus Technologies, Inc., published on the Internet at http://www.janus-tech.com/Products/ProxTrax. html, printed May 29, 2002.
Lockwood Technology Corporation, “Asset Management,” copyright 2002 by Lockwood Technology Corporation, published on the Internet at http://www.lockwoodtechnology.com/ asset—tracking.html, printed May 29, 2002.
International Search Report PCT/US02/00996; dated Jun. 24, 2002; Applicant: Airbiquity, Inc.
Office Action in U.S. Appl. No. 09/625,159 dated Apr. 9, 2003; 15 pages.
3GPP2 Access Network Interfaces Technical Specification Group, “3GGP2 Access Network Interfaces TSG (TSG-A) #60, Meeting Summary,” Coeur d'Alene, Idaho, Apr. 19, 2004, pp. 1-5.
3rd Generation Partnership Project; Technical Specification Group Services and System Aspects Push Architecture (Rel. 6); 3GPP TR 23.976; vol. 3-SA2, No. V6.1.0; Jun. 1, 2004; pp. 1-34.
Universal Mobile Telecommunications System (UMTS); Push Architecture (3GPP TR 23.976 version 6.1.0 Release 6); Jun. 2004; 36 pages.
Protean Research Group, “Anycast Routing for Mobile Services (ARMS) Project Overview,” Published on the Internet at <http://tang.itd.nrl.navy.mll/5522/anycast/anycast—index.html>. Downloaded from the internet Jan. 19, 2005.
Vocal Technologies, Ltd. Home Page, “Audio Codecs,” http://www.vocal.com/data—sheets/audio—codecs.html?glad, accessed Jun. 12, 2005.
International Search Report for PCT/US06/03416, dated Feb. 5, 2007, 3 pages.
Phifer, Lisa A., Surfing the Web Over Wireless, Jan. 1998, http://www.corecom.com/html/ wireless.html, printed May 22, 2007.
International Search Report of International Application No. PCT/US07/64443, dated Sep. 15, 2008.
USPTO Search Authority; PCT/US08/80555 International Search Report; Dec. 19, 2008, 11 pages.
Stolowitz Ford Cowger LLP List of Related Cases dated Dec. 23, 2011.
PCT/US2009/056834 International Search Report dated Dec. 30, 2009; 12 pages.
Supplemental European Search Report for Application 08840726.7 dated Sep. 19, 2012; 8 pages.
International Search Report for PCT/US12/52712 dated Nov. 2, 2012; 4 pages.
Translation of a portion of JP 09-259391 by Sugimura; provided Oct. 11, 2012; 5 pages.
Translation of a portion of JP 10-215328 by Sugimura; provided Oct. 11, 2012; 3 pages.
Translation of a portion of JP 10-232138 by Sugimura; provided Oct. 11, 2012; 2 pages.
Translation of a portion of JP 11-312285 by Sugimura; provided Oct. 11, 2012; 1 page.
Translation of a portion of JP 2001-211189 by Sugimura; provided Oct. 11, 2012; 1 page.
Related Publications (1)
Number Date Country
20110029832 A1 Feb 2011 US
Provisional Applications (1)
Number Date Country
61230930 Aug 2009 US