System and method for delivering information to a transmitting and receiving device

Information

  • Patent Grant
  • 8560006
  • Patent Number
    8,560,006
  • Date Filed
    Monday, February 11, 2013
    11 years ago
  • Date Issued
    Tuesday, October 15, 2013
    10 years ago
Abstract
The present invention provides systems and method for delivering information to a transmitting and receiving device. The device receives a notification alerting a user of the device that information is available to be obtained and, in some embodiments, providing a short description of the information. After receiving the notification at the device, the user can then use the device to obtain or otherwise act on the information at a time and at a place convenient to the user.
Description
BACKGROUND OF THE INVENTION

1. Field of the Invention


The present invention relates generally to systems and methods for selective paging and, more particularly, to paging systems and methods for selectively paging in response to messages received at a plurality of sources.


2. Discussion of the Background


In general, a paging receiver can be classified into one of four categories: an alert or tone only paging receiver, a numeric paging receiver, an alphanumeric paging receiver, or a voice paging receiver. One common characteristic of all of these paging receivers is that they monitor the air waves and notify the user when their particular address has been detected. For the alert or tone only paging receiver, the paging receiver would generate a tone or beep when its address is detected. The other paging receivers, upon detecting their address, would additionally store a message associated with the address signal and display or play it to the user. The message for a numeric paging receiver would be a set of numbers, typically the calling person's telephone number, and the message for an alphanumeric paging receiver would be a set of numbers and/or letters. The user of an alphanumeric paging receiver could therefore receive a message in the form of a telephone number with some descriptive text. For the voice paging receiver, the message that is stored is a voice message that the user can later play to hear the message.


A paging receiver is typically a rather small electronic device and, accordingly, has a limited amount of memory for storing messages that have been received from a base station in a paging system. Because of the relatively small size of the memory, the paging receiver can store only a limited number of messages. A user can delete messages from memory but will oftentimes desire to save a message, such as temporarily until the user makes a note of the message or until he or she is able to respond to the page. The messages that are saved in memory, however, reduce the space in memory that is available to receive new messages. This demand on space in memory is increasing as the size of the messages continue to grow and as users receive a greater number of messages. Although more memory can be added to accommodate more messages, the added cost and space needed for extra memory runs counter to the desires to keep the paging receiver small and inexpensive. A need therefore exists for a paging receiver which can display and/or play messages while efficiently using memory.


In addition to the demand on paging receiver memory, paging systems will be challenged as greater numbers of pages are being transmitted and as the size of the transmitted messages increases. Initially, when paging systems were only concerned with transmitting address signals of the paging receivers, the size of each transmission by the paging systems was relatively small. Paging receivers and paging systems, however, have undergone tremendous advances with paging systems now transmitting messages which can be hundreds of kilobytes or greater in size in addition to the address signals. Additionally, many paging receivers are actually paging transceivers which transmit acknowledgment signals back through the paging system. The capacity of the paging systems are therefore being challenged not only by messages of increasing sizes but also by reply signals transmitted from the paging transceivers to the paging system. The future of paging systems is therefore tied to the ability of the paging systems to control the number and size of the data transmissions and to provide additional features without sacrificing the quality of service to the user.


As discussed above, many paging transceivers are able to issue a reply or acknowledgment back to the base station in response to a received message. If the base station does not receive this reply or acknowledgment, then the base station assumes that the message has not been received and will repeatedly transmit the message until the reply or acknowledgment is received. Due to the high power levels at which the base station transmits its paging signals, the signals are usually easily received by all paging transceivers located within the coverage area of the base station antenna. The paging transceivers, on the other hand, must operate at lower power levels and often cannot transmit signals at sufficiently high levels to reach the base station. For example, when a paging transceiver is located in a basement of a building, in a subway, or in an airplane, the paging transceiver may be unable to issue a reply that can reach the base station. As a result, the base station may continue to transmit a page to a paging transceiver and the paging transceiver will continue to receive the message but the base station cannot detect the reply being issued by the paging transceiver. This unnecessary transmission of duplicate messages and the ineffectual reply signals transmitted by the paging transceivers consume valuable resources of the paging system and of the paging transceiver.


For safety reasons, a user may at times have to turn off his or her paging transceiver. For instance, when the user is on an airplane, the transmissions from the paging transceiver can interfere with the instrumentation or communication within the cockpit of the plane. The paging transceiver therefore should not be operating within the plane or around other electronic equipment that are sensitive to interference from the signals transmitted by the paging transceiver. As another example, if the user is in an environment that contains electronic detonators for explosive materials, the signals transmitted by the paging transceiver could possibly trigger an explosion. The user therefore must turn his or her paging transceiver off to ensure that it does not transmit any reply or acknowledgment signals in response to a received page. Although it may be dangerous for the paging transceiver to issue a reply signal in these situations, the signals transmitted by the base station may at times be safely received by the paging transceiver. Since the paging transceiver automatically issues a reply in response to a received message, the paging transceiver must nonetheless be turned off so as to not pose a risk to the user. During these times that the paging transceiver must be turned off, the user unfortunately is unable to receive any page or message. A need therefore exists for a paging transceiver that can notify a user of a message without automatically generating a reply message or acknowledgment to the base station.


SUMMARY OF THE INVENTION

The present invention solves the problems described above with methods and systems for selective paging. A paging system notifies a paging transceiver that a message has been received but does not initially transmit the associated message. The user, upon being notified of the message, can then download the entire message at a time convenient to the user, which allows the user to download messages at less expensive off-peak hours and allows the user to place the paging transceiver at a location where it can easily receive the message and reply to the message. Since the messages are not initially transmitted to the paging transceiver, the paging transceiver can receive and store a greater number of pages with minimal increase in the size of memory. Further, because entire messages are not automatically transmitted and since the user can position the paging transceiver to issue a sufficiently strong reply, traffic in the paging system can be controlled and actually reduced.


The system may transmit some identifying information about the page to the user without sending the entire message. For instance, the base station may identify the type of message, such as email, voice, or text, and also indicate the caller or other descriptive material about the message. The user can then determine the priority of the message and whether he or she wants to retrieve the message, play the message, erase the message, store the message, forward, reply, or otherwise act on the message. The user is also given control over the messages stored remotely from the paging transceiver and can erase or store these messages from the paging transceiver. The paging transceiver may have a timer for allowing the user to program the paging transceiver to perform a desired function on a message at a particular time.


The information initially sent to the user may also indicate the location of the stored message. For instance, the system paging a particular paging transceiver to notify it that a page has been received need not be the system actually storing the content of the message. Instead, a plurality of systems may store the contents of messages with one or more of the systems paging the paging transceiver. The paging transceiver would be provided sufficient information on the system storing the message so that it can communicate with this system. The system paging the paging transceiver can therefore act as a clearinghouse for other messaging systems by notifying a user of all messages received regardless of their source or type.


Accordingly, it is an object of the present invention to provide systems and methods for paging that conserve memory in paging transceivers.


It is another object of the present invention to provide systems and methods for paging that conserve valuable air time.


It is a further object of the present invention to provide systems and methods for paging that provide users with remote control over their messages.


It is yet another object of the present invention to provide systems and methods for paging that allow users to select when and how action should be taken on their messages.


It is yet a further object of the present invention to provide messaging systems and methods for notifying users of received messages.


It is also an object of the present invention to provide messaging systems and methods for providing control to users over messages stored at remote locations.


It is still another object of the present invention to provide messaging systems and methods that notify users of messages received from multiple sources.





BRIEF DESCRIPTION OF THE DRAWINGS

The accompanying drawings, which are incorporated in and form a part of the specification, illustrate preferred embodiments of the present invention and, together with the description, serve to explain the principles of the invention. In the drawings:



FIG. 1 is a block diagram of a paging transceiver according to a preferred embodiment of the invention;



FIG. 2 is a more detailed block diagram of the transceiver in the paging transceiver of FIG. 1;



FIG. 3 is a block diagram of a communication system according to a preferred embodiment of the invention;



FIGS. 4A and 4B are flow charts depicting an exemplary set-up routine for establishing communications between the system of FIG. 3 and the transceiver of FIG. 1;



FIG. 5 is a flow chart depicting a paging process;



FIG. 6 a flow chart depicting of process of notifying a paging transceiver of an unread message;



FIG. 7 is a flow chart depicting a process of receiving a page at the paging transceiver of FIG. 1;



FIG. 8 is a flow chart depicting a process of selecting a function at the paging transceiver of FIG. 1;



FIG. 9 is a generic flow chart depicting a selective process performed at the paging transceiver of FIG. 1 for executing a desired function;



FIG. 10 is a block diagram of a paging system having multiple systems for storing messages; and



FIG. 11 is a diagram of a data transmission for the system in FIG. 10.





DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS

Reference will now be made in detail to preferred embodiments of the invention, non-limiting examples of which are illustrated in the accompanying drawings. With reference to FIG. 1, a paging transceiver 100 according to a preferred embodiment of the invention comprises an antenna 1, a transceiver 2, a user interface 3, a controller 4, and a memory 5. The single antenna 1 is preferably used for both receiving and transmitting signals, although the paging transceiver 100 may comprise a separate antenna for transmitting signals and a separate antenna for receiving signals.


The transceiver 2 is connected to the antenna I and is for transmitting signals from the paging transceiver 100 and for receiving signals directed to the paging transceiver 100. The signals that may be transmitted to, or received from, the paging transceiver 100 include, but are not limited to, such signals as selective call signals, command data signals, signals corresponding to a message, and information data signals. The transceiver 2 may comprise a transceiver found in two way pagers or mobile radios and preferably comprises a transceiver commonly used in a portable mobile radiotelephone.


The transceiver 2 is connected to the user interface 3, which contains all necessary input and output devices. The user interface 3 includes a microphone, speaker, alert transducer, LED or LCD display, keypad, and necessary switches. The user interface 3 may also contain other types of input/output devices depending on the messaging application, such as a video display, camera, scanner, a printer, or a voice recognition device. The user interface 3 is not limited to these examples of user input/output devices but may comprise any input or output device which allows or assists communication between the user and the paging transceiver 100.


The transceiver 2 is connected to, and communicates with, the controller 4, which preferably comprises a digital signal processor (DSP) 4. The memory 5 is connected to the DSP 4 and is for storing messages or other types of information. The memory 5 may comprise static RAM, Dynamic RAM, Flash RAM, or any type of memory suitable for storing messages and allowing the retrieval of the messages. The amount of the memory 5 is preferably at least 4 MB for voice or text applications, although it may consist of a greater or lesser amount depending upon the specific message type application.


The transceiver 2, as shown in more detail in FIG. 2, includes an antenna interface 20 connected to the antenna 1 The antenna interface 20 directs signals received from antenna 1 to a receiver section 21 of the paging transceiver 100 and directs signals transmitted from a transmit section 24 to the antenna 1. The antenna interface 20 is preferably a duplexer, however an antenna switch or other device may be utilized to provide signal isolation between the receiver and transmitter sections 21 and 24. Alternatively, if paging transceiver 100 includes two antennas 1 with one for transmitting signals and the other for receiving signals, the transceiver 2 would not require any type of antenna interface 20.


The receive section 21 includes a receiver 22 and a receiver frequency synthesizer 23. The receiver 22 is connected to the antenna 1 through antenna interface 20 and receives the signals directed to the paging transceiver 100. The receiver frequency synthesizer 23, based on an input from a processor 27, selects the frequency at which the receiver 22 receives signals. The received signals are passed from the receiver 22 to the processor 27.


The transmit section 24 includes a transmitter 25 for receiving signals from the processor 27. The transmit section 24 also includes a transmitter frequency synthesizer 26 connected to the transmitter 25 which, based upon an input from the processor 27, selects the transmit frequency for the transmitter 25. The signals output by the transmitter 25 are supplied to the antenna interface 20 and then to the antenna 1.


The processor 27 comprises a central processing unit (CPU) having internal memory and switching capabilities. The CPU 27, for instance, comprises all necessary RAM and ROM memory, signal and data switching circuitry, signal processing circuitry, I-O Ports, and all standard program instructions and stored options commonly utilized in portable cellular telephones. The standard cellular telephone program instructions and CPU 27 may be obtained from a variety of suppliers. For instance, the instructions may be obtained from Wireless Link Inc. of Sunnyvale, Calif. and the CPU 27 from GEC Plessey Semiconductor, Inc. of Scotts Valley, Calif.


The DSP 4 includes necessary I-O and program memory and are commonly utilized in cellular telephones. Any suitable DSP may be used in the paging transceiver 100. Alternatively, the controller 4 may comprise another type of electronic device, such as a codec or digital-to-analog/analog-to-digital conversion circuit or other type of modulator-demodulator including memory interface circuitry coupled to message memory 5 for reading and writing of messages.


The transceiver 2 also preferably includes a delay circuit 28. The delay circuit 28 may comprise a timer which informs the processor 27 of when a period of time has expired. The timer, for instance, may expire at a certain time of day, week, or month, or may expire a fixed period of time after a triggering event, such as one hour after the event. The time at which the timer 28 expires is preferably programmable through the user interface 3 and through processor 27. Additionally, the timer 28 preferably comprises a plurality of timers for notifying the processor 27 of when a plurality of different time periods have expired. Rather than a timer, the delay circuit 28 may alternatively operate to delay the occurrence of an event until a certain condition is satisfied. This condition, for instance, may be the strength of received signals or the receipt of a specified signal. The purpose of the timer 28 will become apparent from the description below.


With reference to FIG. 3, a system 30 according to a preferred embodiment of the invention is interconnected to a base station 34, both of which are connected to the Public Switched Telephone Network (PSTN) or to other telephone company equipment 35. The system 30 comprises a paging terminal controller 31 which may comprise a controller circuit and associated memory having a database of subscriber listings and corresponding selective call address fields. The paging terminal controller 31 communicates with storage and retrieval unit 32 and correlates messages with subscriber listings. The storage and retrieval unit 32 may comprise a CPU or control circuit, message information and program memory, memory interface circuitry and a DSP with appropriate operational code for storage and retrieval of the desired messages. The input/output controller 33 contains all necessary input and output circuitry such as encoders and decoders, modems and required routing and control circuitry for communicating with the paging terminal controller 31, the storage and retrieval unit 32, the PSTN 35, and the base station 34.


A call setup routine 40 for establishing communication between the system 30 and base station 34 will now be described with reference to FIGS. 4A and 4B. At step 41, a connection, such as a telephone connection, is routed through the PSTN 35 or in the case of paging transceiver 100 the switch 36, to the input/output controller 33. The input/output controller 33 determines at step 42 whether the connection is with an automated signaling device or with a person. If the connection is with a person, then at step 48 the storage and retrieval unit 32 is activated to produce one or more voice responses during the call in order to guide the person throughout the process.


If, at step 42, the input/output controller 33 determines that the call is from a device, such as a paging transceiver 100 or computer terminal, data is exchanged between the paging transceiver 100 and system 30 at step 43. The type of data that may be exchanged includes, but is not limited to, the following types of data: identification data, command data, and information data. The data supplied from the PSTN 35 may also be exchanged at step 43 with this data including data for identifying the caller and subscriber, such as, for example, Caller ID and DNIS (Dialed Number Identification Service). Additionally, the data may be extracted from the base station 34. For example, the location of the paging transceiver 100 may be determined from a home location registry (HLR) and the HLR data may be utilized by the system 30 in order to determine the location of the paging transceiver 100, as opposed to having the paging transceiver 100 supply the location information to system 30.


After data is exchanged at step 43, the system 30 determines at step 44 whether an error occurred during the transmission between the system 30 and paging transceiver 100. If an error did occur, then at step 47 the process ends and the paging transceiver 100 is informed of the error. The error is preferably presented to the user in the form of status information produced at the user interface 3, such as with an alert tone or visual display on the LED or LCD display. An error may include, but is not limited to, the following errors: “system busy,” “wrong ID,” or “bill over due.” If no error is detected, as determined by the system 30 at step 44, a function is enabled and executed at step 45. The function, as will be described in greater detail below with reference to FIG. 8, may be selected by the user from a group of available functions. At step 46, housekeeping functions are performed both at the paging transceiver 100 and at the system 30 and the call is terminated at step 47.


If the call is from a person as determined at step 42, then the caller is provided with a voice response at step 48 and, with reference to FIG. 4B, the caller is then verbally prompted at step 49 to enter information. At step 50, the caller sends data to the system 30, such as by pressing the telephone keypad to generate DTMF tones. The data that may be sent by the caller includes, but is not limited to, ID code, pass code, mail box number, and subscriber number. The system 30 may respond to voice commands from a caller by utilizing a readily available voice recognition system, such as those presently in use by the telephone company to except collect calls. At 51, the system 30 determines whether an error has occurred. If an error is detected, the caller may be given an opportunity to correct the error or, as shown, the process may end at step 56. If no error was detected by the system 30 at step 51, a message, such as a voice message, is recorded and stored in the storage and retrieval unit 32 at step 52. At step 53, the system 30 determines whether a return receipt or a reply message is requested. If a return receipt or reply message is requested, the return address is entered by the caller or optionally issued by the system 30 and is stored by the system 30 in the storage and retrieval unit 32 at step 54. The system 30, for instance, may detect the address signal of the incoming call and, by default, store this number as the return address. After the return address is stored at step 54 or if a return address is not requested, the stored message is cross referenced to selective call data corresponding to the intended paging transceiver 100 at step 55. Also at step 55, a flag is set in a transmission stack file at the paging terminal controller 31 for subsequently transmitting selective call signals representative of the selective call data to the targeted paging transceiver 100. Housekeeping is performed by the system 30 and the call ends at step 56.


