US 6,515,984 B1Grant
Data/voice/fax compression multiplexer
Issue Date:2003-02-04
•24 Claims
•57 Drawing Sheets
Abstract
A data multiplexing network is described which multiplexes a plurality of asynchronous data channels with an asynchronous data stream representing compressed voice signals and/or facsimile signals onto a single synchronous data packet stream. The single synchronous data packet stream is then transmitted by a high speed statistical multiplexer over a composite link to a second site using a modified high-level synchronous data link control protocol with an overlay of a priority statistical multiplexing algorithm. The asynchronous data channels and the compressed voice channel and/or facsimile signals are demultiplexed and reconstructed for sending to other asynchronous computer terminals and to a standard telephone or facsimile analog port at the second site, respectively. PBX trunk interfaces are also provided to allow PBX's to share the composite link between sites. Communication between the first site by voice or facsimile and the second site is transparent to the users. The multiplexer efficiently allocated the bandwidth of the composite link by detecting silence periods in the voice signals and suppressing the sending of the voice information to preserve bandwidth.
The transmission of facsimile information is performed by decoding the fax transmissions, sending only the facsimile image packets over the multiplexed composite link and reassembling, with carrier, the facsimile signals at the remote site for transmission over an analog telephone line to a remote facsimile machine.
Metadata
Assignee
- Multi-Tech Systems, Inc.
Inventors
- Harinarayana Arimilli
- Ashish A. Thanawala
- Vasant Kumar Kanchan
Application Information
Application Number:US 09/711,754
Filing Date:2000-11-13
Priority Date:1994-04-19
Art Unit:7
Classifications
IPC:
H04L 1266H04L 1228
Field of Search:
370352370353370354370355370356370401379 93
Patent Drawings (57 sheets)
Description
[0003] This application is a Continuation of U.S. Ser. No. 08/903,032 filed Jul. 29, 1997, now U.S. Pat. No. 6,151,333, issued on Nov. 21, 2000, which is a Continuation of U.S. Ser. No. 08/229,958 filed Apr. 19, 1994, now U.S. Pat. No. 5,682,386 issued on Oct. 28, 1997.
FIELD OF THE INVENTION
[0004] The present invention relates to data communication multiplexers and in particular to communication multiplexers which multiplex data, facsimile and compressed voice over a single composite link.
BACKGROUND OF THE INVENTION
[0005] Data multiplexers in the telecommunications field are used to combine several asynchronous data communication signals from individual data terminal equipment (DTE) sources such as computer terminals or personal computers (PC's) onto a single composite link. The individual asynchronous signals from the PC's are connected to the multiplexer channel inputs and converted into a single signal called the composite signal which is then sent over a single analog or digital link called the composite link. Of course, the composite link may be a dedicated telephone line, a leased line, or a single private wire.
[0006] The data multiplexer combines the channel signals from individual PC's into a composite signal by using one of a variety of techniques such as frequency division multiplexing, time division multiplexing and statistical time division multiplexing. Frequency division multiplexers assign separate frequencies to each signal and combine the frequencies onto the single composite link. Time division multiplexers assign a time slice of a single carrier to each of the channels being combined. Statistical time division multiplexers are in adaptation of a time division multiplexers in which only those channels actually sending data get a slice of time. This results in a more efficient use of the composite link.
[0007] Typically, a data multiplexer is used as an efficient alternative to traditional data communications in which a single channel uses a single telephone line link. By combining a plurality of asynchronous channels into a composite link, fewer telephone lines or leased lines and less equipment is used to transfer the data. This is especially cost effective when a four wire “leased” line is used to connect a pair of synchronous modems. This type of private line offers a degree of security that public dial-up telephone lines cannot match. In addition, the superior error correction of a synchronous multiplexer network is preferred over the single telephone line asynchronous connections. Better yet, the use of a digital line with a DSU (Digital Service Unit) connection is more reliable and error free than analog.
[0008] FIG. 1 shows a typical arrangement for a prior art connection of a plurality of PC's at building A 101 and a computer system at building B 102. The computer system at building B may be personal computers (PC's) 103 such as those shown in building A or any variety of computer equipment devices. Traditional dial-up telephone links 105a, 105b, 105cthrough 105nare used between the plurality of PC's in building A 101 and the plurality of data terminal equipment (DTE) devices of building B such as a VAX computer 106. Each asynchronous link, therefore, requires its own dial-up link 105a, 105b, 105cthrough 105n, which is in many cases not cost effective. The connections may be between two sites, or multiple sites may be connected.
[0009] FIG. 2 shows a prior art data multiplexer scheme in which a plurality of PC's 203 at building “A” 201 are multiplexed using a data multiplexer and synchronous modem 207 to transmit the information over a single telephone link 205 to building “B” 202. The signals are then demultiplexed by a similar multiplexor/modem 208 and transmitted to the DTE of building “B” 202, which for illustrative purposes is shown as a VAX computer 206.
[0010] In general, FIG. 2 describes a data multiplexer 207 and, in particular, a device manufactured by the assignee of the present invention called the MultiMux (model 900, 1600 or 3200) product from Multi-Tech Systems, Inc. of Mounds View, Minn. The product allows for up to n-RS232 connections to local PC's 203, dumb terminals, host computers such as a DEC VAX 206, or other devices which communicate via asynchronous connection. In one product environment, n equals eight where eight PC's or other asynchronous devices can be attached to eight RS232 ports. The composite link is typically handled through an proprietary protocol with data rates up to 64 kilobytes per second. Not shown is a command port for menu driven control of the operational settings of the data multiplexer.
[0011] Connections from one site to another site over a composite link using a dedicated line is an efficient use of the line resources, however additional line connections are still typically needed between the two sites or more sites for traditional telephone voice or facsimile connections between the sites. There is a need in the art, therefore, to combine compressed voice grade telephone signals with data signals and facsimile signals and transmit all over a composite link to further increase the efficient use of a single telephone line connection.
SUMMARY OF THE INVENTION
[0012] The present invention solves the aforementioned deficiencies of the prior art and solves other problems that will be understood and appreciated by those skilled in the art upon reading and understanding the present specification. The present invention describes a data multiplexing network which combines a plurality of asynchronous data channels with an asynchronous data stream representing compressed voice signals and/or facsimile signals onto a single synchronous data packet stream. The single synchronous data packet stream is then transmitted by a high speed statistical multiplexer over a composite link to a second site using a modified high-level synchronous data link control protocol with an overlay of a priority statistical multiplexing algorithm. The asynchronous data channels and the compressed voice channel and/or facsimile signals are demultiplexed and reconstructed at the second site for sending to other asynchronous data terminal equipment and to a standard telephone or facsimile analog port or PBX interface, respectively. Communication between the first site by voice or facsimile and the second site is transparent to the users.
[0013] In a further embodiment of the present invention, the transmission of facsimile information is performed by demodulating the fax transmissions, sending only the facsimile image packets over the multiplexed composite link and remodulating the facsimile signals at the remote site for transmission over an analog telephone line to a remote facsimile machine. The demodulating and remodulating of the facsimile image packets by the present invention is transparent to the facsimile machines except that certain proprietary facsimile protocols are suppressed by the stripping of the proprietary information from the facsimile header packets.
DESCRIPTION OF THE DRAWINGS
[0014] In the drawings, where like numerals describe like components throughout the several views,
[0015] FIG. 1 is a drawing of a prior art connection between building A and building B using traditional dial-up telephone links by modem;
[0016] FIG. 2 is a prior art description of the connection between building A and building B using a statistical multiplexer link;
[0017] FIG. 3 is a general block diagram showing the preferred embodiment of the present invention which combines both telephone and facsimile information through a number of possible alternative interfaces with digital data information for transmission to and demultiplexing at a remote site;
[0018] FIG. 4A is a detailed block diagram showing the use of the multiplexor 300 of the present invention to combines both telephone (voice), facsimile through a variety of connections with data over a single composite link to a remote site;
[0019] FIG. 4B is a detailed block diagram showing the division of major components of the data/voice/fax multiplexor of FIG. 4A including the FXS, FXO and E&M interfaces;
[0020] FIG. 5A is a diagram showing a first one of the preferred connections of the present invention which multiplexes voice telephone, facsimile information and digital data information for transmission to and demultiplexing at a remote site for connection to other DTE devices and for connection to remote voice telephone and facsimile equipment;
[0021] FIG. 5B is a diagram showing a second one of the preferred connections of the present invention which multiplexes voice telephone, facsimile information and digital data information for transmission to and demultiplexing at a remote site for connection to other DTE devices and to a remote PBX;
[0022] FIG. 5C is a diagram showing a third one of the preferred connections of the present invention which multiplexes voice telephone, facsimile information and digital data information for transmission to and demultiplexing at a remote site for connection to other DTE devices and to remote voice telephone and facsimile equipment through a remote PBX;
[0023] FIG. 5D is a diagram showing a fourth one of the preferred connections of the present invention which multiplexes voice telephone and facsimile information through a local PBX with local digital data information for transmission to and demultiplexing at a remote site for connection to other DTE devices and to remote PBX for remote voice telephone and facsimile equipment;
[0024] FIGS. 6A, 6B and 6C are detailed block diagrams of the asynchronous channel cards, the aggregate cards and the voice/fax cards, respectively, of the multiplexer shown in FIG. 4;
[0025] FIGS. 7A-7B, 7C-7I, 8A-8B, 8C-8I, 9A-9B, 9C-9I and 10A-10B, 10C-10I are detailed electrical schematic diagrams of the voice/fax card of FIG. 6C;
[0026] FIG. 11 is a signal flow diagram of the speech compression algorithm;
[0027] FIG. 12 is a detailed function flow diagram of the speech compression algorithm;
[0028] FIG. 13 is a detailed function flow diagram of the speech decompression algorithm;
[0029] FIG. 14 is a flow chart of the modified HDLC transmission packet protocol using priority statistical multiplexing of the data/voice/fax multiplexor of FIGS. 6A, 6B and 6C;
[0030] FIG. 15 shows a Link Request Frame used to initiate and establish a connection between multiplexers using modified HDLC with Priority Statistical Multiplexing;
[0031] FIG. 16 shows a Voice/Fax Data Frame used to transmit voice/fax channel data;
[0032] FIG. 17 shows a Network Control Frame used in a networking environment;
[0033] FIG. 18 shows an Asynchronous Channel Data Frame used to transmit asynchronous channel data; and
[0034] FIG. 19 shows an Acknowledgement Frame used to acknowledge communications between multiplexers.
DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS
[0035] In the following Detailed Description of the Preferred Embodiment, reference is made to the accompanying drawings which form a part hereof and in which is shown by way of illustration specific embodiments 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 and that electrical, logical, and structural changes may be made without departing from the spirit and the scope of the present invention. The following detailed description is, therefore, not to be taken in a limiting sense and the scope of the present invention is defined by the appended claims.
System Overview
[0036] FIG. 3 is a block diagram showing a plurality of connection combinations for the preferred embodiment of the present invention which is a communication system in which a data/voice/fax multiplexer 300ais configured to take voice information from telephone equipment, facsimile information from facsimile machines and asynchronous data from data terminal equipment (DTE) devices and combine this information and data for transmission over a single composite communications link. Data/voice/fax multiplexers 300aand 300b(generally referred to as data/voice/fax multiplexer 300) are identically configured for multiplexing and demultiplexing this data and information. The result of this connection allows telephone, facsimile and data communications between sites “A” and “B” in a method of communication which appears to users at both sites to be simultaneous and transparent.
[0037] The present invention shown in FIG. 3 connects a plurality of data terminal equipment (DTE) devices such as computers, terminals, printers, modems, etc., through asynchronous channels to the data/voice/fax multiplexer 300 at site “A”. Also, telephone equipment such as telephone desk sets, PBX equipment and facsimile (fax) equipment are also connected to data/voice/fax multiplexer 300. The data/voice/fax multiplexer 300 is configured to take analog voice channel inputs from telephone equipment through specially configured voice channel interfaces to be digitized, compressed and encoded into a special packet protocol using a voice compression algorithm. Multiplexer 300 is also configured to connect to fax equipment to receive and demodulate the fax picture data to place the decoded picture data into the special packet protocol. The asynchronous data received by multiplexer 300 from the DTE devices is combined with packetized picture data and packetized compressed voice information for multiplexing and synchronous transmission over the composite link.
[0038] At site “B”, multiplexer 300boperates identically to multiplexer 300aat Site “A” to multiplex outgoing data, voice or fax information and to demultiplex incoming data from site “A”. Each multiplexer 300 operates to compress or decompress the digitized voice data from telephone equipment using a voice compression algorithm described more fully below. Multiplexers 300 also operate to modulate and demodulate the fax picture data so that all three forms of data (DTE data, compressed voice data and facsimile picture data) are combined using a special packet protocol for transmission over the composite link. The composite link 313 may be an analog line such as a public telephone line using synchronous modems, a private leased line using synchronous modems or a digital line using DSU (Digital Service Units).
Hardware Overview
[0039] As shown in FIG. 4, the present invention combines a plurality of asynchronous data channels 302a-302n, which in many cases are RS232 interfaces 303athrough 303n, along with a data packet stream of compressed voice or facsimile information into a single data stream. The single packetized data stream is transmitted using synchronous modem 314 over a single telephone line 315 to a remote site (Site “B”). As described more fully below, the composite link 313 may be selected to be an analog line such as a public telephone line using synchronous modems, a private leased line using synchronous modems or a digital line using DSU (Digital Service Units). FIG. 4 shows only one such composite link implementation which is a public telephone line 315 using synchronous modems 314.
[0040] As shown in FIG. 4, the basic elements at the local site (Site “A”) connected to multiplexer 300aare terminals or PCs 301a-301nwhich are connected to channel ports 302a-302nwhich in turn connect to RS232 interfaces 303a-303n. The channel ports 302a-302nprovide access to data buffers 304a-304ncontrolled by microprocessor 306 which assembles the data packets for the data processor 318. The combined data packets are connected to the phone line 315 by synchronous modem 314 for transmission at high speeds over the dedicated phone line 315.
[0041] Asynchronous data from the individual PC's contain start and stop flags. The asynchronous data is collected from the individual PC's and is assembled into synchronous data packets, each with a header and a trailer. Typically, 85% to 90% of an asynchronous line is not used efficiently since the line is not carrying any data most of the time. By using a statistical multiplexer 314, the sporadic data activity of several individual channels 302a-302nconnected to PC's 301a-301ncan be combined onto a single line 315 to make more efficient use of that line. The microprocessor statistically multiplexes and collects the asynchronous data and packetizes it into synchronous data packets for transmission.
[0042] Synchronous data transmissions also gain efficiency over asynchronous data transmissions by reducing framing overhead. By way of example of the data transmission efficiency gain, asynchronous data is by definition formatted by framing each character with a start and stop bit. This process can account to up to one-third of the bits in a single transmission on an asynchronous link. In contrast to this, synchronous data is transmitted in a packet that first contains a header (which contains destination address), followed by a block of data characters and followed by trailer information (such as error checking codes, checks sums, etc.). Since the packet is addressed, a statistical multiplexer can arrange the packet in any order with the other asynchronous data based on demand and use of the asynchronous data lines.
[0043] Data from the asynchronous channels 302a-202nconnected to the PC's 301a-301nis sent to the microprocessor for statistical multiplexing after first being buffered through buffer 305 and collected by internal microprocessor 306. The microprocessor 306 assembles the data into the synchronous data stream in the form of synchronous data packets which are framed by the address and error correcting data and sent to data processor 318 for multiplexing with voice and fax data packets for transmission over the synchronous composite link.
[0044] The composite link 315 may be a digital or analog network link, a simple analog leased line, a four-wire leased line or private line. Communication over the composite link is through a special synchronous modems operating typically at 300 to 19.2 kbps, 38.4 kbps or DSU's (Digital Service Units) operating at 9600 to 256 Kbps @@56 Kbps in excess of 256 Kbps. The management and control format of the data transmitted over the composite link is described more fully below. This format is similar to the high-level synchronous data link control format (HDLC) used for inter-modem or DSU communication. A proprietary modified form of the HDLC is used with the preferred embodiment of the present invention which is called Modified HDLC or MHDLC. MHDLC is used in combination with a Priority Statistical Multiplexing (PSM) algorithm to achieve a highly efficient use of the composite link.
Multiplexer Overview
[0045] FIG. 4B is a block diagram of a single data/voice/fax multiplexer 300 with the circuits shown divided according to the physical implementation on multiple cards. Those skilled in the art will readily recognize that the physical implementation of the present invention need not follow the physical partitioning exemplified here. The multiplexer 300 uses statistical time division multiplexing to transmit data, voice and facsimile data in a fashion that appears simultaneous to the user at each end. In the illustrated embodiment of the present invention, two eight-channel interface cards 401aand 401bare included to provide a total of sixteen RS232 asynchronous ports for connection to PC's, mainframe computers, and other DTE devices, although as shown below, more channel cards may be added to extend the number of asynchronous channels serviced. In the preferred implementation, 32 asynchronous channels are interfaced using four 8-channel cards. The channels are buffered and connected to the host or aggregate card 400 of the multiplexer 300 for multiplexing with packetized voice or facsimile information from Voice Channel Equipment (VCE) Channel 1 circuit 308 or VCE Channel 2 circuit 309 (both VCE channels implemented on a single card).
[0046] Those skilled in the art will readily recognize that a variable number of asynchronous RS232 port cards and a variable number of voice or facsimile interface cards may be combined in the preferred embodiment of the present invention without limiting the scope of the invention. Thus, the design of the data/voice/fax multiplexor 300 is modular to allow the addition of cards to expand the capability of the system. In the preferred implementation shown in FIG. 4B, two VCE channel circuits 308 and 309 on a single card are used to send/receive facsimile or analog voice information connections for packetizing and transmission over the composite link lines 313aand 313b. As part of the modular design, the preferred implementation of data voice/fax/multiplexor 300 is shown with two dedicated lines 313aand 313bconnected to ports 403aand 403brespectively. Network ports 403aand 403beach interface to separate lines using dedicated synchronous modems 314 for analog lines or to DSU's (Data Service Units) for digital lines.
[0047] The facsimile information from a fax machine is received as a telephone connection on VCE channel 1 circuit 308 or VCE channel 2 circuit 309. The facsimile information is taken off the analog carrier by demodulating the carrier so that the picture or pixel packets are recovered. The picture or pixel packets are then passed through dual port RAM 307 to be received by the data processor 318. The data processor 318 combine the facsimile or pixel packets with the synchronous data packets received from the asynchronous data channels 401a-401bfor statistical multiplexing and transmission over one of the composite link lines 313aor 313bthrough network ports 403aor 403b, respectively.
[0048] In addition, or alternatively, telephone equipment connected to either VCE channel 1 circuit 308 or VCE channel 2 circuit 309 will receive analog voice information, digitize the voice information, compress and encode the digitized voice information into packets and load the packets into dual port RAM (Random Access Memory) 307 for receipt by the data processor 318. These compressed voice packets are then statistically multiplexed with the facsimile picture packets and/or the asynchronous data packets from asynchronous channel cards 401aand 401bfor multiplexed transmission over the composite link lines 313aor 313b. The packets are collected and transmitted over the telephone line using a proprietary synchronous data link format which, for purposes of the present discussion, is described as a modified high speed data link control or MHDLC using a proprietary priority statistical multiplexing algorithm described more fully below.
Operation of the Voice/Facsimile Channel Interface
[0049] The VCE channel 1 circuit 308 and VCE channel 2 circuit 309 of FIG. 4B are identical circuits which are capable of operating in parallel to transmit and receive signals to and from telephones and facsimile machines. Illustrated in FIG. 4B for VCE channel 1 circuit 308 and VCE channel 2 circuit 309 are three types of telephone line interfaces labeled FXS, FXO, and E&M. The FXS acronym stands for Foreign Exchange Station. The FXS interface mimics the subscriber-side of a standard tip and ring two-wire telephone connection either as a loop or a ground start configuration. The FXO acronym stands for Foreign Exchange Office. The FXO interface mimics the central office or provider-side of a standard tip and ring two-wire telephone connection. The E&M acronym was historically designated in telephone circuit diagrams as the “e” in “received” and the “m” in “transmit” for trunk signalling. The E&M interface mimics a typical PBX trunk interface.
[0050] As shown in more detail in FIG. 6C, each voice channel card is capable of handling the three interfaces: FXS, FXO and E&M to provide a wide variety of connectivity for interfacing to different types of telephone equipment. Four of these types of connections are illustrated in FIGS. 5A though 5D.
[0051] As shown in FIGS. 5A, a telephone or facsimile machine may be connected to the FXS interface at Site “A”, which will appear to this equipment as though it were connected to the subscriber side of a standard tip and ring two-wire analog telephone connection. The FXS connection on VCE channel 1 circuit 308 or VCE channel 2 circuit 309 shown in FIGS. 4A and 4B would appear to be a telephone central office (CO) to this telephone equipment (or a PBX-mimic of a CO). Thus, if a user picked up the handset of a standard telephone connected to the FXS interface at Site “A” of FIG. 5A, the telephone or fax machine at site “B” would ring.
[0052] A PBX may be connected to the FXO interface on VCE channel 1 circuit 308 or VCE channel 2 circuit 308 shown in FIGS. 4A and 4B. Referring to FIG. 5B, the PBX at site “B” is attached to the FXO interface of the multiplexer 300b. The PBX at site “B” will see the multiplexer FXO interface as a piece of telephone equipment responding to the PBX connection. A telephone or fax machine at site “A” is connected to the FXS interface of multiplexer 300abut will appear to be connected to the station connection of the PBX at site “B”. The telephone or fax machine at site “A” will then be able to dial any extension serviced by the PBX at site “B” or dial out to the local Public Switched Telephones Network (PSTN) from the PBX. The telephone or fax equipment at site “A” appears to be directly connected to the PBX at site “B”.
[0053] A PBX trunk interface may also be connected to the E&M interface on VCE channel 1 circuit 308 or VCE channel 2 circuit 308 shown in FIGS. 4A and 4B. Referring to FIG. 5C, the trunk interface of the PBX at site “B” is attached to the E&M interface of the multiplexer 300b. The PBX at site “B” will see the multiplexer E&M interface as a trunk telephone line responding to the PBX connection. A telephone or fax machine at site “A” is connected to the FXS interface of multiplexer 300abut will appear to be connected to the PBX at site “B” through the trunk interface. The telephone or fax machine at site “A” will then be able to dial any extension serviced by the PBX at site “B” or dial out to the local Public Switched Telephones Network (PSTN) from the PBX. The telephone or fax equipment at site “A” appears to be directly connected to the PBX at site “B”. The telephone or fax equipment serviced by the PBX at site “B” can access the telephone or fax equipment at site “A” by calling the appropriate trunk number for site “A”.
[0054] A PBX trunk interface of PBX equipment at both sites “A” and “B” may be connected to the E&M interface on VCE channel 1 circuit 308 or VCE channel 2 circuit 308 shown in FIGS. 4A and 4B. Referring to FIG. 5D, a trunk interface of the PBX at site “A” is attached to the E&M interface of the multiplexer 300aand a trunk interface of the PBX at site “B” is attached to the E&M interface of the multiplexer 300b. The PBX at site “A” will see the multiplexer E&M interface as a trunk telephone line responding to the PBX connection and the PBX at site “B” will see the multiplexer E&M interface as a trunk telephone line responding to the PBX connection. Both PBX's will see the other PBX as a direct connection through a trunk line. The telephone or fax machine at site “A” will then be able to dial any extension serviced by the PBX at site “B” or dial out to the local Public Switched Telephones Network (PSTN) from the PBX at site “B” Similarly, the telephone or fax machine at site “B” will then be able to dial any extension serviced by the PBX at site “A” or dial out to the local Public Switched Telephones Network (PSTN) from the PBX at site “A”
Asynchronous Channel Cards
[0055] FIG. 6A is a detailed block diagrams of the asynchronous channel cards. As described above, the present system is modular in its design to allow a variable number of asynchronous channel interfaces. Thus, FIG. 6A such channel boards 600a, 600b, 600c, 600d, each capable of collecting asynchronous data from eight RS 232 interfaces for a total of 32 RS 232 asynchronous interfaces.
[0056] Each channel board 600a, 600b, 600c, 600d, is identical in design and commonly referenced as channel board 600. Each channel board 600 is controlled by a channel processor 306 to collect and distribute asynchronous data to and from the eight channels through I/O interfaces 602a, 602b, 602c, 602d. The I/O interfaces communicate with channel processor 306 via a bus to share a data path. Channel processor 306 utilizes a local RAM memory 604 for storing the operation and control programs. The asynchronous data collected or the asynchronous data to be distributed is transferred to and from the aggregate card or board 400 of FIG. 6B along channel data bus 605. The channel data bus 605 is continued on FIG. 6B through connection point A.
[0057] In an alternate embodiment of the present invention, the channel processor 306 can compress the asynchronous data using a compression algorithm such as the algorithm used in the CCITT V.42bis standard. Also, the channel boards 600a, 600b, 600c, 600d, may operate to receive synchronous data for multiplexing over the composite link.
Aggregate Card
[0058] Aggregate card 400 of FIG. 4B is shown in greater detail in the block diagram of FIG. 6B. A data processor 318 controls the internal operation of aggregate card 400 and performs the functions of collecting asynchronous data from bus 605, collecting voice and fax data packets from interface 607, and multiplexing and framing the various data packets and call signalling packets into synchronous data packets. Data processor 318 in the preferred embodiment is a Z180 microprocessor. A RAM memory 611 on internal bus 608 supports data processor 318 to store control programs and to buffer packet information received from the voice/fax board 402 via connection 607. The synchronous data packets are sent from data processor 318 along internal bus 608 to a serial communications controller 609. Serial communications controller 609 operate under the control of the data processor 318 via control lines separate from the internal bus 608. The synchronous data stream may be transmitted via a variety of paths through serial communications controller 609 as composite links. External synchronous modems 314aand 314bprovide modem communications over active two-wire or four-wire leased lines or an alternative communication path may be established via DSU (Digital Service Units) 610aand 610bto digital data networks.
[0059] Data processor 318 is under direct control of command processor 612 which supports a local connection to a status and control PC 613 and a remote connection to the status and control PC at the remote site through dial-up modem 615 for coordination of configuration information and operating parameters. The command processor maintains the configuration information and operating parameters in a non-volatile EPROM memory 614.
Voice/Fax Card
[0060] A dual channel voice/fax card 402 is shown in the detailed block diagram of FIG. 6C. Voice Channel Equipment (VCE) Channel 1 circuit 402aand VCE Channel 2 circuit 402bof FIG. 5 are implemented on a single card 402 shown in FIG. 6C. The local incoming analog voice information or fax carrier is received on the FXS interfaces. The remote reconstructed analog voice information or fax carrier is produced locally on the FXO interfaces. The PBX trunk signalling is produced on the E&M interfaces.
[0061] The incoming analog voice information or fax carrier is received on the FXS interface 624aand 624band converted from analog information to digital samples by analog to digital converters 622aor 622b, respectively. The digital samples are passed to digital signal processor 620 which either decodes the fax carrier information if fax information is detected or compresses the voice data if voice information was detected. The voice compression algorithms are described more fully below. The compressed voice data is placed in packets by the digital signal processor 620 and passed to the data processor 318 of FIG. 6B in via interface 607 through connection point B. The fax picture data is similarly packetized by the digital signal processor 620 and passed to the data processor 318 of FIG. 6B.
Detailed Electrical Schematic Diagrams
[0062] FIGS. 7A-7B, 8A-8B, 9A-9B and 10A-10B are detailed electrical schematic diagrams of the circuits depicted in block diagram form in FIGS. 6C. In FIG. 7A, the DSP 56002 circuit U14 corresponds to the digital signal processor (DSP) 620 of FIG. 6C which functions to compress and decompress digitized voice signals and handle the call progress signals. The call progress signalling establishes the calls before the voice compression or decompression starts through the FXS, FXO and E&M interfaces. DSP 56002 also functions to detect the fax tones and perform fax modulation and demodulation and to perform far-end echo-cancellation in the digital domain.
[0063] DSP 56002 circuit U14 controls the FXS, FXO and E&M interfaces to handle the call progress via the data bus D0-D23 through the buffer circuits U2 and U3 for channel 1 and channel 2, respectively. For example, for the FXS interface, the DSP 56002 circuit U14 operates to control the ring of the telephone and detect the off-hook of the telephone. For the FXO interface, DSP 56002 circuit U14 operates to detect the ring from the PBX and returns an off-hook signal to the station side of the PBX. For the E&M interface, DSP 56002 circuit U14 operates to connect to the trunk of the PBX to primarily control the E-lead and M-lead for trunk signalling. Integrated circuit U1 is a buffer circuit used to control the status indicator LED's shown in FIG. 7B.
[0064] As described above, channel 1 and channel 2 of the voice/fax board are identical and correspond to Voice Channel Equipment (VCE) Channel 1 circuit 402aor VCE Channel 2 circuit 402bof FIG. 5. Only one channel circuit is shown in the electrical schematic diagrams of FIGS. 10A and 10B and the control signal labels shown in the electrical schematic diagram of FIG. 7B match by placing a “B” in front of any control signal label to indicate channel 1. For example, the signal E&ME of the electrical schematic diagram of FIG. 7B matches the signal E&ME of the electrical schematic diagram of FIG. 10A for channel 2 and the signal BE&ME of the electrical schematic diagram of FIG. 7B matches the signal E&ME of the electrical schematic diagram of FIG. 10A for channel 1. In FIGS. 10A and 10B, the FXS, FXO and E&M connections for the voice/fax card 402 are shown to the right of FIG. 10B. The E&M trunk line connector J5 handles both two-wire and four-wire interfaces.
[0065] Referring to FIGS. 8A and 8B, the dual port RAM memory U10 corresponds to the dual port RAM memory 307 of FIGS. 6C, 5 and 4. Dual port RAM 307 is used to transfer the voice and fax packets to and from the command processor 612 of FIG. 6B. SRAM circuits U5, U6 and U7 in the upper parts of FIGS. 8A and 8B correspond to the RAM memory 618 of FIG. 6C. This memory contains the operating programs for DSP U14 of FIG. 7A (corresponding to DSP 620 of FIG. 6C). DSP U14 executes the program code from SRAM memory circuits U5, U6 and U7 but the code is permanently stored in non-volatile EPROM memory 619 of FIG. 6C corresponding to EPROM circuits U8 and U69 of FIG. 8B. The code executes much faster from the RAM memory 618 so the operating program code is loaded from the EPROM 618 to the RAM 619 upon power up of the system.
[0066] Referring to FIGS. 9A and 9B, connector J1 is the interface 607 with the main aggregate board of FIG. 6B. The operational amplifiers in the top portion of FIG. 9B are used for gain control and level control of the analog voice signals. Not shown in these schematic diagram are the AC (ring voltage) and DC voltage sources.
[0067] CODEC 621afor channel 1 of FIG. 6C corresponds to CODEC circuit U24 of FIG. 8B. CODEC 621bfor channel 2 of FIG. 6C corresponds to CODEC circuit U16 of FIG. 8B. CODEC's U24 and U16 include an analog to digital (A/D) converter and a digital to analog (D/A) converter.
[0068] Additional detail regarding echo cancellation, voice digitization and voice compression can be found in copending U.S. patent application Ser. No. 08/002,467 filed Jan. 8, 1993 entitled “COMPUTER-BASED MULTIFUNCTION PERSONAL COMMUNICATIONS SYSTEM”, the complete application of which, including the microfiche appendix, is hereby incorporated by reference. This application is assigned to the same assignee as the present invention. The DSP 56002 DSP U14 is described more fully in the DSP56002 Digital Signal Processor User's Manual published in 1993 Motorola, Inc., which is hereby incorporated by reference. CODEC chips U16 and U24, in the preferred embodiment, are part number T7540 Digital Telephone CODEC manufactured and sold by AT&T Microelectronics. A more detailed description of this telephone CODEC chip U12 is described in the T7540 Digital Telephone CODEC Data Sheet and Addendum published July, 1991 by AT&T Microelectronics, which is hereby incorporated by reference.
Speech Compression
[0069] The Speech Compression Algorithm for compressing/decompressing the digitized speech information of the present system is accomplished via the DSP 620 of FIG. 6C. The analog voice signals are received and digitized by the telephone CODEC circuits 621aor 621b. The digitized voice information is passed from the digital telephone CODEC circuits to the digital signal processor (DSP) 620 which is programmed to do the voice compression algorithm. The DSP 620 compresses the speech and places the compressed digital representations of the speech into special voice packets described more fully below. As a result of the voice compression algorithm, the compressed voice information is passed to the dual port RAM circuit 307 for forwarding to the aggregate board in FIG. 6B. The voice packets are approximately 23 bytes for a 9200 baud compression and represent 20 ms of speech each.
Speech Compression Algorithm
[0070] 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 9200 bps encoding bit stream using a fixed-point (non-floating point) DSP such that the compressed speech of channel 1 an be transmitted over the telephone line multiplexed with fax data or compressed speech of channel 2 and multiplexed still further with asynchronous data. The present compression algorithms accomplish an approximately 7 to 1 compression ratio. This is accomplished in an efficient manner such that enough machine cycles remain during real time speech compression to allow real time acoustic and line echo cancellation in the same fixed-point DSP 620.
[0071] A silence detection function is used to detect quiet intervals in the speech signal which allows the data processor 620 substitute asynchronous data in lieu of voice data packets over the composite link to efficiently time multiplex the voice and asynchronous data transmission. The allocation of time for asynchronous data transmission is constantly changing depending upon how much silence is on either of the voice channels.
[0072] 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 160 digitized speech samples (20 milliseconds), divides the speech samples into time segments of 5 milliseconds each, and uses predictive coding on each segment. 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 value is 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, four 5 ms speech segments can be reduced to a packet of 23 bytes or 184 bits (46 bits per sample segment). By transmitting 184 bits every 20 milliseconds, an effective serial data transmission rate of 9200 bps is accomplished.
[0073] 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.
[0074] FIG. 11 is a high level signal flow block diagram of the speech compression algorithm used in the present system to compress the digitized voice for transmission over the telephone line in the voice over data mode of operation or for storage and use on the personal computer. The transmitter and receiver components are implemented using the digital signal processor 620 of FIG. 6C.
[0075] 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.
[0076] 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 in 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 5 ms 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.
[0077] The channel 1111 corresponds to the aggregate board 402 and the composite link in which the compressed speech bits are multiplexed with the asynchronous data using a synchronous packet format described below. The voice bits are sent in 100 ms packets of 5 frames each, each frame corresponding to 20 ms of speech in 160 samples. Each frame of 20 ms is further divided into 4 sub-blocks or segments of 5 ms each. In each sub-block of the data consists of 7 bits for the long term predictor, 3 bits for the long term predictor gain, 4 bits for the sub-block gain, and 32 bits for each code book entry for a total 46 bits each 5 ms. The 32 bits for code book entries consists of four 8-bit 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 8-bit table entry is transmitted rather than the actual samples. The code book entries are pre-computed from representative speech segments.
[0078] 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.
[0079] The complete speech compression algorithm is summarized as follows:
[0080] a) Remove any D.C. bias in the speech signal.
[0081] b) Pre-emphasize the signal.
[0082] c) Find the innovation in the current speech segment by subtracting the prediction from reconstructed past samples. This step requires the synthesis of the past speech samples locally (analysis by synthesis) such that the residual error is fed back into the system.
[0083] d) Quantize 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 5 ms 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.
[0084] e) At the transmitter and the receiver, reconstruct the speech from the quantized error signal fed into the inverse of the function in step c above. Use this signal for analysis by synthesis and for the output to the reconstruction stage below.
[0085] f) Use a de-emphasis filter to reconstruct the output.
[0086] 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 provide bit rates of 8, 9.2, 9.6 and 16 Kbit/s, any one of which could be used in the present invention. 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.
Detailed Description of the Speech Compression Algorithm
[0087] The speech compression algorithm is described in greater detail with reference to FIGS. 11 through 13, and with reference to the block diagram of the hardware components of the present system shown in FIG. 6C. Also, reference is made to the detailed schematic diagrams in FIGS. 7A-10B. The voice compression algorithm operates within the programmed control of the DSP circuit 620. In operation, the speech or analog voice signal is received through the one of the telephone interfaces such as FXS nd is digitized by the CODEC circuit 621aor 621b. The CODEC for circuit 621aor 621bis a companding μ-law CODEC. The analog voice signal from the telephone interface is band-limited to about 3,500 Hz and sampled at 8 kHz by digital telephone CODEC 621aor 621b. Each sample is encoded into 8-bit PCM data producing a serial 64 kb/s signal. The digitized samples are passed to the DSP 620. There, the 8-bit μ-law PCM data is converted to 13-bit linear PCM data. The 13-bit representation is necessary to accurately represent the linear version of the logarithmic 8-bit μ-law PCM data. With linear PCM data, simpler mathematics may be performed on the PCM data.
[0088] The sampled and digitized PCM voice signals from the telephone μ-law CODEC 621aor 621bare passed to the DSP 620 via direct data lines clocked and synchronized to an 8 KHz clocking frequency. The digital samples are loaded into DSP 620 one at a time through the serial input and stored into an internal queue held in RAM and converted to linear PCM data. As the samples are loaded into the end of the queue in the RAM of DSP 620, the samples at the head of the queue are operated upon by the voice compression algorithm. The voice compression algorithm then produces a greatly compressed representation of the speech signals in a digital packet form. The compressed speech signal packets are then passed to the dual port RAM circuit 307 shown in FIG. 6C for use by the data processor 318 for transmission.
[0089] Concurrent with this transmit operation, DSP 620 is receiving compressed voice data packets from dual port RAM circuit 307, uncompressing the voice data and transferring the uncompressed and reconstructed digital PCM voice data to the digital telephone CODEC 621aor 621bfor digital to analog conversion and eventual transfer to the user through on of the telephone interfaces of FIG. 6C. This is the receive mode of operation of DSP 620 corresponding to receiver block 1200 of FIG. 11 and corresponding to the decompression algorithm of FIG. 13. Thus the DSP circuit 620 is processing the voice data in both directions in a full-duplex fashion.
[0090] Digital Signal Processor (DSP) 620 operates at a clock frequency of approximately 40 MHz while processing data at sampling rates of approximately 8 KHz in both directions for two channels. 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 620 during real time speech compression to allow real time acoustic and line echo cancellation in the same fixed-point DSP.
[0091] In operation, the availability of an eight-bit sample of PCM voice data from the μ-law digital telephone CODEC circuit 621aor 621bcauses an interrupt in DSP 620 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 621aor 621bcould also be linear CODEC.
[0092] Referring to FIG. 11, the digital samples are shown as speech entering the transmitter block 1100. The transmitter block, of course, is the mode of operation of DSP 620 operating to receive local digitized voice information, compress it and packetize it for transfer to the dual port RAM 307 for eventual multiplexing and transmission on the composite link, which corresponds to the channel 1111 of FIG. 11. A frame rate for the voice compression algorithm is 20 milliseconds of speech for each compression. This correlates to 160 samples to process per frame. When 160 samples are accumulated in the queue of the internal DSP RAM, the compression of that sample frame is begun.
[0093] The DSP circuit 620 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. The formula for removal of the DC bias or drift is as follows:
[0094] S(n)=x(n)−x(n−1)+α*S(n−1)
[0095] where
[0096]
[0097] The removal of the DC is for the 20 millisecond frame of voice which amounts to 160 samples. The selection of α is based on empirical observation to provide the best result.
[0098] Referring to FIG. 12, the voice compression algorithm in a control flow diagram is shown which will assist in the understanding of the block diagram of FIG. 11. The analysis and compression began at block 1201 where the 13-bit linear PCM speech samples are accumulated until 160 samples representing 20 milliseconds of voice or one frame of voice is passed to the DC removal portion of code operating within the programmed DSP 620. The DC removal portion of the code described above approximates the base line of the frame of voice by using an adaptive DC removal technique.
[0099] A silence detection algorithm 1205 is also included in the programmed code of the DSP 620. 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 and C-data described below. During silent portions of the speech, the data processing 318 will transfer asynchronous digital data over the composite linked in lieu of voice data packets. The formula for computing the power is:
[0100] If the power PWR is lower than a preselected threshold, then the present voice frame is flagged as containing silence. The 160-sample silent frame is still processed by the voice compression algorithm; however, the silent frame packets are discarded by the data processor 318 so that more asynchronous data may be transferred in lieu of voice data.
[0101] The rest of the voice compression is operated upon in segments where there are four segments per frame amounting to 40 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 FIG. 12 is the next step. The formula for the pre-emphasis is
[0102] S(n)=S(n)−τ*S(n−1)
[0103] where τ=0.55
[0104] Each segment thus amounts to five milliseconds of voice which is equal to 40 samples. Pre-emphasis then is done on each segment. The selection of τ is based on empirical observation to provide the best result.
[0105] The pre-emphasis essentially flattens the signal by reducing the dynamic range of the signal. By using pre-emphasis to flatten the dynamic range of the signal, less of a signal range is required for compression making the compression algorithm operate more efficiently.
[0106] The next step in the speech compression algorithm is the long-term predictor (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 linear PCM data of the current segment on a sample by sample basis to the reconstructed linear PCM data from the previous segments to obtain the innovation information and an indicator of the error in the prediction.
[0107] The first step in the long term prediction is to predict the pitch of the voice segment and the second step is to predict the gain of the pitch. For each segment of 40 samples, a long-term correlation lag PITCH and associated LTP gain factor β, (where j=0, 1, 2, 3 corresponding to each of the four segments of the frame) are determined at 1209 and 1211, respectively. The computations are done as follows.
[0108] From MINIMUM PITCH (40) to MAXIMUM PITCH (120) for indices 40 through 120 (the pitch values for the range of previous speech viewed), DSP 620 computes the cross correlation between the current speech segment and the previous speech segment by comparing the samples of the current speech segment against the reconstructed speech samples of the previous speech segment using the following formula:
[0109] where j=40, . . . 120
[0110] S=current sample of current segment
[0111] S′=past sample of reconstructed previous segment
[0112] nk=0, 40, 80, 120 (the subframe index)
[0113] and where the best fit is
[0114] Sxy=MAX {Sxy (j)}
[0115] where j=40, . . . 120.
[0116] The value of j for which the peak occurs is the PITCH. This is a 7 bit value for the current segment calculated at 1209. The value of j is an indicator of the delay or lag at which the cross correlation matches the best between the past reconstructed segment and the current segment. This indicates the pitch of the voice in the current frame. The maximum computed value of j is used to reduce the redundancy of the new segment compared to the previous reconstructured segments in the present algorithm since the value of j is a measure of how close the current segment is to the previous reconstructed segments.
[0117] Next, DSP 620 computes the LTP gain factor β at 1211 using the following formula in which Sxy is the current segment and Sxx is the previous reconstructed segment:
[0118] where
[0119] The value of the LTP gain factor β 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 the LTP gain factor is one.
[0120] The LTP gain factor is quantized from a LTP Gain Table. This table is characterized in Table 1.
| TABLE 1 |
|---|
| LTP Gain Quantization |
[0121] The gain value of β is then selected from this table depending upon which zone or range βsegmentwas found as depicted in Table 1. For example, if βsegmentis equal to 0.45, then β is selected to be 2. This technique quantizes the β into a 3-bit quantity.
[0122] Next, the LTP (Long Term Predictor) filter function 1213 is computed. The pitch value computed above is used to perform the long-term analysis filtering to create an error signal e(n). The normalized error signals will be transmitted to the other site as an indicator of the original signal on a per sample basis. The filter function for the current segment is as follows:
[0123] e(n)=S(n)−β*S′(n-−pitch)
[0124] where n=0, 1, . . . 39
[0125] Next, the code book search and vector quantization function 1215 is performed. First, DSP 620 computes the maximum sample value in the segment with the formula:
[0126] GAIN=MAS {|e(n)|}
[0127] where n=0, 1, . . . 39
[0128] This gain different that the LTP gain. This gain is the maximum amplitude in the segment. Next, DSP 620 normalizes the LTP filtered speech by the quantized GAIN value by using the maximum error signal |e(n)| (absolute value for e(n)) for the current segment and dividing this into every sample in the segment to normalize the samples across the entire segment. Thus the e(n) values are all normalized to have values between zero and one using the following:
[0129] e(n)=e(n)/GAIN n=0 . . . 39
[0130] Each segment of 40 samples is comprised of four subsegments of 10 samples each. The DSP circuit 620 quantizes 10 samples of e(n) with an index into the code book. The code book consists of 256 entries (256 address) with each code book entry consisting of ten sample values. Every entry of 10 samples in the code book is compared to the 10 samples of each subsequent. Thus, for each subsegment, the code book address or index is chosen based on a best match between the 10-sample subsequent and the closest 10-sample code book entry. The index chosen has the least difference according to the following minimization formula:
[0131] where
[0132] xi=the input vector of 10 samples, and
[0133] yi=the code book vector of 10 samples
[0134] This comparison 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 by precomputing and storing some of the values of this equation. For example, by expanding out the above formula, some of the unnecessary terms may be removed and some fixed terms may be precomputed:
[0135] where xi2is a constant so it may be dropped from the formula, and where the value of ½ Σyi2may be pre-computed and stored as the eleventh value in the code book os that the only real-time computation involved is the following formula:
[0136] Thus, for a segment of 40 samples, we will transmit 4 code book indexes corresponding to 4 subsegments of 10 samples each. After the appropriate index into the code book is chosen, the LTP filtered speech samples are replaced with the code book samples. These samples are then multiplied by the quantized GAIN in block 1217.
[0137] Next, the inverse of the LTP filter function is computed at 1219:
[0138] e(n)=e(n)+β*S′(n−pitch) n=0, . . . , 39
[0139] S′(i)=S′(n) n=40, . . . , 120; i=0, . . . (120−40)
[0140] S′(i)=e(i) i=0, . . . 40
[0141] 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 FIG. 13. The synthesis of FIG. 13 is also performed in the compression algorithm of FIG. 12 since the past segment must be synthesized to predict the gain and pitch of the current segment.
Voice or Fax Data Packet
[0142] When the DSP circuit 620 completes the compression of one 20 ms portion of voice or fax information, it will send a block of voice or fax data every 20 ms to the dual port RAM 307 where the data processor 318 can retrieve it for transmission. Each voice of fax data packet has three header bytes and 23 bytes of voice or fax data (for 9200 baud voice compression) or 43 bytes of voice data (for 16K baud voice compression) in the dual port RAM. The header bytes indicate the destination address, destination channel, frame ID, byte count, etc. Bits 6 and 7 of the first header byte indicate the packet type. The voice/fax packet is described in Table 2 below.
| TABLE 2 |
|---|
| Compressed Voice Packet Structure |
[0143] Bits 6 to 7 of the first byte of the header contains the packet identifier which identifies the contents of the packet. These bits are defined as follows:
[0144] 00=the following voice packet contains silent sound
[0145] 01=the following voice/fax packet contains information
[0146] 10=the following packet contains telephone signalling or control information
[0147] 11=reserved
Silence Suppression
[0148] If there is a silence period indicated by the DSP 620 in an empty packet sent to the data processor 318 through the dual port RAM 307, the data processor 318 will not send the silence packets to the remote site. Instead, the data processor will send a two-byte packet indicating no voice information to be sent or the data processor will set a bit in one of the acknowledgement, data, or network control packets to alert the receiving side. The detection and suppression of the transmission of the voice packets frees up bandwidth for the transmission of other data. In this fashion, the use of the bandwidth over the composite link is dynamically allocated between voice, fax and data. Since human speech is typically 60% silence (pauses between spoken words and sentences), a highly efficient multiplexing is accomplished.
HDLC Protocol With Priority Statistical Multiplexing
[0149] Referring once again to FIG. 4, the multiplexed data over composite link 313 between the synchronous multiplexors 300 uses priority statistical multiplexing (PSM) on top of a modified form of high-level synchronous data link control (HDLC) to transmit and receive the data packets. In general, this protocol follows the CCITT V.32 standard and the like for handshaking and communication. In the initial handshake period in establishing a communications link, a special link protocol is used. This protocol is described in the flow chart of FIG. 14.
Link Protocol
[0150] Both multiplexors 300 and the associated composite link (either analog or digital) transmit and receive a link request A or link request B, and a link acknowledgement as shown in FIG. 15. Data cannot be transferred until the link has been established. Link Request A (LRA) is transmitted by the initiating modem to the remote and receiving modem to initiate a link process. This link request is retransmitted every three seconds until link request B is received.
[0151] The called, or receiving, modem transmits Link Request B (LRB) to the transmitting multiplexor after LRA is received. LRB is transmitted every three seconds until link acknowledgement is received. Link Acknowledgement (LA) is transmitted to remote multiplexors only after LRA is sent and LRB is received, and LRA is received and LRB is sent, by the transmitting and receiving modems, respectively.
Acknowledgements
[0152] Acknowledgement blocks are used to acknowledge valid (uncorrupted) data blocks that were received as well as to relay control information to the remote multiplexer. An acknowledgement is always transmitted with the sequence number of the last received data block as shown in FIG. 19. Forced acknowledgements are acknowledgements which must be transmitted immediately. If one of the following conditions exist, a forced acknowledgement is required:
[0153] 1.) Control information needs to be sent to the remote multiplexer. For example, a receive buffer of a local channel is full.
[0154] 2.) Four data blocks have been received without an acknowledgement.
[0155] 3.) Two consecutive out-of-sequence data blocks are received.
[0156] 4.) A window flow time expires (see below).
[0157] Unforced acknowledgements are transmitted only after all of the following conditions are checked:
[0158] 1.) A forced acknowledgement condition doesn't exist.
[0159] 2.) A retransmissions of a data block is not necessary.
[0160] 3.) There are not new data blocks to send.
[0161] 4.) One or more data blocks have been received without an acknowledgement being transmitted.
Data Transfer
[0162] A voice/fax data frame is shown in FIG. 16 and an asynchronous channel data frame is shown in FIG. 18. Transfer of data takes place under the following conditions:
[0163] A.) A retransmission of data blocks is needed if one or two events occur:
[0164] 1.) Duplicate acknowledgements (consecutive acknowledgements with the same sequence number) are received while outstanding data blocks still exist.
[0165] 2.) The retransmission timer expires.
[0166] Retransmission of a data block should start with the first unforced acknowledgement. Data blocks follow in sequential order.
[0167] B.) New data blocks are transmitted only if data exists in the transmit buffer and all of the following conditions are met:
[0168] 1.) Forced acknowledgement condition doesn't exist.
[0169] 2.) Retransmission of data is not necessary.
[0170] 3.) The source channel doesn't have more than four outstanding unacknowledged conditions.
[0171] 4.) The total number of outstanding data blocks doesn't exceed seven.
Timers
[0172] The following timers are used for the present modified HDLC.
[0173] 1. A link request timer is a three second timer which is initiated on a reset of the multiplexer 300 or if the Link Request A (described above) is received. This timer is cancelled once the link has been established. This timer is resent each time LRA (Link Request A), LRB (Link Request B) or LA (Link Acknowledgement) is transmitted.
[0174] 2.) A window flow timer is a three second timer which is initiated after the link has been established. This timer is reset only when an acknowledgement (forced or unforced) is transmitted. If this timer expired, a forced acknowledgement is required.
[0175] 3.) An acknowledgement timer is a two second timer which is initiated when a valid data block is received. This timer is cancelled when an acknowledgement is transmitted. This timer is never reset but it is either initiated or cancelled. If this timer expires, a forced acknowledgement is required.
[0176] 4.) A retransmit timer is a four second timer which is initiated at the time a data block is transmitted. This timer is reset when a positive acknowledgement (an acknowledgement for any outstanding data blocks) is received or when a duplicate acknowledgement is received while an outstanding exists. The latter is a retransmission condition. This timer is cancelled when all outstanding data blocks have been acknowledged. This timer should only be initiated if this timer has been cancelled and a data block is to be transmitted. If this timer expires, retransmission of all blocks is required starting with the first unacknowledged block.
Miscellaneous
[0177] Receive Status Bytes are bytes which are included in the acknowledgement frame. The number of Receive Status Bytes is a minimum of one byte (for an eight channel multiplexer) and a maximum of four (for a thirty-two channel multiplexer) in the preferred embodiment. One bit is assigned per channel whereby each bit represents the status of the corresponding channel receive buffer (ie.: bit zero of Receive Status Byte number one corresponds to channel 1 and bit five of Receive Status Byte number four corresponds to channel 30). Each bit being set indicates that the corresponding channel receive buffers is full. In such a condition, the remote multiplexer will hold any data block that are intended for that channel. If the bit is clear, then the corresponding receive buffer is clear for receiving data. Any change in status of any of these bits causes a forced acknowledgement to be sent.
[0178] Remote Parameter Bytes are byte used to configure the remote slave unit (mutliplexer) 300 and are included in the LRA (Link Request A) and LRB (Link Request B) frames only if the local multiplexer 300 is configured as a master unit. The configuration of a master or slave is by selection of switches on the multiplexer 300. There are 59 bytes per eight channels with a minimum of 59 bytes (for eight channels) and a maximum of 236 bytes (for a 32 channel multiplexer).
[0179] The present invention will emulate the Hewlett-Packard ENQ/ACK flow control. If the ENQ is received by a channel port, it is passed through to the remote site and an ACK (acknowledgement) is immediately transmitted by the local channel to the HP device. If the remote channel detects ENQ in its data stream to the HP (Hewlett-Packard) device, it will transmit the ENQ and wait for a ACK (acknowledgement) to be received before transmitting any more data. Once the ACK is received, transmission is continued and the ACK is discarded.
Network Control
[0180] The multiplexor 300 may be a part of a series or chain of identical multiplexers 300 connected to pass data, voice and fax information along the chain. Thus, aggregate card 400 of FIG. 6B shows two composite links 610aand 610bwhich may be connected to “upstream” and “downstream” multiplexer 300. The aggregate card 400 contains pass-through buffers which simply pass along packets to the other multiplexers if those packets are not addressed to the local site.
[0181] The network control frame shown in FIG. 17 is used for network congestion control. If the pass-through buffers of the local multiplexer become full, the local multiplexer must tell the upstream multiplexers that are sending packets to stop until the downstream multiplexers have emptied the local pass-through buffers. The network control frame of FIG. 17 is sent upstream to all multiplexers until it is received by the multiplexer on the end of the chain. The packet of FIG. 17 is then returned downstream as a form of acknowledgement that all multiplexers upstream have ceased sending packets.
Priority Statistical Multiplexing
[0182] The present invention uses a proprietary priority statistical multiplexing (PSM) paradigm implemented in conjunction with the above-described modified HDLC protocol to allow high-priority (time sensitive) data such as voice, fax, LAN (local area network) synchronous and video to be multiplied with low priority data (such as asynchronous data) over a composite link. The fundamental difference between the two groups of data is the absence of the modified HDLC protocol overhead with high priority data. This absence of the modified HDLC protocol overhead is due to the time-sensitive nature of the high priority data which requires that the high-priority data be transmitted and received with a minimal amount of delay. The time sensitive condition removes any type of error correction or detection scheme, any type of retransmissions or any type of acknowledgements that are associated with the modified HDLC protocol employed with high priority data.
[0183] This priority statistical multiplexing uses variable-length packets and statistical multiplexing of low priority channels for efficiency during inactivity (idle time) of higher priority channels. Priority statistical multiplexing also assures predictable and minimal delay of higher priority packets by limiting the maximum length of lower priority packets. The lower priority packet maximum length is determined dynamically by taking the difference between the composite link speed and the combined data rates of all high priority channels for a time interval of 20 milliseconds. The example in Table 3 is for two voice/vax channels (high priority channels) with a 9600 baud voice compression and a single composite link speed of 56K bps. This example indicates the worst case of how long the multiplexer can wait before it must check to see if a non-silent voice packet is available to send.
| TABLE 3 |
|---|
| Example of Maximum Asynchronous Data Packet Length |
[0184] This formula ensures there will be a maximum of 20 milliseconds delay of voice/fax data. The maximum byte length for asynchronous data packets is set at the time the multiplexer is configured and does not change. The multiplexer periodically checks to see if there is a voice or facsimile packet to send over the composite link. If there is no voice to send, a silence packet is found in the dual port RAM and the data processor indicates this to the other side of the composite link without sending the voice or facsimile packet. The indicator used is a two-byte packet instead of the 23 byte packet for the voice of facsimile packet. In the alternative, a one-bit flag may be set in an acknowledgement packet, a data packet or a network control packet to indicate no voice packet is being sent.
[0185] Priority statistical multiplexing is also used to pass high priority data through intermediate multiplexers 300 in applications with multiple multiplexers configured in a chain. Priority statistical multiplexing has the ability to route an incoming packet on one composite link out the other composite link after receiving the second byte of the packet. This produces a minimal delay for higher priority packets going through intermediate multiplexers on the network which assures quality and integrity of high priority data.
Demodulating of Facsimile Information
[0186] The transmission of facsimile information is performed by demodulating the fax transmissions, sending only the facsimile image packets over the multiplexed composite link and remodulating the facsimile signals at the remote site for transmission over an analog telephone line to a remote facsimile machine. The demodulating and remodulating of the facsimile image packets by the present invention is transparent to the facsimile machines except that certain proprietary facsimile protocols are suppressed by the stripping off the proprietary information from the facsimile header packets. The facsimile tone is demodulated in the digital domain by DSP 620 and the facsimile data is placed in a data packet similar to the voice data packet described above in Table 2 except the header of the packet distinguishes between voice data and facsimile data.
CONCLUSION
[0187] 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 of variations of the present invention. Therefore, it is manifestly intended that this invention be limited only by the claims and the equivalents thereof.
Claims
We claim:
1. A multiplexer, comprising:
a local area network (LAN) data interface means;
collection means for collecting LAN data from the LAN data interface means, and for producing therefrom collected LAN data packets;
a telephone interface means for receiving voice band signals;
conversion means for converting the voice band signals into digital samples;
compression means for compressing and encoding the digital samples and for producing therefrom compressed digital voice data;
means for placing the compressed digital voice data into compressed digital voice data packets;
multiplexer means connected for receiving the collected LAN data packets, for receiving the compressed digital voice data packets and for multiplexing the collected LAN data packets and the compressed digital voice data packets into a data stream; and
means for transmitting the data stream.
2. The multiplexer of claim 1, wherein the data stream includes a synchronous data stream.
3. The multiplexer of claim 1, wherein the telephone interface means is further operable for receiving facsimile data and the multiplexer means is further operable for receiving the facsimile data and for multiplexing the collected LAN data packets, the compressed digital voice data packets and the facsimile data into a data stream.
4. The multiplexer of claim 3, wherein the data stream includes a synchronous data stream.
5. The multiplexer of claim 1, wherein the telephone interface means further includes a PBX interface means for connecting to a PBX for exchange of voice or facsimile signals.
6. A method comprising:
receiving analog voice information signals;
digitizing the analog voice information signals to produce digital voice information;
compressing the digital voice information to produce compressed voice information packets;
collecting local area network (LAN) data and producing therefrom LAN data packets;
multiplexing the compressed voice information packets with the LAN data packets to produce a data stream; and
sending the data stream over a composite link.
7. The method of claim 6, wherein multiplexing the compressed voice information packets with the LAN data packets to produce a data stream includes multiplexing the compressed voice information packets with the LAN data packets to produce a synchronous data stream.
8. A multiplexed information network, comprising:
a first multiplexer having a first telephone line interface, a first local area network (LAN) data port, a first data processor connected for receiving LAN data from the first LAN data port and for placing the LAN data into LAN data packets each having separate headers, a first voice channel circuit means connected for receiving voice signals from the first telephone line interface and for digitizing and compressing the voice signals into compressed voice packets each having separate headers, the first data processor further operable for receiving the compressed voice packets from the voice channel circuit means and for multiplexing the LAN data packets and the compressed voice packets into a data stream, and the first data processor further connected to a first line interface for transmitting the data stream;
a second multiplexer having a second telephone line interface, a second LAN data port, a second data processor connected to a second line interface for receiving the data stream, the second data processor operable for demultiplexing the data stream to reproduce the LAN data packets and the compressed voice packets and for sending the compressed voice packets to a second voice channel circuit means, the second data processor further operable for removing the LAN data from the LAN data packets and for sending the LAN data to the second LAN data port, the second voice channel circuit means operable for decompressing and decoding the compressed voice packets to reproduce the voice signals and connected for sending the voice signals to the second telephone line interface; and
a composite link connected between the first line interface of the first multiplexer and the second line interface of the second multiplexer.
9. The network of claim 8, wherein the first telephone line interface of the first multiplexer is connected to a PBX and wherein the second telephone line interface of the second multiplexer is connected to a telephone.
10. The network of claim 8, wherein the first telephone line interface of the first multiplexer is connected to a PBX and wherein the second telephone line interface of the second multiplexer is connected to a PBX.
11. The network of claim 8, wherein the first telephone line interface of the first multiplexer is connected to a telephone and wherein the second telephone line interface of the second multiplexer is connected to a telephone.
12. The network of claim 8, wherein the composite link is an analog network link.
13. The network of claim 8, wherein the composite link is a digital network link.
14. The network of claim 8, wherein the composite link is an analog telephone line.
15. The network of claim 8, wherein the composite link is an analog leased line.
16. The network of claim 8, wherein the composite link is a public telephone line.
17. The network of claim 8, wherein the composite link is a private leased line.
18. The network of claim 8, wherein the composite link is a digital line.
19. The network of claim 8, wherein the first multiplexer comprises:
means for determining a link speed between the first multiplexer and the second multiplexer;
means for selecting a time interval for sending high priority data packets each having a header;
means for dynamically assigning a packet size for a low priority data packet having a header with the packet size for the low priority data packet limited in length based upon the link speed and the time interval; and
means for sending as many low priority data packets as will fit between the sending of high priority data packets within the time interval for sending high priority packets.
20. A multiplexer, comprising:
means for transmitting the data stream.
a local area network (LAN) data interface;
collection means for collecting LAN data from the LAN data interface, and for producing therefrom collected LAN data packets each having a header;
a telephone interface for receiving voice band signals;
conversion means for converting the voice band signals into digital samples;
compression means for compressing and encoding the digital samples and for producing therefrom compressed digital voice data;
means for placing the compressed digital voice data into compressed digital voice data packets each having headers;
multiplexer means connected for receiving the collected LAN data packets for receiving the compressed digital voice data packets and for multiplexing the collected LAN data packets and the compressed digital voice data packets into a data stream, the multiplexer means including:
means for determining a link speed between the multiplexer and a second site;
means for selecting a time interval for sending high priority data packets each having a header;
means for dynamically assigning a packet size for a low priority data packet having a header with the packet size for the low priority data packet limited in length based upon the link speed and the time interval; and
means for sending as many low priority data packets as will fit between the sending of high priority data packets within the time interval for sending high priority packets; and
21. The multiplexer of claim 20, wherein the data stream includes a synchronous data stream.
22. The multiplexer of claim 20, wherein the telephone interface is further operable for receiving facsimile data and the multiplexer means is further operable for receiving the facsimile data and for multiplexing the collected LAN data packets, the compressed digital voice data packets and the facsimile data into a data stream.
23. The multiplexer of claim 22, wherein the data stream includes a synchronous data stream.
24. The multiplexer of claim 20, wherein the telephone interface further includes PBX interface means for connecting to a PBX for exchange of voice or facsimile signals.
Patent Citations (292)
| Patent | Date | Inventor | Cited By |
|---|---|---|---|
| US3304372(A) | 1967-02-01 | Filipowsky et al. | Applicant |
| US3781818(A) | 1973-12-01 | Pardoe et al. | Applicant |
| US3789165(A) | 1974-01-01 | Campanella et al. | Applicant |
| US3904830(A) | 1975-09-01 | Every, Sr. et al. | Applicant |
| US3973081(A) | 1976-08-01 | Hutchins | Applicant |
| US3973089(A) | 1976-08-01 | Puckette | Applicant |
| US3997732(A) | 1976-12-01 | Every, Sr. et al. | Applicant |
| US4074081(A) | 1978-02-01 | Humm | Applicant |
| US4100377(A) | 1978-07-01 | Flanagan | Applicant |
| US4107471(A) | 1978-08-01 | Reed | Applicant |
| US4205202(A) | 1980-05-01 | Kahn | Applicant |
| US4284850(A) | 1981-08-01 | Chingelpeel | Applicant |
| US4295292(A) | 1981-10-01 | Kahn | Applicant |
| US4320265(A) | 1982-03-01 | Biggiogera et al. | Applicant |
| US4354273(A) | 1982-10-01 | Araseki et al. | Applicant |
| US4355388(A) | 1982-10-01 | Deal, Jr. | Applicant |
| US4377860(A) | 1983-03-01 | Godbole | Applicant |
| US4380687(A) | 1983-04-01 | Stewart | Applicant |
| US4403322(A) | 1983-09-01 | Kato et al. | Applicant |
| US4425512(A) | 1984-01-01 | Tomooka et al. | Applicant |
| US4425661(A) | 1984-01-01 | Moses et al. | Applicant |
| US4445213(A) | 1984-04-01 | Baugh et al. | Applicant |
| US4446555(A) | 1984-05-01 | Devault et al. | Applicant |
| US4447675(A) | 1984-05-01 | Arntsen et al. | Applicant |
| US4476559(A) | 1984-10-01 | Brolin et al. | Applicant |
| US4479195(A) | 1984-10-01 | Herr et al. | Applicant |
| US4479213(A) | 1984-10-01 | Galand et al. | Applicant |
| US4495620(A) | 1985-01-01 | Steele et al. | Applicant |
| US4500987(A) | 1985-02-01 | Hasegawa | Applicant |
| US4524244(A) | 1985-06-01 | Faggin et al. | Applicant |
| US4528425(A) | 1985-07-01 | Melindo et al. | Applicant |
| US4531023(A) | 1985-07-01 | Levine | Applicant |
| US4534024(A) | 1985-08-01 | Maxemchuk et al. | Applicant |
| US4546212(A) | 1985-10-01 | Crowder, Sr. | Applicant |
| US4549291(A) | 1985-10-01 | Renoulin et al. | Applicant |
| US4555599(A) | 1985-11-01 | Hackett-jones et al. | Applicant |
| US4578537(A) | 1986-03-01 | Faggin et al. | Applicant |
| US4587651(A) | 1986-05-01 | Nelson et al. | Applicant |
| US4593389(A) | 1986-06-01 | Wurzburg et al. | Applicant |
| US4597101(A) | 1986-06-01 | Kishimoto et al. | Applicant |
| US4598397(A) | 1986-07-01 | Nelson et al. | Applicant |
| US4609788(A) | 1986-09-01 | Miller et al. | Applicant |
| US4610022(A) | 1986-09-01 | Kitayama et al. | Applicant |
| US4622680(A) | 1986-11-01 | Zinser | Applicant |
| US4629829(A) | 1986-12-01 | Puhl et al. | Applicant |
| US4649548(A) | 1987-03-01 | Crane | Applicant |
| US4652703(A) | 1987-03-01 | Lu et al. | Applicant |
| US4653086(A) | 1987-03-01 | Laube | Applicant |
| US4660218(A) | 1987-04-01 | Hashimoto | Applicant |
| US4670874(A) | 1987-06-01 | Sato et al. | Applicant |
| US4697281(A) | 1987-09-01 | O'sullivan | Applicant |
| US4700341(A) | 1987-10-01 | Huang | Applicant |
| US4707831(A) | 1987-11-01 | Weir et al. | Applicant |
| US4718082(A) | 1988-01-01 | Parker et al. | Applicant |
| US4740963(A) | 1988-04-01 | Eckley | Applicant |
| US4750169(A) | 1988-06-01 | Carse et al. | Applicant |
| US4751510(A) | 1988-06-01 | Desaint Michel et al. | Applicant |
| US4751736(A) | 1988-06-01 | Gupta et al. | Applicant |
| US4757527(A) | 1988-07-01 | Beniston et al. | Applicant |
| US4760595(A) | 1988-07-01 | Arai | Applicant |
| US4761646(A) | 1988-08-01 | Choquet et al. | Applicant |
| US4761781(A) | 1988-08-01 | Calvignac et al. | Examiner |
| US4764955(A) | 1988-08-01 | Galand et al. | Applicant |
| US4771425(A) | 1988-09-01 | Baran et al. | Examiner |
| US4794595(A) | 1988-12-01 | Ohyama | Applicant |
| US4804957(A) | 1989-02-01 | Selph | Applicant |
| US4807250(A) | 1989-02-01 | Tanaka | Applicant |
| US4809271(A) | 1989-02-01 | Kondo et al. | Applicant |
| US4813040(A) | 1989-03-01 | Futato | Applicant |
| US4827085(A) | 1989-05-01 | Yaniv et al. | Applicant |
| US4835765(A) | 1989-05-01 | Bergmans et al. | Applicant |
| US4839802(A) | 1989-06-01 | Wonak et al. | Applicant |
| US4845746(A) | 1989-07-01 | Li | Applicant |
| US4847900(A) | 1989-07-01 | Wakim | Applicant |
| US4862449(A) | 1989-08-01 | Hoefkens et al. | Applicant |
| US4864559(A) | 1989-09-01 | Perlman | Applicant |
| US4866732(A) | 1989-09-01 | Carey et al. | Applicant |
| US4873715(A) | 1989-10-01 | Shibata | Applicant |
| US4884264(A) | 1989-11-01 | Servel et al. | Applicant |
| US4887265(A) | 1989-12-01 | Felix | Applicant |
| US4890282(A) | 1989-12-01 | Lambert et al. | Applicant |
| US4890316(A) | 1989-12-01 | Walsh et al. | Applicant |
| US4901333(A) | 1990-02-01 | Hodgkiss | Applicant |
| US4905282(A) | 1990-02-01 | Mcglynn et al. | Applicant |
| US4912756(A) | 1990-03-01 | Hop | Applicant |
| US4912758(A) | 1990-03-01 | Arbel | Applicant |
| US4914650(A) | 1990-04-01 | Sriram | Applicant |
| US4926416(A) | 1990-05-01 | Weik | Applicant |
| US4926448(A) | 1990-05-01 | Kraul et al. | Applicant |
| US4932048(A) | 1990-06-01 | Kenmochi et al. | Applicant |
| US4935954(A) | 1990-06-01 | Thompson et al. | Applicant |
| US4942569(A) | 1990-07-01 | Maeno | Applicant |
| US4953210(A) | 1990-08-01 | Mcglynn et al. | Applicant |
| US4965789(A) | 1990-10-01 | Bottau et al. | Applicant |
| US4972457(A) | 1990-11-01 | O'Sullivan | Applicant |
| US4972462(A) | 1990-11-01 | Shibata | Applicant |
| US4972483(A) | 1990-11-01 | Carey | Applicant |
| US4977591(A) | 1990-12-01 | Chen et al. | Applicant |
| US4987586(A) | 1991-01-01 | Gross et al. | Applicant |
| US4991169(A) | 1991-02-01 | Davis et al. | Applicant |
| US4993022(A) | 1991-02-01 | Kondo et al. | Applicant |
| US4995059(A) | 1991-02-01 | Ishikawa | Applicant |
| US4996706(A) | 1991-02-01 | Cho | Applicant |
| US4998241(A) | 1991-03-01 | Brox et al. | Applicant |
| US5001710(A) | 1991-03-01 | Gawrys et al. | Applicant |
| US5001745(A) | 1991-03-01 | Pollock | Applicant |
| US5005183(A) | 1991-04-01 | Carey et al. | Applicant |
| US5008901(A) | 1991-04-01 | Wallach et al. | Applicant |
| US5008926(A) | 1991-04-01 | Misholi | Applicant |
| US5014232(A) | 1991-05-01 | Andre | Applicant |
| US5020058(A) | 1991-05-01 | Holden et al. | Applicant |
| US5025443(A) | 1991-06-01 | Gupta | Applicant |
| US5036513(A) | 1991-07-01 | Greenblatt | Applicant |
| US5044010(A) | 1991-08-01 | Frenkiel et al. | Applicant |
| US5046188(A) | 1991-09-01 | Molnar | Applicant |
| US5051720(A) | 1991-09-01 | Kittirutsunetorn | Applicant |
| US5054055(A) | 1991-10-01 | Hanle et al. | Applicant |
| US5062133(A) | 1991-10-01 | Melrose | Applicant |
| US5065425(A) | 1991-11-01 | Lecomte et al. | Applicant |
| US5081647(A) | 1992-01-01 | Bremer | Applicant |
| US5083310(A) | 1992-01-01 | Drory | Applicant |
| US5086471(A) | 1992-02-01 | Tanaka et al. | Applicant |
| US5099472(A) | 1992-03-01 | Townsend et al. | Applicant |
| US5107519(A) | 1992-04-01 | Ishikawa | Applicant |
| US5115429(A) | 1992-05-01 | Hluchyj et al. | Applicant |
| US5121385(A) | 1992-06-01 | Tominaga et al. | Applicant |
| US5127001(A) | 1992-06-01 | Steagall et al. | Applicant |
| US5127041(A) | 1992-06-01 | O'Sullivan | Applicant |
| US5127046(A) | 1992-06-01 | Malm | Applicant |
| US5130985(A) | 1992-07-01 | Kondo et al. | Applicant |
| US5132966(A) | 1992-07-01 | Hayano et al. | Applicant |
| USRE34034(E) | 1992-08-01 | O'Sullivan | Applicant |
| US5136586(A) | 1992-08-01 | Greenblatt | Applicant |
| US5138662(A) | 1992-08-01 | Amano et al. | Applicant |
| US5146470(A) | 1992-09-01 | Fujii et al. | Applicant |
| US5150410(A) | 1992-09-01 | Bertrand | Applicant |
| US5151937(A) | 1992-09-01 | Chujo et al. | Applicant |
| US5153897(A) | 1992-10-01 | Sumiyoshi et al. | Applicant |
| US5162812(A) | 1992-11-01 | Aman et al. | Applicant |
| US5164982(A) | 1992-11-01 | Davis | Applicant |
| US5177734(A) | 1993-01-01 | Cummiskey et al. | Applicant |
| US5182762(A) | 1993-01-01 | Shirai et al. | Applicant |
| US5187591(A) | 1993-02-01 | Guy et al. | Applicant |
| US5187692(A) | 1993-02-01 | Haneda et al. | Applicant |
| US5193110(A) | 1993-03-01 | Jones et al. | Applicant |
| US5195130(A) | 1993-03-01 | Weiss et al. | Applicant |
| US5206900(A) | 1993-04-01 | Callele | Applicant |
| US5208812(A) | 1993-05-01 | Dudek et al. | Applicant |
| US5208850(A) | 1993-05-01 | Kino | Applicant |
| US5214656(A) | 1993-05-01 | Chung et al. | Applicant |
| US5227876(A) | 1993-07-01 | Cucchi et al. | Applicant |
| US5228026(A) | 1993-07-01 | Albrow et al. | Applicant |
| US5233660(A) | 1993-08-01 | Chen | Applicant |
| US5235595(A) | 1993-08-01 | O'Dowd | Applicant |
| US5247591(A) | 1993-09-01 | Baran | Applicant |
| US5249218(A) | 1993-09-01 | Sainton | Applicant |
| US5258983(A) | 1993-11-01 | Lane et al. | Applicant |
| US5261027(A) | 1993-11-01 | Taniguchi et al. | Applicant |
| US5263019(A) | 1993-11-01 | Chu | Applicant |
| US5272695(A) | 1993-12-01 | Makino et al. | Applicant |
| US5276703(A) | 1994-01-01 | Budin et al. | Applicant |
| US5278900(A) | 1994-01-01 | Van Gerwen et al. | Applicant |
| US5280479(A) | 1994-01-01 | Mary | Applicant |
| US5282197(A) | 1994-01-01 | Kreitzer | Applicant |
| US5283638(A) | 1994-02-01 | Engberg et al. | Applicant |
| US5283819(A) | 1994-02-01 | Glick et al. | Applicant |
| US5289539(A) | 1994-02-01 | Maruyama | Applicant |
| US5295136(A) | 1994-03-01 | Ashley et al. | Applicant |
| US5297203(A) | 1994-03-01 | Rose et al. | Applicant |
| US5301246(A) | 1994-04-01 | Archibald et al. | Applicant |
| US5305312(A) | 1994-04-01 | Fornek et al. | Applicant |
| US5307413(A) | 1994-04-01 | Denzer | Applicant |
| US5309562(A) | 1994-05-01 | Li | Applicant |
| US5313498(A) | 1994-05-01 | Sano | Applicant |
| US5317604(A) | 1994-05-01 | Osterweil | Applicant |
| US5319682(A) | 1994-06-01 | Clark | Applicant |
| US5327520(A) | 1994-07-01 | Chen | Applicant |
| US5329472(A) | 1994-07-01 | Sugiyama | Applicant |
| US5333196(A) | 1994-07-01 | Jakab | Applicant |
| US5341374(A) | 1994-08-01 | Lewen et al. | Applicant |
| US5343473(A) | 1994-08-01 | Cidon et al. | Applicant |
| US5343521(A) | 1994-08-01 | Jullien et al. | Applicant |
| US5347572(A) | 1994-09-01 | Avni | Applicant |
| US5355365(A) | 1994-10-01 | Bhat et al. | Applicant |
| US5355406(A) | 1994-10-01 | Chencinski et al. | Applicant |
| US5365577(A) | 1994-11-01 | Davis et al. | Applicant |
| US5371853(A) | 1994-12-01 | Kao et al. | Applicant |
| US5377260(A) | 1994-12-01 | Long | Applicant |
| US5379292(A) | 1995-01-01 | Kurata et al. | Applicant |
| US5379340(A) | 1995-01-01 | Overend et al. | Applicant |
| US5381412(A) | 1995-01-01 | Otani | Applicant |
| US5384780(A) | 1995-01-01 | Lomp et al. | Applicant |
| USH1413(H) | 1995-02-01 | Gunn | Applicant |
| US5388150(A) | 1995-02-01 | Schneyer et al. | Applicant |
| US5390239(A) | 1995-02-01 | Morris et al. | Applicant |
| US5390250(A) | 1995-02-01 | Janse et al. | Applicant |
| US5402474(A) | 1995-03-01 | Miller et al. | Applicant |
| US5406557(A) | 1995-04-01 | Baudion | Applicant |
| US5406560(A) | 1995-04-01 | Kondo et al. | Applicant |
| US5408401(A) | 1995-04-01 | Miyazaki | Applicant |
| US5408522(A) | 1995-04-01 | Ikehata et al. | Applicant |
| US5414773(A) | 1995-05-01 | Handelman | Applicant |
| US5414796(A) | 1995-05-01 | Jacobs et al. | Applicant |
| US5416776(A) | 1995-05-01 | Panzarella et al. | Applicant |
| US5425089(A) | 1995-06-01 | Chan et al. | Applicant |
| US5438614(A) | 1995-08-01 | Rozman et al. | Applicant |
| US5440547(A) | 1995-08-01 | Easki et al. | Applicant |
| US5440698(A) | 1995-08-01 | Sindhu et al. | Applicant |
| US5440717(A) | 1995-08-01 | Bosshart | Applicant |
| US5444704(A) | 1995-08-01 | Henderson et al. | Applicant |
| US5444770(A) | 1995-08-01 | Davis et al. | Applicant |
| US5448555(A) | 1995-09-01 | Bremer et al. | Applicant |
| US5452289(A) | 1995-09-01 | Sharma et al. | Applicant |
| US5453986(A) | 1995-09-01 | Davis et al. | Applicant |
| US5457601(A) | 1995-10-01 | Georgopulos et al. | Applicant |
| US5463616(A) | 1995-10-01 | Kruse et al. | Applicant |
| US5465267(A) | 1995-11-01 | Todoroki | Applicant |
| US5471470(A) | 1995-11-01 | Sharma et al. | Applicant |
| US5472351(A) | 1995-12-01 | Greco et al. | Applicant |
| US5473676(A) | 1995-12-01 | Frick et al. | Applicant |
| US5479407(A) | 1995-12-01 | Ko et al. | Applicant |
| US5479475(A) | 1995-12-01 | Grob et al. | Applicant |
| US5481562(A) | 1996-01-01 | Pearson et al. | Applicant |
| US5483576(A) | 1996-01-01 | Staples | Applicant |
| US5490060(A) | 1996-02-01 | Malec et al. | Applicant |
| US5493609(A) | 1996-02-01 | Winseck, Jr. et al. | Applicant |
| US5506868(A) | 1996-04-01 | Cox et al. | Applicant |
| US5506900(A) | 1996-04-01 | Fritz | Applicant |
| US5515398(A) | 1996-05-01 | Walsh et al. | Applicant |
| US5521975(A) | 1996-05-01 | Hashimoto | Applicant |
| US5526423(A) | 1996-06-01 | Ohuchi et al. | Applicant |
| US5532898(A) | 1996-07-01 | Price | Applicant |
| US5535204(A) | 1996-07-01 | Li | Applicant |
| US5546448(A) | 1996-08-01 | Caswell et al. | Applicant |
| US5600649(A) | 1997-02-01 | Sharma et al. | Applicant |
| US5619508(A) | 1997-04-01 | Davis et al. | Applicant |
| US5631745(A) | 1997-05-01 | Wong et al. | Applicant |
| US5644629(A) | 1997-07-01 | Chow | Applicant |
| US5675640(A) | 1997-10-01 | Tappert et al. | Applicant |
| US5682386(A) | 1997-10-01 | Arimilli et al. | Examiner |
| US5699410(A) | 1997-12-01 | Imamura et al. | Applicant |
| US5699417(A) | 1997-12-01 | Khojasteh | Applicant |
| US5699418(A) | 1997-12-01 | Jones | Applicant |
| US5745558(A) | 1998-04-01 | Richardson, Jr. et al. | Applicant |
| US6009082(A) | 1999-12-01 | Caswell et al. | Applicant |
| US6151333(A) | 2000-11-01 | Arimilli et al. | Examiner |
| CA2104701 | 1994-07-01 | Applicant | |
| DE3504064 | 1986-08-01 | Applicant | |
| DE3630469 | 1988-03-01 | Applicant | |
| DE3409532 | 1989-04-01 | Applicant | |
| DE3490532 | 1989-04-01 | Applicant | |
| EP364866 | 1990-04-01 | Applicant | |
| EP429054 | 1991-05-01 | Applicant | |
| EP443548 | 1991-08-01 | Applicant | |
| EP488685 | 1992-06-01 | Applicant | |
| EP488865 | 1992-06-01 | Applicant | |
| EP510411 | 1992-10-01 | Applicant | |
| EP526104 | 1993-02-01 | Applicant | |
| EP582537 | 1994-02-01 | Applicant | |
| EP581528 | 1994-05-01 | Applicant | |
| EP614305 | 1994-09-01 | Applicant | |
| EP630141 | 1994-12-01 | Applicant | |
| EP650286 | 1995-04-01 | Applicant | |
| GB2210237 | 1989-06-01 | Applicant | |
| GB2260670 | 1993-04-01 | Applicant | |
| GB2268663 | 1994-01-01 | Applicant | |
| JP59044140 | 1984-03-01 | Applicant | |
| JP59-081947 | 1984-05-01 | Applicant | |
| JP59-044140 | 1984-07-01 | Applicant | |
| JP63-019951 | 1988-01-01 | Applicant | |
| JP63-124658 | 1988-05-01 | Applicant | |
| JP63-054052 | 1988-08-01 | Applicant | |
| JP64-068052 | 1989-03-01 | Applicant | |
| JP1198144 | 1989-08-01 | Applicant | |
| JP2-034077 | 1990-02-01 | Applicant | |
| JP193489 | 1990-07-01 | Applicant | |
| JP257748 | 1990-10-01 | Applicant | |
| JP2246941 | 1990-10-01 | Applicant | |
| JP3-009643 | 1991-01-01 | Applicant | |
| JP3-153152 | 1991-07-01 | Applicant | |
| JP3162052 | 1991-07-01 | Applicant | |
| JP3-162052 | 1991-07-01 | Applicant | |
| JP3-237853 | 1991-10-01 | Applicant | |
| JP3-280797 | 1991-12-01 | Applicant | |
| JP4-319847 | 1992-11-01 | Applicant | |
| WO91/07044 | 1991-05-01 | Applicant | |
| WO91/15067 | 1991-10-01 | Applicant | |
| WO92/06550 | 1992-04-01 | Applicant | |
| WO92/20028 | 1992-11-01 | Applicant | |
| WO93/11643 | 1993-06-01 | Applicant | |
| WO93/22869 | 1993-11-01 | Applicant | |
| WO94/26056 | 1994-11-01 | Applicant |
Non-Patent Literature (74)
- U.S. Patent Application Serial No. 08/338,340, filing date Nov. 10, 1994, entitled: Computer-Based Multifunctional Personal Communication System With Caller ID.Applicant
- AT&T Moden Designer's Guide, AT&T Microelectroncis, (Oct. 25, 1993).Applicant
- Bellcore Technical Reference TR-NWT-000030, Issue 2, (Oct. 1992).Applicant
- Copy of European Search Report (Application No. EP 94304742), completed Jun. 8, 1995 by Examiner Mikkelsen.Applicant
- European Search Report for Application No. EP 93403164 completed on Sep. 21, 1995 by Examiner Lambley; 4 pages.Applicant
- IBM Technical Disclosure Bulletin.Applicant
- Rockwell Application Note, Doc No. 29800N73, Order No. 873, (Oct. 1991).Applicant
- U.S. West Caller ID, 1 p., (Jul. 18, 1994).Applicant
- “Radish System Lets Phone Users Send Voice, Data Simultaneously”, PC Week, 9(19), pp. 53, (May 11, 1992).Applicant
- “Telewriting Terminal Equipment”, CCITT, Recommendation T. 150, (1988).Applicant
- “***PICFON Card Brochure”, Specom Technologies Corp., (Published Prior to Applicant's Invention).Applicant
- “A Family of 2-Wire, Duplex Modems Operating at Data Signalling Rates”, CCITT, V.32, Facsimile Recommendation, (1988).Applicant
- “Applications of the MT8841 Calling Number Identification Circuit”, Mitel Microelectronics Digital/Analog Communications Handbook, Doc. No. 9161-001-060-NA, Issue 1 , pp. 12-307, (1993).Applicant
- “AT&T Microelectronics T7540 Digital Telephone CODEC Data Sheet and Addedendum”, pp. 1-4, (Jul. 1991).Applicant
- “AT&T Microelectronics T7540 Digital Telephone CODEC Preliminary Data Sheet”, pp. 1-64, (Jan. 1991).Applicant
- “AT&T Microelectronics, High-Speed Data Pump Chip Sets”, 1-91 & F1-F20, (Dec. 1991).Applicant
- “AT&T Microelectronics, WE DSP16C Digital Signal Processor/C0DEC Preliminary Data Sheet”, 1-63, (May 1991).Applicant
- “Canadian Application No. 2,104,701, Computer-Based Multifunction Personal Communications System”, 52 sheets of drawing, 1-104, (Jul. 9, 1994).Applicant
- CCITT V.42, “Error-Correcting Procedures for DCES Using Asynchronous-to-Synchronous Conversion”, 296-370, (1988).Applicant
- “Combined Use of Collision-Resolution and Collision-Avoidance Media-Access Communication Protocols”, IBM Technical Disclosure Bulletin, 37, 299-301, (Oct. 1994).Applicant
- “Communications for the Information Age”, IEEE Global Telecommunications Conference & Exhibition, 1 of 3, pp. 34-36, (Nov. 28-Dec. 1).Applicant
- “Computer-Based Multifunction Personal Communications System”, Canadian Application No. 2,104,701, 1-105 and 52 drawing, (Jul. 9, 1994).Applicant
- “Copy of European Search Report (Application No. EP 94304742)”, Copy of European Search Report (Application No. EP 94304742), completed Jun. 8, 1995 by Examiner Mikkelsen.Applicant
- “Copy of European Search Report by S. Lambley for Application No. EP 93403164”, 5 pages, (Apr. 18, 1996).Applicant
- “Copy of PCT Search Report”, by C. Canosa Areste for Application No. PCT/US 95/14253, 6 pages, (May. 24, 1996).Applicant
- “Copy of PCT Search Report by Areste Canosa For Application No. PCT/US95/05034”, 8 pages, (Apr. 25, 1996).Applicant
- “Copy of PCT Search Report by C. Canosa Areste for Application No. PCT/US95/14253”, 6 pages, (May 24, 1996).Applicant
- “Copy of PCT Search Report by J. Lange for Application No. PCT/US95/14826”, 7 pages, (Apr. 10, 1996).Applicant
- “Copy of PCT Search Report by M. Vandevenne for Application No. PCT/US95/14829”, 8 pages, (Mar. 28, 1996).Applicant
- “Data Communication Over the Telephone Network”, CCITT Blue Book, vol. VIII, (1989).Applicant
- “Error-Correcting Procedures for DCES Using Asynchronous-to-Synchronous Conversion”, CCITT V. 42, vol. VIII, pp. 296-370, (1988).Applicant
- “European Search Report for Application No. EP 93403164”, Completed onSep. 21, 1995 by Examiner Lambley; 4 pages.Applicant
- “Method and Apparatus for the Statistical Multiplexing of Voice, Data, and Image Signals”, IBM Technical Disclosure Bulletin, 35, pp. 409-411, (Nov. 1991).Applicant
- “Mitel MT8841 Calling Number Identification Circuit”, Mitel Microelectronics Digital/Analog Communications Handbook, Doc. No. 9161-952-007-NA, Issue 9, pp. 8-93-8-102, (1993).Applicant
- “Mitsubishi Still Color Picture TV Phone”, Techno Japan, 23, 6, (Jun. 1990).Applicant
- “MultiX25-X.25 Pad, The New MultiX25 Pad 8 Port X.25 Packet Assembler/Disassembler for Public and Private Data Networks”, MultiTech Systems.Applicant
- “Pen Telephone Brochure”, Shimadzu, Published Prior to Applicants's Invention.Applicant
- “PICFON Card Brochure”, Specom Technologies Corp., Published Prior to Applicants Invention.Applicant
- “Radish System Lets Phone Users Send Voice Data Simultaneously”, PC Week, 9, 19, 53, (May 11, 1992).Applicant
- “Speech Data Adaptive Multiplexer”, IBM Technical Disclosure Bulletin, vol. 27, No. 2, 969, (Jul. 1994).Applicant
- “TechTips—A Periodic Round-up of Technical Applciations, Notes, and Information on MultiTech's Data Communications Products”, MultiTech Systems, vol. 2, No. 2, May 1992.Applicant
- “Telewriter Product Description”, Optel Communication, Inc., (Published Prior to Applicant's Invention).Applicant
- “Telewriting Terminal Equipment”, CCITT, (Recommendation T. 150), pp. 228-277, (1988).Applicant
- “The Photophone”, (Product Brochure0 GTE, (Feb. 15, 1990).Applicant
- “Videowriter ′91 Product Description”, Optel Communications, Inc., (1991).Applicant
- “WE DSP 16C Digital Signal Processor/CODEC Preliminary Data Sheet”, AT& T Microelectronics, 1-64, (May 1991).Applicant
- “WE DSP 16C Digital Signal Processor/CODEC Preliminary Data Sheet”, AT& T Microelectronics, 32 pages, published in May, 1991.Applicant
- “Z84C01 Z80 CPU with Clock Generator/Controler”, Zilog Intelligent Peripheral Controllers, pp. 43-73, (1991).Applicant
- “Z84C90 CMOS Z80 KIO Serial/Parallel/counter/timer”, Zilog Intelligent Peripheral Controllers, pp. 205-224, (1991).Applicant
- “Z85C01 Z10 CPU with Clock Generator/Controller”, Zilog Intelligent Peripheral Controllers, pp. 43-73, published in 1991.Applicant
- “Zilog Intelligent Perpheral Controllers, Z84C01 Z80 CPU with Clock Generator/Controller”, pp. 43-73, (1991).Applicant
- “Zilog Intelligent Perpheral Controllers, Z84C90 CMOS Z80 KI0 Serial/Parallel/Counter/Timer”, pp. 205-224, (1991).Applicant
- Akaiwa, Y., et al., “An Integrated Voice and Data Radio Access System”, IEEE, pp. 255-258, (1992).Applicant
- Callens, P., et al., “Speech Data Adaptive Multiplexer”, IBM Technical Disclosure Bull., 27, p. 969, (Jul. 1984).Applicant
- Casale, et al., “Statistical voice/high speed data multiplexing on a 64 kbit/s channel”, Phoenix Conference on Computers and Communications, Scottsdale, AZ, pp. 459-464, (Mar. 27, 1991).Applicant
- Cuperman, V., et al., “Backward Adaptive Configurations For Low-Delay Vector Excitation Coding”, Advances In Speech Coding, pp. 13-23, (Jan. 1, 1996).Applicant
- Erskine, C., et al., “VoicePump: voice-Over-Data Modem Technology Utilizing ASM-CELP Speech Compression at 4800, 7200 and 9600 Bits Per Second”, Proceedings of the International Conference on Signal Processing Applications and Technology, 2, pp. 1425-1429, (Sep. 28, 1993).Applicant
- Gulick, et al., “Interface the ISDN to your PC with a Voice/Data Board”, Electronic Design, 35 (29), pp. 85-88, (Dec. 10, 1987).Applicant
- Kishimoto, et al., “Simultaneous Transmission of Voice and Handwriting Signals: Sketchphone System”, IEEE Transaction on Communication, COM-29, 12, pp. 1982-1986, (Dec. 1981).Applicant
- Komiya, et al., “An approach to the multifunction graphic terminal for the ISDN environment”, IEEE Global Telecommunications Conference and Exhibition, 1 , Hollywood, FL, pp. 32-36, (Nov. 28, 1988).Applicant
- Laube, M., “Audiographic Terminal”, Electrical Communication, 60 (1), (1986).Applicant
- Mikkelsen, “Copy of European Search Report (Application No. EP 94304742)”, Completed Jun. 8, 1995.Applicant
- Mikkelsen, C., “International search Report for PCT Application Serial No. PCT/US 95/07720”, 3.Applicant
- Mikkelsen, C., Copy of PCT Search Report for Application Serial No. PCT/US11313, 4.Applicant
- Mills, J.D., et al., “A Data and Voice System for the General Service Telephone Network”, Proceedings of the International Conference on Industrial Electronics, Control, and Instrumentation, pp. 1143-1148, (Nov. 1987).Applicant
- Noerpel, A.R., et al., “Radio Link Access Procedure for a Wireless Access Communications System”, IEEE, 2, pp. 1111-1115, (1994).Applicant
- Pierce, Jr., G.A., “Don't Just Tell Them, Show Them!”, Automation, (Aug. 1990).Applicant
- Radcliffe, M., “Video Calls Use Basic Phone Lines”, MacWeek, (Aug. 3, 1992).Applicant
- Sasaki, et al., “Variable rate voice coding system”, MILCOM 92, 1, San Diego, CA, pp. 364-367, (Oct. 11, 1992).Applicant
- Shimadzu, “Pen Telephone Brochure”, (Published Prior to Applicant's Invention).Applicant
- Smith, R., “Writs TVs Still Fiction, but Police Videophones Take Hold”, TE&M, (Dec. 15, 1987).Applicant
- Spragins, J.D., et al., “Telecommunications—Protocols and Design”, Communications Equipment Interface Design, Chapter 4, Addison-Wesley Publishing Company, pp. 156, 304 & 327, (1991).Applicant
- Stallings, W., “Protocols and Architecture”, Data and Computer Communications, 2nd Edition, pp. 100-103, (1988).Applicant
- Tominaga, et al., “Comparison of Coding Schemes for Telewriting Systems”, ICCC, (1986).Applicant