A method for dynamically changing the polling process of a single microprocessor within a modem. An additional step is added into the main polling loop that checks the amount of data in the transmit and receive buffers. If one buffer is empty, additional polling cycles are performed to service the other buffer. The number of additional cycles is dependent on how full the buffer is. If both buffers contain data, no change is made in the polling process and both are serviced with equal priority.

Patent
   5301274
Priority
Aug 19 1991
Filed
Aug 19 1991
Issued
Apr 05 1994
Expiry
Aug 19 2011
Assg.orig
Entity
Small
10
19
EXPIRED
1. A modem for use in transferring data between a communication line and a data terminal, comprising:
a memory containing a transmit buffer and a receive buffer each for storing bytes of data;
modulator means for modulating compressed data and transferring it onto the communication line,
demodulator means coupled to the memory for transferring compressed data from the communication line and for demodulating the compressed data to produce demodulated data and for transferring the demodulated data to the receive buffer;
processing means coupled to the modulator means and the memory and operative in an input mode for retrieving data from the transmit buffer, compressing it, and supplying it to the modulator means, and in an output mode for retrieving data from the receive buffer, decompressing it, and presenting it to the data terminal; and
mode control means coupled with the processing means for controlling the relative amount of time the processing means operates in the input mode and the output mode according to the quantity of data in the transmit and receive buffers, the mode control means including means for operating the processing means in an operating loop, and in a first part of the loop checking the quantity of data in the transmit and receive buffers, and in a second subsequent part of the loop operating the processing means alternately in the input mode and the output mode with each mode active an amount of time responsive to the quantity of data in the transmit and receive buffers, the mode control means including means responsive to the presence of data in the transmit buffer and absence of data in the receive buffer for causing the processing means to be active in the input mode an amount of time substantially more than in the output mode in the second subsequent part of the loop, the mode control means including means responsive to the absence of data in the transmit buffer and presence of data in the receive buffer to cause the processing means to be active in the output mode an amount of time substantially more than in the input mode in the second subsequent part of the loop, the mode control means including means responsive to the presence of data in the transmit buffer and presence of data in the receive buffer to cause the processing means to be active in the output mode substantially the same amount of time as in the input mode in the second subsequent part of the loop.
2. Apparatus according to claim 1, further wherein the mode control means includes means for checking the transmit buffer to determine if it is more than a predetermined amount full, and if more than the predetermined amount full causing the processing means to be active in the input mode a first amount of time in the second subsequent part of the loop, and if not more than the predetermined amount full, causing the processing means to be active in the input mode a second amount of time substantially less than the first amount of time in the second subsequent part of the loop, the transmit buffer having a certain capacity, and said predetermined amount being a substantial amount of the buffer's capacity.

The present invention pertains generally to data communications devices, and more particularly to a method of dynamically allocating modem resources to process data with higher compression ratios.

As the need to transfer larger amounts of information becomes greater, data communications devices such as modems have adopted several strategies for increasing the amount of information they can transfer in a given amount of time. One such strategy involves the use of dynamic data compression and decompression. By using increasingly sophisticated strategies, higher data compression ratios are possible, thus increasing the effective amount of information that can be transferred without increasing the line baud rate. However, higher data compression ratios require a greater amount of computation, and modems designed for lower compression ratios may have difficulty keeping up with higher compression ratios at the highest baud rates.

Modern modems use an analog-to-digital (A/D) converter to sample an incoming line signal and convert it to a digitized signal which is then stored temporarily in a memory area until one or more microprocessors can process the signal, decompress the data, and transmit it to the host. In a single microprocessor system, the microprocessor must also compress and transmit outgoing data and respond to internal control requests. The microprocessor uses a polling strategy to check and service input, output and control functions in turn.

The nature of most high duty data communications involves a relatively large amount of information sent in one direction in the form of data packets and a relatively small amount of information sent in the opposite direction in the form of acknowledgements. During these high transmit or receive periods the microprocessor may fall behind and reduce throughput because it is polling and servicing all functions equally when the amount of processing required by each function is not equal.

Therefore, there is a need to provide a method to increase the amount of time spent processing functions that require a high degree of service and reduce the amount of time spent processing functions that require a low degree of service.

The present invention provides a method for dynamically changing the polling process of a single microprocessor within a modem. An additional step is added into the main polling loop that checks the amount of data in the transmit and receive buffers. If one buffer is empty, additional polling cycles are performed to service the other buffer. The number of additional cycles is dependent on how full the buffer is. If both buffers contain data, no change is made in the polling process and both are serviced with equal priority.

The method for dynamically changing the polling process requires no additional memory for buffers and requires only slightly more program code to implement. A system implemented according to the present invention demonstrates a noticeable increase in the speed with which compressed data can be transmitted than systems implemented under previous methods.