The base station 34, as shown in FIG. 3, comprises a switch 36, a transceiver antenna 37, and a transceiver base station 38. In response to a received message, the system 30 passes control information to switch 36 for setting up a page call. The switch 36, for instance, may be a mobile telephone switching office (MTSO) for interfacing to the transceiver base station 38. In the send page mode, selective call signals having an address associated with the paging transceiver 100 are transmitted. The address may be an address code for a paging transceiver, a mobile telephone number (MIN) for a mobile radiotelephone, or type of identifying information for a communication device.


Command data and information data may also be communicated from the system 30 to the paging transceiver 100 through the base station 34. The command data and information data shall hereinafter be referred to as CI data, examples of which include the following: paging transceiver location, forward message, retrieve message, reply to message, paging transceiver ID, message identifiers, retrieval instructions, save message, erase message, message type, message length, time/date message received, system 30 ID, system 30 location, message address, message location, battery life, message identifier, format code, compression type, message age, message priority, alert codes, energy saving commands, memory status, program data, provisioning data, acknowledgment data and requests, function codes, sender name, current time, number of messages, mailbox number, phone number, return address, alpha numeric short messages, general command requests, group calls, and signal strength.


The address and command data and information may be transmitted over any suitable communication system. For instance, the data may be communicated over a paging system, a cellular system having short message service capabilities, such as GSM-SMS, a Cellular Digital Packet Data (CDPD) system, Personal Communications Services, or any other type of mobile radiotelephone system or communication system. Furthermore, the paging transceiver 100 preferably is able to communicate over more than one system, such as with both a paging network and a mobile radiotelephone network.


With reference to FIG. 5, a flow diagram 60 for performing a page call is shown. At step 61, the system 30 locates the current message flag from its transmission stack within paging terminal controller 31 and communicates with base station 34 for setting up a page call. The base station 34 transmits selective call signals and CI data to the targeted paging transceiver 100. At step 62, the system 30 determines whether an acknowledgment (Ack) was received from the paging transceiver 100 indicating that the page call was received. If an acknowledgment was not received, then at step 70 the system 30 determines whether an acknowledgment is a system 30 option. If an acknowledgment is required, then at step 71 the system 30 assigns the page call a priority in the transmission stack and eventually returns to step 61 for re-transmission. If the acknowledgment is received at step 62, the system 30 sets an acknowledgment flag (Ack flag) corresponding to the stored message.


If an acknowledgment is not a system requirement, as determined at step 70, or after posting the acknowledgment flag at step 63, the system 30 sets a timer at step 64 and waits a period of time before proceeding to step 65. At step 65, the paging terminal controller 31 determines if the stored message has been read. If the message has been read, then at step 66 the system 30 posts a read flag in the subscriber data base to indicate that the message was delivered and read and at step 67 the process ends.


If, at step 65, the message had not been read, then at step 68 the system 30 determines the priority of the message and proceeds to step 69. If the priority is high, as determined at step 69, then at step 61 the page call is returned to the transmission stack at the designated priority level for re-transmission. If, on the other hand, the priority is not high as determined at step 69, then the message has a low priority and the process ends at step 67.


An alternate routine 80 for notifying a paging transceiver 100 that an unread message is waiting is shown in FIG. 6. At step 81, the paging terminal controller 31 sorts through subscriber listings which have a corresponding unread and unnotified message in the storage and retrieval unit 32 and sends a page request to base station 34. At step 82, the switch 36 checks a home location registry (HLR) to determine the registered location and status of the remote paging transceiver 100. A page call is processed by transmitting selective call signals from transceiver base station 37 at step 82. If a page acknowledgment is desired for verification that the paging transceiver 100 recipient received the selective call signals, an Ack signal is manually or automatically transmitted from the paging transceiver 100 to base station 34 for storage in the subscriber database of paging terminal controller 31 at step 82.


At step 83, if an acknowledgement signal was received, a notified flag is set in the subscriber data base corresponding to the unread message stored in the storage and retrieval unit 32 and the paging process for the current unread message ends at step 84. If at step 83 an acknowledgment signal was not received, the message is assigned a new priority and the process is subsequently repeated. Optionally, a plurality of priorities may be assigned to acknowledged and not acknowledged unread messages so that the paging transceiver 100 is sent a number of calls until the message is read by the subscriber.


In the preferred embodiment, the base station 34 is part of a mobile radiotelephone network and the paging transceiver 100 is paged over the designated paging channel or the control channels of the network. In addition to paging the paging transceiver 100, the short messages or other data transmitted to the paging transceiver 100 are also preferably transmitted over the paging channel or control channels. Although the paging is preferably performed through a mobile radiotelephone network, the selective call signals may alternatively be routed to a paging system for transmitting an address code and CI data over an independent paging transmitter. In such a configuration, the paging transceiver 100 may be configured to have a separate paging receiver or transceiver compatible with the paging transmitter or paging transceiver. Since radio pager devices require much less energy than portable cellular telephones, a paging transceiver 100 configured with a low energy paging receiver would reduce energy required for receiving selective call signals and allow high energy circuitry of the paging transceiver 100 to be turned off until the user needs to retrieve or transmit messages. Other variations and modifications will be apparent to those skilled in the art.


A process 90 for receiving messages at a paging transceiver 100 is shown in FIG. 7. A selective call signal including an address is received by receive section 21 of the transceiver 100 at step 91. At step 92, the demodulated signal is processed by the CPU 27 to compare the received address with an address code stored in the CPU 27 memory. If the received address code does not match the stored address, flow returns to step 91 and the transceiver 100 continues to monitor transmissions for its address. When the address corresponds to the pre-stored address code, as determined at step 92, the CPU 27 stores and processes any corresponding received CI data at step 93.


Next, at step 94, the CPU 27 determines if an acknowledgment transmission is required by the paging transceiver 100. The CPU 27 may always enable an acknowledgment in order to confirm at the system 30 or base station 34 that the selective call signals were received by the targeted paging transceiver 100. Alternatively, the CPU 27 may never enable an acknowledgment from the transceiver 100, which is useful in explosive environments where transmissions are dangerous and in environments where a reply from the paging transceiver 100 may cause harmful interference to other electronic equipment. The CPU 27 may, as another option, enable an acknowledgment only when acknowledgment data is contained within the received CI data, such as with a remote request. Finally, the CPU 27 may enable an acknowledgment in response to a user-enabled command.


Returning to step 94, if the paging transceiver 100 allows for an acknowledgment then at step 95 the CPU 27 determines whether the acknowledgment is required or if the acknowledgment is a user option. If the acknowledgment is required to be automatic, then an acknowledgment flag is set at step 97. If, on the other hand, the acknowledgment is not automatic but rather optional, then at step 96 the CPU 27 determines whether an acknowledgment has been enabled. If the acknowledgment has been enabled, then the acknowledgment flag is set in step 97.


At step 98, the CPU 27 determines whether short messages may be transmitted. Short messages may include CI data or any type of short coded message which was pre-stored by the user in the paging transceiver 100. If short messages are enabled, at step 99 the CPU 27 sets the short message flag. At step 100, the paging transceiver 100 transmits all flagged data, including CI data, to the base station 34 for processing by the system 30. The CPU 27 generates status information corresponding to received Cl data and passes any necessary user status information to the user interface 3 for visual and/or audible reception by the user. For example the user may hear an alert beep, feel an alert vibration, view an LCD indicating the number of unread messages, view an animated graphic display, hear a synthesized voice indicating that an urgent message is waiting, or receive other types of indications. At step 101, the CPU 27 performs house keeping functions and the routine ends.



FIG. 8 depicts a user function flow diagram 110 for user selectable function requests at the paging transceiver 100. At step 111, the user selects a function to be performed from available functions 112 to 117. These functions are exemplary functions that may be available and additional functions may exist. One or more of these functions are preferably selected through the user interface 3. One or more messages may be selected by the user to be forwarded to one or a plurality of addresses or recipients at step 112. Items such as messages and send message lists may be selected by scrolling through the message number or name. The selected messages for forwarding may reside at the paging transceiver 100 or at the system 30. The user may also select the function of saving a selected message at step 113. At step 114, selected messages are retrieved for reproduction and/or storage. At step 115, messages may be sent to one or a plurality of recipients, such as to another paging transceiver 100. At step 116, the selected message may be erased and at step 117, a reply may be sent to the originator of a selected message. With any of the functions selected at steps 112 to 117, the system 30 may act upon the entire information or, alternatively, may instead operate on only the message identifier. For instance, if the user selected the desired action of forwarding a message, the system 30 may send the entire message to a designated recipient or may instead send just the message identifier.



FIG. 9 depicts processing performed by the paging transceiver 100 in response to the selection of any one of the functions 112 to 117 shown in FIG. 8. At step 131, the function is identified by the CPU 27 and other processing occurs prior to step 132 where the CPU 27 determines whether a call is required. If a call is not required to perform the function, then at step 133 the CPU 27 performs the requested function and the process ends at step 140.


If, on the other hand, a call is required, then at step 134 the CPU 27 next determines whether a call is already in progress. If a call is in progress, the CPU 27 exchanges data with the system 30 and base station 34 at step 135 and the function is performed or executed at step 136. The data that is exchanged at step 135 includes a request signal that is sent from the paging transceiver 100 to the system 30 specifying the desired action and the particular information or message. If a call is not in progress, then at step 137 the CPU 27 preferably asks the user if a call should be made and receives the user's feedback at step 138. If the user elects not to call, then a delay occurs at step 141 with delay circuit 28.


As discussed above, the delay circuit 28 may be a timer which expires at a set time, such as at 1:00 a.m., when traffic and costs are low or may expire after a period of time, such as 1 hour. The set time or the period of time may be programmed by the user or may be determined by default values. Additionally, the delay circuit 28 may operate to delay operation until the signal strength is above a certain threshold. The delay circuit 28, in this example, may therefore comprise a level detector and a comparator circuit for comparing the signal strength to the threshold level. The delay circuit 28 would therefore advantageously delay the paging transceiver 100 from initiating communication until signal strength is sufficiently high. Moreover, the delay circuit 28 may alternatively comprise a communication monitor circuit for determining when the paging transceiver 100 is communicating before performing a function. Also, the delay circuit 28 may detect transmissions and trigger a certain event in response to a received communication. As an example, if the paging transceiver 100 receives a certain type of message or a message from a particular source or individual, the paging transceiver 100 may automatically perform a programmed action. The paging transceiver 100 would therefore be able, for instance, to automatically forward all messages received from one recipient to a designated person.


After the timer 28 is triggered or if the user decides to call now, then at step 139 the CPU 27 sets up a call to the base station 34. Once a call is established, then processing proceeds to step 135 for the exchange of data and then to step 136 for the performance or execution of the function. At step 140, the process ends. The process shown in FIG. 9 is not limited to the performance of a single function but also represents the processing if the user selects a number of functions. For example, the user may select the functions of retrieving a message at step 114 and forwarding a message at step 112 and these functions may be performed in unison with each other or sequentially one after the other.


The paging transceiver 100 and system 30 may exchange status information during messaging calls initiated by the paging transceiver 100 or by selective call, such as page calls, initiated by the system 30. The status information may contain information corresponding to messages stored within the paging transceiver 100 or within the system 30. For example, if the system 30 erases a message that has resided in its memory for too long a period of time, such as an unsaved, read message, the system 30 may inform the paging transceiver 100 that the message no longer exists. If the message identifier stored in the paging transceiver 100 no longer corresponds to a message stored in the system 30 or in the paging transceiver 100, the CPU 27 removes the identifier for the no-longer existing message.


When the forward message function 112 is selected, flow proceeds to step 131 where the CPU 27 reads information pertaining to the message or plurality of messages selected by the user to be forwarded. The information may include a message identifier, location data, message length, message type, destination addresses, or other CI type data as previously described. At step 132, the CPU 27 determines whether the message cannot be forwarded without communicating with the system 30. At step 134, the CPU 27 determines if a call is in progress. If a call is in progress, CI data is exchanged at step 135 with the system 30 for forwarding messages. If the messages to be forwarded are located at the system 30, the messages are simply flagged for forwarding to the appropriate addresses. At step 136, the messages are forwarded and confirmation is communicated to the paging transceiver 100. If the message is not located at system 30, the message is transmitted from the paging transceiver 100 to system 30 at step 136 and the process ends at step 140. If at step 134, it is determined that a call is not in progress, the user is asked if the message should be forwarded now at step 137. If at step 138 the user selects yes, a call is established with system 30 at step 139 and flow continues as previously described. If at step 138 the user responds that a call should not be made, the CPU 27 keeps the forwarding information in memory for forwarding the message during a subsequent call with system 30 and a delay occurs at step 141 with delay circuit 28, as described above. After the delay, a call is established with system 30 at step 139 and flow continues as previously described. The process ends at step 140.


In operation, the user selects a message or messages to be forwarded and also selects a recipient for receiving the message. If the message resides at the system 30, the message is simply forwarded to the addressed recipient. If the message is located in the paging transceiver 100, the message is first transmitted to the system 30 at step 135 before it can be forwarded to the intended recipient. In order to conserve time, the system 30 will not accept receipt of a message from the paging transceiver 100 if the same message already exists at the system 30. The system 30 will simply perform the required function with the already present duplicate message.


If the function selected is the save message function 113, then at step 131 the message identifier to be saved is read by CPU 27. At step 132, the CPU 27 determines if the message identifier selected corresponds to a message already stored in message memory 5 and if the selected function can be processed off-line. If yes, at step 133 the CPU 27 sets a save message flag in order to protect the message stored in message memory 5 from being over-written and the process ends at step 140.


If at step 132 the CPU 27 determines that the message is not stored at the paging transceiver 100, then at step 134 the CPU 27 determines whether a call is in progress. If a messaging call is in progress, CI data instructing the system 30 to save the message is sent. The system 30 flags the stored message and sends a message saved acknowledgment to the paging transceiver 100 at step 136. The CPU 27 converts the acknowledgment to status information and informs the user that the message is saved at the system 30 and the process ends at step 140. If at step 134, it is determined that the paging transceiver 100 is not currently in communication with the system 30, the CPU 27 flags the message identifier for saving and the user is asked if the call should be made now at step 137. If no, at step 138 the flag is kept for transmission to system 30 at a later time. A delay occurs at step 141 with delay circuit 28 as described above. After the delay, a call is established with system 30 at step 139 and flow continues as previously described. Transmission to system 30 may also take place at a later time, such as during a selective call to the paging transceiver 100 or during a messaging call to system 30. If yes, then the CPU 27 sets up a call at step 139 for transmitting the save flag and CI data as previously described.


When the retrieve message function is selected at 114, then at step 131 the message identifiers corresponding to messages to be returned are read from the CPU 27 memory for retrieving the message. Additionally, the CPU 27 may read message location information, system ID information, address information, message length information, and/or message type information as previously described. At step 132, the CPU 27 determines the location of the message and determines if a call to system 30 is required. If the message is stored in message memory 5, then at step 133 the CPU 27 retrieves the message. The message, for instance, may be an audio message, visual message, text message, or electronic signal intended to be transferred to another device.


At step 132, if the message does not reside in message memory 5, the CPU 27 determines that a call is required to retrieve the message and, at step 134, determines if a call is in progress. If a call is in progress, CI data, such as which messages to retrieve, message length, message type, and message identifier, is exchanged at step 135. At step 136, the message is retrieved and simultaneously stored in message memory 5 by the DSP 4. The appropriate status information corresponding to the message is stored by the CPU 27 in its memory and the process ends at step 140. If at step 134 a call is not in progress, the user is asked if the call should be made now or if during another call at step 137. At step 138, if the user chooses to place the call, the call is set up at 139. If the user chooses to delay the call at step 141 until another session or some later time, the message is left flagged for retrieval at the next session or some later time and the process ends at step 140. With the timer 28, the message may be retrieved at a chosen time or a retrieval instruction may be sent from system 30 to paging transceiver 100 for causing the paging transceiver 100 to automatically retrieve a message or plurality of messages at a time designated by system 30. For example it may be desirable to have emergency weather information automatically retrieved during night-time hours when telephone line charges and air time charges are less expensive. The above described options may also be utilized for forwarding messages, erasing messages, saving messages, sending messages, and replying to messages as will be shown in more detail hereinafter.


With the send message function 115, in order to send a message, the message must first be stored at the paging transceiver 100 or at the system 30. The process of storing or recording messages is well know to those of ordinary skill in the art and accordingly will not be described in further detail. Examples of these devices are described in U.S. Pat. No. 4,602,129 to Matthew, et al., titled “Electronic Audio Communications System With Versatile Message Delivery,” and in U.S. Reissued Pat. No. Re. 34,976 to Helferich et al, titled “Analog/Digital Voice Storage Cellular Telephone,” both of which are incorporated herein by reference. The system 30 and paging transceiver 100 can record, store and retrieve a plurality of different types of messages as previously described depending on the application required.


If the send message function 115 is selected, the CPU 27 identifies the message to be sent and cross references it to the selected recipient address information. At step 132, the CPU 27 determines whether a call is required. The subsequent processing of sending a message should be apparent from the description above for forwarding a message and accordingly will not be duplicated in order to simplify description of the invention. The message to be sent may reside in the paging transceiver 100 or in the system 30. If the message resides in the system 30 and in the paging transceiver 100, the message in the system 30 corresponding to the CPU 27 message identifier will be sent in order to conserve air time. If the message does not reside in system 30, the message will be sent from the paging transceiver 100 to the system 30. If the message is to be sent from the paging transceiver 100, the message may be a pre-stored message or alternatively, the message may be transmitted to system 30 by paging transceiver 100 in real time during a call session between system 30 and paging transceiver 100.


