Abstract:
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.

Description:
BACKGROUND OF THE INVENTION 
     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. 
     BACKGROUND OF THE INVENTION 
     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. 
     SUMMARY OF THE INVENTION 
     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. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     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. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     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.