FIG. 1 is a block diagram showing the high-level architecture of typical modem according to the present invention.

FIG. 2 is a flow diagram showing the steps taken to poll modem functions according to the present invention.

FIG. 3 is a flow diagram representative of the steps taken to dynamically change the polling priority according to the present invention.

In the following Detailed Description of the Preferred Embodiments, 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. It is to be understood that other embodiments may be utilized and structural changes may be made without departing from the scope of the present invention.

FIG. 1 shows the high level architecture of a typical single microprocessor modem. The line transmit signal 101 exits and receive signal 103 enters a telephone line interface 105 which converts line voltages to internal voltages. The analog transmit signal 107 exits and receive signal 109 enters a modulator/demodulator 111 where they are converted from and to serial digital signals. The serial digital transmit signal 113 exits and the serial digital receive signal 115 enters a serial input/output (I/O) device 117 which converts them from and to parallel signals for the internal data bus 131. Data Terminal Equipment (DTE) 129 serial digital transmit signal 125 enters and receive signal 127 exits an RS232 interface 123 where they are converted to internal digital transmit 119 and receive 121 signals, which then enter or exit the serial I/O device 117. A microprocessor 133 and random access memory (RAM) 135 serving as a transmit buffer and a receive buffer, communicate via the internal data bus 131.

FIG. 2 shows the four steps the microprocessor performs in its main polling loop. Step 1 is represented by Input Interface 137, which processes any incoming data. Step 2 is represented by Main Control 139, which processes any internal control requests. Step 3 is represented by Automatic Balance Control 141, which checks the amount of data in the transmit and receive buffers. If the transmit buffer is empty and the receive buffer is not empty, control is transfered 149 back to the input interface 137. Step 4 is represented by Output Interface 143, which processes any outgoing data. If in step 3 both the transmit and receive buffers are not empty, control is transfered 145 back to the input interface 137. Otherwise, only the receive buffer is empty and it transfers control 147 back to the main control 139.

The method for automatic balance control is shown in FIG. 3. At 151 the transmit data buffer count is read and checked at 153 to see if it is zero. If the transmit data buffer count is zero, the receive buffer data count is read at 155 and checked at 157 to see if it is zero. If the receive buffer data count is zero, the input control function is called at 165 and the output control function is called at 167 before exiting. If the receive buffer data count is not zero, the input control function is called at 159, and the output control function is called twenty times 161. The data compression function is then called at 163 before exiting.

If when the transmit buffer was originally checked at 153 it was found to be not empty, the receive buffer data count is read at 169 and checked at 171 to see if it is zero. If the receive buffer data count is not zero, the input control function is called at 165 and the output control function is called at 167 before exiting. If the receive buffer data count is zero, the transmit buffer is checked at 173 to see if it is greater than fifty percent full. If the transmit buffer is greater than fifty percent full, the output control function is called thirty times at 175 then the data compression function is called at 179 before exiting. If the transmit buffer is less than or equal to fifty percent full, the output control function is called seven times at 177 then the data compression function is called at 179 before exiting.

As described above, the automatic resource balancing method checks the contents of both the transmit and receive buffers. If both contain data they are both serviced equally to provide a prompt response and avoid losing data. If the transmit buffer is empty and the receive buffer is not empty, more data is coming in than going out, therefore twenty bytes are processed from the receive buffer before checking the transmit buffer again. If the receive buffer is empty and the transmit buffer is not empty, more data is going out than coming in, therefore if the transmit buffer is less than fifty percent full, seven bytes are processed from the transmit buffer before checking the receive buffer again. If the transmit buffer is greater than fifty percent full, the data is still not being processed fast enough, therefore thirty bytes are processed from the transmit buffer before checking the receive buffer again.

The values of twenty iterations for the input buffer and seven iterations and thirty iterations for the output buffer are empirically derived as optimal values for the described modem architecture at a compression ratio of 4:1 at a line baud rate of 9600. The optimal values may be different for other modem architectures or data compression ratios or line baud rates.

It is to be understood, however, that even though numerous characteristics and advantages of the invention have been set forth in the foregoing description, together with details of the structure and function of the invention, the disclosure is illustrative only, and changes may be made in detail, especially in matters of shape, size, and arrangement of parts within the principles of the invention, to the full extent indicated by the broad general meaning of the terms in which the appended claims are expressed.

Li, Ping