If the erase message function is selected at step 116, the erase message function allows a user to erase messages stored at the system 30 or at the paging transceiver 100 depending on the mode of operation. A message may be erased at a paging transceiver 100 without erasing the message identifier. If a message is erased at the paging transceiver 100 and the identifier still exists in message memory 5, the message can be retrieved from the system 30. In order to remove a message identifier at the paging transceiver 100, the message must be erased at the system 30. This feature causes the user to manage the messages at the platform, thereby conserving memory space at the storage and retrieval unit 32. At step 131, the selected message to be erased is identified and the user is asked if the selected message in the paging transceiver is to be erased or if both copies of the message are to be erased. If the local message only is selected to be erased, the message identification information is kept and at step 133 the CPU 27 flags the message stored in memory 5 for erasure or overwriting. In other words, the message still exists but may be over-written by another message when memory space is required and, until then, may be retrieved from message memory 5. If at step 132 a decision was made to erase both copies of the message, then at step 134 the CPU 27 determines if a call is in progress. If yes, at step 135 the CI data is exchanged instructing system 30 to erase the message. At step 131, the system 30 transmits an acknowledgment that the message was erased, the CPU 27 flags the local message for erasure, the identifier is removed and both copies of the message and the identifiers are erased.


If at step 134 the CPU 27 determines that a call is not in progress, the CPU 27 at step 137 erases the local message and the user is asked if the system 30 copy of the message needs to be erased now. If the user responds yes, the call is established at step 139 and the process continues as previously described. If the user responds, the necessary flags are set for erasing the remote message during the next communication with system 30 after the delay of step 141 and the timer 28 is activated. The timer 28 may be utilized for a timed erase of the message stored at system 30.


The message reply function 117 is for sending a reply to an already received message. A reply message utilizes the same process as the send message function except that a return address is already correlated to the message targeted for a reply. During the send message function 115, the user is required to select an address or destination for the message to be sent In other words, the user must know the destination or address in advance. The message reply function 117 does not require that the user know the address of the recipient because the message being replied to has a corresponding return address. As with the send message function 115, a reply message may be sent in real time or it may be pre-recorded and stored in the paging transceiver 100 for transmission to system 30. Additionally, the reply transmission may be delayed for a set period of time as previously described with timer 28.


In summary, as discussed above with reference to FIGS. 5 and 6, the system 30 does not transmit the entire message to the paging transceiver 100 but rather notifies the user that a message is waiting. The paging transceiver 100, as discussed above with reference to FIG. 7, stores data associated with the page and possibly a short message. The user can then select a desired one of plurality of available functions, such as those shown in FIG. 8, and the paging transceiver 100 will process the request in accordance with FIG. 9.


With the system 30 and paging transceiver 100, the paging transceiver 100 can notify a user of a message without receiving the entire message. The user can then decide to act upon the message at a time convenient to the user. Rather than receiving the message with the alert, as occurs with conventional paging receivers, the user can control the time when he or she wants to receive a message and may even decide not to retrieve the message. After the user has been notified, the user can then control the paging transceiver 100 to retrieve the message from the system 30, to save the message at either the system 30 or paging transceiver 100, to forward the message to an indicated recipient, to reply to the message, or to erase the message from the paging transceiver 100 or from the system 30.


With paging transceiver 100, the user can position the paging transceiver in a desired location before initiating communication with the system 30. Thus, if the user is paged by system 30 while the user is in a subway, basement, or on an airplane, the user can postpone the delivery of the message until the paging transceiver 100 is in a better location to receive and reply to the message. Similarly, the user may be in an explosive environment or near sensitive electronic equipment and may postpone delivery of the message and a reply from the paging transceiver 100 until the user is out of the explosive environment or far enough away from the sensitive electronic equipment. The paging transceiver 100 and system 30 therefore give the user control over the messages stored in the system 30.


The paging transceiver 100 and system 30 conserve both valuable air time and also paging transceiver message memory 5. The system 30 does not automatically deliver each message to the intended paging transceiver 100 but instead allows the user to exercise control over the message. Since a message may be many bytes in length, perhaps kilobytes, megabytes, or even greater, the benefit to the system 30 and to the base station 34 in not having to transmit each message can be quite substantial. Also, since each message is not automatically delivered to the paging transceiver 100, the paging transceiver 100 does not become overloaded with messages and instead the user can choose to act on selective messages, such as by retrieving only certain messages. The user, additionally, may decide not to act on any of the messages through base station 34 and may call the system 30 through the PSTN 35, thereby bypassing the base station 34 and its associated charges and expenses.


The paging transceiver 100 and system 30 are not limited to voice messages in a paging system. Rather, the paging transceiver 100 and system 30 may operate with any type of message or information, including, but not limited to numeric messages, alphanumeric messages, voice or other audio messages, video messages, graphics or even data. The paging transceiver 100 may be a separate paging transceiver, may be integral with a mobile radiotelephone, or may be incorporated into other devices.


For instance, the paging transceiver 100 may be integrated into a portable radio, CD, or tape player. The paging transceiver 100 could receive messages from system 30 which indicate portions of songs that may be sampled by the user. The user may browse through a listing of available music and select a desired song. The paging transceiver 100 then communicates with the system 30 to retrieve the selected song and the user can then play the song at the paging transceiver 100.


As another example, the messages may be video messages which the user can browse through and select only desired messages. The paging transceiver 100 may be integral with a television set and the video messages may be promotions for new movies or shows. Alternatively, the paging transceiver 100 may be integral with a game console and the video messages may be clips of new games that are available with that game console. Other applications for the paging transceiver 100 and system 30 will be apparent to those skilled in the art.


The information or message available to a paging transceiver 100 need not be static but instead may be dynamic. In other words, when a paging transceiver 100 is alerted that information is available, the information may be updated or otherwise change from the time that the user was alerted. As an example, the user may receive a weather alert and by the time the user decides to receive the information the information would be updated to reflect current weather conditions. The identifier for the information therefore does not limit the content that may be stored as the information available to the user.


The system 30 is not limited to transmitting only one alert at a time to one paging transceiver 100. Instead, the system 30 may send a plurality of alerts to a single paging transceiver 100 and each of those alerts may be broadcast to a plurality of paging transceivers 100. For instance, the system 30 may broadcast information to a plurality of transceivers 100 that share a common set of numbers within their mobile identification numbers. If the system 30 sends a plurality of alerts to a paging transceiver 100, these alerts may be displayed by the user interface 3 and the user can scroll through and act upon the messages as desired.


As discussed above, the system 30 and paging transceiver 100 allows information to be remotely acted upon by the paging transceiver 100. The system 30, however, also allows users access to their information via conventional ways, such as the PSTN 35. Therefore, a user may receive the alert with a paging transceiver 100 and decide to call in through the PSTN 35 to listen or otherwise act upon the message. The system 30 preferably is connected to the Internet whereby users can also gain access and act upon their information via the Internet.


The paging transceiver 100 preferably alerts the user both when a message identifier signal has been received and when complete messages have been received. The alerts may comprise any suitable indication to inform the user that the paging transceiver 100 has received a communication, such as a tone, vibration, or visual display. The alerts for a received identifier and for a received message are preferably different so as to allow a user to easily differentiate between the two communications.


The example provided in FIG. 3 was a single system 30 for storing messages on behalf of a plurality of paging transceivers 100. The invention, however, may include any number of systems 30 for storing messages with each system 30 storing information for a transceiver 100 being considered a content provider. For instance, as shown in FIG. 10, a messaging system 200 may comprise a plurality of systems 30 connected to the PSTN 35 with system 30A being associated with base station 34A and transceiver antenna 37A and system 30B being associated with base station 34B and transceiver antenna 37B. Although three systems 30 are shown, the system 200 may include any number of systems 30 and, although two base stations 34 are shown, each system 30 may be associated with a base station 34 and transceiver antenna 37 or only one of the systems 30 may be associated with a base station 34 and transceiver antenna 37. Furthermore, each system 30 need not include a paging terminal controller 31 or a storage unit 32. System 30C, for instance, may include a storage and retrieval unit 32 and input/output controller 33 but not a paging terminal controller 31 and may page the paging transceiver 100 through the paging terminal controller 31 in system 30A. Conversely, a system 30, such as system 30A, may include a paging terminal controller 31 and an input/output controller 33 but not a storage and retrieval unit 32. Further, the input/output controller 33 need not be a separate unit but may be incorporated into the paging terminal controller 31 if the system 30 does not include a storage and retrieval unit 32, or into the storage and retrieval unit 32, if the system 30 does not include a paging terminal controller 31. The systems 30 and base stations 34 may communicate with each other through the PSTN 35 or through links or lines other than or in addition to the PSTN 35, such as through an SS7 backbone of a wireless network or through the Internet.


Additionally, each of the base stations 34A and 34B may be part of a paging network but are preferably part of a cellular network. Either one or both of base stations 34A or 34B may page the paging transceiver and either one or both of the base stations 34A or 34B may deliver the contents of messages to the paging transceiver. Each of the systems 30A, 30B, and 30C may store messages on behalf of a user with the messages being of the same or different types. Furthermore, the messages stored within a single system 30 may be all the same type or may differ from each other.


As an example, system 30A may store voice mail messages and email messages directed to the user's office, system 30B may store voice mail messages directed to the user's home, and system 30C may store audio messages. The base station 34A acts as a clearinghouse for all messages delivered to the user to any of the systems 30 and pages the paging transceiver 100 whenever a message is received. Thus, when a voice mail message or email message is received at system 30A, the system 30A delivers a page to base station 34A which is then delivered to paging transceiver 100. When a voice message is received at system 30B, the system 30B sends information about the message to system 30A and system 30A then delivers a page to base station 34A for delivering the page to the paging transceiver 100. Similarly, when system 30C has an audio message it notifies system 30A and system 30A acts to have the page delivered to the paging transceiver 100.


An example of the data transmission 201 sent from system 30B or 30C to system 30A is shown in FIG. 11. The data transmission 201 includes system ID information for identifying the system 30 from a potential plurality of systems 30. The system ID information may be an address code or may comprise the telephone number of the system 30 and may be automatically captured by system 30A, such as from Caller ID or from DNIS information. The data message 201 also identifies the paging transceiver(s) 100, such as with an address code or MIN. For many systems 30, the message or information stored will often be for a single user whereby the transceiver ID would be the address code or MIN for that single paging transceiver 100. For other systems 30, however, the system 30 may want to broadcast a single message to a plurality of paging transceivers 100 whereby the transceiver ID may be a code that identifies a predefined group of paging transceivers 100.


The data transmission 201 also includes message information. The message information includes information identifying the message and preferably also includes information specifying the type of the message, the length of the message, and the message priority. The message identification may identify the message with a unique code, such as a number, or may specify the address in system 30 for the message. The message type advantageously indicates whether the message is a voice message, email message, audio message, video message, or text message. The message length indicates the size of the message and the message priority indicates the priority level of the message. For instance, the user can designate priorities based upon the telephone number of the caller leaving the message or the priority may be set by the caller. Although the data transmission 201 preferably includes this information, the data transmission 201 may include additional or fewer fields than the example provided in FIG. 11.


The data transmission 201 also includes additional information that may be relayed and presented to the user. For instance, for many systems 30 that receive and store messages on behalf of the user, the additional descriptive information preferably comprises a return address for identifying the caller's telephone number to inform the user as to who left the message. For other systems 30 which may generate their own information, the additional information preferably describes the information available to the user. For instance, for a system 30 that allows users to sample songs, the additional information would indicate the title and the artist of the song and may also specify the cost to retrieve and play the song. Other uses of the additional information will be apparent to those skilled in the art.


The page sent to the paging transceiver 100 includes most, if not all, of the data transmission 201. The information transmitted to the paging transceiver 100, with reference to FIG. 7, may be inserted into a short message transmitted to the user at step 98. From the system ID information, the paging transceiver 100 can determine which system 30 it needs to respond to in order to act upon a message. For instance, system 30A may page the paging transceiver 100 and indicate that system 30B has a stored message. If the user selects the retrieve message function, then the paging transceiver 100 can contact system 30B through base station 34B to retrieve the desired message. The paging transceiver 100 as discussed above may instead respond to base station 34A to retrieve the message and base station 34A would communicate with system 30B to retrieve or otherwise act upon the message.


The message information is used by the paging transceiver 100 to inform the user of the message or information stored at the system 30. The message type, length, priority, and additional descriptive material may be displayed or otherwise indicated to the user at the paging transceiver 100. From this information, the user can decide what type of action to take upon the message or information at the system 30.


As described with reference to FIG. 9, a call to the system 30 may be required in order for the paging transceiver 100 to perform a desired function. If a call is required, the paging transceiver 100 relays information in the data transmission 201 to the system 30. If the paging transceiver 100 responds to a system 30 other than the one storing the message or information, the paging transceiver 100 identifies the system 30 storing the message or information and also identifies the message. As discussed above, the message may be identified in a number of ways, such as with a message code or by specifying the location in memory where the message is stored. The call to the system 30 would automatically provide the transceiver identification information to the system 30, although the paging transceiver 100 could provide this information with the other information provided to the system 30.


Upon receiving a call from the paging transceiver 100, the system 30 reads the transceiver identification and message information to find the information requested by the paging transceiver 100. The information obtained from the paging transceiver 100 at the system 30 and the transfer of the requested information to the paging transceiver occurs at step 135 in FIG. 9.


The system 200 can present substantial cost savings to conventional paging systems. With a conventional paging system, the entire message is transmitted to the location of the paging transceiver 100. For instance, if the user's home base is in Chapel Hill, N.C., and the message originates in Chicago, Ill., then the message is typically sent over the PSTN 35 to the home base. With nationwide paging, the user may have traveled to San Diego, Calif. whereby the home base would then send the entire message from Chapel Hill to San Diego. With system 200, on the other hand, only the data transmission 201 is transmitted from Chicago to Chapel Hill and from Chapel Hill to San Diego. The actual message, in contrast, is sent directly from the storage facility in Chicago to San Diego, thereby reducing charges associated with the transfer between Chicago and Chapel Hill. Moreover, the data transmissions 201 between systems 30 may occur over the Internet. These transmissions, for instance, may be formatted according to the Voice Profile for Internet Mail (VPIM) and the addresses of the transceivers 100 may be determined from an open directory service, such as the Lightweight Directory Access Protocol (LDAP) or X.500.


The systems 30 and 200 allow a user to easily manage the multitude of messages that are commonly received every day. Conventionally, a user would have to call in to the office voice mail to retrieve voice messages, call home to retrieve voice messages sent to the house, and connect with the computer network at the office to retrieve email messages. Although paging systems have been used to notify a user that a voice mail message or other message has been received, the user would still have to call in to a separate system to actually retrieve the message. The system 200, on the other hand, enables a user to be notified of all messages, regardless of their type and regardless of their location and furthermore allows the user to selectively retrieve, save, erase or perform other functions on the messages. The systems 30 and 200 and paging transceiver 100, moreover, allow the user to exercise control over the remotely stored messages; the user can selectively store, save, retrieve, erase, forward, send or otherwise perform operations on messages stored at a remote location.


The forgoing description of the preferred embodiments of the invention has been presented only for the purpose of illustration and description and is not intended to be exhaustive or to limit the invention to the precise forms disclosed. Many modifications and variations are possible in light of the above teaching.


The embodiments were chosen and described in order to explain the principles of the invention and their practical application so as to enable others skilled in the art to utilize the invention and various embodiments and with various modifications as are suited to the particular use contemplated.

