Abstract:
A dynamic trunk compression system for processing digitized speech signals. The system includes a monitoring apparatus which measure current traffic intensity at the trunk. The current traffic intensity drives an algorithm that periodically estimates blocking probabilities. When the blocking probabilities fall outside of a predetermined range, the trunk is repartitioned to provide more speech channels.

Description:
BACKGROUND OF THE INVENTION 
     (1) Field of the Invention 
     The present invention relates to speech processing in general and more particularly to the concentration/deconcentration of speech from and into a PBX system. 
     (2) Prior Art 
     The technique for processing telephone messages from a PBX installation onto a trunk line and vice versa is well known in the prior art. The conventional technique is usually static in that the trunk line is partitioned into a fixed number of channels designated to accommodate a particular number of incoming lines. Even though the total number of lines is not being utilized, the unused capacity in the trunk cannot be allocated to the active incoming lines. Needless to say that the reapportionment of the unused trunk line to the active incoming lines would greatly improve the overall operating characteristics of the PBX system. 
     SUMMARY OF THE INVENTION 
     It is therefore the general object of the present invention to provide a more efficient PBX telephone system than was heretofore possible. 
     It is another object of the present invention to provide a PBX system wherein the trunk capacity is dynamically partitioned to achieve a demand-determined degree of user compression while maintaining at least a specified grade of service. 
     The improved PBX telephone system provides the maximum speech quality consistent with the specified grade of service by dynamically trading quality against compression ratio. 
     The PBX telephone system includes an algorithm that is activated periodically in response to traffic intensity at the trunk. Upon activation, the algorithm estimates a blocking probability. If the blocking probability falls within a predetermined range, no adjustment is made to the system. However, if the blocking probability falls outside of the predetermined range, the trunk is repartitioned to provide more speech channels. Simultaneously therewith the bit rate in each channel is reduced thereby bringing the quality or grade of service back into the allowed range. 
     In particular, given the system loading the probability of system blocking (P b ) is periodically calculated and compared with a specified maximum and minimum level (say, Y≦P b  ≦Z). When the predicted blocking P b  falls outside of the desired range, the number of channels N is adjusted, in accordance with the algorithms shown in FIGS. 2, 3A and 3B, to reconfigure the system in the appropriate direction. This means that if the traffic intensity goes down the bit rate in each channel is increased thereby improving the grade of service. Likewise, if the traffic intensity goes up (i.e., increases) the bit rate in each channel decreases. 
     In one embodiment of the present invention the desired range was as follows: 0.01≦P b  ≦0.05. 
     The foregoing features and advantages of this invention will be more fully described in the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1A shows a block diagram of a PBX telephone system embodying the teachings of the present invention. The figure shows telephone traffic in an outbound direction from the PBX telephone installation to a T-1 trunk. 
     FIG. 1B shows a block diagram of the PBX telephone system embodying the teachings of the present invention. The figure shows telephone traffic in the inbound direction from the T-1 trunk to the PBX telephone installation. 
     FIG. 2 shows a flow chart of the process steps and algorithm used to partition the T-1 trunk. 
     FIG. 3A shows an algorithm and process steps used to determine the probability of blocking. 
     FIG. 3B shows an algorithm and process steps used to determine the required number of channels. 
    
    
     DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT 
     FIGS. 1A and 1B show in block diagram form the PBX telephone system according to the teaching of the present invention. FIG. 1A shows traffic in the outbound direction while FIG. 1B shows traffic in the inward bound direction. The system is designed to compress a number of digitized signals into a single T-1 trunk. Although a trunk line with varying capacity is available, in the preferred embodiment of this invention the capacity of the trunk line is approximately 1.536 Mb/sec. It has been determined that a T-1 trunk having a capacity of 1.536 Mb/sec. can reasonably accommodate from 48 to 96 voice grade channels. This information is recorded in Table I below. 
     In addition to the channel capacity, Table I also shows the traffic intensity measured in Erlangs and the probability of system blocking which occurs when the trunk is partitioned into 48 and 96 channels. As will be described subsequently, whenever the probability of blocking falls outside of the range of 0.01 and 0.05, the algorithms to be described subsequently will partition the channel into an acceptable number of channels. 
     
                       TABLE I______________________________________48 channels @ 32 kb/sec/channel = 1.536 M bit/sec.96 channels @ 16 kb/sec/channel = 1.536 M bit/sec.Number of Traffic Intensity              Probability of SystemChannels (N)       in Erlangs Blocking______________________________________48          36         0.0196          90         0.05______________________________________ 
    
     It should be noted that the information of Table I is determined mathematically. 
     It should be noted that the capacity of the T-1 trunk, the number of channels assigned thereto, the traffic intensity, and the probability of system blocking chosen above are merely exemplary and are not intended to limit the scope or contents of the present invention since it is well within the skill of one skilled in the art to change these numbers without departing from the scope and spirit of the present invention. 
     Referring again to FIG. 1A, a number of lines identified by numerals 1-96 are outputted from a PBX telephone installation (not shown) into the PBX interface means 100. At a given time, a number, say &#34;N&#34; of these 96 lines may be in use. Of course, the maximum number of lines may be more or less than 96. Speech signals enter the system via these input lines in either analog form or as eight or twelve bit PCM. The number of active ports are fed over conductor 102 to system configuration means 104. As will be explained subsequently, the function of system configuration means 104 is to determine the values of the parameters &#34;R&#34; and &#34;N&#34;, respectively. As is used herein, &#34;R&#34; represents the coding rate while &#34;N&#34; represents the number of channels. 
     The value of the parameter R is fed over conductor 106 to the bank of speech coders identified by numeral 108. The coder&#39;s specific operating rate is determined by a single input parameter (to be described subsequently) that is entered into the coder&#39;s bit assignment algorithm. The parameter takes the integer value R-3, where R is the desired bit rate in Kb/sec. It shuld be noted that the number 3 represents a 3 Kb/sec. overhead channel which among other things passes information regarding a block compander integral to the coding algorithm. 
     As will be explained subsequently, the rate R is determined by the following relationship: 
     R=GI{1536/N}, where N is the number of channels required and &#34;GI&#34; represents the greatest integer function. 
     Given a real floating-point variable x falling between two consecutive positive integers K and L, such that K≦x&lt;L, then the greatest integer function maps x to k: 
     
         GI(x)=K. 
    
     Likewise, the parameter &#34;N&#34; which is outputted from system configuration means 104 (FIG. 1) over conductor 110 into organization and multiplex means 112 identifies the number of channels which must be provided to accommodate a particular level of system loading. 
     Still referring to FIG. 1A, a bank off switches identified by numeral 114 interconnects the output from the PBX interface means 100 and to the input of the bank of sub-band speech coders 108. Each speech signal is compressed by a sub-band coder. Analog-to-digital conversion, if needed, is performed at this stage. Speech coders providing good speech quality at rates between 16 kg/sec. and 32 kb/sec. are well known in the prior art. Other types of speech coders (e.g., adaptive transform, adaptive differential PCM, etc.) are suitable for use in the present system. Similarly, a bank of switches identified by numeral 116 interconnects the output from the bank of speech coders 108 to the input of organization and multiplex means 112. By activating a number of selected switches from banks 114 and 116, respectively, a given number of coders S is made to output speech signals into the organization and multiplex means 112. The number of coders that are active at a particular time is determined (from the system loading and the allowed range of expected blocking probability) by the algorithm to be described below. Likewise, the same procedure (to be described below) sets the rate R of the speech coders. 
     A traffic monitor means 118 is coupled by means 120 to T-1 trunk. The traffic monitor means (to be described subsequently) tabulates the traffic or message or signal intensity impinging on the trunk. The intensity or utilization is measured in Erlangs and is fed over conductor 122 to system configuration means 104. A running average (that is, lowpass filter) of this measurement is the parameter &#34;E&#34; shown and described below in FIGS. 2 and 3 and will be described subsequently. From &#34;E&#34; and the current number of channels &#34;N&#34;, the projected system blocking is calculated (FIGS. 2 and 3 to be described hereinafter) and the repartitioning decision (choosing a new number of channels &#34;N&#34;) is made. 
     Still referring to FIG. 1A, the resulting signals from the bank of speech coders are serialized and multiplexed by organization and multiplex means 112 onto the T-1 trunk interface means 124. This interface guarantees that the interconnection restrictions imposed by the common carrier (for example, overvoltage protection, compatibility of signal levels, etc) are met. The value of &#34;N&#34; is included in transmissions to the receiver. The receiver uses N to ensure proper decoding. 
     The traffic monitor means decodes the in-band and explicit call establishment signaling transmitted via the T-1 carrier. The time of arrival of new traffic (i.e., the establishment of a circuit) at the T-1 interface is recorded in a call progress table, as is the time of departure (termination of the circuit) for said traffic. The &#34;call arrival rate&#34; (in calls/second) is determined from the record of arrivals. The average holding time per circuit or traffic duration is determined by the difference of the departure and arrival times. Traffic intensity &#34;E&#34; is the running average of the product of arrival rate and duration, expressed in Erlangs, for completed traffic. This value &#34;E&#34; is periodically sent to configuration means 104 by conductor 122, with update every 30 seconds in the preferred embodiment. At this time, the call-progress table entries for completed calls, comprising &#34;E&#34; are erased, freeing space for new arrivals, and the running average is reset. 
     Referring now to FIG. 2, there is shown the process step and algorithm that are used in the configuration means 104 to determine R and N. Although it is well within the skill of the art to implement the algorithm in hardware, in the preferred embodiment of this invention the algorithm was implemented in a programmed microcomputer. Any conventional off-the-shelf microcomputer which is programmed in accordance with the flow chart shown in FIG. 2 can be used to implement the present invention. Therefore, a specific microprocessor will not be identified. Each block in FIG. 2 signifies a process step in the program of FIG. 2 and will now be described. 
     The first step in the program is identified by block 126. Block 126 is an entry point and signifies the point whereat the program is entered. 
     Step B is practiced in block 128. In this block the program checks to see if it is time for the next update. If it is not, the program re-enters block 126. If it is, the program exits the block into block 130. In block 130 the program checks to see what is the average traffic intensity &#34;E&#34;. As described above, in relationship with FIG. 1A, the value of E is outputted from the traffic monitor means 118. The program then descends into block 132 where it computes the blocking probability &#34;P b  &#34;. Details of this computation will be given subsequently in relationship with FIG. 3A. 
     From block 132 the program enters into block 134. There the program checks to see if the blocking probability P b  falls within a prescribed range. As stated above, in the preferred embodiment of this invention, the prescribed range of blocking probability is between 0.01 and 0.05. Of course, other limits on the blocking probability P b  can be selected without deviating from the scope and spirit of the present invention. 
     If the blocking probability (P b ) is within the prescribed limits, then the program loops back to block 126 and performs the previously described process steps. If the blocking probability (P b ) falls outside of the prescribed range, then the program descends into block 136. In block 136 the program computes &#34;N&#34; such that the blocking probability for P b  (N) is less than 0.05. The technique used to compute N is shown in FIG. 3B and will be described subsequently. 
     From block 136 the program descends into block 138. In block 138 the program checks to see if N is less than or equal to the maximum number of channels which is allotted for the particular PBX telephone system to handle. Although (N) may be any desired number in the preferred embodiment of this invention, N was chosen to be 96. If N is not less than or equal to 96, the program exits block 138 along the no path into block 140. In block 140 the program sets the N parameter equal to 96 and the R parameter equal to 16. It should be noted that the values for N and R are chosen in a particular example and does not limit the scope of this invention. The key point is that N and R are set to fit the upper limit of the selected range. From block 140 the program loops back to block 126 to repeat the above-described process steps. 
     Still referring to FIG. 2, if N (block 138) is less than or equal to 96, the program exits along the yes path into block 142. In block 142 the program checks to see if N is greater than or equal to the lower number of assigned channels. In this particular example the lower limit is 48. If N is less than or equal to 48, the program exits block 142 along the no path into block 144. There the program sets N=48, R=32 and then re-enters the program in block 126. If N is greater than or equal to 48, the program exits block 142 along the yes path into block 146. In block 146 the program computes the value of R. As stated above, R=GI(1536/N). The program then re-enters block 126. The process of periodically monitoring, calculating (P b ) and making necessary adjustments in channel allocation continues until the system is turned off. 
     FIG. 3A show a program for determining the blocking probability P b . The blocking probability P b  is determined from a parameter recursively. 
     The recursion is defined as follows: ##EQU1## where E is traffic intensity in Erlangs, M is the number of channels and P is the probability of blocking. 
     Referring again to FIG. 3A, the first step to calculate the probability of blocking is identified in block 148. In block 148 the following boundary conditions are set: P(0)=1.0; M=1=dummy counter. The program then descends into block 150 where it calculates the first pass in the recursion algorithm. The recursion function is identified above and will not be repeated here. From block 150 the program descends into block 152. In block 152 the program tests to see if M is equal to N. If it is not, then the program descends into block 154 where M is set equal to (M+1) and the program loops back into block 150. The looping (that is the recursion) continues until whenever M is equal to N the program exits along the &#34;yes&#34; path. The value of P b  is then utilized as is previously described. 
     FIG. 38 shows the program which is used to calculate the required number of channels identified in block 136, FIG. 2. As stated above, the program also utilizes the recursion algorithm to determine N. The first step in the process is identified by block 156. In block 156 certain boundary functions for P and N are set. The program then descends into block 158 where it calculates the first value in the recursion algorithm. The program then descends into block 160 where it tests to see if P n  is less than the lower limits of the probability range. In the preferred embodiment the lower range is set to 0.05. As stated before, a different value than 0.05 may be used. 
     If P n  is greater than 0.05, the program exits the block along the no path into block 162. In block 162 the program sets N=(N+1) and enters into a loop. The looping continues until P n  is less than 0.05. The program then exits block 160 along the yes path. 
     FIG. 1B shows the PBX telephone system with inbound signals from the T-1 trunk. 
     These signals are inputted to the T-1 trunk interface means 200, which provides signal-level conditioning and proper termination for the common carrier T-1 trunk. Digital signals representing serialized voice links and signaling information are carried by conductor 202 to the organization and demultiplex means 204. Means 204 extracts the parameter &#34;N&#34;, the number of active channels, and separates the serialized digital signal into its component voice-links and signaling parameters. The number of active channels &#34;N&#34; is carried to the configuration means 208 via conductor 206. Configuration means 208 determines the previously described parameter &#34;R&#34; which assigns, via conductor 212, bit rates to the speech decoder bank means 210. &#34;R&#34; is determined from the greatest integer function, as previously described, by the relationship 
     
         R=GI[1536/N]. 
    
     The value of &#34;N&#34; is carried via conductor 214 to the enabling means 216. The enabling means operates switch banks 218 and 220 by signals carried via conductors 222. By activating a number of selected switches from banks 218 and 220, a given number of speech decoders N is made to decode and output speech signals into the PBX interface means 224. Speech is outputted on lines 301-396 a analogue or 12 or 8-bit PCM signals as appropriate for the attached PBX. 
     As we have shown, a circuit for the transmission of speech is established from input lines (FIG. 1A), through PBX interface means 100, switch banks means 114 and 116, speech coder means 108, organization and multiplex means 112, through the T-1 trunk interface means 124, via the common carrier T-1 trunk into interface means 200 (FIG. 1B), organization and demultiplex means 204, through switch banks 218 and 220, speech decoder means 210, and delivered to the PBX interface means 224 via conductors 301 through 396. 
     The number of such end-to-end circuits is N. The bit rate of the speech coders is R k bits/sec. Both R and N are changed as described to maintain the desired grade of service and blocking probability. The apparatus shown in FIGS. 1A and 1B appear at both ends of said voice circuit. A return path for the bidirectional voice circuit is provided with the sense of transmission reversed, as would be obvious to one skilled in the art.