Patent Priority Assignee Title
5440691, Feb 27 1992 ENTERASYS NETWORKS, INC System for minimizing underflowing transmit buffer and overflowing receive buffer by giving highest priority for storage device access
5444704, Aug 12 1991 Brandywine Communications Technologies LLC Dial restoral method and apparatus
5546543, Mar 26 1993 ENTERASYS NETWORKS, INC Method for assigning priority to receive and transmit requests in response to occupancy of receive and transmit buffers when transmission and reception are in progress
5654983, Jun 10 1994 TELOGY NETWORKS, INC Method and apparatus of operating data communications equipment in command mode and autobauding
5691820, Oct 04 1993 Fujitsu Limited Data communication system and facsimile machine in the data communication system
6151653, Feb 26 1998 Winbond Electronics Corp. USB/UART converter and its control method
6611868, May 21 1999 HEWLETT-PACKARD DEVELOPMENT COMPANY, L P Method and system for automatic link hang up
6904037, Nov 05 1996 Cisco Technology, Inc Asymmetric implementation of DSVD for voice/data internet access
7203483, Feb 09 2001 Samsung Electronics Co., Ltd. Wireless communication apparatus, method thereof and wireless communication system employing the same
9235449, Jun 22 2012 Adtran, Inc.; ADTRAN, INC Systems and methods for reducing contention for a software queue in a network element
Patent Priority Assignee Title
3927268,
3997729, Jul 25 1975 Communications Satellite Corporation (Comsat) Pseudo-random sequencing for speech predictive encoding communications system
4009346, Dec 30 1974 International Business Machines Corporation Distributional activity compression
4298954, Apr 30 1979 International Business Machines Corporation Alternating data buffers when one buffer is empty and another buffer is variably full of data
4368512, Jun 30 1978 Motorola, Inc. Advanced data link controller having a plurality of multi-bit status registers
4388697, Sep 08 1980 Bell Telephone Laboratories, Incorporated Voiceband data set circuitry with dual bus architecture
4472832, Dec 01 1981 AT&T Bell Laboratories Digital speech coder
4514825, Mar 09 1982 Kinex Corporation High speed digital modem
4823312, Oct 30 1986 National Semiconductor Corp. Asynchronous communications element
4841574, Oct 11 1985 International Business Machines Corporation; INTERNATIONAL BUSINESS MACHINES CORPORATION, ARMONK, NEW YORK 10504, A CORP OF N Y Voice buffer management
4902881, Jun 10 1988 LAMBERT TECHNOLOGIES, INC , A CORP OF CA Parallel process communications terminal and network
4914699, Oct 11 1988 ITT Corporation High frequency anti-jam communication system terminal
4922520, Dec 31 1986 M. A. Kempner, Inc. Automatic telephone polling system
4926482, Jun 26 1987 Unisys Corp. Apparatus and method for real time data compressor
5163132, Sep 24 1987 TAIWAN SEMICONDUCTOR MANUFACTURING CO , LTD Integrated controller using alternately filled and emptied buffers for controlling bi-directional data transfer between a processor and a data storage device
5202884, Jun 28 1991 ENTERASYS NETWORKS, INC Multiplexing scheme for modem control signals
GB2110906,
JP62016638,
RE32580, Sep 18 1986 American Telephone and Telegraph Company, AT&T Bell Laboratories Digital speech coder
//
Executed onAssignorAssigneeConveyanceFrameReelDoc
Aug 16 1991LI, PINGMULTI-TECH SYSTEMS, INC ASSIGNMENT OF ASSIGNORS INTEREST 0058150023 pdf
Aug 19 1991Multi-Tech Systems, Inc.(assignment on the face of the patent)
Date Maintenance Fee Events
Sep 30 1997M183: Payment of Maintenance Fee, 4th Year, Large Entity.
Nov 03 1997LSM2: Pat Hldr no Longer Claims Small Ent Stat as Small Business.
Nov 03 1997SM02: Pat Holder Claims Small Entity Status - Small Business.
Apr 05 2000ASPN: Payor Number Assigned.
Oct 04 2001M284: Payment of Maintenance Fee, 8th Yr, Small Entity.
Oct 19 2005REM: Maintenance Fee Reminder Mailed.
Apr 05 2006EXP: Patent Expired for Failure to Pay Maintenance Fees.


Date Maintenance Schedule
Apr 05 19974 years fee payment window open
Oct 05 19976 months grace period start (w surcharge)
Apr 05 1998patent expiry (for year 4)
Apr 05 20002 years to revive unintentionally abandoned end. (for year 4)
Apr 05 20018 years fee payment window open
Oct 05 20016 months grace period start (w surcharge)
Apr 05 2002patent expiry (for year 8)
Apr 05 20042 years to revive unintentionally abandoned end. (for year 8)
Apr 05 200512 years fee payment window open
Oct 05 20056 months grace period start (w surcharge)
Apr 05 2006patent expiry (for year 12)
Apr 05 20082 years to revive unintentionally abandoned end. (for year 12)