Claims
  • 1. A method that delivers content from a content provider to a cell phone via a content messaging system that includes an internet-accessible content storage and retrieval system and a notification system, comprising: (a) the content provider storing the content at the internet-accessible content storage and retrieval system; and(b) the content provider receiving identification data from an identifier service, wherein the identification data: (1) includes a system address of a system for the cell phone to initially respond to begin the content retrieval process, wherein the system for the cell phone to initially respond to is not the internet-accessible content storage and retrieval system storing the content, and (2) includes a unique numerical code for identifying the content;(c) wherein after storing the content at the internet-accessible content storage and retrieval system, the content provider causing the notification system to transmit a SMS notification message via a cellular network, wherein the SMS notification message includes: (1) the identification data; (2) text describing the content, and (3) the name of the content provider, wherein the content is not included in the SMS notification message.
  • 2. The method of claim 1, wherein the notification system: (i) includes an interface to a home location registry, (ii) is configured to process data into individual SMS notification messages, and (iii) is configured to transmit the individual SMS notification messages to cellular phones.
  • 3. The method of claim 2 wherein the notification system accesses the home location registry to retrieve data associated with the cellular phone.
  • 4. The method of claim 3 wherein the data retrieved comprises the cellular network location of the wireless communication device.
  • 5. The method of claim 1, further comprising: (d) the content provider receiving a request message transmitted over the mobile radiotelephone network, the request message including (i) data corresponding to the identification data, (ii) an address of the cellular phone, and (iii) a command from the cellular phone to retrieve the content; and(e) the content provider, subsequent to receiving the request message, causing the content to be delivered to the cellular phone via the cellular network.
  • 6. The method of claim 5, wherein the SMS notification message contains an address of the cellular phone.
  • 7. The method of claim 1, further comprising: (d) the content provider causing the content to be updated;(e) the content provider receiving a request message transmitted over the cellular network, the request message including (i) data corresponding to the identification data, (ii) an address of the cellular phone, and (iii) a command from the cellular phone to retrieve the content; and(f) the content provider, subsequent to receiving the request message, causing the updated content to be delivered to the cellular phone via the cellular network.
  • 8. The method of claim 7, wherein the SMS notification message contains an address of the cellular phone.
  • 9. The method of claim 1 wherein the SMS notification message further includes a type identifier that identifies the content's type.
  • 10. The method of claim 9 wherein the type comprises one or more of text, image, audio, and video.
  • 11. The method of claim 1 wherein the SMS notification message further indicates a future time the content is available.
  • 12. The method of claim 1 wherein the cellular network includes at least a global system for mobile communications (GSM) system.
  • 13. The method of claim 1 wherein the information includes at least one of the group consisting of: (1) voice, (2) email, (3) audio, (4) video, (5) graphics, (6) games, and (7) text.
  • 14. The method of claim 1 wherein the content is caused to be delivered to the cellular phone via the cellular network in a way that bypasses the notification system.
  • 15. The method of claim 1, further comprising the content provider receiving, at the internet-accessible content storage and retrieval system, a command from the cellular phone to forward the content to another cellular phone.
  • 16. The method of claim 1, further comprising the content provider receiving, at the internet-accessible content storage and retrieval system, a command from the cellular phone to save the content.
  • 17. The method of claim 1, further comprising the content provider receiving, at the internet-accessible content storage and retrieval system, a command from the cellular phone to delete the content.
  • 18. The method of claim 1, wherein the SMS notification message includes a plurality of address identifiers identifying a plurality of cell phones.
  • 19. The method of claim 1, wherein the SMS notification message includes an address signal identifying a plurality of cell phones.
  • 20. The method of claim 1, further comprising causing status information to be transmitted to the wireless transceiver from the system to initially respond to.
  • 21. The method of claim 20, wherein the request message is based at least in part on the status information.
  • 22. The method of claim 20, wherein the status information comprises an indication of a wrong ID.
  • 23. The method of claim 1, wherein the SMS notification message further includes at least information about the subject of the content.
  • 24. The method of claim 1, wherein the SMS notification message indicates the importance of a message.
  • 25. The method of claim 1, wherein the SMS notification message further comprises a return receipt request.
  • 26. The method of claim 25, wherein the return receipt request is configured such that a response to the return receipt request indicates the content has been read.
  • 27. The method of claim 25, wherein the content provider receives an return receipt from the cellular phone in response to the return receipt request.
  • 28. The method of claim 27, wherein the return receipt indicates that the content has been read by the recipient.
  • 29. The method of claim 1, wherein the address of the cellular phone included in the request message specifies the same cellular phone as a recipient address of the SMS notification message.
  • 30. The method of claim 1, further comprising the content provider causing a request message to be received via the cellular network by the system for the cellular phone to initially respond to, the request message including the system address of a system for the cell phone to initially respond to.
  • 31. The method of claim 30, wherein the request message further includes information that identifies to the system for the cellular phone to initially respond to which content storage and retrieval system actually stores the content and also identifies a location of the identified content in the content storage and retrieval system actually storing the content.
  • 32. The method of claim 31, further comprising the content provider causing the content storage and retrieval system actually storing the content to transmit the content to the cellular phone upon the content storage and retrieval system receiving the information that identifies the location of the identified content.
RELATED APPLICATIONS

This application is a continuation of U.S. patent application Ser. No. 13/109,437, filed May 17, 2011 (pending), which is a divisional of U.S. patent application Ser. No. 12/167,971, flied Jul. 3, 2008 (now U.S. Pat. No. 8,116,741), which is a divisional of U.S. patent application Ser. No. 11/399,513, filed Apr. 7, 2006 (now U.S. Pat. No. 7,499,716), which is a continuation of U.S. patent application Ser. No. 09/688,282, filed on Oct. 13, 2000 (now U.S. Pat. No. 7,039,428), which is a divisional of U.S. patent application Ser. No. 08/933,344, filed on Sep. 19, 1997 (now U.S. Pat. No. 6,253,061). The contents of the above referenced applications are incorporated herein by this reference. Reference is made to the following co-pending and patented patent applications: (1) Ser. No. 08/934,337 (now U.S. Pat. No. 6,259,892); (2) Ser. No. 08/934,143 (now U.S. Pat. No. 6,233,430); (3) Ser. No. 08/934,132 (now U.S. Pat. No. 6,087,956); (4) Ser. No. 09/860,954 (now U.S. Pat. No. 6,462,646); (5) Ser. No. 10/236,932 (now U.S. Pat. No. 6,696,921); (6) Ser. No. 09/688,321 (now U.S. Pat. No. 7,003,304); (7) Ser. No. 09/613,345 (now U.S. Pat. No. 6,459,360); (8) Ser. No. 11/049,869 (now U.S. Pat. No. 7,277,716); (9) Ser. No. 11/050,775 (now U.S. Pat. No. 7,155,241); (10) Ser. No. 11/082,913 (now U.S. Pat. No. 7,280,838); (11) Ser. No. 11/081,611 (now U.S. Pat. No. 7,376,432); (12) Ser. No. 11/082,872 (now U.S. Pat. No. 7,242,951); (13) Ser. No. 11/083,897 (now U.S. Pat. No. 7,403,787); (14) Ser. No. 11/635,781 (now U.S. Pat. No. 7,843,314); (15) Ser. No. 12/367,358 (now U.S. Pat. No. 8,134,450); (16) Ser. No. 12/580,189 now U.S. Pat. No. 8,224,294); (17) Ser. No. 12/764,025 (now U.S. Pat. No. 7,835,357); and (18) Ser. No. 13/109,389 (now U.S. Pat. No. 8,355,702).

