Patent Grant
7542555
The present invention relates to communications systems and in particular to computer assisted digital communications including data, fax, digitized voice and caller identification information.
A wide variety of communications alternatives are currently available to telecommunications users. For example, facsimile transmission of printed matter is available through what is commonly referred to as a stand-alone fax machine. Alternatively, fax-modem communication systems are currently available for personal computer users which combine the operation of a facsimile machine with the word processor of a computer to transmit documents held on computer disk. Modem communication over telephone lines in combination with a personal computer is also known in the art where file transfers can be accomplished from one computer to another. Also, simultaneous voice and modem data transmitted over the same telephone line has been accomplished in several ways.
The increased accessibility provided by telephone services and modems raises problems for controlling access to computer systems. Computer security systems have been developed which incorporate password programs to control access. These programs often monitor the number of times a particular user has logged onto a system. Systems which restrict access by limiting the number of attempted accesses in a given time period or by limiting the number of attempted accesses for a given password enable unauthorized users to “tie up” the system while they attempt to gain unauthorized access. When the system is tied up, authorized users may be prohibited from accessing the system due to repeated unsuccessful attempts by unauthorized users. In addition, such systems fail to guarantee that the unauthorized user will not gain access by guessing a correct password.
Another personal communications system access problem is gracefully restricting access to the personal communications system depending on the date or time of day. For example, the system operator of a BBS might want to restrict modem communications with the BBS between the hours of 8:00 a.m. and 6:00 p.m. to leave time for system maintenance duties.
Therefore, there is a need in the art for an access control system for a personal communications system which quickly rejects unauthorized users, and, preferably denies access before the unauthorized user has an opportunity to illegally enter the system. There is a further need for an access control system which screens callers without the use of a password system. Finally, there is a need in the art for a personal communications access system which screens calls based on date and time.
The present invention solves the aforementioned problems and shortcomings of the existing art and solves other problems not listed above which will become apparent to those skilled in the art upon reading and understanding the present specification and claims.
The present disclosure describes a complex computer assisted communications system which contains multiple inventions. The subject of the present multiple inventions is a personal communications system which includes components of software and hardware operating in conjunction with a personal computer. The user interface control software operates on a personal computer, preferably within the Microsoft Windows® environment. The software control system communicates with hardware components linked to the software through the personal computer serial communications port. The hardware components include telephone communication equipment, digital signal processors, and hardware to enable both fax and data communication with a hardware components at a remote site connected through a standard telephone line. The functions of the hardware components are controlled by control software operating within the hardware component and from the software components operating within the personal computer.
The major functions of the present system are a telephone function, a voice mail function, a fax manager function, a multi-media mail function, a show and tell function, a terminal function and an address book function. These functions are described in further detail in U.S. patent application Ser. No. 08/002,467 filed Jan. 8, 1993 entitled “COMPUTER-BASED MULTIFUNCTION PERSONAL COMMUNICATIONS SYSTEM”, which has been incorporated by reference.
The hardware components of the present system include circuitry to enable digital data communication and facsimile communication over standard telephone lines.
The present disclosure also describes a system for personal communications system access control using a caller ID interface (“CID interface”). Many standard telephone carriers are encoding caller ID information which may be received before answering the telephone. One embodiment of the present invention decodes the incoming caller ID information and compares the present caller's identification information with a preprogrammed access matrix to determine if access to the modem is appropriate. The callers' identification information can be recorded and statistically tracked regardless of whether the callers are authorized and regardless of whether each call is answered.
In one embodiment of the present invention, the caller ID interface incorporates a ring detector, off-hook circuit, dc holding circuit, caller ID decoder, relay switching circuit, memory, and processor. The ring detector circuit is used to enable the caller ID decoder after the first ring, since most caller ID carriers encode the caller ID information using frequency shift keying transmission after the first telephone ring and before the second telephone ring. The caller ID decoder is connected to the telephone line (without answering the call) using the relay switching circuit between the first and second telephone ring to receive the incoming caller ID information. The off-hook circuit is used to hang up on an unwanted caller before actually answering the telephone.
In one embodiment of the present invention the caller ID interface acquires information about incoming calls by decoding the incoming caller ID information and storing it in memory. Statistical tracking of callers is performed on the stored caller ID information if desired by the personal communications system owner. Another embodiment of the present invention screens access by comparing a preprogrammed access matrix to details of the call such as the caller's name, caller's phone number, the time and date the call is made, and the number of previous accesses by that caller in a predefined time frame. A variety of preprogrammed criteria are utilized to control access to the personal communications system. For example, in one embodiment, screening by name and telephone number is performed on an inclusive (or exclusive) basis by preprogramming the caller ID interface with the names or telephone numbers of the callers with (or without) access privileges. The incoming call details obtained from the caller ID information are then compared to the inclusive (or exclusive) caller list to determine if the callers are authorized to access the personal communications system. In an alternate embodiment of the present invention the caller ID interface hangs up on an unauthorized caller, preventing the unauthorized caller even brief access.
Therefore, the present invention solves the deficiencies of the prior art by providing an apparatus and method for rapid database creation of incoming calls using caller ID information. One embodiment of the present invention also quickly rejects unauthorized callers, and may hang up on them instantly, rather than allow access to the modem. The screening process of the present invention need not use a password for caller authorization, since the caller ID information can be used to screen out unwanted callers. Yet another embodiment of the present invention screens incoming calls based on date and time.
In the drawings, where like numerals describe like components throughout the several views,
In the following detailed description, references made to the accompanying drawings which form a part hereof and in which is shown by way of illustration specific embodiment in which the invention may be practiced. These embodiments are described in sufficient detail to enable those skilled in the art to practice and use the invention, and it is to be understood that other embodiments may be utilized in that electrical, logical, and structural changes may be made without departing from the spirit and scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense in scope of the present invention as defined by the appended claims
The ornamental features of the hardware components 20 of
The present inventions are embodied in a commercial product by the assignee, MultiTech Systems, Inc. The software component operating on a personal computer is sold under the commercial trademark of MultiExpressPCS™ personal communications software while the hardware component of the present system is sold under the commercial name of MultiModemPCS™, Intelligent Personal Communications System Modem. In the preferred embodiment, the software component runs under Microsoft® Windows® however those skilled in the art will readily recognize that the present system is easily adaptable to run under any single or multi-user, single or multi-window operating system.
The present system is a multifunction communication system which includes hardware and software components. The system allows the user to connect to remote locations equipped with a similar system or with modems, facsimile machines or standard telephones over a single analog telephone line. The software component of the present system includes a number of modules which are described in more detail below.
The telephone module allows the system to operate as a conventional or sophisticated telephone system. The system converts voice into a digital signal so that it can be transmitted or stored with other digital data, like computer information. The telephone function supports PBX and Centrex features such a call waiting, call forwarding, caller ID and three-way calling. This module also allows the user to mute, hold or record a conversation. The telephone module enables the handset, headset or hands-free speaker telephone operation of the hardware component. It includes on-screen push button dialing, speed-dial of stored numbers and digital recording of two-way conversations.
The voice mail portion of the present system allows this system to operate as a telephone answering machine by storing voice messages as digitized voice files along with a time/date voice stamp. The digitized voice files can be saved and sent to one or more destinations immediately or at a later time using a queue scheduler. The user can also listen to, forward or edit the voice messages which have been received with a powerful digital voice editing component of the present system. This module also creates queues for outgoing messages to be sent at preselected times and allows the users to create outgoing messages with the voice editor.
The fax manager portion of the present system is a queue for incoming and outgoing facsimile pages. In the preferred embodiment of the present system, this function is tied into the Windows “print” command once the present system has been installed. This feature allows the user to create faxes from any Windows®-based document that uses the “print” command. The fax manager function of the present system allows the user to view queued faxes which are to be sent or which have been received. This module creates queues for outgoing faxes to be sent at preselected times and logs incoming faxes with time/date stamps.
The multi-media mail function of the present system is a utility which allows the user to compose documents that include text, graphics and voice messages using the message composer function of the present system, described more fully below. The multi-media mail utility of the present system allows the user to schedule messages for transmittal and queues up the messages that have been received so that can be viewed at a later time.
The show and tell function of the present system allows the user to establish a data over voice (DOV) communications session. When the user is transmitting data to a remote location similarly equipped, the user is able to talk to the person over the telephone line while concurrently transferring the data. This voice over data function is accomplished in the hardware components of the present system. It digitizes the voice and transmits it in a dynamically changing allocation of voice data and digital data multiplexed in the same transmission. The allocation at a given moment is selected depending on the amount of voice digital information required to be transferred. Quiet voice intervals allocate greater space to the digital data transmission.
The terminal function of the present system allows the user to establish a data communications session with another computer which is equipped with a modem but which is not equipped with the present system. This feature of the present system is a Windows®-based data communications program that reduces the need for issuing “AT” commands by providing menu driven and “pop-up” window alternatives.
The address book function of the present system is a database that is accessible from all the other functions of the present system. This database is created by the user inputting destination addresses and telephone numbers for data communication, voice mail, facsimile transmission, modem communication and the like. The address book function of the present system may be utilized to broadcast communications to a wide variety of recipients. Multiple linked databases have separate address books for different groups and different destinations may be created by the users. The address book function includes a textual search capability which allows fast and efficient location of specific addresses as described more fully below.
In the preferred embodiment of the present system three alternate telephone interfaces are available: the telephone handset 301, a telephone headset 302, and a hands-free microphone 303 and speaker 304. Regardless of the telephone interface, the three alternative interfaces connect to the digital telephone coder-decoder (CODEC) circuit 305.
The digital telephone CODEC circuit 305 interfaces with the voice control digital signal processor (DSP) circuit 306 which includes a voice control DSP and CODEC. This circuit does digital to analog (D/A) conversion, analog to digital (A/D) conversion, coding/decoding, gain control and is the interface between the voice control DSP circuit 306 and the telephone interface. The CODEC of the voice control circuit 306 transfers digitized voice information in a compressed format to multiplexor circuit 310 to analog telephone line interface 309.
The CODEC of the voice control circuit 306 is actually an integral component of a voice control digital signal processor integrated circuit, as described more fully below. The voice control DSP of circuit 306 controls the digital telephone CODEC circuit 305, performs voice compression and echo cancellation.
Multiplexor (MUX) circuit 310 selects between the voice control DSP circuit 306 and the data pump DSP circuit 311 for transmission of information on the telephone line through telephone line interface circuit 309.
The data pump circuit 311 also includes a digital signal processor (DSP) and a CODEC for communicating over the telephone line interface 309 through MUX circuit 310. The data pump DSP and CODEC of circuit 311 performs functions such as modulation, demodulation and echo cancellation to communicate over the telephone line interface 309 using a plurality of telecommunications standards including FAX and modem protocols.
The main controller circuit 313 controls the DSP data pump circuit 311 and the voice control DSP circuit 306 through serial input/output and clock timer control (SIO/CTC) circuits 312 and dual port RAM circuit 308 respectively. The main controller circuit 313 communicates with the voice control DSP 306 through dual port RAM circuit 308. In this fashion digital voice data can be read and written simultaneously to the memory portions of circuit 308 for high speed communication between the user (through interfaces 301, 302 or 303/304) and the personal computer connected to serial interface circuit 315 and the remote telephone connection connected through the telephone line attached to line interface circuit 309.
As described more fully below, the main controller circuit 313 includes, in the preferred embodiment, a microprocessor which controls the functions and operation of all of the hardware components shown in
The RS232 serial interface circuit 315 communicates to the serial port of the personal computer which is running the software components of the present system. The RS232 serial interface circuit 315 is connected to a serial input/output circuit 314 with main controller circuit 313. SIO circuit 314 is in the preferred embodiment, a part of SIO/CTC circuit 312.
Referring once again to
The telephone function 115 is implemented by the user either selecting a telephone number to be dialed from the address book 127 or manually selecting the number through the telephone menu on the personal computer. The telephone number to be dialed is downloaded from the personal computer over the serial interface and received by main controller 313. Main controller 313 causes the data pump DSP circuit 311 to seize the telephone line and transmit the DTMF tones to dial a number. Main controller 313 configures digital telephone CODEC circuit 305 to enable either the handset 301 operation, the microphone 303 and speaker 304 operation or the headset 302 operation. A telephone connection is established through the telephone line interface circuit 309 and communication is enabled. The user's analog voice is transmitted in an analog fashion to the digital telephone CODEC 305 where it is digitized. The digitized voice patterns are passed to the voice control circuit 306 where echo'cancellation is accomplished, the digital voice signals are reconstructed into analog signals and passed through multiplexor circuit 310 to the telephone line interface circuit 309 for analog transmission over the telephone line. The incoming analog voice from the telephone connection through telephone connection circuit 309 is passed to the integral CODEC of the voice control circuit 306 where it is digitized. The digitized incoming voice is then passed to digital telephone CODEC circuit 305 where it is reconverted to an analog signal for transmission to the selected telephone interface (either the handset 301, the microphone/speaker 303/304 or the headset 302). Voice Control DSP circuit 306 is programmed to perform echo cancellation to avoid feedback and echoes between transmitted and received signals, as is more fully described below.
In the voice mail function mode of the present system, voice messages may be stored for later transmission or the present system may operate as an answering machine receiving incoming messages. For storing digitized voice, the telephone interface is used to send the analog speech patterns to the digital telephone CODEC circuit 305. Circuit 305 digitizes the voice patterns and passes them to voice control circuit 306 where the digitized voice patterns are digitally compressed. The digitized and compressed voice patterns are passed through dual port ram circuit 308 to the main controller circuit 313 where they are transferred through the serial interface to the personal computer using a packet protocol defined below. The voice patterns are then stored on the disk of the personal computer for later use in multi-media mail, for voice mail, as a pre-recorded answering machine message or for later predetermined transmission to other sites.
For the present system to operate as an answering machine, the hardware components of
The hardware components of
A facsimile transmission is also facilitated by the hardware components of
The operation of the multi-media mail function 121 of
The multimedia package of information including text, graphics and voice messages (collectively called the multimedia document) may be transmitted or received through the hardware components shown in
The show and tell function 123 of the present system allows the user to establish a data over voice communication session. In this mode of operation, full duplex data transmission may be accomplished simultaneously with the voice communication between both sites. This mode of operation assumes a like configured remote site. The hardware components of the present system also include a means for sending voice/data over cellular links. The protocol used for transmitting multiplexed voice and data include a supervisory packet described more fully below to keep the link established through the cellular link. This supervisory packet is an acknowledgement that the link is still up. The supervisory packet may also contain link information to be used for adjusting various link parameters when needed. This supervisory packet is sent every second when data is not being sent and if the packet is not acknowledged after a specified number of attempts, the protocol would then give an indication that the cellular link is down and then allow the modem to take action. The action could be for example; change speeds, retrain, or hang up. The use of supervisory packets is a novel method of maintaining inherently intermittent cellular links when transmitting multiplexed voice and data.
The voice portion of the voice over data transmission of the show and tell function is accomplished by receiving the user's voice through the telephone interface 301, 302 or 303 and the voice information is digitized by the digital telephone circuit 305. The digitized voice information is passed to the voice control circuit 306 where the digitized voice information is compressed using a voice compression algorithm described more fully below. The digitized and compressed voice information is passed through dual port RAM circuit 308 to the main controller circuit 313. During quiet periods of the speech, a quiet flag is passed from voice control circuit 306 to the main controller 313 through a packet transfer protocol described below by a dual port RAM circuit 308.
Simultaneous with the digitizing compression and packetizing of the voice information is the receipt of the packetized digital information from the personal computer over interface line circuit 315 by main controller circuit 313. Main controller circuit 313 in the show and tell function of the present system must efficiently and effectively combine the digitized voice information with the digital information for transmission over the telephone line via telephone line interface circuit 309. As described above and as described more fully below, main controller circuit 313 dynamically changes the amount of voice information and digital information transmitted at any given period of time depending upon the quiet times during the voice transmissions. For example, during a quiet moment where there is no speech information being transmitted, main controller circuit 313 ensures that a higher volume of digital data information be transmitted over the telephone line interface in lieu of digitized voice information.
Also, as described more fully below, the packets of digital data transmitted over the telephone line interface with the transmission packet protocol described below, requires 100 percent accuracy in the transmission of the digital data, but a lesser standard of accuracy for the transmission and receipt of the digitized voice information. Since digital information must be transmitted with 100 percent accuracy, a corrupted packet of digital information received at the remote site must be retransmitted. A retransmission signal is communicated back to the local site and the packet of digital information which was corrupted during transmission is retransmitted. If the packet transmitted contained voice data, however, the remote site uses the packets whether they were corrupted or not as long as the packet header was intact. If the header is corrupted, the packet is discarded. Thus, the voice information may be corrupted without requesting retransmission since it is understood that the voice information must be transmitted on a real time basis and the corruption of any digital information of the voice signal is not critical. In contrast to this the transmission of digital data is critical and retransmission of corrupted data packets is requested by the remote site.
The transmission of the digital data follows the CCITT V.42 standard, as is well known in the industry and as described in the CCITT Blue Book, volume VIII entitled Data Communication over the Telephone Network, 1989. The CCITT V.42 standard is hereby incorporated by reference. The voice data packet information also follows the CCITT V.42 standard, but uses a different header format so the receiving site recognizes the difference between a data packet and a voice packet. The voice packet is distinguished from a data packet by using undefined bits in the header (80 hex) of the V.42 standard. The packet protocol for voice over data transmission during the show and tell function of the present system is described more fully below.
Since the voice over data communication with the remote site is full-duplex, incoming data packets and incoming voice packets are received by the hardware components of
Terminal operation 125 of the present system is also supported by the hardware components of
In a reciprocal fashion, data is received from the telephone line over telephone line interface circuit 309 and simply forwarded by the data pump circuit 311, the main controller circuit 313 over the serial line interlace circuit 315 to the personal computer.
As described above, and more fully below, the address book function of the present system is primarily a support function for providing telephone numbers and addresses for the other various functions of the present system.
The detailed electrical schematic diagrams comprise
Beginning with the electrical schematic diagram of
Also connected across the incoming telephone line is a ring detect circuit. Optical isolator U32 (part model number CNY17) senses the ring voltage threshold when it exceeds the breakdown voltages on zener diodes CR1 and CR2. A filtering circuit shown in the upper right corner of
The present system is also capable of sensing the caller ID information which is transmitted on the telephone line between rings. Between the rings, optically isolated relays U30, U31 on
Referring now to
Relay U29 shown in
The connections T1 and T2 for the telephone line from
Incoming signals are buffered by operational amplifiers U27A and U27B. The first stage of buffering using operational amplifier U27B is used for echo suppression so that the transmitted information being placed on the telephone line is not fed back into the receive portion of the present system. The second stage of the input buffering through operational amplifier U27A is configured for a moderate amount of gain before driving the signal into CODEC U35.
CODEC chip U35 on
The chip set U34, U35 and U37 on
The main controller of controller circuit 313 and the support circuits 312, 314, 316, 317 and 308 are shown in
The Z80180 microprocessor in microcontroller chip U17 is intimately connected to a serial/parallel I/O counter timer chip U15 which is, in the preferred embodiment, a Zilog 84C90 CMOS Z80 KIO serial/parallel/counter/timer integrated circuit available from Zilog, Inc. This multi-function I/O chip U15 combines the functions of a parallel input/output port, a serial input/output port, bus control circuitry, and a clock timer circuit in one chip. The Zilog Z84C90 product specification describes the detailed internal operations of this circuit in the Zilog Intelligent Peripheral Controllers 1991 Handbook available from Zilog, Inc. Z84C90 CMOS Z80KIO Product specification pgs. 205-224 of the Zilog 1991 Intelligent Peripheral Controllers databook is hereby incorporated by reference.
Data and address buses A and B shown in
The memory chips which operate in conjunction with the Z80 microprocessor in microcontroller chip U17 are shown in
In the preferred embodiment, RAM chip U14 is a pseudostatic RAM which is essentially a dynamic RAM with a built-in refresh. Those skilled in the art will readily recognize that a wide variety memory chips may be used and substituted for pseudo-static RAM U14 and flash PROMs U16 and U13.
Referring once again to
Referring to
Also in
The connections to DSP/CODEC chip U8 are shown split across
The Digital Telephone CODEC chip U12 is also shown in
Support circuits shown on
The operation of the dual port RAM U11 is controlled both by DSP U8 and main controller chip U17. The dual port operation allows writing into one address while reading from another address in the same chip. Both processors can access the exact same memory locations with the use of a contention protocol such that when one is reading the other cannot be writing. In the preferred embodiment, dual port RAM chip U11 is part number CYZC131 available from Cyprus Semiconductor. This chip includes built in contention control so that if two processors try to access the same memory location at the same time, the first one making the request gets control of the address location and the other processor must wait. In the preferred embodiment, a circular buffer is arranged in dual port RAM chip U11 comprising 24 bytes. By using a circular buffer configuration with pointers into the buffer area, both processors will not have a contention problem.
The DSP RAM chips U6 and U7 are connected to the DSP chip U8 and also connected through the data and address buses to the Zilog microcontroller U17. In this configuration, the main controller can download the control programs for DSP U8 into DSP RAMs U6 and U7. In this fashion, DSP control can be changed by the main controller or the operating programs on the personal computer, described more fully below. The control programs stored in DSP chips U6 and U7 originate in the flash PEROM chips U16 and U17. The power-up control routine operating on controller chip U17 downloads the DSP control routines into DSP RAM chips U6 and U7.
The interface between the main controller circuit 313 and the personal computer is through SIO circuit 314 and RS232 serial interface 315. These interfaces are described more fully in conjunction with the detailed electrical schematic diagrams of
Finally, the “glue logic” used to support various functions in the hardware components 20 are described in conjunction with the detailed electrical schematic diagrams of
A special packet protocol is used for communication between the hardware components 20 and the personal computer (PC) 10. The protocol is used for transferring different types of information between the two devices such as the transfer of DATA, VOICE, and QUALIFIED information. The protocol also uses the BREAK as defined in CCITT X.28 as a means to maintain protocol synchronization. A description of this BREAK sequence is also described in the Statutory Invention Registration entitled “ESCAPE METHODS FOR MODEM COMMUNICATIONS”, to Timothy D. Gunn filed Jan. 8, 1993, which is hereby incorporated by reference.
The protocol has two modes of operation. One mode is packet mode and the other is stream mode. The protocol allows mixing of different types of information into the data stream without having to physically switch modes of operation. The hardware component 20 will identify the packet received from the computer 10 and perform the appropriate action according to the specifications of the protocol. If it is a data packet, then the controller 313 of hardware component 20 would send it to the data pump circuit 311. If the packet is a voice packet, then the controller 313 of hardware component 20 would distribute that information to the Voice DSP 306. This packet transfer mechanism also works in the reverse, where the controller 313 of hardware component 20 would give different information to the computer 10 without having to switch into different modes. The packet protocol also allows commands to be sent to either the main controller 313 directly or to the Voice DSP 306 for controlling different options without having to enter a command state.
Packet mode is made up of 8 bit asynchronous data and is identified by a beginning synchronization character (01 hex) followed by an ID/LI character and then followed by the information to be sent. In addition to the ID/LI character codes defined below, those skilled in the art will readily recognize that other ID/LI character codes could be defined to allow for additional types of packets such as video data, or alternate voice compression algorithm packets such as Codebook Excited Linear Predictive Coding (CELP) algorithm, GSM, RPE, VSELP, etc.
Stream mode is used when large amounts of one type of packet (VOICE, DATA, or QUALIFIED) is being sent. The transmitter tells the receiver to enter stream mode by a unique command. Thereafter, the transmitter tells the receiver to terminate stream mode by using the BREAK command followed by an “AT” type command. The command used to terminate the stream mode can be a command to enter another type of stream mode or it can be a command to enter back into packet mode.
Currently there are 3 types of packets used: DATA, VOICE, and QUALIFIED. Table 1 shows the common packet parameters used for all three packet types. Table 2 shows the three basic types of packets with the sub-types listed.
A Data Packet is shown in Table 1 and is used for normal data transfer between the controller 313 of hardware component 20 and the computer 10 for such things as text, file transfers, binary data and any other type of information presently being sent through modems. All packet transfers begin with a synch character 01 hex (synchronization byte). The Data Packet begins with an ID byte which specifies the packet type and packet length. Table 3 describes the Data Packet byte structure and Table 4 describes the bit structure of the ID byte of the Data Packet. Table 5 is an example of a Data Packet with a byte length of 6. The value of the LI field is the actual length of the data field to follow, not counting the ID byte.
The Voice Packet is used to transfer compressed VOICE messages between the controller 313 of hardware component 20 and the computer 10. The Voice Packet is similar to the Data Packet except for its length which is, in the preferred embodiment, currently fixed at 23 bytes of data. Once again, all packets begin with a synchronization character chosen in the preferred embodiment to be 01 hex (01H). The ID byte of the Voice Packet is completely a zero byte: all bits are set to zero. Table 6 shows the ID byte of the Voice Packet and Table 7 shows the Voice Packet byte structure.
The Qualified Packet is used to transfer commands and other non-data/voice related information between the controller 313 of hardware component 20 and the computer 10. The various species or types of the Qualified Packets are described below and are listed above in Table 2. Once again, all packets start with a synchronization character chosen in the preferred embodiment to be 01 hex (01H). A Qualified Packet starts with two bytes where the first byte is the ID byte and the second byte is the QUALIFIER type identifier. Table 8 shows the ID byte for the Qualified Packet, Table 9 shows the byte structure of the Qualified Packet and Tables 10-12 list the Qualifier Type byte bit maps for the three types of Qualified Packets.
The Length Identifier of the ID byte equals the amount of data which follows including the QUALIFIER byte (QUAL byte+DATA). If LI=1, then the Qualifier Packet contains the Q byte only.
The bit maps of the Qualifier Byte (QUAL BYTE) of the Qualified Packet are shown in Tables 10-12. The bit map follows the pattern whereby if the QUAL byte=0, then the command is a break. Also, bit 1 of the QUAL byte designates ack/nak, bit 2 designates flow control and bit 6 designates stream mode command. Table 10 describes the Qualifier Byte of Qualified Packet, Group 1 which are immediate commands. Table 11 describes the Qualifier Byte of Qualified Packet, Group 2 which are stream mode commands in that the command is to stay in the designated mode until a BREAK+INIT command string is sent. Table 12 describes the Qualifier Byte of Qualified Packet, Group 3 which are information or status commands.
The Qualifier Packet indicating stream mode and BREAK attention is used when a large of amount of information is sent (voice, data . . . ) to allow the highest throughput possible. This command is mainly intended for use in DATA mode but can be used in any one of the possible modes. To change from one mode to another, a break-init sequence would be given. A break “AT . . . <cr>” type command would cause a change in state and set the serial rate from the “AT” command.
In order to determine the status of the cellular link, a supervisory packet shown in Table 13 is used. Both sides of the cellular link will send the cellular supervisory packet every 3 seconds. Upon receiving the cellular supervisory packet, the receiving side will acknowledge it using the ACK field of the cellular supervisory packet. If the sender does not receive an acknowledgement within one second, it will repeat sending the cellular supervisory packet up to 12 times. After 12 attempts of sending the cellular supervisory packet without an acknowledgement, the sender will disconnect the line. Upon receiving an acknowledgement, the sender will restart its 3 second timer. Those skilled in the art will readily recognize that the timer values and wait times selected here may be varied without departing from the spirit or scope of the present invention.
The Speech Compression algorithm described above for use in transmitting voice over data accomplished via the voice control circuit 306. Referring once again to
To multiplex high-fidelity speech with digital data and transmit both over the over the telephone line, a high available bandwidth would normally be required. In the present invention, the analog voice information is digitized into 8-bit PCM data at an 8 kHz sampling rate producing a serial bit stream of 64,000 bps serial data rate. This rate cannot be transmitted over the telephone line. With the Speech Compression algorithm described below, the 64 kbs digital voice data is compressed into a 9500 bps encoding bit stream using a fixed-point (non-floating point) DSP such that the compressed speech can be transmitted over the telephone line multiplexed with asynchronous data. This is accomplished in an efficient manner such that enough machine cycles remain during real time speech compression to allow to allow for echo cancellation in the same fixed-point DSP.
A silence detection function is used to detect quiet intervals in the speech signal which allows the data processor to substitute asynchronous data in lieu of voice data packets over the telephone line to efficiently time multiplex the voice and asynchronous data transmission. The allocation of time for asynchronous data transmission is constantly changing depending on how much silence is on the voice channel.
The voice compression algorithm of the present system relies on a model of human speech which shows that human speech contains redundancy inherent in the voice patterns. Only the incremental innovations (changes) need to be transmitted. The algorithm operates on 128 digitized speech samples (20 milliseconds at 6400 Hz), divides the speech samples into time segments of 32 samples (5 milliseconds) each, and uses predicted coding on each segment. Thus, the input to the algorithm could be either PCM data sampled at 6400 Hz or 8000 Hz. If the sampling is at 8000 Hz, or any other selected sampling rate, the input sample data stream must be decimated from 8000 Hz to 6400 Hz before processing the speech data. At the output, the 6400 Hz PCM signal is interpolated back to 8000 Hz and passed to the CODEC.
With this algorithm, the current segment is predicted as best as possible based on the past recreated segments and a difference signal is determined. The difference values are compared to the stored difference values in a lookup table or code book, and the address of the closest value is sent to the remote site along with the predicted gain and pitch values for each segment. In this fashion, the entire 20 milliseconds of speech can be represented by 190 bits, thus achieving an effective data rate of 9500 bps.
To produce this compression, the present system includes a unique Vector Quantization (VQ) speech compression algorithm designed to provide maximum fidelity with minimum compute power and bandwidth. The VQ algorithm has two major components. The first section reduces the dynamic range of the input speech signal by removing short term and long term redundancies. This reduction is done in the waveform domain, with the synthesized part used as the reference for determining the incremental “new” content. The second section maps the residual signal into a code book optimized for preserving the general spectral shape of the speech signal.
The DC removal stage 1101 receives the digitized speech signal and removes the D.C. bias by calculating the long-term average and subtracting it from each sample. This ensures that the digital samples of the speech are centered about a zero mean value. The pre-emphasis stage 1103 whitens the spectral content of the speech signal by balancing the extra energy in the low band with the reduced energy in the high band.
The system finds the innovation in the current speech segment by subtracting 1109 the prediction from reconstructed past samples synthesized from synthesis stage 1107. This process requires the synthesis of the past speech samples locally (analysis by synthesis). The synthesis block 1107 at the transmitter performs the same function as the synthesis block 1113 at the receiver. When the reconstructed previous segment of speech is subtracted from the present segment (before prediction), a difference term is produced in the form of an error signal. This residual error is used to find the best match in the code book 1105. The code book 1105 quantizes the error signal using a code book generated from a representative set of speakers and environments. A minimum mean squared error match is determined in segments. In addition, the code book is designed to provide a quantization error with spectral rolloff (higher quantization error for low frequencies and lower quantization error for higher frequencies). Thus, the quantization noise spectrum in the reconstructed signal will always tend to be smaller than the underlying speech signal.
The channel corresponds to the telephone line in which the compressed speech bits are multiplexed with data bits using a packet format described below. The voice bits are sent in packets of 5 frames each, each frame corresponding to 20 ms of speech in 128 samples. The size of the packets depends upon the type of compression used. Three compression algorithms are described which will be called 8K, 9.6K and 16K. The 8K and 9.6K algorithms results in a 24 byte packet while the 16K algorithm produces a packet of 48 bytes for each 20 ms speech segment.
Each frame of 20 ms is divided into 4 sub-blocks or segments of 5 ms each. In each sub-block of the data consists of a plurality of bits for the long term predictor, a plurality of bits for the long term predictor gain, a plurality of bits for the sub-block gain, and a plurality of bits for each code book entry for each 5 ms. The bits for the code book entries consists of four or five table entries in a 256 long code book of 1.25 ms duration. In the code book block, each 1.25 ms of speech is looked up in a 256 word code book for the best match. The table entry is transmitted rather than the actual samples. The code book entries are pre-computed from representative speech segments, as described more fully below.
On the receiving end 1200, the synthesis block 1113 at the receiver performs the same function as the synthesis block 1107 at the transmitter. The synthesis block 1113 reconstructs the original signal from the voice data packets by using the gain and pitch values and code book address corresponding to the error signal most closely matched in the code book. The code book at the receiver is similar to the code book 1105 in the transmitter. Thus the synthesis block recreates the original pre-emphasized signal. The de-emphasis stage 1115 inverts the pre-emphasis operation by restoring the balance of original speech signal.
The complete speech compression algorithm is summarized as follows:
The major advantages of this approach over other low-bit-rate algorithms are that there is no need for any complicated calculation of reflection coefficients (no matrix inverse or lattice filter computations). Also, the quantization noise in the output speech is hidden under the speech signal and there are no pitch tracking artifacts: the speech sounds “natural”, with only minor increases of background hiss at lower bit-rates. The computational load is reduced significantly compared to a VSELP algorithm and variations of the present algorithm thus provides bit rates of 8, 9.6 and 16 Kbit/s, and can also provide bit rates of 9.2 kbits/s, 9.5 kbits/s and many other rates. The total delay through the analysis section is less than 20 milliseconds in the preferred embodiment. The present algorithm is accomplished completely in the waveform domain and there is no spectral information being computed and there is no filter computations needed.
The speech compression algorithm is described in greater detail with reference to
The voice control DSP/CODEC of circuit 306 correspond to the single integrated circuit U8 shown in
The sampled and digitized PCM voice signals from the telephone μ-law CODEC 305 shown in
In the voice-over-data mode of operation, voice control DSP/CODEC circuit 306 of
Concurrent with this transmit operation, the voice control DSP/CODEC circuit 306 is receiving compressed voice data packets from dual port RAM circuit 308, uncompressing the voice data and transferring the uncompressed and reconstructed digital PCM voice data to the digital telephone CODEC 305 for digital to analog conversion and eventual transfer to the user through the telephone interface 301, 302, 304. This is the receive mode of operation of the voice control DSP/CODEC circuit 306 corresponding to receiver block 1200 of
The voice control DSP/CODEC circuit 306 operates at a clock frequency of approximately 24.576 MHz while processing data at sampling rates of approximately 8 KHz in both directions. The voice compression/decompression algorithms and packetization of the voice data is accomplished in a quick and efficient fashion to ensure that all processing is done in real-time without loss of voice information. This is accomplished in an efficient manner such that enough machine cycles remain in the voice control DSP circuit 306 during real time speech compression to allow real time acoustic and line echo cancellation in the same fixed-point DSP.
In programmed operation, the availability of an eight-bit sample of PCM voice data from the μ-law digital telephone CODEC circuit 305 causes an interrupt in the voice control DSP/CODEC circuit 306 where the sample is loaded into internal registers for processing. Once loaded into an internal register it is transferred to a RAM address which holds a queue of samples. The queued PCM digital voice samples are converted from 8-bit μ-law data to a 13-bit linear data format using table lookup for the conversion. Those skilled in the art will readily recognize that the digital telephone CODEC circuit 305 could also be a linear CODEC.
The sampled and digitized PCM voice signals from the telephone μ-law CODEC 305 shown in
Referring to
A frame rate for the voice compression algorithm is 20 milliseconds of speech for each compression. This correlates to 128 samples to process per frame for the 6.4K decimated sampling rate. When 128 samples are accumulated in the queue of the internal DSP RAM, the compression of that sample frame is begun.
The voice-control DSP/CODEC circuit 306 is programmed to first remove the DC component 1101 of the incoming speech. The DC removal is an adaptive function to establish a center base line on the voice signal by digitally adjusting the values of the PCM data. This corresponds to the DC removal stage 1203 of the software flow chart of
The removal of the DC is for the 20 millisecond frame of voice which amounts to 128 samples at the 6.4K decimated sampling rate which corresponds to the 9.6K ALGORITHM. The selection of α is based on empirical observation to provide the best result.
Referring again to
A silence detection algorithm 1205 is also included in the programmed code of the DSP/CODEC 306. The silence detection function is a summation of the square of each sample of the voice signal over the frame. If the power of the voice frame falls below a preselected threshold, this would indicate a silent frame. The detection of a silence frame of speech is important for later multiplexing of the V-data (voice data) and C-data (asynchronous computer data) described below. During silent portions of the speech, the main controller circuit 313 will transfer conventional digital data (C-data) over the telephone line in lieu of voice data (V-data). The formula for computing the power is
If the power PWR is lower than a preselected threshold, then the present voice frame is flagged as containing silence. The 128-sample silent frame is still processed by the voice compression algorithm; however, the silent frame packets are discarded by the main controller circuit 313 so that asynchronous digital data may be transferred in lieu of voice data. The rest of the voice compression is operated upon in segments where there are four segments per frame amounting to 32 samples of data per segment. It is only the DC removal and silence detection which is accomplished over an entire 20 millisecond frame.
The pre-emphasis 1207 of the voice compression algorithm shown in
x(n)=x(n)−ρ*x(n−1) where ρ=0.5
and where n is the sample number,
x(n) is the sample
Each segment thus amounts to five milliseconds of voice which is equal to 32 samples. Pre-emphasis then is done on each segment. The selection of ρ is based on empirical observation to provide the best result.
The next step is the long-term prediction (LTP). The long-term prediction is a method to detect the innovation in the voice signal. Since the voice signal contains many redundant voice segments, we can detect these redundancies and only send information about the changes in the signal from one segment to the next. This is accomplished by comparing the speech samples of the current segment on a sample by sample basis to the reconstructed speech samples from the previous segments to obtain the innovation information and an indicator of the error in the prediction.
The long-term predictor gives the pitch and the LTP-Gain of the sub-block which are encoded in the transmitted bit stream. In order to predict the pitch in the current segment, we need at least 3 past sub-blocks of reconstructed speech. This gives a pitch value in the range of MIN_PITCH (32) to MAX_PITCH (95). This value is coded with 6-bits. But, in order to accommodate the compressed data rate within a 9600 bps link, the pitch for segments 0 and 3 is encoded with 6 bits, while the pitch for segments 1 and 2 is encoded with 5 bits. When performing the prediction of the Pitch for segments 1 and 2, the correlation lag is adjusted around the predicted pitch value of the previous segment. This gives us a good chance of predicting the correct pitch for the current segment even though the entire range for prediction is not used. The computations for the long-term correlation lag PITCH and associated LTP gain factor βj (where j=0, 1, 2, 3 corresponding to each of the four segments of the frame) are done as follows:
For j=min_pitch . . . . max_pitch, first perform the following computations between the current speech samples x(n) and the past reconstructed speech samples x′(n)
The Pitch j is chosen as that which maximizes
Since βj is positive, only j with positive Sxx′2 is considered.
Since the Pitch is encoded with different number of bits for each sub-segment, the value of min_pitch and max_Pitch (range of the synthesized speech for pitch prediction of the current segment) is computed as follows:
The prev_pitch parameter in the above equation, is the of the pitch of the previous sub-segment. The pitch j is the encoded in 6 bits or 5 bits as:
encoded bits=j−min_pitch
The LTP-Gain is given by
The value of the β is a normalized quantity between zero and unity for this segment where β is an indicator of the correlation between the segments. For example, a perfect sine wave would produce a β which would be close to unity since the correlation between the current segments and the previous reconstructed segments should be almost a perfect match so β is one. The LTP gain factor is quantized from a LTP Gain Encode Table. This table is characterized in Table 14. The resulting index (bcode) is transmitted to the far end. At the receiver, the LTP Gain Factor is retrieved from Table 15, as follows:
βq=dlb_tab[bcode]
After the Long-Term Prediction, we pass the signal through a pitch filter to whiten the signal so that all the pitch effects are removed. The pitch filter is given by:
e(n)=x(n)−βq*x′(n−j)
Next, the error signal is normalized with respect to the maximum amplitude in the sub-segment for vector-quantization of the error signal. The maximum amplitude in the segment is obtained as follows:
G=MAX{|e(n)|}
The maximum amplitude (G) is encoded using the Gain Encode Table. This table is characterized in Table 16. The encoded amplitude (gcode) is transmitted to the far end. At the receiver, the maximum amplitude is retrieved from Table 17, as follows:
Gq=dlg_tab[gcode]
The error signal e(n) is then normalized by
From the Gain and LTP Gain Encode tables, we can see that we would require 4 bits for gcode and 3 bits for bcode. This results in total of 7 bits for both parameters. In order to reduce the bandwidth of the compressed bit stream, the gcode and bcode parameters are encoded together in 6 bits, as follows:
BGCODE=6*gcode+bcode
The encoded bits for the G and LTP-Gain (β) at the receiver can be obtained as follows:
gcode=BGCODE/6
bcode=BGCODE−6*gcode
Each segment of 32 samples is divided into 4 vectors of 8 samples each. Each vector is compared to the vectors stored in the CodeBook and the Index of the Code Vector that is closest to the signal vector is selected. The CodeBook consists of 512 entries (512 addresses). The index chosen has the least difference according to the following minimalization formula:
The minimization computation, to find the best match between the subsegment and the code book entries is computationally intensive. A brute force comparison may exceed the available machine cycles if real time processing is to be accomplished. Thus, some shorthand processing approaches are taken to reduce the computations required to find the best fit. The above formula can be computed in a shorthand fashion as follows.
By expanding out the above formula, some of the unnecessary terms may be removed and some fixed terms may be pre-computed:
where xi2 is a constant so it may be dropped from the formula,
and the value of −½Σyi2 may be precomputed and stored as the 9th value in the code book so that the only real-time computation involved is the following formula:
Thus, for a segment of 32 samples, we will transmit 4 CodeBook Indexes (9 bits each) corresponding to 4 subsegments of 8 samples each. This means, for each segment, we have 36 bits to transmit.
After the appropriate index into the code book is chosen, the input speech samples are replaced by the corresponding vectors in the chosen indexes. These values are then multiplied by the Gq to denormalize the synthesized error signal, e′(n). This signal is then passed through the Inverse Pitch Filter to reintroduce the Pitch effects that was taken out by the Pitch filter. The Inverse Pitch Filter is performed as follows:
y(n)=e′(n)+βq*x′ (n−j)
where βq is the decoded LTP-Gain from Table 16, and j is the Lag.
The Inverse Pitch Filter output is used to update the synthesized speech buffer which is used for the analysis of the next sub-segment. The update of the state buffer is as follows:
x′(k)=x′(k+MIN_PITCH)
The signal is then passed through the deemphasis filter since preemphasis was performed at the beginning of the processing. In the analysis, only the preemphasis state is updated so that we properly satisfy the Analysis-by-Synthesis method of performing the compression. In the Synthesis, the output of the deemphasis filter, s′(n), is passed on to the D/A to generate analog speech. The deemphasis filter is implemented as follows:
s′(n)=y(n)+ρ*s′(n−1) where ρ=0.5
The voice is reconstructed at the receiving end of the voice-over data link according to the reverse of the compression algorithm as shown as the decompression algorithm in
If a silence frame is received, the decompression algorithm simply discards the received frame and initialize the output with zeros. If a speech frame is received the pitch, LTP-Gain and GAIN are decoded as explained above. The error signal is reconstructed from the codebook indexes, which is then denormalized with respect to the GAIN value. This signal is then passed through the Inverse filter to generate the reconstructed signal. The Pitch and the LTP-Gain are the decoded values, same as those used in the Analysis. The filtered signal is passed through the Deemphasis filter whose output is passed on to the D/A to put out analog speech.
The compressed frame contains 23 8-bit words and one 6-bit word. Thus a total of 24 words. Total number of bits transferred is 190, which corresponds to 9500 bps as shown in Table 18.
The code books used for the VQ algorithm described above are attached as Appendices A, B and C. Appendix A includes the code book data for the 8K algorithm, Appendix B includes the code book data for the 9.6K algorithm and Appendix C includes the code book data for the 16K algorithm. Table 19 describes the format of the code book for the 9.6K algorithm. The code book values in the appendices are stored in a signed floating point format which is converted to a Q22 value fixed point digital format when stored in the lookup tables of the present invention. There are 256 entries in each code book corresponding to 256 different speech segments which can be used to encode and reconstruct the speech.
For the 9.6K algorithm, the code book comprises a table of nine columns and 256 rows of floating point data. The first 8 rows correspond to the 8 samples of speech and the ninth entry is the precomputed constant described above as −½Σyi2. An example of the code book data is shown in Table 20 with the complete code book for the 9.6K algorithm described in Appendix B.
The code books are converted into Q22 format and stored in PROM memory accessible by the Voice DSP as a lookup table. The table data is loaded into local DSP memory upon the selection of the appropriate algorithm to increase access speed. The code books comprise a table of data in which each entry is a sequential address from 000 to 511. For the 9.6K algorithm, a 9×512 code book is used. For the 16K algorithm, a 9×512 code book is used and for the 8K algorithm, a 9×512 code book is used. Depending upon which voice compression quality and compression rate is selected, the corresponding code book is used to encode/decode the speech samples.
The code books are generated statistically by encoding a wide variety of speech patterns. The code books are generated in a learning mode for the above-described algorithm in which each speech segment which the compression algorithm is first exposed to is placed in the code book until 512 entries are recorded. Then the algorithm is continually fed a variety of speech patterns upon which the code book is adjusted. As new speech segments are encountered, the code book is searched to find the best match. If the error between the observed speech segment and the code book values exceed a predetermined threshold, then the closest speech segment in the code book and the new speech segment is averaged and the new average is placed in the code book in place of the closest match. In this learning mode, the code book is continually adjusted to have the lowest difference ratio between observed speech segment values and code book values. The learning mode of operation may take hours or days of exposure to different speech patterns to adjust the code books to the best fit.
The code books may be exposed to a single person's speech which will result in a code book being tailored to that particular persons method of speaking. For a mass market sale of this product, the speech patterns of a wide variety of speakers of both genders are exposed to the code book learning algorithm for the average fit for a given language. For other languages, it is best to expose the algorithm to speech patterns of only one language such as English or Japanese.
As described above, the present system can transmit voice data and conventional data concurrently by using time multiplex technology. The digitized voice data, called V-data carries the speech information. The conventional data is referred to as C-data. The V-data and C-data multiplex transmission is achieved in two modes at two levels: the transmit and receive modes and data service level and multiplex control level. This operation is shown diagrammatically in
In transmit mode, the main controller circuit 313 of
In transmit mode, there are two data buffers, the V-data buffer 1511 and the C-data buffer 1513, implemented in the main controller RAM 316 and maintained by main controller 313. When the voice control DSP circuit 306 engages voice operation, it will send a block of V-data every 20 ms to the main controller circuit 313 through dual port RAM circuit 308. Each V-data block has one sign byte as a header and 23 bytes of V-data.
The sign byte header of the voice packet is transferred every frame from the voice control DSP to the controller 313. The sign byte header contains the sign byte which identifies the contents of the voice packet. The sign byte is defined as follows:
00 hex=the following V-data contains silent sound
01 hex=the following V-data contains speech information
If the main controller 313 is in transmit mode for V-data/C-data multiplexing, the main controller circuit 313 operates at the data service level to perform the following tests. When the voice control DSP circuit 306 starts to send the 23-byte V-data packet through the dual port RAM to the main controller circuit 313, the main controller will check the V-data buffer to see if the buffer has room for 23 bytes. If there is sufficient room in the V-data buffer, the main controller will check the sign byte in the header preceding the V-data packet. If the sign byte is equal to one (indicating voice information in the packet), the main controller circuit 313 will put the following 23 bytes of V-data into the V-data buffer and clear the silence counter to zero. Then the main controller 313 sets a flag to request that the V-data be sent by the main controller at the multiplex control level.
If the sign byte is equal to zero (indicating silence in the V-data packet), the main controller circuit 313 will increase the silence counter by 1 and check if the silence counter has reached 5. When the silence counter reaches 5, the main controller circuit 313 will not put the following 23 bytes of V-data into the V-data buffer and will stop increasing the silence counter. By this method, the main controller circuit 313 operating at the service level will only provide non-silence V-data to the multiplex control level, while discarding silence V-data packets and preventing the V-data buffer from being overwritten.
The operation of the main controller circuit 313 in the multiplex control level is to multiplex the V-data and C-data packets and transmit them through the same channel. At this control level, both types of data packets are transmitted by the HDLC protocol in which data is transmitted in synchronous mode and checked by CRC error checking. If a V-data packet is received at the remote end with a bad CRC, it is discarded since 100% accuracy of the voice channel is not ensured. If the V-data packets were re-sent in the event of corruption, the real-time quality of the voice transmission would be lost. In addition, the C-data is transmitted following a modem data communication protocol such as CCITT V.42.
In order to identify the V-data block to assist the main controller circuit 313 to multiplex the packets for transmission at his level, and to assist the remote site in recognizing and de-multiplexing the data packets, a V-data block is defined which includes a maximum of five V-data packets. The V-data block size and the maximum number of blocks are defined as follows:
The V-data block header=80h;
The V-data block size=23;
The maximum V-data block size=5;
The V-data block has higher priority to be transmitted than C-data to ensure the integrity of the real-time voice transmission. Therefore, the main controller circuit 313 will check the V-data buffer first to determine whether it will transmit V-data or C-data blocks. If V-data buffer has V-data of more than 69 bytes, a transmit block counter is set to 5 and the main controller circuit 313 starts to transmit V-data from the V-data buffer through the data pump circuit 311 onto the telephone line. Since the transmit block counter indicates 5 blocks of V-data will be transmitted in a continuous stream, the transmission will stop either at finish the 115 bytes of V-data or if the V-data buffer is empty. If V-data buffer has V-data with number more than 23 bytes, the transmit block counter is set 1 and starts transmit V-data. This means that the main controller circuit will only transmit one block of V-data. If the V-data buffer has V-data with less than 23 bytes, the main controller circuit services the transmission of C-data.
During the transmission of a C-data block, the V-data buffer condition is checked before transmitting the first C-data byte. If the V-data buffer contains more than one V-data packet, the current transmission of the C-data block will be terminated in order to handle the V-data.
On the receiving end of the telephone line, the main controller circuit 313 operates at the multiplex control level to de-multiplex received data to V-data and C-data. The type of block can be identified by checking the first byte of the incoming data blocks. Before receiving a block of V-data, the main controller circuit 313 will initialize a receive V-data byte counter, a backup pointer and a temporary V-data buffer pointer. The value of the receiver V-data byte counter is 23, the value of the receive block counter is 0 and the backup pointer is set to the same value as the V-data receive buffer pointer. If the received byte is not equal to 80 hex (80h indicating a V-data packet), the receive operation will follow the current modem protocol since the data block must contain C-data. If the received byte is equal to 80h, the main controller circuit 313 operating in receive mode will process the V-data.
For a V-data block received, when a byte of V-data is received, the byte of V-data is put into the V-data receive buffer, the temporary buffer pointer is increased by 1 and the receive V-data counter is decreased by 1. If the V-data counter is down to zero, the value of the temporary V-data buffer pointer is copied into the backup pointer buffer. The value of the total V-data counter is added with 23 and the receive V-data counter is reset to 23. The value of the receive block counter is increased by 1. A flag to request service of V-data is then set. If the receive block counter has reached 5, the main controller circuit 313 will not put the incoming V-data into the V-data receive buffer but throw it away. If the total V-data counter has reached its maximum value, the receiver will not put the incoming V-data into the V-data receive buffer but throw it away.
At the end of the block which is indicated by receipt of the CRC check bytes, the main controller circuit 313 operating in the multiplex control level will not check the result of the CRC but instead will check the value of the receive V-data counter. If the value is zero, the check is finished, otherwise the value of the backup pointer is copied back into the current V-data buffer pointer. By this method, the receiver is insured to de-multiplex the V-data from the receiving channel 23 bytes at a time. The main controller circuit 313 operating at the service level in the receive mode will monitor the flag of request service of V-data. If the flag is set, the main controller circuit 313 will get the V-data from the V-data buffer and transmit it to the voice control DSP circuit 306 at a rate of 23 bytes at a time. After sending a block of V-data, it decreases 23 from the value in the total V-data counter.
The modem hardware component 20 incorporates a modified packet protocol for negotiation of the speech compression rate. A modified supervisory packet is formatted using the same open flag, address, CRC, and closing flag formatting bytes which are found in the CCITT V.42 standard data supervisory packet, as is well known in the industry and as is described in the CCITT Blue Book, volume VIII entitled Data Communication over the Telephone Network, 1989 referenced above. In the modified packet protocol embodiment, the set of CCITT standard header bytes (control words) has been extended to include nonstandard control words used to signal transmission of a nonstandard communication command. The use of a nonstandard control word should cause no problems with other data communication terminals, for example, when communicating with a non-PCS modem system, since the nonstandard packet will be ignored by a non-PCS system.
Table 21 offers one embodiment of the present invention showing a modified supervisory packet structure. It should be noted that Table 21 does not depict the CCITT standard formatting bytes: open flag, address, CRC, and closing flag, but such bytes are inherent to using the CCITT standard. The modified supervisory packet is distinguished from a V.42 standard packet by using a nonstandard control word, such as 80 hex, as the header.
The modified supervisory packet is transmitted by the HDLC protocol in which data is transmitted in synchronous mode and checked by CRC error checking. The use of a modified supervisory packet eliminates the need for an escape command sent over the telephone line to interrupt data communications, providing an independent channel for negotiation of the compression rate. The channel may also be used as an alternative means for programming standard communications parameters.
The modified supervisory packet is encoded with different function codes to provide an independent communications channel between hardware components. This provides a means for real time negotiation and programming of the voice compression rate throughout the transmission of voice data and conventional data without the need for conventional escape routines. The modified supervisory packet is encoded with a function code using several methods. For example, in one embodiment, the function code is embedded in the packet as one of the data words and is located in a predetermined position. In an alternate embodiment, the supervisory packet header itself serves to indicate not only that the packet is a nonstandard supervisory packet but also the compression rate to be used between the sites. In such an embodiment, for example, a different nonreserved header is assigned to each function code. These embodiments are not limiting and other methods known to those skilled in the art may be employed to encode the function code into the modified supervisory packet.
Referring once again to
Alternatively, as stated above, the function code could be stored in a predetermined position of one of the packet data bytes. It should be apparent that other function code encoding methods could be used. Again, these methods are given only for illustrative purposes and not limiting.
In either case, the receiving PCS modem 20A will recognize the speech compression command and will respond with an acknowledge packet using, for instance, a header byte such as hex 81. The acknowledge packet will alert the calling modem 20 that the speech compression algorithm and speech compression ratio selected are available by use of the ACK field of the supervisory packet shown in Table 22. Receipt of the acknowledge supervisory packet will cause the calling modem 20 to transmit all voice over data information according to the selected speech compression algorithm and compression ratio.
The frequency of which the speech compression command supervisory packet is transmitted will vary with the application. For moderate quality voice over data applications, the speech compression algorithm need only be negotiated at the initialization of the phone call. For applications requiring more fidelity, the speech compression command supervisory packet may be renegotiated during the call to accommodate new parties to the communication which have different speech compression algorithm limitations or to actively tune the speech compression ratio as the quality of the communications link fluctuates.
Therefore, those skilled in the art will recognize that other applications of the speech compression command supervisory packet may be employed which allow for varying transmission rates of the speech compression command supervisory packet and different and more elegant methods of speech compression algorithm and compression ratio negotiation, depending on the available hardware and particular application. Additionally, a number of encoding methods can be used to encode the supervisory packet speech compression algorithm and the speech compression ratio, and this method was demonstrated solely for illustrative purposes and is not limiting.
Of course a new supervisory packet may be allocated for use as a means for negotiating multiplexing scheme for the various types of information sent over the communications link. For example, if voice over data mode is employed, there exist several methods for multiplexing the voice and digital data. The multiplexing scheme may be selected by using a modified supervisory packet, called a multiplex supervisory packet, to negotiate the selection of multiplexing scheme.
Similarly, another supervisory packet could be designated for remote control of another hardware device. For example, to control the baud rate or data format of a remote modem, a remote control supervisory packet could be encoded with the necessary selection parameters needed to program the remote device.
Those skilled in the art will readily appreciate that there exist numerous other unidirectional and bidirectional communication and control applications in which the supervisory packet may be used. The examples given are not limiting, but are specific embodiments of the present invention offered for illustrative purposes.
Ring detector 1710 signals processor 1770 on signal line 1772 when an incoming call is received on telephone lines 1702 and 1704. Processor 1770 signals caller ID relays 1740 on signal line 1774 to decode the caller ID information as transmitted by the telephone company between the first and second telephone rings. Caller ID relays 1740 route signals on telephone lines 1702 and 1704 to caller ID decoder 1750 via isolation device 1782 when signal 1774 is pulled to a logic “0” state. When signal 1774 is logic low, transistor 1745 conducts and normally open optoisolated relays 1742 and 1743 close briefly while normally closed optoisolated relay 1744 opens. The switching period only needs to be long enough to receive the frequency shift keying caller ID transmissions between the first and second telephone rings. Rectifier 1794 ensures that the telephone line polarity to the dc holding circuit 1730 is consistent regardless of the polarity of the telephone service connections to lines 1702 and 1704.
An access matrix is preprogrammed into the interface memory 1780 which specifies the parameters associated with an authorized caller (Further details on the access matrix and screening modes are discussed below.) If the incoming caller ID information and the access matrix parameters indicate that the caller is authorized, then processor 1770 answers the telephone call by asserting a logic “0” on line 1776 and engaging the telephone current loop using signal 1777 to activate DC holding circuit 1730. When these circuits are activated caller ID relays 1740 are programmed to pass telephone signals 1732 and 1734 through caller ID decoder 1750 to personal communications system electronics 1760 for demodulation and data processing.
If the caller is not authorized access, the caller ID interface 1650 can hang up on the caller by momentarily taking the personal communications system off-hook and returning to on-hook by toggling signal line 1776. In this way, the caller ID interface can hang up on an unwanted caller without providing access to the caller.
Referring now to
ring detector 1710 is optical isolator U32 (CNY17) and zener diodes CR1 and CR2 of
caller ID relays 1742, 1743, and 1744 are relays U30, U31, (of
caller ID decoder 1750 is chip set U34, U35, and U37 of
dc holding circuit 1730 is CR9, R73, C71, CR20, CR26, R74, R75, R76, and transistors Q2 and Q3;
off hook circuit 1720 is optoisolated relay U29, transistor Q4, resistor R15, and resistor R69 of
processor 1770 is main controller 313, which is a Zilog Z80180 microprocessor, part number Z84C01 by Zilog, Inc. of Campbell, Calif.; and
memory 1780 is the combination of RAM 316 and PEPROM 317. Isolation device 1782 electrically isolates the caller ID interface from the PCS electronics 1760. Isolation device 1782 is typically a transformer, however, alternate embodiments employ and optocoupler device. The detailed operation of this circuitry is discussed above in the section entitled: “Detailed Electrical Schematic Diagrams”.
An alternative embodiment of the caller ID interface 1652 is described in
In yet another embodiment, caller ID decoder 1750 is the Mitel MT8841 Calling Number Identification Circuit as specified in the Mitel Microelectronics Digital/Analog Communications Handbook, Doc. No. 9161-952-007-NA, issue 9 (1993), which is hereby incorporated by reference. Processor 1770 is the Zilog Z182 Microprocessor as specified in the Z180 Family Microprocessors and Peripherals Databook, Doc No. Q2/94 DC 8322-00, which is hereby incorporated by reference.
Those skilled in the art will readily recognize that other caller ID decoders and processors may be used without departing from the scope and spirit of the present invention. Alternate embodiments use sophisticated, multifunction decoding devices and data pumps to perform the functions of caller ID decoder 1750. Additionally, processor 1770 may be replaced with combinational logic to control the operation of the caller ID interface. Finally, alternate relay switching embodiments may be constructed which do not depart from the scope and spirit of the present invention.
In standard telephone caller ID systems the caller ID information is transmitted between the first and second telephone ring. The caller ID information includes a message-type byte, a length byte, and data bytes consisting of date, time, telephone number with area code, telephone owner's name, and check sum byte and is sent using frequency shift keying between the first and second ring. Several industry protocols for caller ID are being developed by telecommunications vendors, including:
Those skilled in the art would readily recognize that this method could be modified for accommodating future caller ID message protocols without departing from the scope and spirit of the present invention, and that the protocols presented were not intended in an exclusive or limiting sense.
In one embodiment of the present invention the quick hang feature allows the personal communications system to hang up immediately on an unwanted caller by placing the personal communications system off hook for a duration of one second (using off-hook circuit 1720), and then place the personal communications system back “on hook” again. The personal communications system is then ready to accept another call. This feature minimizes the amount of time an invalid user can tie up a phone line. Other durations are possible without departing from the spirit and scope of the present invention.
In one embodiment of the present invention time synchronization can be accomplished by using the decoded caller ID information which identifies the time of day to synchronize an on-board time-of-day clock.
The information available from decoding caller ID information allows the caller ID interface to screen users by a variety of parameters as specified in a preprogrammed access matrix. The flowchart shown in
The caller ID interface then detects a ring 2004, decodes the caller ID information 2006, and compares the caller ID information with the access matrix (a function of the screening mode, as described below) 2008, and determines whether the caller is authorized to access the personal communications system 2010. If the caller is not authorized an exit routine is performed 2020 which may be a number of operations including, but not limited to, a friendly error message and a quick hang up 2022. If the personal communications system is compiling a database of callers, the database can be updated with the received caller ID information 2024 before waiting for another call 2004. If the caller is authorized, access is enabled 2014 and allowed until the call is terminated 2016. The hang up procedure 2022 is followed by an database update 2024 before returning to the wait state for another call 2004. The step of determining whether access is authorized 2010 is discussed in detail in the below section on Screening Modes.
The following modes are used in one embodiment of the present invention to control access to a personal communications system connected to the caller ID interface. The parameters of each mode become part of the preprogrammed access matrix. A number of examples will be offered following a brief description of the various modes of this embodiment:
Number Only Mode
In the number only mode, the personal communications system compares an incoming caller ID number to phone numbers on a “number only” list. Only incoming calls with numbers matching the phone numbers on the list will be answered. The number list is part of the access matrix which is preprogrammed into the caller ID interface memory.
Blacklist Mode
In the blacklist mode, the personal communications system compares an incoming caller ID number to a list of callers on a “blacklist.” Any call which matches a phone number on the “blacklist” will be denied access to the device and the incoming call will be terminated immediately using a preprogrammed exit routine, such as the “quick-hang” feature described above. The blacklist and desired exit routine can be tailored depending on the particular blacklisted caller. For example, a BBS might want to quick hang up on a blacklisted abuser of the bulletin board, but only give a “late dues” message to a blacklisted user who is merely late in paying dues. The access matrix contains all of the blacklist parameters.
Day Only Mode
In the day only mode, the access matrix is programmed to authorize calls only on specific days.
Time Only Mode
In the time only mode, the personal communications system only answers calls during a certain preprogrammed times of the day and ignores calls outside of those specified times. For example, this feature enhances the security to a computer network provided by the present invention during non-business hours.
Name Only Mode
The name only mode authorizes access only to callers whose names are preprogrammed in a name table in the access matrix. This is a means for inclusively authorizing access to the personal communications system. (The blacklist mode is an exclusive means for authorizing access to the personal communications system.)
S Register 50 Mode
The S Register 50 mode provides a limited number of accesses by a particular user. The access matrix is preprogrammed with a predetermined number of calls allowed to a user before that user is black listed. This feature is especially useful for electronic bulletin board service operators because it allows them to screen out unwanted users as soon as the S Register number is reached. The S Register mode also allows for limiting the number of accesses made by a new user of the bulletin board, since in one embodiment of the present invention a new user can be assigned a position in the access matrix and subject to a maximum number of accesses, similar to the known users. This is known as a Temporary Blacklist mode, since after the predetermined number of accesses, the user is temporarily blacklisted until the access counter for that user is reset by the system administrator.
Hybrid Modes
Any combination of the above modes provides a specialized access matrix based on each listed user. For example, access authority can be given to Mr. X at only 6:00 to 7:00 p.m. by programming Mr. X's name and the access times as illustrated in the examples below.
Several access matrix examples for a BBS and their associated interpretations are described below for each entry in the table, according to one embodiment of the present invention.
Table 23 shows two examples of the blacklist mode. Any caller from 333-3333 will receive a quick hang immediately on attempt to access the BBS personal communications system. Additionally, any time Mr. J attempts to call (from any of his phones), the message “Illegal Access” will be displayed prior to hang up by the BBS.
Table 24 shows that only Mr. and Ms. B can access the BBS personal communications system, regardless of telephone number or day.
Table 25 shows that only callers from 123-4567 and 676-8888 can access the BBS personal communications system, regardless of name or time of day.
Table 26 shows that any caller between 9:00 a.m. and 5:00 p.m. can access the BBS personal communications system (24 hour time format used in this example).
Table 27 provides four examples of access matrix entries. In the first line, Mr A. can access the BBS personal communications system from Monday to Wednesday and at the times of 6:00 a.m. to 1:00 p.m. and 2:00 p.m. to 3:00 p.m. Mr. A can only access the BBS personal communications system five (5) times before access is denied and the system administrator is notified. Mr. A will get a quick hang up on his sixth attempt to access the BBS personal communications system, and attempts thereafter, until his access register is reset by the system administrator.
Ms. B can access the BBS personal communications system all days of the week, but only between the hours of 9:00 a.m. to 5:00 p.m. Ms. B can access the BBS personal communications system an unlimited number of times.
Any caller from phone number 555-5555 can access the BBS personal communications system from Monday to Friday between the hours of 9:00 a.m. to 5:00 p.m. A “Pay Dues” message will be displayed to the user before a hang up on the eleventh attempt to access the BBS personal communications system, and subsequent attempted accesses. The system administrator must reset the access counter for future access authorization.
Mr. C can access the BBS personal communications system from any of his phone numbers, and can access at any time on Monday through Wednesday. After three accesses, Mr. C's exit routine will be whatever the default exit routine for the BBS happens to be.
The described screening modes are not limiting and not exclusive. One skilled in the art would readily recognize that other modes and variations of these modes are possible without departing from the scope and spirit of the present invention.
The previously described screening modes are not exclusive or limiting to the present invention. Neither is the particular interaction of the screening modes. The following is only one embodiment of a screening algorithm offered to demonstrate the interaction between screening modes in one embodiment of the present invention.
The present invention was described in terms of a personal communications system interface, however, the methods and apparatus are applicable to a number of data exchange devices. For example, the present invention could be adapted to any system with caller identification information, including, but not limited to applications in the fiber superhighway and similar applications.
Although specific embodiments have been illustrated and described herein, it will be appreciated by those of ordinary skill in the art that any arrangement which is calculated to achieve the same purpose may be substituted for the specific embodiment shown. This application is intended to cover any adaptations or variations of the present invention. Therefore, it is manifestly intended that this invention be limited only by the claims and equivalents thereof.
This patent application is a continuation of U.S. Ser. No. 09/400,607 filed on Sept. 20, 1999, which is a continuation of U.S. application Ser. No. 08/338,340 filed Nov. 10, 1994, now U.S. Pat. No. 6,009,082, which is a Continuation-in-part of U.S. application Ser. No. 08/002,467, filed Jan. 8, 1993 entitled “COMPUTER-BASED MULTIFUNCTION PERSONAL COMMUNICATIONS SYSTEM”, now U.S. Pat. No. 5,452,289, the complete applications of which, including any microfiche appendix, are all hereby incorporated by reference.
| Number | Name | Date | Kind |
|---|---|---|---|
| 3304372 | Filipowsky et al. | Feb 1967 | A |
| 3789165 | Campanella et al. | Jan 1974 | A |
| 3904830 | Every, Sr. et al. | Sep 1975 | A |
| 3973081 | Hutchins | Aug 1976 | A |
| 3973089 | Puckette | Aug 1976 | A |
| 3997732 | Every, Sr. et al. | Dec 1976 | A |
| 4040014 | Gehrking | Aug 1977 | A |
| 4045774 | Morrison | Aug 1977 | A |
| 4059731 | Green et al. | Nov 1977 | A |
| 4059800 | Jones, Jr. | Nov 1977 | A |
| 4074081 | Humm | Feb 1978 | A |
| 4100377 | Flanagan | Jul 1978 | A |
| 4107471 | Reed | Aug 1978 | A |
| 4124773 | Elkins | Nov 1978 | A |
| 4178480 | Carbrey | Dec 1979 | A |
| 4205201 | Kahn | May 1980 | A |
| 4205202 | Kahn | May 1980 | A |
| 4216354 | Esteban et al. | Aug 1980 | A |
| 4284850 | Chingelpeel | Aug 1981 | A |
| 4310721 | Manley et al. | Jan 1982 | A |
| 4320265 | Biggiogera et al. | Mar 1982 | A |
| 4354273 | Araseki et al. | Oct 1982 | A |
| 4363122 | Black et al. | Dec 1982 | A |
| 4377860 | Godbole | Mar 1983 | A |
| 4403322 | Kato | Sep 1983 | A |
| 4425512 | Tomooka et al. | Jan 1984 | A |
| 4425625 | Seligman et al. | Jan 1984 | A |
| 4425661 | Moses et al. | Jan 1984 | A |
| 4445213 | Baugh et al. | Apr 1984 | A |
| 4447675 | Arntsen et al. | May 1984 | A |
| 4450554 | Steensma et al. | May 1984 | A |
| 4455649 | Esteban et al. | Jun 1984 | A |
| 4476559 | Brolin et al. | Oct 1984 | A |
| 4479195 | Herr et al. | Oct 1984 | A |
| 4479213 | Galand et al. | Oct 1984 | A |
| 4491945 | Turner | Jan 1985 | A |
| 4494230 | Turner | Jan 1985 | A |
| 4495620 | Steele et al. | Jan 1985 | A |
| 4500987 | Hasegawa | Feb 1985 | A |
| 4503288 | Kessler | Mar 1985 | A |
| 4503533 | Tobagi et al. | Mar 1985 | A |
| 4523055 | Hohl et al. | Jun 1985 | A |
| 4524244 | Faggin et al. | Jun 1985 | A |
| 4528425 | Melindo et al. | Jul 1985 | A |
| 4528659 | Jones, Jr. | Jul 1985 | A |
| 4531023 | Levine | Jul 1985 | A |
| 4532495 | Gagnon | Jul 1985 | A |
| 4533948 | McNamara et al. | Aug 1985 | A |
| 4534024 | Maxemchuk et al. | Aug 1985 | A |
| 4535448 | Baxter et al. | Aug 1985 | A |
| 4546212 | Crowder, Sr. | Oct 1985 | A |
| 4549290 | Bell | Oct 1985 | A |
| 4549308 | LoPinto | Oct 1985 | A |
| 4555599 | Hackett-Jones et al. | Nov 1985 | A |
| 4555805 | Talbot | Nov 1985 | A |
| 4578537 | Faggin et al. | Mar 1986 | A |
| 4581735 | Flamm et al. | Apr 1986 | A |
| 4587651 | Nelson et al. | May 1986 | A |
| 4589107 | Middleton et al. | May 1986 | A |
| 4593389 | Wurzburg et al. | Jun 1986 | A |
| 4597101 | Kishimoto et al. | Jun 1986 | A |
| 4598397 | Nelson et al. | Jul 1986 | A |
| 4609788 | Miller et al. | Sep 1986 | A |
| 4610022 | Kitayama et al. | Sep 1986 | A |
| 4611323 | Hessenmiller | Sep 1986 | A |
| 4611342 | Miller et al. | Sep 1986 | A |
| 4622680 | Zinser | Nov 1986 | A |
| 4625081 | Lotito et al. | Nov 1986 | A |
| 4629829 | Puhl et al. | Dec 1986 | A |
| 4630262 | Callens et al. | Dec 1986 | A |
| 4631746 | Bergeron et al. | Dec 1986 | A |
| 4644561 | Paneth et al. | Feb 1987 | A |
| 4652703 | Lu et al. | Mar 1987 | A |
| 4653086 | Laube | Mar 1987 | A |
| 4660194 | Larson et al. | Apr 1987 | A |
| 4660218 | Hashimoto | Apr 1987 | A |
| 4665514 | Ching et al. | May 1987 | A |
| 4670874 | Sato et al. | Jun 1987 | A |
| 4679190 | Dias et al. | Jul 1987 | A |
| 4697281 | O'Sullivan | Sep 1987 | A |
| 4698803 | Haselton et al. | Oct 1987 | A |
| 4700341 | Huang | Oct 1987 | A |
| 4707831 | Weir et al. | Nov 1987 | A |
| 4716585 | Tompkins et al. | Dec 1987 | A |
| 4718057 | Venkitakrishnan et al. | Jan 1988 | A |
| 4718082 | Parker et al. | Jan 1988 | A |
| 4723238 | Isreal et al. | Feb 1988 | A |
| 4725977 | Izumi et al. | Feb 1988 | A |
| 4730311 | Carse et al. | Mar 1988 | A |
| 4740963 | Eckley | Apr 1988 | A |
| 4750169 | Carse et al. | Jun 1988 | A |
| 4751510 | Desaint Michel et al. | Jun 1988 | A |
| 4751736 | Gupta et al. | Jun 1988 | A |
| 4757497 | Beierle et al. | Jul 1988 | A |
| 4757527 | Beniston et al. | Jul 1988 | A |
| 4761646 | Choquet et al. | Aug 1988 | A |
| 4764955 | Galand et al. | Aug 1988 | A |
| 4769833 | Farleigh et al. | Sep 1988 | A |
| 4771425 | Baran et al. | Sep 1988 | A |
| 4782485 | Gollub | Nov 1988 | A |
| 4782515 | Phillips, et al. | Nov 1988 | A |
| 4785472 | Shapiro | Nov 1988 | A |
| 4792945 | Mark | Dec 1988 | A |
| 4794595 | Ohyama | Dec 1988 | A |
| 4797878 | Armstrong | Jan 1989 | A |
| 4802221 | Jibbe | Jan 1989 | A |
| 4807250 | Tanaka | Feb 1989 | A |
| 4809271 | Kondo et al. | Feb 1989 | A |
| 4813040 | Futato | Mar 1989 | A |
| 4817089 | Paneth et al. | Mar 1989 | A |
| 4819228 | Baran et al. | Apr 1989 | A |
| 4821312 | Horton et al. | Apr 1989 | A |
| 4827085 | Yaniv et al. | May 1989 | A |
| 4833673 | Chao et al. | May 1989 | A |
| 4835765 | Bergmans et al. | May 1989 | A |
| 4839802 | Wonak et al. | Jun 1989 | A |
| 4839906 | Leveque et al. | Jun 1989 | A |
| 4845746 | Li | Jul 1989 | A |
| 4847677 | Music et al. | Jul 1989 | A |
| 4847829 | Tompkins et al. | Jul 1989 | A |
| 4847900 | Wakim | Jul 1989 | A |
| 4862449 | Hoefkens et al. | Aug 1989 | A |
| 4864559 | Perlman | Sep 1989 | A |
| 4866704 | Bergman | Sep 1989 | A |
| 4866732 | Carey et al. | Sep 1989 | A |
| 4872160 | Hemmady et al. | Oct 1989 | A |
| 4873715 | Shibata | Oct 1989 | A |
| 4887265 | Felix | Dec 1989 | A |
| 4890282 | Lambert et al. | Dec 1989 | A |
| 4890316 | Walsh et al. | Dec 1989 | A |
| 4890326 | Euler | Dec 1989 | A |
| 4890327 | Bertrand et al. | Dec 1989 | A |
| 4891806 | Farias et al. | Jan 1990 | A |
| 4893308 | Wilson et al. | Jan 1990 | A |
| 4893326 | Duran et al. | Jan 1990 | A |
| 4893339 | Bright et al. | Jan 1990 | A |
| 4901333 | Hodgkiss | Feb 1990 | A |
| 4903261 | Baran et al. | Feb 1990 | A |
| 4905231 | Leung et al. | Feb 1990 | A |
| 4905282 | Mcglynn et al. | Feb 1990 | A |
| 4907277 | Callens et al. | Mar 1990 | A |
| 4912705 | Paneth et al. | Mar 1990 | A |
| 4912745 | Fitzpatrick et al. | Mar 1990 | A |
| 4912756 | Hop | Mar 1990 | A |
| 4912758 | Arbel | Mar 1990 | A |
| 4914586 | Swinehart et al. | Apr 1990 | A |
| 4914650 | Sriram | Apr 1990 | A |
| 4926448 | Kraul et al. | May 1990 | A |
| 4926482 | Frost et al. | May 1990 | A |
| 4932022 | Keeney et al. | Jun 1990 | A |
| 4932048 | Kenmochi et al. | Jun 1990 | A |
| 4935927 | Kaewell, Jr. et al. | Jun 1990 | A |
| 4935954 | Thompson et al. | Jun 1990 | A |
| 4942569 | Maeno | Jul 1990 | A |
| 4953210 | Mcglynn et al. | Aug 1990 | A |
| 4965789 | Bottau et al. | Oct 1990 | A |
| 4972457 | O'Sullivan | Nov 1990 | A |
| 4972462 | Shibata | Nov 1990 | A |
| 4972483 | Carey | Nov 1990 | A |
| 4974099 | Lin et al. | Nov 1990 | A |
| 4977591 | Chen et al. | Dec 1990 | A |
| 4981371 | Gurak et al. | Jan 1991 | A |
| 4985891 | Fujiwara et al. | Jan 1991 | A |
| 4989203 | Phinney | Jan 1991 | A |
| 4991169 | Davis et al. | Feb 1991 | A |
| 4991172 | Cidon et al. | Feb 1991 | A |
| 4991197 | Morris | Feb 1991 | A |
| 4994802 | Critchlow et al. | Feb 1991 | A |
| 4995059 | Ishikawa | Feb 1991 | A |
| 4996697 | Critchlow et al. | Feb 1991 | A |
| 4998241 | Brox et al. | Mar 1991 | A |
| 4998248 | Matsuzaki | Mar 1991 | A |
| 5001710 | Gawrys et al. | Mar 1991 | A |
| 5001729 | Tjahjadi et al. | Mar 1991 | A |
| 5001745 | Pollock | Mar 1991 | A |
| 5005183 | Carey et al. | Apr 1991 | A |
| 5007050 | Kasparian et al. | Apr 1991 | A |
| 5008901 | Wallach et al. | Apr 1991 | A |
| 5008926 | Misholi | Apr 1991 | A |
| 5014232 | Andre | May 1991 | A |
| 5014267 | Tompkins et al. | May 1991 | A |
| 5014306 | Rodgers et al. | May 1991 | A |
| 5020058 | Holden et al. | May 1991 | A |
| 5022024 | Paneth et al. | Jun 1991 | A |
| 5023903 | Bowen | Jun 1991 | A |
| 5025443 | Gupta | Jun 1991 | A |
| 5034962 | Yamamoto et al. | Jul 1991 | A |
| 5036513 | Greenblatt | Jul 1991 | A |
| 5042028 | Ogawa | Aug 1991 | A |
| 5044010 | Frenkiel et al. | Aug 1991 | A |
| 5046188 | Molnar | Sep 1991 | A |
| 5051720 | Kittirutsunetorn | Sep 1991 | A |
| 5054055 | Hanle et al. | Oct 1991 | A |
| 5062133 | Melrose | Oct 1991 | A |
| 5065395 | Shenoi et al. | Nov 1991 | A |
| 5065425 | Lecomte et al. | Nov 1991 | A |
| 5065427 | Godbole | Nov 1991 | A |
| 5070526 | Richmond et al. | Dec 1991 | A |
| 5072308 | Lin et al. | Dec 1991 | A |
| 5073926 | Suzuki et al. | Dec 1991 | A |
| 5079769 | Ehricke et al. | Jan 1992 | A |
| 5081647 | Bremer | Jan 1992 | A |
| 5083310 | Drory | Jan 1992 | A |
| 5086425 | Le Goffic et al. | Feb 1992 | A |
| 5086471 | Tanaka et al. | Feb 1992 | A |
| 5099472 | Townsend et al. | Mar 1992 | A |
| 5107519 | Ishikawa | Apr 1992 | A |
| 5115429 | Hluchyj et al. | May 1992 | A |
| 5119375 | Paneth et al. | Jun 1992 | A |
| 5121385 | Tominaga et al. | Jun 1992 | A |
| 5121391 | Paneth et al. | Jun 1992 | A |
| 5127001 | Steagall et al. | Jun 1992 | A |
| 5127041 | O'Sullivan | Jun 1992 | A |
| 5130985 | Kondo et al. | Jul 1992 | A |
| 5132966 | Hayano et al. | Jul 1992 | A |
| RE34034 | O'Sullivan | Aug 1992 | E |
| 5136586 | Greenblatt | Aug 1992 | A |
| 5138662 | Amano et al. | Aug 1992 | A |
| 5146470 | Fujii et al. | Sep 1992 | A |
| 5148429 | Kudo et al. | Sep 1992 | A |
| 5150357 | Hopner et al. | Sep 1992 | A |
| 5150410 | Bertrand | Sep 1992 | A |
| 5151937 | Chujo et al. | Sep 1992 | A |
| 5153897 | Sumiyoshi et al. | Oct 1992 | A |
| 5155726 | Spinney et al. | Oct 1992 | A |
| 5155847 | Kirouac et al. | Oct 1992 | A |
| 5162812 | Aman et al. | Nov 1992 | A |
| 5164982 | Davis | Nov 1992 | A |
| 5170427 | Guichard et al. | Dec 1992 | A |
| 5177734 | Cummiskey et al. | Jan 1993 | A |
| 5179588 | Nowicki | Jan 1993 | A |
| 5182762 | Shirai et al. | Jan 1993 | A |
| 5187591 | Guy et al. | Feb 1993 | A |
| 5187692 | Haneda et al. | Feb 1993 | A |
| 5193110 | Jones et al. | Mar 1993 | A |
| 5195086 | Baumgartner et al. | Mar 1993 | A |
| 5195130 | Weiss et al. | Mar 1993 | A |
| 5206900 | Callele | Apr 1993 | A |
| 5208812 | Dudek et al. | May 1993 | A |
| 5208850 | Kino | May 1993 | A |
| 5214650 | Renner et al. | May 1993 | A |
| 5214656 | Chung et al. | May 1993 | A |
| 5228026 | Albrow et al. | Jul 1993 | A |
| 5228033 | Okouchi | Jul 1993 | A |
| 5228076 | Hopner et al. | Jul 1993 | A |
| 5233660 | Chen | Aug 1993 | A |
| 5235595 | O'Dowd | Aug 1993 | A |
| 5247591 | Baran | Sep 1993 | A |
| 5249218 | Sainton | Sep 1993 | A |
| 5257410 | Meszko et al. | Oct 1993 | A |
| 5258983 | Lane et al. | Nov 1993 | A |
| 5260783 | Dixit | Nov 1993 | A |
| 5261027 | Taniguchi et al. | Nov 1993 | A |
| 5263019 | Chu | Nov 1993 | A |
| 5272695 | Makino et al. | Dec 1993 | A |
| 5272700 | Hansen et al. | Dec 1993 | A |
| 5276703 | Budin et al. | Jan 1994 | A |
| 5278900 | Van Gerwen et al. | Jan 1994 | A |
| 5280519 | Nakajima et al. | Jan 1994 | A |
| 5282197 | Kreitzer | Jan 1994 | A |
| 5283638 | Engberg et al. | Feb 1994 | A |
| 5283819 | Glick et al. | Feb 1994 | A |
| 5289539 | Maruyama | Feb 1994 | A |
| 5295136 | Ashley et al. | Mar 1994 | A |
| 5297203 | Rose et al. | Mar 1994 | A |
| 5301246 | Archibald et al. | Apr 1994 | A |
| 5303236 | Kunimoto et al. | Apr 1994 | A |
| 5305312 | Fornek et al. | Apr 1994 | A |
| 5307413 | Denzer | Apr 1994 | A |
| 5309434 | Maekawa | May 1994 | A |
| 5309562 | Li | May 1994 | A |
| 5313498 | Sano | May 1994 | A |
| 5317604 | Osterweil | May 1994 | A |
| 5319682 | Clark | Jun 1994 | A |
| 5327520 | Chen | Jul 1994 | A |
| 5329472 | Sugiyama | Jul 1994 | A |
| 5341374 | Lewen et al. | Aug 1994 | A |
| 5343473 | Cidon et al. | Aug 1994 | A |
| 5343521 | Jullien et al. | Aug 1994 | A |
| 5347572 | Avni | Sep 1994 | A |
| 5355365 | Bhat et al. | Oct 1994 | A |
| 5355406 | Chencinski et al. | Oct 1994 | A |
| 5365576 | Tsumura et al. | Nov 1994 | A |
| 5365577 | Davis et al. | Nov 1994 | A |
| 5369700 | Koura et al. | Nov 1994 | A |
| 5371853 | Kao et al. | Dec 1994 | A |
| 5375068 | Palmer et al. | Dec 1994 | A |
| 5377260 | Long | Dec 1994 | A |
| 5379340 | Overend et al. | Jan 1995 | A |
| 5381412 | Otani | Jan 1995 | A |
| 5384780 | Lomp et al. | Jan 1995 | A |
| H1413 | Gunn | Feb 1995 | H |
| 5388150 | Schneyer et al. | Feb 1995 | A |
| 5390239 | Morris et al. | Feb 1995 | A |
| 5390250 | Janse et al. | Feb 1995 | A |
| 5402474 | Miller et al. | Mar 1995 | A |
| 5406557 | Baudoin | Apr 1995 | A |
| 5406560 | Kondo et al. | Apr 1995 | A |
| 5408401 | Miyazaki | Apr 1995 | A |
| 5408522 | Ikehata et al. | Apr 1995 | A |
| 5408527 | Tsutsu | Apr 1995 | A |
| 5414773 | Handelman | May 1995 | A |
| 5414796 | Jacobs et al. | May 1995 | A |
| 5416776 | Panzarella et al. | May 1995 | A |
| 5425089 | Chan et al. | Jun 1995 | A |
| 5426652 | Heiman | Jun 1995 | A |
| 5438536 | Salzman | Aug 1995 | A |
| 5438614 | Rozman et al. | Aug 1995 | A |
| 5440547 | Easki et al. | Aug 1995 | A |
| 5440619 | Cann | Aug 1995 | A |
| 5440698 | Sindhu et al. | Aug 1995 | A |
| 5444770 | Davis et al. | Aug 1995 | A |
| 5448555 | Bremer et al. | Sep 1995 | A |
| 5450425 | Gunn et al. | Sep 1995 | A |
| 5452289 | Sharma et al. | Sep 1995 | A |
| 5452329 | Sato | Sep 1995 | A |
| 5453986 | Davis et al. | Sep 1995 | A |
| 5463616 | Kruse et al. | Oct 1995 | A |
| RE35104 | Murakami et al. | Nov 1995 | E |
| 5465267 | Todoroki | Nov 1995 | A |
| 5471470 | Sharma et al. | Nov 1995 | A |
| 5472351 | Greco et al. | Dec 1995 | A |
| 5473676 | Frick et al. | Dec 1995 | A |
| 5477547 | Sugiyama | Dec 1995 | A |
| 5479407 | Ko et al. | Dec 1995 | A |
| 5479475 | Grob et al. | Dec 1995 | A |
| 5483576 | Staples | Jan 1996 | A |
| 5490060 | Malec et al. | Feb 1996 | A |
| 5493609 | Winseck, Jr. et al. | Feb 1996 | A |
| 5500859 | Sharma et al. | Mar 1996 | A |
| 5502727 | Catanzaro et al. | Mar 1996 | A |
| 5515398 | Walsh et al. | May 1996 | A |
| 5521975 | Hashimoto | May 1996 | A |
| 5524047 | Brown et al. | Jun 1996 | A |
| 5526423 | Ohuchi et al. | Jun 1996 | A |
| 5535204 | Li | Jul 1996 | A |
| 5541640 | Larson | Jul 1996 | A |
| 5546395 | Sharma et al. | Aug 1996 | A |
| 5546448 | Caswell et al. | Aug 1996 | A |
| 5550816 | Hardwick et al. | Aug 1996 | A |
| 5559793 | Maitra et al. | Sep 1996 | A |
| 5574725 | Sharma et al. | Nov 1996 | A |
| 5577041 | Sharma et al. | Nov 1996 | A |
| 5592586 | Maitra et al. | Jan 1997 | A |
| 5596628 | Klein | Jan 1997 | A |
| 5600649 | Sharma et al. | Feb 1997 | A |
| 5604737 | Iwami et al. | Feb 1997 | A |
| 5617423 | Li et al. | Apr 1997 | A |
| 5619508 | Davis et al. | Apr 1997 | A |
| 5628030 | Tuckner | May 1997 | A |
| 5631745 | Wong et al. | May 1997 | A |
| 5644629 | Chow | Jul 1997 | A |
| 5673257 | Sharma et al. | Sep 1997 | A |
| 5673268 | Sharma et al. | Sep 1997 | A |
| 5675640 | Tappert et al. | Oct 1997 | A |
| 5699410 | Imamura et al. | Dec 1997 | A |
| 5699417 | Khojasteh | Dec 1997 | A |
| 5699418 | Jones | Dec 1997 | A |
| 5717742 | Hyde-Thomson | Feb 1998 | A |
| 5745558 | Richardson, Jr. et al. | Apr 1998 | A |
| 5754589 | Maitra et al. | May 1998 | A |
| 5764627 | Sharma et al. | Jun 1998 | A |
| 5764628 | Davis et al. | Jun 1998 | A |
| 5790532 | Sharma et al. | Aug 1998 | A |
| 5812534 | Davis et al. | Sep 1998 | A |
| 5815503 | Li | Sep 1998 | A |
| 5821987 | Larson | Oct 1998 | A |
| 5864560 | Li et al. | Jan 1999 | A |
| 6009082 | Caswell et al. | Dec 1999 | A |
| 6012113 | Tuckner | Jan 2000 | A |
| 6181784 | Duran et al. | Jan 2001 | B1 |
| 6240085 | Iwami et al. | May 2001 | B1 |
| 20020075815 | Sharma et al. | Jun 2002 | A1 |
| 20030223461 | Sharma et al. | Dec 2003 | A1 |
| Number | Date | Country |
|---|---|---|
| 2104701 | Jul 1994 | CA |
| 3344140 | Jun 1984 | DE |
| 3426055 | Jan 1985 | DE |
| 3409532 | Sep 1985 | DE |
| 3504064 | Aug 1986 | DE |
| 3726366 | Feb 1988 | DE |
| 3630469 | Mar 1988 | DE |
| 3531173 | Mar 1989 | DE |
| 3490532 | Apr 1989 | DE |
| 0 309 993 | Apr 1989 | EP |
| 0 309 993 | Apr 1989 | EP |
| 0 364 866 | Jan 1990 | EP |
| 0 374 828 | Jun 1990 | EP |
| 0 429 054 | May 1991 | EP |
| 0 443 548 | Aug 1991 | EP |
| 0 453 128 | Oct 1991 | EP |
| 0 480 634 | Apr 1992 | EP |
| 0 488 685 | Jun 1992 | EP |
| 0 488 685 | Jun 1992 | EP |
| 0 488 685 | Jun 1992 | EP |
| 0 488 685 | Jun 1992 | EP |
| 0 496 427 | Jul 1992 | EP |
| 0 496 427 | Jul 1992 | EP |
| 0 510 411 | Oct 1992 | EP |
| 0 526 104 | Feb 1993 | EP |
| 0 581 528 | Feb 1994 | EP |
| 0 582 537 | Feb 1994 | EP |
| 0 614 305 | Sep 1994 | EP |
| 0 630 141 | Dec 1994 | EP |
| 0 650 286 | Apr 1995 | EP |
| 0 425 163 | May 1995 | EP |
| 2 025 735 | Jan 1980 | GB |
| 2 131 654 | Jun 1984 | GB |
| 2 173 070 | Oct 1986 | GB |
| 2 184 327 | Jun 1987 | GB |
| 2 195 866 | Apr 1988 | GB |
| 2 208 986 | Apr 1989 | GB |
| 2 210 237 | Jun 1989 | GB |
| 2 212 028 | Jul 1989 | GB |
| 2 227 625 | Aug 1990 | GB |
| 2 260 670 | Apr 1993 | GB |
| 2 268 663 | Jan 1994 | GB |
| 58-88961 | May 1983 | JP |
| 59-44140 | Mar 1984 | JP |
| 59-081947 | May 1984 | JP |
| 61077449 | Apr 1986 | JP |
| 62-61437 | Mar 1987 | JP |
| 62-77730 | Apr 1987 | JP |
| 62-221267 | Sep 1987 | JP |
| 63-019951 | Jan 1988 | JP |
| 63-48030 | Feb 1988 | JP |
| 63-54052 | Mar 1988 | JP |
| 63-64460 | Mar 1988 | JP |
| 63-105533 | May 1988 | JP |
| 63-155831 | Jun 1988 | JP |
| 63-169850 | Jul 1988 | JP |
| 64-16043 | Jan 1989 | JP |
| 64-18329 | Jan 1989 | JP |
| 01068052 | Mar 1989 | JP |
| 1-181344 | Jul 1989 | JP |
| 1-198144 | Aug 1989 | JP |
| 02034077 | Feb 1990 | JP |
| 2-67847 | Mar 1990 | JP |
| 2-107027 | Apr 1990 | JP |
| 2-145097 | Jun 1990 | JP |
| 193489 | Jul 1990 | JP |
| 257748 | Oct 1990 | JP |
| 03009643 | Jan 1991 | JP |
| 3-58582 | Mar 1991 | JP |
| 3-157027 | Jul 1991 | JP |
| 03153152 | Jul 1991 | JP |
| 03162052 | Jul 1991 | JP |
| 03237853 | Oct 1991 | JP |
| U 3-115458 | Nov 1991 | JP |
| 03280797 | Dec 1991 | JP |
| 4-35137 | Feb 1992 | JP |
| 04319847 | Nov 1992 | JP |
| 5-504687 | Jul 1993 | JP |
| 2790977 | Jul 1995 | JP |
| WO 8701254 | Feb 1987 | WO |
| WO 9105419 | Apr 1991 | WO |
| WO 9107044 | May 1991 | WO |
| WO 9115067 | Oct 1991 | WO |
| WO 9206550 | Apr 1992 | WO |
| WO 9220028 | Nov 1992 | WO |
| WO 9311643 | Jun 1993 | WO |
| WO 9322869 | Nov 1993 | WO |
| WO 9426056 | Nov 1994 | WO |
| WO 9615601 | May 1996 | WO |
| WO 9615612 | May 1996 | WO |
| Number | Date | Country | |
|---|---|---|---|
| 20060153176 A1 | Jul 2006 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 09400607 | Sep 1999 | US |
| Child | 11339256 | US | |
| Parent | 08338340 | Nov 1994 | US |
| Child | 09400607 | US |
| Number | Date | Country | |
|---|---|---|---|
| Parent | 08002467 | Jan 1993 | US |
| Child | 08338340 | US |