US Referenced Citations (834)
Number Name Date Kind
2003576 Buhren Jun 1935 A
3118145 Nee Jan 1964 A
3794983 Sahin Feb 1974 A
3973200 Akerberg Aug 1976 A
4039761 Nicoud et al. Aug 1977 A
4042906 Ezell Aug 1977 A
4124773 Elkins Nov 1978 A
4369443 Giallanza et al. Jan 1983 A
4371752 Matthews et al. Feb 1983 A
4412217 Willard et al. Oct 1983 A
4468813 Burke et al. Aug 1984 A
4480253 Anderson Oct 1984 A
4495647 Burke et al. Jan 1985 A
4549047 Brian et al. Oct 1985 A
4573140 Szeto Feb 1986 A
4602129 Matthews et al. Jul 1986 A
4640991 Matthews et al. Feb 1987 A
4644352 Fujii Feb 1987 A
4654713 Boucharlat et al. Mar 1987 A
4710955 Kauffman Dec 1987 A
4713837 Gordon Dec 1987 A
4737979 Hashimoto Apr 1988 A
4769641 Yoshizawa et al. Sep 1988 A
4769642 Davis et al. Sep 1988 A
4786902 Davis et al. Nov 1988 A
4807155 Cree et al. Feb 1989 A
4811376 Davis et al. Mar 1989 A
4812843 Champion, III et al. Mar 1989 A
4821308 Hashimoto Apr 1989 A
4825456 Rosenberg Apr 1989 A
4837798 Cohen et al. Jun 1989 A
4837800 Freeburg et al. Jun 1989 A
4839734 Takemura Jun 1989 A
4845491 Fascenda et al. Jul 1989 A
4851829 DeLuca et al. Jul 1989 A
4853688 Andros et al. Aug 1989 A
4858232 Diaz et al. Aug 1989 A
4864301 Helferich Sep 1989 A
4868560 Oliwa et al. Sep 1989 A
4872005 DeLuca et al. Oct 1989 A
4873520 Fisch et al. Oct 1989 A
4885577 Nelson Dec 1989 A
4897835 Gaskill et al. Jan 1990 A
4905003 Helferich Feb 1990 A
4916737 Chomet et al. Apr 1990 A
4942598 Davis Jul 1990 A
4949143 Iesaka et al. Aug 1990 A
4961216 Baehr et al. Oct 1990 A
4965569 Bennett et al. Oct 1990 A
4975694 McLaughlin et al. Dec 1990 A
5003576 Helferich Mar 1991 A
5003577 Ertz et al. Mar 1991 A
5005013 Tsukamoto et al. Apr 1991 A
5007105 Kudoh et al. Apr 1991 A
5029199 Jones et al. Jul 1991 A
5040204 Sasaki et al. Aug 1991 A
5043721 May Aug 1991 A
5047763 Kuznicki et al. Sep 1991 A
5065423 Gaskill Nov 1991 A
5070536 Mahany et al. Dec 1991 A
5093659 Yamada Mar 1992 A
5093901 Cree et al. Mar 1992 A
5115233 Zdunek et al. May 1992 A
5117449 Metroka et al. May 1992 A
5128980 Choi Jul 1992 A
5128981 Tsukamoto et al. Jul 1992 A
5134724 Gehring et al. Jul 1992 A
5138311 Weinberg Aug 1992 A
5138312 Tsukamoto et al. Aug 1992 A
5140419 Galumbeck et al. Aug 1992 A
5146612 Grosjean et al. Sep 1992 A
5153582 Davis Oct 1992 A
5153903 Eastmond et al. Oct 1992 A
5159331 Park et al. Oct 1992 A
5159592 Perkins Oct 1992 A
5159713 Gaskill et al. Oct 1992 A
5173688 DeLuca et al. Dec 1992 A
5175758 Levanto et al. Dec 1992 A
5177780 Kasper et al. Jan 1993 A
5182553 Kung Jan 1993 A
5185604 Nepple et al. Feb 1993 A
5192947 Neustein Mar 1993 A
5194857 Gomez Mar 1993 A
5212636 Nakazawa May 1993 A
5220366 King Jun 1993 A
5227774 Benoist Jul 1993 A
5239466 Morgan et al. Aug 1993 A
5239679 Murai Aug 1993 A
5241305 Fascenda et al. Aug 1993 A
5247700 Wohl et al. Sep 1993 A
5249230 Mihm, Jr. Sep 1993 A
5255305 Sattar Oct 1993 A
5257307 Ise Oct 1993 A
5265033 Vajk et al. Nov 1993 A
5283818 Klausner et al. Feb 1994 A
5285426 Teodoridis Feb 1994 A
5285496 Frank et al. Feb 1994 A
5315635 Kane et al. May 1994 A
5329501 Meister et al. Jul 1994 A
5329550 Rousseau et al. Jul 1994 A
5332994 Kawashima et al. Jul 1994 A
5333266 Boaz et al. Jul 1994 A
5349678 Morris et al. Sep 1994 A
5375161 Fuller et al. Dec 1994 A
5379031 Mondrosch et al. Jan 1995 A
5390362 Modjeska et al. Feb 1995 A
5392451 Schwendeman et al. Feb 1995 A
5396537 Schwendeman Mar 1995 A
5396547 Baals et al. Mar 1995 A
5398021 Moore Mar 1995 A
5402466 Delahanty Mar 1995 A
5406557 Baudoin Apr 1995 A
5406616 Bjorndahl Apr 1995 A
5410302 Dulaney, III et al. Apr 1995 A
5416473 Dulaney, III et al. May 1995 A
5416725 Pacheco et al. May 1995 A
5418835 Frohman et al. May 1995 A
5420922 Lundblad et al. May 1995 A
RE34976 Helferich et al. Jun 1995 E
5426422 Vanden Heuvel et al. Jun 1995 A
5426594 Wright et al. Jun 1995 A
5428663 Grimes et al. Jun 1995 A
5428784 Cahill, Jr. Jun 1995 A
5432839 DeLuca Jul 1995 A
5436960 Campana, Jr. et al. Jul 1995 A
5438611 Campana, Jr. et al. Aug 1995 A
5440559 Gaskill Aug 1995 A
5442706 Kung Aug 1995 A
5444438 Goldberg Aug 1995 A
5444671 Tschannen et al. Aug 1995 A
5448759 Krebs et al. Sep 1995 A
5452289 Sharma et al. Sep 1995 A
5452356 Albert Sep 1995 A
5455579 Bennett et al. Oct 1995 A
5455823 Noreen et al. Oct 1995 A
5457732 Goldberg Oct 1995 A
5463382 Nikas et al. Oct 1995 A
5463672 Kage Oct 1995 A
5471470 Sharma et al. Nov 1995 A
5473143 Vak et al. Dec 1995 A
5473320 DeLuca et al. Dec 1995 A
5473667 Neustein Dec 1995 A
5475653 Yamada et al. Dec 1995 A
5475863 Simpson et al. Dec 1995 A
5475866 Ruthenberg Dec 1995 A
5479378 Yamada et al. Dec 1995 A
5479408 Will Dec 1995 A
5479472 Campana, Jr. et al. Dec 1995 A
5481255 Albert et al. Jan 1996 A
5483352 Fukuyama et al. Jan 1996 A
5483595 Owen Jan 1996 A
5485503 Diem Jan 1996 A
5487100 Kane Jan 1996 A
5487167 Dinallo et al. Jan 1996 A
5489894 Murray Feb 1996 A
5493692 Theimer et al. Feb 1996 A
5497373 Hulen et al. Mar 1996 A
5506886 Maine et al. Apr 1996 A
5511069 England et al. Apr 1996 A
5524009 Tuutijarvi et al. Jun 1996 A
5530438 Bickham et al. Jun 1996 A
5530930 Hahn Jun 1996 A
5544321 Theimer et al. Aug 1996 A
5546077 Lipp et al. Aug 1996 A
5550535 Park Aug 1996 A
5555376 Theimer et al. Sep 1996 A
5555446 Jasinski Sep 1996 A
5557606 Moon Sep 1996 A
5557659 Hyde-Thomson Sep 1996 A
5557749 Norris Sep 1996 A
5559800 Mousseau et al. Sep 1996 A
5559862 Bhagat et al. Sep 1996 A
5561702 Lipp et al. Oct 1996 A
5564018 Flores et al. Oct 1996 A
5568536 Tiller et al. Oct 1996 A
5568540 Greco et al. Oct 1996 A
5572196 Sakumoto et al. Nov 1996 A
5572488 Yamada et al. Nov 1996 A
5577041 Sharma et al. Nov 1996 A
5579372 Astrom Nov 1996 A
5581366 Merchant et al. Dec 1996 A
5581593 Engelke et al. Dec 1996 A
5584070 Harris et al. Dec 1996 A
5588009 Will Dec 1996 A
5590092 Fehnel Dec 1996 A
5592532 Koizumi Jan 1997 A
5600703 Dang et al. Feb 1997 A
5600708 Meche et al. Feb 1997 A
5603054 Theimer et al. Feb 1997 A
5604788 Tett Feb 1997 A
5608446 Carr et al. Mar 1997 A
5608786 Gordon Mar 1997 A
5611050 Theimer et al. Mar 1997 A
5623242 Dawson, Jr. et al. Apr 1997 A
5625870 Moon Apr 1997 A
5627525 Kudoh et al. May 1997 A
5627876 Moon May 1997 A
5630060 Tang et al. May 1997 A
5630207 Gitlin et al. May 1997 A
5631635 Robertson May 1997 A
5631948 Bartholomew et al. May 1997 A
5633916 Goldhagen et al. May 1997 A
5635918 Tett Jun 1997 A
5636265 O'Connell et al. Jun 1997 A
5638369 Ayerst et al. Jun 1997 A
5640442 Fitzgerald et al. Jun 1997 A
5644627 Segal et al. Jul 1997 A
5649305 Yoshida Jul 1997 A
5652789 Miner et al. Jul 1997 A
5654942 Akahane Aug 1997 A
5661782 Bartholomew et al. Aug 1997 A
5663703 Pearlman et al. Sep 1997 A
5668880 Alajajian Sep 1997 A
5675507 Bobo, II Oct 1997 A
5675627 Yaker Oct 1997 A
5678176 Moon Oct 1997 A
5678179 Turcotte et al. Oct 1997 A
5680442 Bartholomew et al. Oct 1997 A
5684859 Chanroo et al. Nov 1997 A
5694120 Indekeu et al. Dec 1997 A
5694454 Hill et al. Dec 1997 A
5696500 Diem Dec 1997 A
5699053 Jonsson Dec 1997 A
5703934 Zicker et al. Dec 1997 A
5706211 Beletic et al. Jan 1998 A
5706434 Fraize et al. Jan 1998 A
5710816 Stork et al. Jan 1998 A
5717742 Hyde-Thomson Feb 1998 A
5722071 Berg et al. Feb 1998 A
5724410 Parvulescu et al. Mar 1998 A
5724424 Gifford Mar 1998 A
5726643 Tani Mar 1998 A
5737394 Anderson et al. Apr 1998 A
5737395 Irribarren Apr 1998 A
5737688 Sakai et al. Apr 1998 A
5740230 Vaudreuil Apr 1998 A
5742668 Pepe et al. Apr 1998 A
5745689 Yeager et al. Apr 1998 A
5748100 Gutman et al. May 1998 A
5751706 Land et al. May 1998 A
5751793 Davies et al. May 1998 A
5751814 Kafri May 1998 A
5752191 Fuller et al. May 1998 A
5754119 Deluca et al. May 1998 A
5761622 Priest Jun 1998 A
5764747 Yue et al. Jun 1998 A
5768381 Hawthorne Jun 1998 A
5768509 Günlük Jun 1998 A
5774803 Kariya Jun 1998 A
5778315 Proietti Jul 1998 A
5781857 Hwang et al. Jul 1998 A
5787345 Moon Jul 1998 A
5794039 Guck Aug 1998 A
5794144 Comer et al. Aug 1998 A
5796394 Wicks et al. Aug 1998 A
5797091 Clise et al. Aug 1998 A
5802165 Kim Sep 1998 A
5802466 Gallant et al. Sep 1998 A
5805886 Skarbo et al. Sep 1998 A
5809115 Inkinen Sep 1998 A
5809116 Cairo Sep 1998 A
5809130 Ayala Sep 1998 A
5809413 Meche et al. Sep 1998 A
5809415 Rossmann Sep 1998 A
5809424 Eizenhoefer Sep 1998 A
5809428 Garahi et al. Sep 1998 A
5812639 Bartholomew et al. Sep 1998 A
5812671 Ross, Jr. Sep 1998 A
5812776 Gifford Sep 1998 A
5812795 Horovitz et al. Sep 1998 A
5812865 Theimer et al. Sep 1998 A
5815800 Su et al. Sep 1998 A
5818824 Lu et al. Oct 1998 A
5821874 Parvulescu et al. Oct 1998 A
5826187 Core et al. Oct 1998 A
5826191 Krishnan Oct 1998 A
5828882 Hinckley Oct 1998 A
5835089 Skarbo et al. Nov 1998 A
5838252 Kikinis Nov 1998 A
5841837 Fuller et al. Nov 1998 A
5844498 Ide Dec 1998 A
5845202 Davis Dec 1998 A
5845211 Roach, Jr. Dec 1998 A
5850429 Joyce et al. Dec 1998 A
5850520 Griebenow et al. Dec 1998 A
5850594 Cannon et al. Dec 1998 A
5857020 Peterson, Jr. Jan 1999 A
5862325 Reed et al. Jan 1999 A
5864606 Hanson et al. Jan 1999 A
5867793 Davis Feb 1999 A
5870030 DeLuca et al. Feb 1999 A
5870454 Dahlen Feb 1999 A
5872779 Vaudreuil Feb 1999 A
5872847 Boyle et al. Feb 1999 A
5872926 Levac et al. Feb 1999 A
5872930 Masters et al. Feb 1999 A
5875436 Kikinis Feb 1999 A
5878230 Weber et al. Mar 1999 A
5878351 Alanara et al. Mar 1999 A
5880731 Liles et al. Mar 1999 A
5884159 Thro et al. Mar 1999 A
5884160 Kanazaki Mar 1999 A
5884170 Valentine et al. Mar 1999 A
5887249 Schmid Mar 1999 A
5889852 Rosecrans et al. Mar 1999 A
5892909 Grasso et al. Apr 1999 A
5893032 Maeda et al. Apr 1999 A
5893091 Hunt et al. Apr 1999 A
5895471 King et al. Apr 1999 A
5897622 Blinn et al. Apr 1999 A
5903723 Beck et al. May 1999 A
5903845 Buhrmann et al. May 1999 A
5905495 Tanaka et al. May 1999 A
5905777 Foladare et al. May 1999 A
5905865 Palmer et al. May 1999 A
5907680 Nielsen May 1999 A
5907805 Chotai May 1999 A
5909491 Luo Jun 1999 A
5913032 Schwartz et al. Jun 1999 A
5918158 LaPorta et al. Jun 1999 A
5920826 Metso et al. Jul 1999 A
5924016 Fuller et al. Jul 1999 A
5928325 Shaughnessy et al. Jul 1999 A
5930250 Klok et al. Jul 1999 A
5930471 Milewski et al. Jul 1999 A
5930701 Skog Jul 1999 A
5933478 Ozaki et al. Aug 1999 A
5936547 Lund Aug 1999 A
5937161 Mulligan et al. Aug 1999 A
5938725 Hara Aug 1999 A
5943055 Sylvan Aug 1999 A
5943397 Gabin et al. Aug 1999 A
5946629 Sawyer Aug 1999 A
5948059 Woo et al. Sep 1999 A
5951638 Hoss et al. Sep 1999 A
5956390 McKibben et al. Sep 1999 A
5958006 Eggleston et al. Sep 1999 A
5961590 Mendez et al. Oct 1999 A
5961620 Trent et al. Oct 1999 A
5963618 Porter Oct 1999 A
5966652 Coad et al. Oct 1999 A
5974447 Cannon et al. Oct 1999 A
5974449 Chang et al. Oct 1999 A
5978837 Foladare et al. Nov 1999 A
5988857 Ozawa et al. Nov 1999 A
5991615 Coppinger et al. Nov 1999 A
5991799 Yen et al. Nov 1999 A
5995597 Woltz et al. Nov 1999 A
6009173 Sumner Dec 1999 A
6014559 Amin Jan 2000 A
6018654 Valentine et al. Jan 2000 A
6018657 Kennedy et al. Jan 2000 A
6018774 Mayle et al. Jan 2000 A
6021114 Shaffer et al. Feb 2000 A
6021190 Fuller et al. Feb 2000 A
6021307 Chan Feb 2000 A
6021394 Takahashi Feb 2000 A
6021433 Payne et al. Feb 2000 A
6026153 Fuller et al. Feb 2000 A
6026292 Coppinger et al. Feb 2000 A
6029065 Shah Feb 2000 A
6029171 Smiga et al. Feb 2000 A
6032039 Kaplan Feb 2000 A
6035104 Zahariev Mar 2000 A
6041124 Sugita Mar 2000 A
6044247 Taskett et al. Mar 2000 A
6047053 Miner et al. Apr 2000 A
6047327 Tso et al. Apr 2000 A
6049821 Theriault et al. Apr 2000 A
6052442 Cooper et al. Apr 2000 A
6052595 Schellinger et al. Apr 2000 A
6058304 Callaghan et al. May 2000 A
6060997 Taubenheim et al. May 2000 A
6061570 Janow May 2000 A
6064342 Sandhu et al. May 2000 A
6064879 Fujiwara et al. May 2000 A
6067082 Enmei May 2000 A
6070067 Nguyen et al. May 2000 A
6073165 Narasimhan et al. Jun 2000 A
6081703 Hallqvist Jun 2000 A
6087956 Helferich Jul 2000 A
6088127 Pieterse Jul 2000 A
6088717 Reed et al. Jul 2000 A
6091957 Larkins et al. Jul 2000 A
6094574 Vance et al. Jul 2000 A
6097941 Helferich Aug 2000 A
6101531 Eggleston et al. Aug 2000 A
6115248 Canova et al. Sep 2000 A
6119167 Boyle et al. Sep 2000 A
6122484 Fuller et al. Sep 2000 A
6122503 Daly Sep 2000 A
6125281 Wells et al. Sep 2000 A
6128490 Shaheen et al. Oct 2000 A
6134325 Vanstone et al. Oct 2000 A
6134432 Holmes et al. Oct 2000 A
6137864 Yaker Oct 2000 A
6138158 Boyle et al. Oct 2000 A
6141666 Tobin Oct 2000 A
6144313 Nakano Nov 2000 A
6144671 Perinpanathan et al. Nov 2000 A
6145079 Mitty Nov 2000 A
6147314 Han et al. Nov 2000 A
6151386 Argade Nov 2000 A
6151443 Gable et al. Nov 2000 A
6151491 Farris et al. Nov 2000 A
6151507 Laiho Nov 2000 A
6167253 Farris et al. Dec 2000 A
6167426 Payne et al. Dec 2000 A
6169883 Vimpari et al. Jan 2001 B1
6169911 Wagner et al. Jan 2001 B1
6175859 Mohler Jan 2001 B1
6178331 Holmes et al. Jan 2001 B1
6181736 McLaughlin et al. Jan 2001 B1
6185423 Brown et al. Feb 2001 B1
6192112 Rapaport et al. Feb 2001 B1
6192407 Smith et al. Feb 2001 B1
6195564 Rydbeck et al. Feb 2001 B1
6201974 Leitsalmi et al. Mar 2001 B1
6205330 Winbladh Mar 2001 B1
6208839 Davani Mar 2001 B1
6212550 Segur Apr 2001 B1
6215858 Bartholomew et al. Apr 2001 B1
6216165 Woltz et al. Apr 2001 B1
6219694 Lazaridis et al. Apr 2001 B1
6219696 Wynblatt et al. Apr 2001 B1
6222857 Kammer et al. Apr 2001 B1
6223042 Raffel Apr 2001 B1
6226495 Neustein May 2001 B1
6226533 Akahane May 2001 B1
6230133 Bennett, III et al. May 2001 B1
6230188 Marcus May 2001 B1
6230202 Lewine May 2001 B1
6233318 Picard et al. May 2001 B1
6233430 Helferich May 2001 B1
6236804 Tozaki et al. May 2001 B1
6243739 Schwartz et al. Jun 2001 B1
6246871 Ala-Laurila Jun 2001 B1
6252588 Dawson Jun 2001 B1
6253061 Helferich Jun 2001 B1
6259892 Helferich Jul 2001 B1
6272532 Feinleib Aug 2001 B1
6278862 Henderson Aug 2001 B1
6282435 Wagner et al. Aug 2001 B1
6285745 Bartholomew et al. Sep 2001 B1
6285777 Kanevsky et al. Sep 2001 B2
6288715 Bain et al. Sep 2001 B1
6292668 Alanara et al. Sep 2001 B1
6298231 Heinz Oct 2001 B1
6301471 Dahm et al. Oct 2001 B1
6301513 Divon et al. Oct 2001 B1
6317085 Sandhu et al. Nov 2001 B1
6317594 Gossman et al. Nov 2001 B1
6320957 Draganoff Nov 2001 B1
6321094 Hayashi et al. Nov 2001 B1
6321267 Donaldson Nov 2001 B1
6330079 Dugan et al. Dec 2001 B1
6330244 Swartz et al. Dec 2001 B1
6330308 Cheston et al. Dec 2001 B1
6333919 Gaffney Dec 2001 B2
6333973 Smith et al. Dec 2001 B1
6336135 Niblett et al. Jan 2002 B1
6339591 Migimatsu Jan 2002 B1
6343219 Wada Jan 2002 B1
6344848 Rowe et al. Feb 2002 B1
6351523 Detlef Feb 2002 B1
6356939 Dahl Mar 2002 B1
6361523 Bierman Mar 2002 B1
6363082 Kammer et al. Mar 2002 B1
RE37618 Helferich Apr 2002 E
6370389 Isomursu et al. Apr 2002 B1
6373835 Ng Apr 2002 B1
6381465 Chern et al. Apr 2002 B1
6381650 Peacock et al. Apr 2002 B1
6388877 Canova et al. May 2002 B1
6389457 Lazaridis et al. May 2002 B2
6389572 Garrabrant et al. May 2002 B1
6397059 Vance et al. May 2002 B1
6401113 Lazaridis et al. Jun 2002 B2
6411827 Minata Jun 2002 B1
6418305 Neustein Jul 2002 B1
6418307 Amin Jul 2002 B1
6421678 Smiga et al. Jul 2002 B2
6422147 Shann Jul 2002 B1
6424841 Gustafsson Jul 2002 B1
6425087 Osborn et al. Jul 2002 B1
6438585 Mousseau et al. Aug 2002 B2
6441824 Hertzfeld et al. Aug 2002 B2
6442243 Valco et al. Aug 2002 B1
6442637 Hawkins et al. Aug 2002 B1
6449344 Goldfinger Sep 2002 B1
6457134 Lemke et al. Sep 2002 B1
6459360 Helferich Oct 2002 B1
6462646 Helferich Oct 2002 B2
6463463 Godfrey et al. Oct 2002 B1
6463464 Lazaridis et al. Oct 2002 B1
6484027 Mauney et al. Nov 2002 B1
6501834 Milewski et al. Dec 2002 B1
6505237 Beyda et al. Jan 2003 B2
6510453 Apfel et al. Jan 2003 B1
6516202 Hawkins et al. Feb 2003 B1
6522877 Lietsalmi et al. Feb 2003 B1
6522879 Myer et al. Feb 2003 B2
6523124 Lunsford et al. Feb 2003 B1
6526127 Piotrowski et al. Feb 2003 B1
6539476 Marianetti et al. Mar 2003 B1
6546083 Chaves et al. Apr 2003 B1
6564249 Shiigi May 2003 B2
6567179 Sato et al. May 2003 B1
6580784 Rodriquez et al. Jun 2003 B2
6580787 Akhteruzzaman et al. Jun 2003 B1
6587681 Sawai Jul 2003 B1
6587693 Lumme et al. Jul 2003 B1
6590588 Lincke et al. Jul 2003 B2
6597688 Narasimhan et al. Jul 2003 B2
6597903 Dahm et al. Jul 2003 B1
6611254 Griffin et al. Aug 2003 B1
6622147 Smiga et al. Sep 2003 B1
6625142 Joffe et al. Sep 2003 B1
6625642 Naylor et al. Sep 2003 B1
6633630 Owens et al. Oct 2003 B1
6636522 Perinpanathan et al. Oct 2003 B1
6636733 Helferich Oct 2003 B1
6658409 Nomura et al. Dec 2003 B1
6662195 Langseth et al. Dec 2003 B1
6665547 Ehara Dec 2003 B1
6665803 Lunsford et al. Dec 2003 B2
6671715 Langseth et al. Dec 2003 B1
6687839 Tate et al. Feb 2004 B1
6694316 Langseth et al. Feb 2004 B1
6701378 Gilhuly et al. Mar 2004 B1
6728530 Heinonen et al. Apr 2004 B1
6741980 Langseth et al. May 2004 B1
6744528 Picoult et al. Jun 2004 B2
6744874 Wu Jun 2004 B2
6751453 Schemers et al. Jun 2004 B2
6760423 Todd Jul 2004 B1
6766490 Garrabrant et al. Jul 2004 B1
6771949 Corliss Aug 2004 B1
6775264 Kurganov Aug 2004 B1
6775689 Raghunandan Aug 2004 B1
6779019 Mousseau et al. Aug 2004 B1
6779022 Horstmann et al. Aug 2004 B1
6788767 Lambke Sep 2004 B2
6792112 Campbell et al. Sep 2004 B1
6792544 Hashem et al. Sep 2004 B2
6807277 Doonan et al. Oct 2004 B1
6813489 Wu et al. Nov 2004 B1
6816723 Borland Nov 2004 B1
6823225 Sass Nov 2004 B1
6826407 Helferich Nov 2004 B1
6832130 Pintsov et al. Dec 2004 B2
6868498 Katsikas Mar 2005 B1
6869016 Waxelbaum Mar 2005 B2
6871214 Parsons et al. Mar 2005 B2
6880079 Kefford et al. Apr 2005 B2
6882709 Sherlock et al. Apr 2005 B1
6886096 Appenseller et al. Apr 2005 B2
6892074 Tarkiainen et al. May 2005 B2
6912285 Jevans Jun 2005 B2
6912400 Olsson et al. Jun 2005 B1
6920637 Mason et al. Jul 2005 B2
RE38787 Sainton et al. Aug 2005 E
6938065 Jain Aug 2005 B2
6941349 Godfrey et al. Sep 2005 B2
6944283 Klein Sep 2005 B1
6950679 Sugiyama et al. Sep 2005 B2
6952599 Noda et al. Oct 2005 B2
6980792 Iivonen et al. Dec 2005 B2
6983138 Helferich Jan 2006 B1
6990587 Willins et al. Jan 2006 B2
7003308 Fuoss et al. Feb 2006 B1
7006459 Kokot et al. Feb 2006 B2
7007239 Hawkins et al. Feb 2006 B1
7013391 Herle et al. Mar 2006 B2
7017181 Spies et al. Mar 2006 B2
7020688 Sykes, Jr. Mar 2006 B2
7023967 Andersson et al. Apr 2006 B1
7031437 Parsons et al. Apr 2006 B1
7054905 Hanna et al. May 2006 B1
7058390 Chikazawa Jun 2006 B2
7062536 Fellenstein et al. Jun 2006 B2
7065189 Wakabayashi Jun 2006 B2
7068993 Rai et al. Jun 2006 B2
7072642 Yabe et al. Jul 2006 B2
7076528 Premutico Jul 2006 B2
7079006 Abe Jul 2006 B1
7082469 Gold et al. Jul 2006 B2
7082536 Filipi-Martin Jul 2006 B2
7088990 Isomursu et al. Aug 2006 B1
7092743 Vegh Aug 2006 B2
7100048 Czajkowski et al. Aug 2006 B1
7107246 Wang Sep 2006 B2
7113601 Ananda Sep 2006 B2
7113803 Dehlin Sep 2006 B2
7113979 Smith et al. Sep 2006 B1
7116762 Bennett, III et al. Oct 2006 B2
7116997 Byers et al. Oct 2006 B2
7133687 El-Fishawy et al. Nov 2006 B1
7146009 Andivahis et al. Dec 2006 B2
7149537 Kupsh et al. Dec 2006 B1
7149893 Leonard et al. Dec 2006 B1
7155241 Helferich Dec 2006 B2
7188186 Meyer et al. Mar 2007 B1
7218919 Vaananen May 2007 B2
7233655 Gailey et al. Jun 2007 B2
7239338 Krisbergh et al. Jul 2007 B2
7251314 Huang Jul 2007 B2
7254384 Gailey et al. Aug 2007 B2
7277692 Jones et al. Oct 2007 B1
7277716 Helferich Oct 2007 B2
7280838 Helferich Oct 2007 B2
7286817 Provost et al. Oct 2007 B2
7289797 Kato Oct 2007 B2
7299036 Sanding et al. Nov 2007 B2
7299046 Ozugur et al. Nov 2007 B1
7317929 El-Fishawy et al. Jan 2008 B1
7333817 Tsuchiyama Feb 2008 B2
7353018 Mauney et al. Apr 2008 B2
7403793 Mauney et al. Jul 2008 B2
7426264 Henderson Sep 2008 B1
7433461 Bauer Oct 2008 B1
7734305 Alanara et al. Jun 2010 B2
20010005857 Lazaridis et al. Jun 2001 A1
20010005860 Lazaridis et al. Jun 2001 A1
20010005861 Mousseau et al. Jun 2001 A1
20010013071 Lazaridis et al. Aug 2001 A1
20010048737 Goldberg et al. Dec 2001 A1
20010054115 Ferguson et al. Dec 2001 A1
20020012323 Petite Jan 2002 A1
20020023131 Wu et al. Feb 2002 A1
20020029258 Mousseau et al. Mar 2002 A1
20020032658 Oki et al. Mar 2002 A1
20020035687 Skantze Mar 2002 A1
20020038298 Kusakabe et al. Mar 2002 A1
20020039419 Akimoto et al. Apr 2002 A1
20020046084 Steele et al. Apr 2002 A1
20020049818 Gilhuly et al. Apr 2002 A1
20020052218 Rhee May 2002 A1
20020065887 Paik et al. May 2002 A1
20020065895 Zhang et al. May 2002 A1
20020087645 Ertugrul et al. Jul 2002 A1
20020091777 Schwartz Jul 2002 A1
20020091782 Benninghoff Jul 2002 A1
20020101998 Wong et al. Aug 2002 A1
20020107928 Chalon Aug 2002 A1
20020120696 Mousseau et al. Aug 2002 A1
20020120788 Wang et al. Aug 2002 A1
20020128036 Yach et al. Sep 2002 A1
20020138735 Felt et al. Sep 2002 A1
20020138759 Dutta Sep 2002 A1
20020156691 Hughes et al. Oct 2002 A1
20020178353 Graham Nov 2002 A1
20020181701 Lee Dec 2002 A1
20020194281 McConnell et al. Dec 2002 A1
20020194285 Mousseau et al. Dec 2002 A1
20030005066 Lazaridis et al. Jan 2003 A1
20030009698 Lindeman et al. Jan 2003 A1
20030037261 Meffert et al. Feb 2003 A1
20030048905 Gehring et al. Mar 2003 A1
20030050987 Lazaridis et al. Mar 2003 A1
20030055902 Amir et al. Mar 2003 A1
20030061511 Fischer Mar 2003 A1
20030078058 Vatanen et al. Apr 2003 A1
20030081621 Godfrey et al. May 2003 A1
20030088633 Chiu et al. May 2003 A1
20030097361 Huang et al. May 2003 A1
20030115448 Bouchard Jun 2003 A1
20030120733 Forman Jun 2003 A1
20030126216 Avila et al. Jul 2003 A1
20030126220 Wanless Jul 2003 A1
20030142364 Goldstone Jul 2003 A1
20030182575 Korfanta Sep 2003 A1
20030187938 Mousseau et al. Oct 2003 A1
20030191808 Adler et al. Oct 2003 A1
20030194990 Helferich Oct 2003 A1
20030204568 Bhargava et al. Oct 2003 A1
20030220979 Hejl Nov 2003 A1
20030222765 Curbow et al. Dec 2003 A1
20030235307 Miyamoto Dec 2003 A1
20030235308 Boynton et al. Dec 2003 A1
20030237082 Thurlow Dec 2003 A1
20040019780 Waugh et al. Jan 2004 A1
20040021889 McAfee et al. Feb 2004 A1
20040024824 Ferguson et al. Feb 2004 A1
20040030906 Marmigere et al. Feb 2004 A1
20040052340 Joffe et al. Mar 2004 A1
20040059598 L. Wellons et al. Mar 2004 A1
20040059914 Karaoguz Mar 2004 A1
20040060056 Wellons et al. Mar 2004 A1
20040073619 Gilhuly et al. Apr 2004 A1
20040078488 Patrick Apr 2004 A1
20040083271 Robert Tosey Apr 2004 A1
20040083365 Renier et al. Apr 2004 A1
20040111478 Gross et al. Jun 2004 A1
20040111480 Yue Jun 2004 A1
20040116073 Mauney et al. Jun 2004 A1
20040116119 Lewis et al. Jun 2004 A1
20040122847 Rodgers Jun 2004 A1
20040122905 Smith et al. Jun 2004 A1
20040137884 Engstrom et al. Jul 2004 A1
20040137955 Engstrom et al. Jul 2004 A1
20040165727 Moreh et al. Aug 2004 A1
20040185877 Asthana et al. Sep 2004 A1
20040194116 McKee et al. Sep 2004 A1
20040196978 Godfrey et al. Oct 2004 A1
20040198348 Gresham et al. Oct 2004 A1
20040199669 Riggs et al. Oct 2004 A1
20040202327 Little et al. Oct 2004 A1
20040203642 Zatloukal et al. Oct 2004 A1
20040205106 Adler et al. Oct 2004 A1
20040205248 Little et al. Oct 2004 A1
20040205330 Godfrey et al. Oct 2004 A1
20040208296 Aboujaoude et al. Oct 2004 A1
20040212639 Smoot et al. Oct 2004 A1
20040221014 Tomkow Nov 2004 A1
20040221048 Ogier Nov 2004 A1
20040230657 Tomkow Nov 2004 A1
20040243677 Curbow et al. Dec 2004 A1
20040243844 Adkins Dec 2004 A1
20040243847 Way Dec 2004 A1
20040249768 Kontio et al. Dec 2004 A1
20040249895 Way Dec 2004 A1
20040249899 Shiigi Dec 2004 A1
20040252727 Mousseau et al. Dec 2004 A1
20040264121 Orriss Dec 2004 A1
20040266441 Sinha et al. Dec 2004 A1
20050003809 Kato Jan 2005 A1
20050009502 Little et al. Jan 2005 A1
20050015455 Liu Jan 2005 A1
20050019634 Legg Jan 2005 A1
20050025172 Frankel Feb 2005 A1
20050025291 Peled et al. Feb 2005 A1
20050025297 Finnigan Feb 2005 A1
20050038863 Onyon et al. Feb 2005 A1
20050044160 McElligott Feb 2005 A1
20050055413 Keohane et al. Mar 2005 A1
20050058124 Helferich Mar 2005 A1
20050058260 Lasensky et al. Mar 2005 A1
20050060720 Mayer Mar 2005 A1
20050076109 Mathew et al. Apr 2005 A1
20050091329 Friskel Apr 2005 A1
20050099654 Chen May 2005 A1
20050099998 Semper May 2005 A1
20050102381 Jiang et al. May 2005 A1
20050108336 Naick et al. May 2005 A1
20050108359 Hyder et al. May 2005 A1
20050114652 Swedor et al. May 2005 A1
20050130631 Maguire et al. Jun 2005 A1
20050132010 Muller Jun 2005 A1
20050135681 Schirmer Jun 2005 A1
20050137009 Vetelainen Jun 2005 A1
20050138353 Spies Jun 2005 A1
20050141718 Yu et al. Jun 2005 A1
20050148356 Ferguson et al. Jul 2005 A1
20050159107 Mauney et al. Jul 2005 A1
20050163320 Brown et al. Jul 2005 A1
20050165740 Kerr et al. Jul 2005 A1
20050176451 Helferich Aug 2005 A1
20050180576 Jevans Aug 2005 A1
20050188024 Singer Aug 2005 A1
20050188045 Katsikas Aug 2005 A1
20050198143 Moody et al. Sep 2005 A1
20050198170 LeMay et al. Sep 2005 A1
20050198506 Qi et al. Sep 2005 A1
20050210064 Caldini et al. Sep 2005 A1
20050210106 Cunningham Sep 2005 A1
20050210246 Faure Sep 2005 A1
20050210394 Crandall et al. Sep 2005 A1
20050216587 John Sep 2005 A1
20050216735 Huang Sep 2005 A1
20050229258 Pigin Oct 2005 A1
20050251558 Zaki Nov 2005 A1
20050257057 Ivanov et al. Nov 2005 A1
20050265551 Hara Dec 2005 A1
20050282525 Adams et al. Dec 2005 A1
20060013368 LaBaw Jan 2006 A1
20060019638 Chiu et al. Jan 2006 A1
20060019639 Adams et al. Jan 2006 A1
20060020667 Wang et al. Jan 2006 A1
20060021038 Brown et al. Jan 2006 A1
20060021066 Clayton et al. Jan 2006 A1
20060026246 Fukuhara et al. Feb 2006 A1
20060029191 Miller et al. Feb 2006 A1
20060041505 Enyart Feb 2006 A1
20060041625 Chen et al. Feb 2006 A1
20060046720 Toropainen et al. Mar 2006 A1
20060046757 Hoover et al. Mar 2006 A1
20060047766 Spadea Mar 2006 A1
20060053202 Foo et al. Mar 2006 A1
20060068768 Sanding et al. Mar 2006 A1
20060069737 Gilhuly et al. Mar 2006 A1
20060072761 Johnson et al. Apr 2006 A1
20060074706 Gilham Apr 2006 A1
20060075027 Zager et al. Apr 2006 A1
20060080384 Robinson et al. Apr 2006 A1
20060090065 Bush et al. Apr 2006 A1
20060095510 Rouse et al. May 2006 A1
20060101119 Qureshi et al. May 2006 A1
20060133585 Daigle et al. Jun 2006 A1
20060135128 Skoog Jun 2006 A1
20060155698 Vayssiere Jul 2006 A1
20060155812 Looman Jul 2006 A1
20060168065 Martin Jul 2006 A1
20060168072 Park Jul 2006 A1
20060177015 Skakkebaek et al. Aug 2006 A1
20060182124 Cole et al. Aug 2006 A1
20060187897 Dabbs et al. Aug 2006 A1
20060190533 Shannon et al. Aug 2006 A1
20060194572 Fresonke et al. Aug 2006 A1
20060200528 Pathiyal Sep 2006 A1
20060217112 Mo Sep 2006 A1
20060218224 Agrawal et al. Sep 2006 A1
20060218244 Rassmussen et al. Sep 2006 A1
20060221916 Taylor et al. Oct 2006 A1
20060224893 Sales et al. Oct 2006 A1
20060230266 Maes Oct 2006 A1
20060233370 Jung et al. Oct 2006 A1
20060234680 Doulton Oct 2006 A1
20060239424 Walter Oct 2006 A1
20060240868 Kaplan et al. Oct 2006 A1
20060247962 Harvey et al. Nov 2006 A1
20060248148 Timmins et al. Nov 2006 A1
20060259558 Yen Nov 2006 A1
20060265660 Hullot et al. Nov 2006 A1
20060270461 Won et al. Nov 2006 A1
20060285533 Divine et al. Dec 2006 A1
20060286990 Juan et al. Dec 2006 A1
20070042747 Sun Feb 2007 A1
20070117541 Helferich May 2007 A1
20070162454 D'Albora et al. Jul 2007 A1
20070265838 Chopra et al. Nov 2007 A1
20080037582 Wang Feb 2008 A1
20080039052 Knowles Feb 2008 A1
20090191848 Helferich Jul 2009 A1
Foreign Referenced Citations (50)
Number Date Country
324650 Dec 1994 EP
631419 Dec 1994 EP
0 695 071 Jan 1996 EP
0 721 268 Jul 1996 EP
777394 Jun 1997 EP
831664 Sep 1997 EP
0 505 489 Nov 1997 EP
0 624 993 Dec 2003 EP
2 284 693 Jun 1995 GB
56000096 Jan 1981 JP
63-283058 Nov 1988 JP
3500955 Feb 1991 JP
03232325 Oct 1991 JP
2-014571 Mar 1993 JP
6-70292 Mar 1994 JP
6-261121 Sep 1994 JP
6-276226 Sep 1994 JP
06245254 Sep 1994 JP
6318899 Nov 1994 JP
06-326656 Nov 1994 JP
7503826 Apr 1995 JP
7245773 Sep 1995 JP
8-019025 Jan 1996 JP
8-097852 Apr 1996 JP
8-97854 Apr 1996 JP
8-163637 Jun 1996 JP
H8-181781 Jul 1996 JP
8228368 Sep 1996 JP
8-237387 Sep 1996 JP
8-265245 Oct 1996 JP
08336182 Dec 1996 JP
9-065430 Mar 1997 JP
9-146824 Jun 1997 JP
9-172685 Jun 1997 JP
9-200250 Jul 1997 JP
2001517891 Oct 2001 JP
2000-513362 Sep 2005 JP
00164369 Sep 1998 KR
8905009 Jun 1989 WO
9214330 Aug 1992 WO
WO 9430021 Dec 1994 WO
WO 9526113 Sep 1995 WO
WO 9625826 Aug 1996 WO
WO 9642041 Dec 1996 WO
9708906 Mar 1997 WO
9731488 Aug 1997 WO
9732439 Sep 1997 WO
WO 9727546 Sep 1997 WO
9858476 Dec 1998 WO
9965256 Dec 1999 WO
Non-Patent Literature Citations (337)
Entry
Anonymous, “Active Channel Server Frequently Asked Questions (FAQ)”, Microsoft Corporation, Q181161, 2006, 2 pages.
Anonymous, “Introduction to Active Channel Technology”, Microsoft Corporation, 2006, 5 pages.
Anonymous, PatentAtlas, “Patent Cluster Tree Encompassing the Subject in Question: SAMPLE” (date unknown).
Anonymous, usamobility.com, “ReFLEX Wireless Data Technology” (date unknown).
Engst, A.C., “The Real TidBITS Channel”, TidBITS Electronic Publishing, 1998, 4 pages.
Engst, A.C., “TidBITS#349/Oct. 14, 1996,” TidBITS Electronic Publishing, 1996, 10 pages.
Form 1449, filed in Patent No. 5,438,611, Campana, Jr. et al., Issued Aug. 1, 1995, 1 page.
Gillay, C.Z., “Subscriptions, Channels, and Active Desktop”, TechNotes, Franklin, Beedle & Associates, Inc., 1999, pp. 1/6.
International Preliminary Examination Report dated Jul. 10 2001 (7 pages) PCT/US00/08261 Jul. 1, 2001.
Khare, R., et al., “Scenarios for an Internet/Scale Event Notification Service (ISENS)”, Internet/Draft, Aug. 13, 1998, 18 pages.
PLUS Patent Linguistics Utility Search Results for U.S. Appl. No. 10/445,257, Searched Mar. 16, 2005.
Siewiorek, D.P., et al., “Computer Structures: Principles and Examples”, McGraw/Hill Book Company, 1982, 21 pages.
Statutory Invention Registration No. H610; Date: Mar. 7, 1989, Focarile et al.
Winnick Cluts, N., et al., “A Preview of Active Channel and the Active Desktop for Internet Explorer 4.0”, Microsoft Corporation, 1997, 13 pages.
Anonymous, “Envoy Wireless Communicator User's Guide,” Motorola, Inc. (1994).
Anonymous, “General Magic OS Targets US, Japan,” Reed Business Information (1996).
Anonymous, “MessagePad 2000: New Newton Exceeds Expectation,” TidBITS #379 (May 12, 1997).
Anonymous, “NETCOM and RadioMail form Strategic Alliance Enabling NETCOM Customers to Exchange Email, Send Faxes and Access Web Sites Wireless,” Business Wire (Dec. 11, 2006).
Anonymous, “New Features of the Newton 2.0 Operating System,” Apple Computer, Inc. (1995).
Anonymous, “New RadioMail Package Brings Maximum Affordability and Simplicity to Wireless Communications,” AllBusiness (Feb. 27, 1996).
Anonymous, “Newton Apple MessagePad Handbook,” Apple Computer, Inc. (1995).
Anonymous, “Newton Internet Enabler,” (1997).
Anonymous, “Newton MessagePad (Original) Specs,” EveryMac.com (1996).
Anonymous, “RadioMail Corporation Releases Wireless Internet Access Solution for CDPD Carriers,” Business Wire (Oct. 7, 1996).
Anonymous, “Using E/Mail on Your Newton Device,” Apple Computer, Inc. (1997).
Denise Shelton, “RadioMail can Find, Retrieve Web Pages,” CNET News (Jun. 4, 1996).
Ira Brodsky, “Instant Gratification,” Telephone Online (Jan. 15, 1999).
Mark Kellner, “Earthquake and RadioMail,” The Washington Times (Jan. 24, 1994).
Mike Fine, “The AllPoints Wireless PC Card and RadioMail Service,” www.palmtoppaer.com (Date Unknown).
Stuart Price, “Product Reviews: Eudora Pro for Newton 1.0,” MacUser (Dec. 22, 1996).
Anonymous, “Sony Electronics Introduces Magic Link PIC/2000,” BusinessWire (Oct. 30, 1995).
M.M. Tso, et al. “Always On, Always Connected Mobile Computing,” 1996 5th IEEE International Conference on Universal Personal Communications Record, vol. 1 of 2, Sessions 1-6, Cambridge Marriott Hotel, Cambridge, Massachusetts, pp. 918-924 (Sep. 29-Oct. 2, 1996) (hereinafter “Always On, Always Connected”).
Anonymous, “Newton Solutions Guide,” Apple Computer, Inc. (1995).
Anonymous, “Newton Messaging Card Arrives,” MacWeek (Sep. 1993).
Anonymous, “Allpen's Nethopper Lets Apple Newton Owners Surf Internet, Intranets,” Tribune Business News (Jun. 1996).
Anonymous, § 3.2.9 ETSI GSM 3.40, “Digital Cellular Telecommunications System (Phase 2+) Technical Realisation of the Short Message Service Point/to/Point,” v4.13.0, (May 1996).
Anonymous, “Eudora Pro for Newton Users' Guide,” Eudora.
“New Wyndmail version 1.5 features another first for wireless industry,” Busines Wire (Author Unknown) (Aug. 19, 1996).
“WyndMail wireless e/mail now provides “Message Header Preview” for Apple Powerbook and MessagePad,” Business Wire (Author Unknown) (Jan. 9, 1997).
Notice of Grounds of Rejection, Japanese Patent App. No. 2009-302127, dated Jun. 30, 2009.
Notice of Grounds of Rejection, Japanese Patent App. No. 2009-052858, dated Oct. 6, 2009.
Anonymous, “Second Generation Personal Handy Phone System,” pp. 117-119, dated Jun. 25, 1996.
Notice of Grounds of Rejection, Japanese Patent App. No. 2009-052859, dated Oct. 6, 2009.
Freed, Borenstein, RFC 2045, MIME format standards, Nov. 1996.
Anonymous, Wikipedia, “Personal Communications Service” (Date Unknown).
Anonymous, Wikipedia, “SMS” (Date Unknown).
“Claim Charts Applying 5,905,777 (Foladare et al.) to Selected Claims of Helferich U.S. Patent Nos. 7,499,716, 7,280,838, and 7,155,241” (Apr. 15, 2010).
Final Rejection, Japanese Patent App. No. 2008-302127, dated Apr. 13, 2010.
Final Rejection, Japanese Patent App. No. 2009-052858, dated Apr. 22, 2010.
Fuhrt, Design issues for interactive television systems, Computer Magazine, May 1995.
Henriksen, Mobile Data Network System Description, Norwegian Telecommunications Administration Research Dept, Apr. 1986.
Crispin, Interactive Mail Access Protocol—Version 2, Request for Comments 1176, Network Working Group, Aug. 1990.
Kaspersen, vol. 1 Network architecture addressing and routing, Mobile Data Network Description, Teledirektoratets forskningsavdeling, Mar. 1989.
Kaspersen, vol. 2 Service and service elements, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, Apr. 1989.
Kaspersen, vol. 6 Requirements to the Base Station, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, Jul. 1989.
Kaspersen, vol. 7 Requirements to the Mobile Stations, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, Sep. 1989.
Kramer, Use of two-way wireless messaging for personal telephone management, University of Wisconsin Record, Jun. 1905.
Anonymous, re Nokia 9000i Communicator, Owner's Manual Issue 1.1, Undated.
Anonymous, Changes from Pine 3.96 to 4.00, Computing and Networking, University of Washington, Feb. 2001.
Anonymous, Active Paper's Presto!Mail to be bundled with Envoy 150 Wireless Communicator from Motorola, Business Wire, Apr. 1996.
Crispin, Internet Message Access Protocol Version 4, Request for Comments 2060, Network Working Group, Dec. 1996.
Rodriquez, Motorola provides NetWare access to paging networks, InfoWorld, May 1995.
A.D. Joseph et al., “Rover: A Toolkit for Mobile Information Access,” Proceedings of the Fifteenth ACM Symposium on Operating Systems and Principles, Copper Mountain Resort, Colorado, pp. 156-171 (Dec. 3-6, 1995) (hereinafter Rover Toolkit).
Hardy, SkyTel is set to launch two-way-paging—Mtel unit is poised for big gains in wireless business, Wall Street Journal, Sep. 1995.
Anonymous, Motorola unveils next-generation Tango products at PCS '96; Tanto Lite guarantees message delivery and receipt, Business Wire, Sep. 1996.
Kaspersen, vol. 3 Protocols and protocol hierarchy within the MDN, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, May 1989.
Kaspersen, vol. 4 Specification of DTL and DTP within the MDN, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, Jun. 1989.
Kaspersen, vol. 8 Specification of the MDN-MHS inter-working, “Mobile Data Network Description”, Teledirektoratets forskningsavdeling, Aug. 1989.
Anonymous, UP Browser Manual, Unwired Planet, Aug, 1996.
Anonymous, UP HDML Language Reference, Jul. 1996.
Anonymous, UP Up.Link Developer's Guide, Jul. 1996.
Verjinkski, PHASE, a portable host access system environment, Unisys Defense Systems , Jan. 1900.
Kylanpaa, Nomadic access to information services by a GSM phone, Computer & Graphics, Jun. 1905.
Anonymous, Cost of Ownership Analysis Instructions, Unwired Planet, Jun. 2010.
Anonymous, The Mobile Intranet—wireless internet access with UP Link by Unwired Planet, Jun. 1905.
Butler, Post Office Protocol Version 2, Request for Comments 937, Network Working Group, Feb. 1985.
Taylor, Internetwork Mobility—the CDPD Approach, Jun. 1996.
Anonymous, Narrowband Sockets Specification Intel and Nokia, Sep. 1996.
Thesis of A.F. deLespinasse, “Rover Mosaic: E-mail Communication for a Full-Function Web Browser,” Massachusetts Institute of Technology (archived Aug. 10, 1995, in MIT Library) (hereinafter “Rover Mosaic”).
Notice of Grounds of Rejection, Japanese Patent App. No. 2010-001327, dated Aug. 17, 2010 (including English Translation).
Anonymous, Compiled Redacted Correspondence regarding Tso '327 Reference, 2010.
Compiled Plaintiff's Response to Defendant's Initial Invalidity Contentions and Defendant's Initial Invalidity Contentions exchanged in NDIL Case No. 1:10-cv-04387 (Dec. 2010).
Request for Ex Parte Reexamination of US Pat 7,835,757, claims 1-20, Control No. 90/009,882, Andrea G. Reister (Feb. 25, 2011).
Request for Ex Parte Reexamination of US Pat 7,499,716, claims 1-18 and 21-69, Control No. 90/009,880, Andrea G. Reister (Feb. 25, 2011).
Request for Ex Parte Reexamination of US Pat 7,280,838, claims 1-96, Control No. 90/009,883, Andrea G. Reister (Feb. 25, 2011).
Information Disclosure Statement by Applicant filed in Reexam of US Pat 7,835,757, Andrea G. Reister (Feb. 25, 2011).
Information Disclosure Statement by Applicant filed in Reexam of US Pat 7,499,716, Andrea G. Reister (Feb. 25, 2011).
Information Disclosure Statement by Applicant filed in Reexam of US Pat 7,280,838, Andrea G. Reister (Feb. 25, 2011).
Order Granting/Denying Request for Ex Parte Reexamination of US Pat 7,835,757, claims 1-20, Control No. 90/009,882, (Mar. 25, 2011).
Order Granting/Denying Request for Ex Parte Reexamination of US Pat 7,499,716, claims 1-18 and 21-69, Control No. 90/009,880, (Mar. 25, 2011).
Order Granting/Denying Request for Ex Parte Reexamination of US Pat 7,280,838, claims 1-96, Control No. 90/009,883, (Apr. 26, 2011).
Notice of Failure to Comply With Ex Parte Reexamination Request Requirements (37 CFR 1.510(c)), Control No. 90/009,883 (Mar. 29, 2011).
Decision Vacating Notice of Failure to Comply (Form PTOL-2077), Control No. 90/009,883 (Apr. 6, 2011).
Vaudreuil, Internet Engineering Task Force Request for Comments 1911: “Voice Profile for Internet Mail,” pp. 1-22 (Feb. 1996) (hereinafter “RFC 1911”); and.
Yeong, et al., Internet Engineering Task Force Request for Comments 1487: “X.500 Lightweight Directory Access Protocol,” pp. 1-21 (Jul. 1993) (hereinafter “RFC 1487”).
Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,835,757, Control No. 90/009,882, (Jun. 17, 2011).
Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,499,716, Control No. 90/009,880, (Jun. 17, 2011).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,835,757, Control No. 90/009,882 (Jun. 29, 2011).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Ex Parte Reexamination of U.S. Pat 7,499,716, Control No. 90/009,880 (Jun. 29, 2011).
Notice of Allowance in U.S. Appl. No. 12/167,971, (Aug. 4, 2011).
Notice of Allowance in U.S. Appl. No. 12/367,358, (Jul. 21, 2011).
Office Action in Ex Parte Reexamination of U.S. Pat. 7,499,716, Control No. 90/009,880, (Aug. 5, 2011).
Office Action in Ex Parte Reexamination of U.S. Pat. 7,835,757, Control No. 90/009,882, (Aug. 5, 2011).
Amendment Pursuant to 37 C.F.R. §§ 1.111 and 1.121 filed in U.S. Appl. No. 11/598,832 (Jun. 15, 2011).
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,280,838 (assigned Control No. 95/001,740) (Oct. 28, 2010).
Request for Ex Parte Reexamination of US Pat 7,835,757, claims 2-20, Control No. 95/001,739, Andrea G. Reister (Sep. 6, 2011).
Request for Ex Parte Reexamination of US Pat 7,499,716, claims 15, 17, 189, and 21-29, Control No. 95/001,738, Andrea G. Reister (Sep. 6, 2011).
Request for Ex Parte Reexamination of US Pat 7,280,838, claims 9-20, Control No. 95/001,740, Andrea G. Reister (Sep. 6, 2011).
Information Disclosure Statement by Applicant filed in 95/001,739 (Inter Partes Reexam of 7,835,757) Andrea G. Reister (Sep. 6, 2011).
Information Disclosure Statement by Applicant filed in 95/001,738 (Inter Partes Reexam of 7,499,716) Andrea G. Reister (Sep. 6, 2011).
Information Disclosure Statement by Applicant filed in 95/001,740 (Inter Partes Reexam of 7,280,838) Andrea G. Reister (Sep. 6, 2011).
Non-Final Office Action in 90/009,883 (Ex Parte Reexamination of 7,280,838) (Sep. 28, 2011).
Patentee Response After Final Office Action in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 5, 2011).
Examiner Summary of Interview in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Sep. 30, 2011).
Patentee Supplemental Response After Final Office Action in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 13, 2011).
Notice of Intent to Issue Reexamination Certificate in 90/009,880 (Ex Parte Reexamination of 7,499,716) (Oct. 21, 2011).
Patentee Response After Final Office Action in 90/009,882 (Ex Parte Reexamination of 7,835,575) (Oct. 5, 2011).
Examiner Summary of Interview in 90/009,882 (Ex Parte Reexamination of 7,835,757) (Oct. 21, 2011).
Advisory Action in 90/009,882 (Ex Parte Reexamination of 7,835,757) (Oct. 21, 2011).
Patentee Supplemental Response After Final Office Action in 90/009,882 (Ex Parte Reexamination of 7,835,575) (Nov. 1, 2011).
3GPP TS 23.140 V6, “Multimedia Messaging Service (MMS); Functional Description, Stage 2 (Release 6)” (Mar. 2009).
Reilly, et al., “Enabling Mobile Network Manager,” Computer Networks and ISDN Systems 29, 1417-1428 (1997).
T. Berners-Lee, “RFC 1945: Hypertext Transfer Protocol—HTTP/1.0,” May 1996.
M. Crispin, “RFC 1730: Internet Message Access Protocol—Version 4,” Dec. 1994.
N. Freed, “RFC: 2046: Multipurpose Internet Mail Extensions (MIME) Part Two: Media Types,” Nov. 1996.
J. Meyers, “RFC 1939: Post Office Protocol—Version 3,” May 1996.
J. Postel, “RFC 793: Transmission Control Protocol,” Sep. 1981.
Nokia 9000 Communicator User's Manual, Issue 2 (1995).
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,499,716 (assigned Control No. 95/001,738) (Nov. 4, 2011).
Order Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,835,757 (assigned Control No. 95/001,739) (Nov. 4, 2011).
Notice of Intent to Issue Reexamination Certificate (“NIRC”) in Ex Parte Reexamination of 7,835,757 (Control No. 90/009,882), (Dec. 9, 2011).
Examiner's Interview Summary in Ex Parte Reexamination of 7,280,838 (Control No. 90/009,883), (Dec. 13, 2011).
Patentee's Response after Non-Final Office Action in Ex Parte Reexamination of 7,280,838 (Control No. 90/009,883), (Nov. 28, 2011).
Kaashoek, M. Frans, et al., “Dynamic Documents: Mobile Wireless Access to the WWW”, IEEE Computer Society (Chs. 1-3) (1995).
Chau, Jonathan, “Internet Explorer 3.0,” Microsoft (Nov. 1, 1996).
“How to Set Up Windows 95's ‘Dial-Up Networking’ for Auto-Dial with 32-bit Internet Applications,” Stanford University Customer Assistance (date unknown).
“Windows NT Internet and Intranet Development. Chapter 3: Microsoft Internet Mail” (date unknown).
Lemay, Laura, “Teach Yourself Web Publishing with HTML in 14 days” (1996).
Wolfe, David, “Designing and Implementing Microsoft Proxy Server, Chapter 11” (1997).
“MSDN Library-file Protocol,” Microsoft (date unknown).
McFedries, Paul, “Windows 95 Unleashed,” SAMS Publishing (Ch. 32) (1996).
“GSM Originating Call Flow,” EventHelix (2008).
“GSM Terminating Call Flow,” EventHelix (2004).
“GSM, SIP, H323, ISUP and IMS Call Flows,” EventHelix (date unknown).
“Eudora Mail Pro, Version 3.0 User Manual,” QUALCOMM (pp. 30, 32, 50, and 53) (Jun. 1997).
Second Request for Inter Partes Reexamination of US Pat 7,499,716, claims 15-18,21-33,37-43,83-86,89-100, and 103-115 Control No. 95/001,867, Andrea G. Reister (Jan. 6, 2012).
Request for Inter Partes Reexamination of US Pat 7,155,241, claims 1, 2, 7, 10, 13, 14, 38, 39, 40, 41, 42, 47, 50, 53, 54, 71, 72, 77, 80, 84, and 85, Control No. 95/001,864, Andrea G. Reister (Dec. 29, 2011).
Helferich Patent Licensing LLC v. Suns Leagacy Partners LLC, Defendant's Answer, Defenses, First Counterclaim, Amended Second Counterclaim, and Jury Demand, Laura E. Muschamp (Feb. 21, 2012).
Helferich Patent Licensing LLC v. Suns Leagacy Partners LLC, Helferich's Response to First Counterclaim, Amended Second Counterclaim by Phoenix Newspapers, Inc., Victoria Curtin (Mar. 16, 2012).
B. Pemberton, “Elm Configuration Guide (The Elm Mail System, Version 2.5),” Oct. 1, 1996.
J. Murphy, et. al, “Restaurant Marketing on the Worldwide Web,” Cornell Hotel and Restaurant Administration Quarterly, pp. 61-71 (Feb. 1996).
M. Cox, et. al, “Robotic Telescopes: An Interactive Exhibit on the World-Wide Web,” (Date Unknown).
M. Kramer, et. al, “Use of Two-way Wireless Messaging for Personal Telephone Management,” Universal Personal Communications, 1993. Personal Communications: Gateway to the 21st Century, Conference Record, pp. 743-748 (Oct. 1993).
Non-Final Office Action in U.S. Appl. No. 12/267,436, (Feb. 17, 2011).
Final Office Action in U.S. Appl. No. 12/267,436, (Oct. 31, 2011).
Applicant's Response to Non-Final Office Action in U.S. Appl. No. 12/267,436, (May 12, 2011).
Applicant's Supplemental Amendment in U.S. Appl. No. 12/267,436, (Jun. 17, 2011).
Applicant's Response to Final Office Action in U.S. Appl. No. 12/267,436, (Feb. 13, 2012).
Applicant's Supplemental Amendment in U.S. Appl. No. 12/267,436, (Mar. 1, 2012).
Notice of Allowance in U.S. Appl. No. 12/267,436, (Mar. 15, 2012).
Anonymous, re Nokia 9000i Communicator, Owner's Manual 9357109 Issue 2 EN, (Jun. 7, 1998).
Anonymous, “Nokia Brings Internet Into The Wireless Age,” Nokia (Sep. 19, 1996).
Anonymous, “GeoWorks GEOS V3.0,” PDAdb.net (Date Unknown).
Christian Müller-Schloe, “Embedded Microprocessor Systems,” IOS Press, (1996) at p. 165.
Anonymous, “Detailed Technical Datasheet of Nokia 9000 Communicator,” PDAdb.net (Date Unknown).
Anonymous, “Nokia 9000,” Softpedia (Date Unknown).
Anonymous, PDAmaster, PDAdb.net (Date Unknown).
Anonymous, “Quick Guide for Nokia 9000/9000i/9110 Communicator GPS—SMS Application Version 1.0,” Nokia Mobile Phones (1999).
Anonymous, “AT&T Wireless Service announces AT&T PocketNet Service for business,” Business Wire (Feb. 10, 1997).
Anonymous, “Handheld Device Markup Language FAQ,” W3C (Apr. 11, 1997).
Sheldon, “HDML (Handheld Device Markup Language),” Linktionary.com (Date Unknown).
Allaire, “The first ‘Internet Phone’ circa 1996,” Brightcove.com (Mar. 16, 2009).
Anonymous, “Network World” at p. 10 (Jul. 15, 1996).
Anonymous, “AT&T Vu by LG User Guide,” LG Electronics (2008).
Sykes, “Motorola's Tango offers wireless E-mail. (pagerlike device) (Brief Article) (Product Announcement),” InfoWorld (Aug. 26, 1996).
Order Granting/Denying Request for Inter Partes Reexamination of US Pat 7,499,716, Control No. 95/001,867, (Feb. 27, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 7,499,716, Control No. 95/001,867 (Apr. 27, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 7,499,716, Control No. 95/001,867 (Apr. 27, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of US Pat 7,155,241, Control No. 95/001,864, (Mar. 12, 2012).
Request for Inter Partes Reexamination of US Pat 8,116,741, Control No. 95/001,983, Andrea G. Reister (May 4, 2012).
Request for Inter Partes Reexamination of US Pat 7,835,757, Control No. 95/001,984, Andrea G. Reister (May 9, 2012).
Request for Inter Partes Reexamination of US Pat 8,107,601, Control No. 95/001,991, Andrea G. Reister (May 16, 2012).
Request for Inter Partes Reexamination of US Pat 7,280,838, Control No. 95/001,996, Paul Stephens (May 18, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 7,155,241, Control No. 95/001,864 (May 14, 2012).
Expert Declaration of John R. Grindon, D. Sc. in Inter Partes Reexamination of U.S. Pat 7,155,241, Control No. 95/001,864 (May 14, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 7,155,241, Control No. 95/001,864 (May 14, 2012).
Request for Inter Partes Reexamination of US Pat 8,134,450, Control No. 95/002,016, Andrea G. Reister (Jun. 14, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of US Pat 8,116,741, Control No. 95/001,983, (Jun. 18, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of US Pat 7,835,757, Control No. 95/001,984, (Aug. 3, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of US Pat 8,107,601, Control No. 95/001,991, (Aug. 3, 2012).
P. Mockapetris, “RFC 883: Domain Names—Implementation and Specification,” Nov. 1983.
T. Berners-Lee, “RFC 1738: Uniform Resource Locators (URL),” Dec. 1994.
R. Fielding, “RFC 1808: Relative Uniform Resource Locators,” Jun. 1995.
R. Fielding, “RFC 2068: Hypertext Transfer Protocol—HTTP/1.1,” Jan. 1997.
T. Berners-Lee, “RFC 2396: Uniform Resource Identifiers (URL): Generic Syntax,” Aug. 1998.
Order Granting/Denying Request for Inter Partes Reexamination of U.S. Patent No. 7,280,838, Control No. 95/002,088 (Nov. 13, 2012).
Order Staying Inter Partes Reexamination of U.S. Patent No. 7,155,241 (Control No. 95/002,088) in View of Petition for Inter Partes Review of U.S. Patent No. 7,155,241, Trial No. IPR2013-00033, Administrative Patent Judge Joni Y. Chang, (Nov. 6, 2012).
Non-Final Office Action in U.S. Appl. No. 13/109,389, (Aug. 21, 2012).
Request for Inter Partes Reexamination of US Pat 7,280,838, Control No. 95/002,088, Paul Stephens (Aug. 17, 2012).
Request for Inter Partes Reexamination of U.S. Patent No. 8,224,294, Control No. 95/002,140, Andrea G. Reister (Filed Sep. 5, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of U.S. Patent No. 8,134,450, Control No. 95/002,016 (Sep. 10, 2012).
Order Granting/Denying Request for Inter Partes Reexamination of U.S. Patent No. 8,224,294, Control No. 95/002,140 (Sep. 27, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 8,116,741, Control No. 95/001,983 (Sep. 18, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 8,116,741, Control No. 95/001,983 (Sep. 18, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 8,116,741, Control No. 95/001,983 (Sep. 18, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 7,835,757, Control No. 95/001,984 (Nov. 5, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 7,835,757, Control No. 95/001,984 (Nov. 5, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 7,835,757, Control No. 95/001,984 (Nov. 5, 2012).
Declaration of Martin Schwartz in Inter Partes Reexamination of U.S. Pat 7,835,757, Control No. 95/001,984 (Nov. 5, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 8,107,601, Control No. 95/001,991 (Nov. 5, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 8,107,601, Control No. 95/001,991 (Nov. 5, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 8,107,601, Control No. 95/001,991 (Nov. 5, 2012).
Declaration of Martin Schwartz in Inter Partes Reexamination of U.S. Pat 8,107,601, Control No. 95/001,991 (Nov. 5, 2012).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 7,155,241, Control No. 95/001,864, Andrea G. Reister (Filed Sep. 28, 2012).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 7,499,716, Control No. 95/001,867, Andrea G. Reister (Filed Oct. 11, 2012).
Helferich Patent Licensing LLC v. CBC Corporation, Bravo Media LLC, and G4 Media LLC, Defendants' Preliminary Invalidity Contentions, Michael E. Markman (Sep. 28, 2012).
Helferich Patent Licensing LLC v. The New York Times Company, Defendant's Updated Initial Invalidity Contentions, Brian M. Buroker (Sep. 28, 2012).
Helferich Patent Licensing LLC v. J.C. Penney Corporation, Inc., Defendant's Initial Invalidity Contentions, R. David Donaghue (Sep. 28, 2012).
Helferich Patent Licensing LLC v. Suns, et al., Defendant's Initial Invalidity Contentions, Michael E. Markman et al. (Nov. 9, 2012).
Helferich Patent Licensing LLC v. CBS Corporation, Bravo Media LLC, and G4 Media LLC, Plaintiff's Response to Defendants' Preliminary Invalidity Contentions, Timothy Sperling (Nov. 2, 2012).
Helferich Patent Licensing LLC v. The New York Times Company, Plaintiff's Response to Defendant's Updated Initial Invalidity Contentions, Timothy Sperling (Oct. 26, 2012).
Helferich Patent Licensing LLC v. J.C. Penney Corporation, Inc., Plaintiff's Response to Defendant's Initial Invalidity Contentions, Timothy Sperling (Nov. 2, 2012).
Balancing Push and Pull for Data Broadcast, Acharya, et al., dated 1997.
AirMedia's Mobile Internet Antenna is First Push Solution for Mobile Computing Market, dated 1997.
Air Media—What is it? With an AirMedia Live wireless receiver and AirMedia Live Software, you're linked to the AirMedia Live Internet Broadcast Network, dated 1996.
BackWeb Delivers Personalized Broadcasting Software on Multiple Platforms, dated 1996.
Handheld to Web paging, Kimberly Caisse, E-mail features, dated 1997.
A Way out of the Web Maze, dated 1997.
When worlds collide: the rapid convergence of enterprise dat, e-mail messaging and paging could result in a big bang for VARs who add wireless to their portfolios, Alison Eastwood, dated 1997.
Data Management for Mobile Computing, Imielinski and Badrinath, dated 1993.
Mobile Wireless Computing, Imielinski and Badrinath, dated 1994.
Intelligent Information Inc. pushes, phone beeper technology, dated 1997.
Libertel campaign leads to upsurge in use of SMS services, Alice Macandrew, dated 1997.
News On-Demand for Multimedia Networks, Miller, et al., dated 1993.
America's competitive advantage: Advanced technologies, Richard Paddock, dated 1997.
Market plans IQ tests of smart handsets, Joseph Palenchar, dated 1997.
IP Mobility Support, Charles Perkins, dated 1996.
Mobile Network Computing Protocol (MNCP), D. Piscitello, dated 1997.
Telecom Monitor Notebook, dated 1997.
TIA/EIA Interim Standard TIA/EIA/IS-637, dated 1995.
Tibco ships push interfaces, dated 1997.
E-mail Pager, Frank Vizard, dated 1997.
FreeLoader takes on PointCast, Nick Wingfield, dated 1997.
Recommendation GSM 04.08, dated 1992.
Recommendation GSM 03.03, dated 1993.
Recommendation GSM 04.11 version 3.3.0, dated 1993.
Standard for the Format of ARPA Internet Text Messages, dated 1982.
RFC 1123—Requirements for Internet Hosts—Application and Support, R. Braden, dated 1989.
RFC 1866—Hypertext Markup Language—2.0, T. Berners-Lee, D. Connolly, dated 1995.
GSM Technical Specification—GSM 3.40, dated 1996.
W3C Proposal for a Handheld Device Markup Language (HDML), dated 1997.
GSM Technical Specification—GSM 3.41, dated 1996.
Eudora Email User Manual for Windows Version 4.3, dated 2000.
Eudora Light Windows User Manual Bringing the P.O. to Where you Live, dated 1995.
GSM 1.04, dated 1991.
GSM 03.02, dated 1991.
Report GSM 11.31, dated 1992.
Multimedia Messaging Client Transactions Candidate Version 1.3—Jun. 17, 2005.
Multimedia Messaging Client Transactions Version 1.1 Version 31—Oct. 2002.
Multimedia Messaging Service Architecture Overview Version 1.1 Version 01—Nov. 2002.
Version 3.0 for Windows User Manual Eudora Light, dated 1997.
Petition for Inter Partes Review of US Pat 7,155,241, IPR2013-00033 (Oct. 25, 2012).
Non-Final Office Action in U.S. Appl. No. 13/210,223, (Dec. 26, 2012).
Response to Non-Final Office Action in U.S. Appl. No. 13/210,223 (Feb. 11, 2013).
Helferich Patent Licensing LLC v. Suns, et al., Plaintiff's Response to Defendant's Initial Invalidity Contentions (Dec. 21, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 8,134,450, Control No. 95/002,016 (Dec. 10, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 8,134,450, Control No. 95/002,016 (Dec. 10, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 8,134,450, Control No. 95/002,016 (Dec. 10, 2012).
Declaration of Martin Schwartz in Inter Partes Reexamination of U.S. Pat 8,134,450, Control No. 95/002,016 (Dec. 10, 2012).
Patentee Response and Request for Reconsideration of Non-Final Rejection in Inter Partes Reexamination of U.S. Pat 8,224,294, Control No. 95/002,140 (Dec. 27, 2012).
Expert Declaration of John R. Grindon, D. Sc., in Inter Partes Reexamination of U.S. Pat 8,224,294, Control No. 95/002,140 (Dec. 27, 2012).
Declaration of Leonard I. Palevsky in Inter Partes Reexamination of U.S. Pat 8,224,294, Control No. 95/002,140 (Dec. 27, 2012).
Declaration of Martin Schwartz in Inter Partes Reexamination of U.S. Pat 8,224,294, Control No. 95/002,140 (Dec. 27, 2012).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 7,835,757, Control No. 95/001,984, Andrea G. Reister (Jan. 4, 2013).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 8,107,601, Control No. 95/001,991, Andrea G. Reister (Feb. 13, 2013).
Order in Inter Partes Review of U.S. Patent No. 7,155,241, Trial No. IPR2013-00033, Expunging Papers in Inter Partes Reexamination of U.S. Patent No. 7,155,241 (Control No. 95/002,088), Administrative Patent Judge Joni Y. Chang, (Dec. 6, 2012).
Order in Inter Partes Review of U.S. Patent No. 7,155,241, Trial No. IPR2013-00033, Denying Request to Lift the Stay in Inter Partes Reexamination of U.S. Patent No. 7,155,241 (Control No. 95/002,088), Administrative Patent Judge Joni Y. Chang, (Dec. 20, 2012).
Preliminary Patent Owner Response to the Petition for Inter Partes Review of US Pat 7,155,241, IPR2013-00033 (Jan. 18, 2013).
Notice of Allowance in U.S. Appl. No. 13/109,389, (Oct. 12, 2012).
Notice of Allowance in U.S. Appl. No. 13/109,437, (Dec. 21, 2012).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 8,107,601, Control No. 95/001,991 (Feb. 13, 2013).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 8,134,450, Control No. 95/002,016 (Feb. 28, 2013).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 8,224,294, Control No. 95/002,140 (Feb. 28, 2013).
Requester Comments in Inter Partes Reexamination of U.S. Patent No. 8,116,741, Control No. 95/001,983 (Mar. 8, 2013).
Non-Final Action Closing Prosecution in Inter Partes Reexamination of U.S. Patent No. 7,499,716, Control No. 95/001,867 (Apr. 29, 2013).
Notice of Allowance in U.S. Appl. No. 13/210,223 (Mar. 19, 2013).
Order Instituting Inter Partes Review of U.S. Patent No. 7,155,241 in IPR2013-00033 (Mar. 25, 2013).
Muller-Schloer, et al., “Embedded Microprocessor Systems,” IOS Press (1996).
Engelen, Letter re: Publication Date of Muller-Schloer, et al., “Embedded Microprocessor Systems,” IOS Press (1996) (Mar. 4, 2013).
Helferich Patent Licensing LLC v. CBS Corporation, Bravo Media LLC, and G4 Media LLC, Defendants' Invalidity and Unenforceability Contentions, (Apr. 10, 2013).
Helferich Patent Licensing LLC v. New York Times Company, Defendant's Invalidity and Unenforceability Contentions, (Apr. 10, 2013).
Helferich Patent Licensing LLC v.J.C. Penney Corporation, Inc., Defendant's Invalidity and Unenforceability Contentions, (Apr. 10, 2013).
Nokia, “Smart Messaging Specification, Revision 1.0.0” (Sep. 15, 1997).
Nokia, “Tagged Text Markup Language” (Sep. 15, 1997).
Simila, et. al, “Providing SMS Based Mobile Office Services in New GSM Communicator,” IOS Press (1996).
Borenstein, et al., “RFC 1521: MIME (Multipurpose Internet Mail Extensions) Part One: Mechanisms for Specifying and describing the Format of Internet Message Bodies” (Sep. 1993).
ETSI GSM 03.12, “European Digital Cellular Telecommunications System (Phase 2); Location Registration Procedures,” (Sep. 1994).
ETSI GSM 03.38, “Digital Cellular Telecommunications System (Phase 2+); Alphabets and language-specific information,” Version 5.3.0 (Jul. 1996).
ETSI GSM 09.02, “Digital Cellular Telecommunications System (Phase 2+); Mobile Application Part (MAP) specification,” Version 5.3.0 (Aug. 1996).
ETSI GSM 03.03, “European Digital Cellular Telecommunications System (Phase 2); Numbering, addressing and identification,” Second Edition (Mar. 1995).
ETSI GSM 03.41, “Digital Cellular Telecommunications System (Phase 2+); Technical realization of Short Message Service Cell Broadcast (SMSCB),” Version 5.0.0 (Oct. 1995).
Non-Final Action Closing Prosecution in Inter Partes Reexamination of U.S. Patent No. 8,116,741, Control No. 95/001,983 (May 31, 2013).
“Patentee Response to Action Closing Prosecution (Non-Final) Pursuant to 37 C.F.R. §1.951(a),” Reexamination Control No. 95/001,867 (Jul. 1, 2013).
“Expert Declaration of John R. Grindon, D.Sc.,” Reexamination Control No. 95/001,867 (Jul. 1, 2013).
“Expert Declaration of Bobby R. Hunt, Ph.D.,” Reexamination Control No. 95/001,867 (Jul. 1, 2013).
“Declaration of Leonard I. Palevsky, Managing Member of Helferich Patent Licensing, LLC,” Reexamination Control No. 95/001,867 (Jul. 31, 2013).
“Patentee Response to Action Closing Prosecution (Non-Final) Pursuant to 37 C.F.R. §1.951(a),” Reexamination Control No. 95/001,983 (Jul. 31, 2013).
“Expert Declaration of John R. Grindon, D.Sc.,” Reexamination Control No. 95/001,983 (Jul. 31, 2013).
“Expert Declaration of Bobby R. Hunt, Ph.D.,” Reexamination Control No. 95/001,983 (Jul. 31, 2013).
“Declaration of Timothy D. Sperling, BSE, JD,” Reexamination Control No. 95/001,983 (Jul. 31, 2013).
“Declaration of Dwight Duncan, M.S., CFA” Reexamination Control No. 95/001,983 (Jul. 31, 2013).
“Patent Owner's Amended Response under 35 U.S.C. §316(a)(8) and 37 C.F.R. §42.220,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jun. 25, 2013).
“Patent Owner's Motion to Amend under 37 C.F.R. §42.121,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jun. 7, 2013).
Official Transcript of John C. Mitchell Cross-Examination Deposition Transcript in IPR2013-0003 (Jun. 3, 2013).
“Expert Declaration of Bobby R. Hunt, Ph.D.,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jun. 7, 2013).
“Expert Declaration of John R. Grindon, D.Sc.,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jun. 7, 2013).
“Supplemental Expert Declaration of John R. Grindon, D.Sc.,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jun. 25, 2013).
“Petitioner's Reply to Patent Owner's Response,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 29, 2013).
“Petitioner's Opposition to Patent Owner's Motion to Amend,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 29, 2013).
“Second Declaration of John C. Mitchell, Ph.D.,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 29, 2013).
“John Grindon Deposition Transcript, vol. I,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 17, 2013).
“John Grindon Deposition Transcript, vol. Ii,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 18, 2013).
“Richard Helferich Deposition Transcript, vol. I,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 15, 2013).
“Richard Helferich Deposition Transcript, vol. II,” Inter Partes Review of U.S. Patent No. 7,155,241 IPR2013-00033 (Jul. 16, 2013).
Microsoft Press Computer Dictionary, pp. 236-237, 240, 285, 487 (3d ed. 1997).
RFC 1081: Post Office Protocol—Version 3 (Nov. 1988).
RFC 1738: Uniform Resource Locators (URL), Dec. 1994.
Non-Final Office Action in U.S. Appl. No. 12/973,722, (May 31, 2013).
Helferich Patent Licensing LLC v. CBS Corporation, Bravo Media LLC, and G4 Media LLC, Defendants' Invalidity and Unenforceability Contentions, (Jun. 7, 2013).
Helferich Patent Licensing LLC v. New York Times Company, Defendant's Invalidity and Unenforceability Contentions, (Jun. 7, 2013).
Helferich Patent Licensing LLC v. J.C. Penney Corporation, Inc., Defendant's Invalidity and Unenforceability Contentions, (Jun. 7, 2013).
Helferich Patent Licensing LLC v. CBS Corporation, Bravo Media LLC, and G4 Media LLC, Defendants' Invalidity and Unenforceability Contentions, (Jun. 21, 2013).
Helferich Patent Licensing LLC v. New York Times Company, Defendant's Invalidity and Unenforceability Contentions, (Jun. 21, 2013).
Helferich Patent Licensing LLC v. J.C. Penney Corporation, Inc., Defendant's Invalidity and Unenforceability Contentions, (Jun. 21, 2013).
Helferich Patent Licensing LLC v. CBS Corporation, Bravo Media LLC, and G4 Media LLC, Plaintiff's Responsive Validity and Enforceability Contentions, (Jul. 19, 2013).
Helferich Patent Licensing LLC v. New York Times Company, Plaintiff's Responsive Validity and Enforceability Contentions, (Jul. 19, 2013).
Helferich Patent Licensing LLC v. J.C. Penney Corporation, Inc., Plaintiff's Responsive Validity and Enforceability Contentions, (Jul. 19, 2013).
Related Publications (1)
Number Date Country
20130157625 A1 Jun 2013 US
Divisions (3)
Number Date Country
Parent 12167971 Jul 2008 US
Child 13109437 US
Parent 11399513 Apr 2006 US
Child 12167971 US
Parent 08933344 Sep 1997 US
Child 09688282 US
Continuations (2)
Number Date Country
Parent 13109437 May 2011 US
Child 13763970 US
Parent 09688282 Oct 2000 US
Child 11399513 US