Abstract:
A digital speech compression system uses a predictive feedback loop. The digital speech signals are compressed within the feedback loop for reducing the transmitter bandwidth. The system comprises a first adder into which the digital signal is fed followed by a quantizer and a compression logic. The predictive loop includes a second adder coupled to the compression logic and followed by a digital predictive filter. The output of the filter is impressed in a negative sense on the first adder and in a positive sense on the second adder. Specifically, the quantizer and compression logic may consist of a two-valued limiter followed by a compressor and a converter in the feedback loop or alternatively the limiter may be followed by a converter while the compressor is disposed outside the feedback loop to provide sample by sample compression.

Description:
BACKGROUND OF THE INVENTION 
     This invention relates generally to digital speech communication systems and particularly to such a system having feedback residue compression in its predictive feedback loop. 
     Bandwidth compression for speech signals has generally been accomplished in two different manners. Thus, the compression may be accomplished by the time domain techniques which operate at relatively high bit rates of between 16-40 kilobits per second. Among these time domain techniques are delta modulators where the difference between the estimate of the predictive feedback and the actual input is small. The other bandwidth compression techniques are spectral domain techniques such as vocoders. These systems operate at very low bit rates between 2.4 and 4.8  kilobits per second. 
     The spectral domain systems are susceptible to errors induced by background noise. This is a result of their restrictive manner of compressing the signal input. Due to their low bandwidth they do not permit to preserve the fidelity of speech. 
     It is therefore desirable to provide a speech processing system which compresses both the speech and the noise and possibly giving preference to the speech. For this reason time domain techniques appear to have certain advantages. 
     Among the systems are continuously variable slope delta modulation techniques. This simply means that the slope or the size of the increment can be changed or varied. 
     Other time domain systems which are characterized by relatively low data rates are adaptive predictive coding systems. In particular the adaptive predictive coding system is characterized by higher intelligibility of the speech and speech quality than can be achieved at lower data rates than can be utilized with delta modulation. However, one of the problems with the adaptive predictive coding system is the complexity of the required hardware. 
     It is accordingly an object of the present invention to provide a digital speech compression system of the type having a predictive feedback loop and which is characterized by greater simplicity. 
     A further object of the present invention is to provide such a speech compression system where the compression is achieved by limiting the number of sequences of quantizer levels that may be fed back to the loop. 
     Another object of the present invention is to provide a predictive speech compression system where the residue stream is compressed within the quantizer loop. 
     SUMMARY OF THE INVENTION 
     A digital speech compression system in accordance with the present invention comprises a digital source of speech. This may, for example, be a speech signal source followed by an analog-to-digital converter. The converter is followed in sequence by a first adder, a quantizer and a compression logic. The quantizer may, for example, consist of a two-valued limiter. The output of the compression logic is the compressed digital speech which then goes to the transmission channel. 
     A predictor loop is provided between the compression logic and the first adder. This includes a second adder coupled to the compression logic. The output of the second adder is fed to a digital predictive filter. The filter output then is connected in a negative sense to the first adder and in a positive sense to the second adder. 
     The compression logic may consist of a compressor followed by a converter in the feedback loop. Alternatively, the limiter may be followed by a converter while the actual compressor is disposed outside of the feedback loop. 
     The novel features that are considered characteristic of this invention are set forth with particularity in the appended claims. The invention itself, however, both as to its organization and method of operation, as well as additional objects and advantages thereof, will best be understood from the following description when read in connection with the accompanying drawings. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     FIG. 1 is a diagram in block form illustrating generally the feedback residue compression for a digital speech system in accordance with the present invention; 
     FIG. 2 is a block diagram of a first embodiment of the invention utilizing sample-by-sample compression and which is somewhat limited as to the coding that can be used for the digital compression; 
     FIG. 3 is a block diagram of a receiver for decoding the received compressed digital signals; 
     FIG. 4 is a block diagram of a second embodiment of the invention providing sample-by-sample compression and which permits a somewhat wider choice of compression coding; 
     FIG. 5 is a block diagram of a blocked compression system which is carried out block-by-block of the input signals; and 
     FIG. 6 is a block diagram of a portion of the circuit of FIG. 5, including the decision logic circuit. 
    
    
     DESCRIPTION OF THE PREFERRED EMBODIMENTS 
     Referring now to the drawings and particularly to FIG. 1, there is shown a block diagram of a digital speech compression system in accordance with the present invention. The block diagram of FIG. 1 generally illustrates the invention while FIGS. 2, 4 and 5 show three specific embodiments of the invention. 
     The block diagram of FIG. 1 includes a speech signal source 10 followed by an analog-to-digital converter 11 to generate digital input signals. These input signals are impressed on an adder 12 which is followed by a quantizer 14 and a compression logic 15. Concerning an explanation of the terms used in the drawings, reference is made to a paper by Rabiner et al. entitled &#34;Terminology in Digital Signal Processing&#34; which appears in IEEE Transactions on Audio and Electroacoustics, Volume AU-20, No. 5, December 1972, pages 322-337. 
     The adder 12 is a well known digital adder which will add or subtract two digital signals. The quantizer 14 may, for example, include a limiter such as a two-valued limiter for generating quantized digital signals. In other words, the quantizer 14 will output either a -q or +q, where q is a suitably selected constant value. 
     The compression logic 15 will be subsequently explained in connection with FIGS. 2, 4 and 5. It basically serves the purpose to compress the digital input signals, that is to convert them into output tuples having fewer levels than the quantized input signals or tuples. 
     The digital speech compression system of FIG. 1 includes a predictor loop 16 which is a predictive feedback between the compression logic 15 and the adder 12. The predictor loop 16 includes a second adder 17 and a filter 18 which has been designated P (Z) filter. This is a digital predictive filter and may consist of any digital filter which will estimate an input signal. It may also include an electrical filter for suppressing certain frequencies and enhancing others. 
     Hence, as shown in FIG. 1, the compression logic 15 is coupled to an input of the adder 17. The output of the adder 17 is connected to the input of the predictive filter 18. Its output is connected both in a negative sense to the first adder 12 and in a positive sense to the second adder 17, thus to complete the feedback loop. 
     The digital signal impressed on the filter 18 may be termed r i  which is the reconstructed signal. If the input signal obtained from analog-to-digital converter 11 and impressed on adder 12 is termed S i , the signal feedback to the adder 12 from the filter 18 is S i . This is the estimate of the actual input signal S i . The signal impressed by the adder 12 on the quantizer 14 may be termed e i  and this represents the error of the original estimate. 
     How this system can be realized will now be explained in connection with FIG. 2. As shown here, the first adder 12 has its output connected to a hard limiter 20, that is a two-valued output limiter. Its input signal is e i , that is the error of the estimate while its output signal q i  is the quantizer output. 
     The limiter 20 is followed by a compressor 21 identified by Q→C. This in turn is followed by a converter 22 forming part of the feedback loop. The converter 22 is identified by C→Q. The output of the converter 22 feeds into an input of the second adder 17 having its output connected to the filter 18 as previously described. The signal r i  is the residue signal which is fed from the adder 17 to the filter 18. As previously explained the output of filter 18 is connected in a negative sense to adder 12 and in a positive sense to adder 17. The output signal which is shown by output lead 24 as going to the transmission channel carries the output signal c k . 
     The meaning of the terms Q, C, and Q will now be explained. Q is, of course, the set of output signals of the limiter 20 or the quantizer output. Q is a set of n tuples and each element of the n-tuple termed q i  where q i  = +q or q i  = -q. 
     C represents a digital output signal which has fewer levels than the output signal Q. It consists of a set C of m tuples C k  of binary numbers fed to the output channel where m is smaller than n. 
     Finally Q consists of n tuples of q i  where each q i  is either +q or -q. This is a coded set of digital levels where the quantized levels feed to the predictor loop. 
     For a better understanding of the meaning of the terms Q, Q and C, reference is made to the following Table I. 
     
                       TABLE I______________________________________  Q         Q           C______________________________________0        000         000                            001        001         0012        010         000         013        011         0014        100         1005        101         101         106        110         1007        111         101         11______________________________________ 
    
     In the above table the first column indicates the digital numbers from 0-7 and the next column the corresponding binary numbers which are termed Q. Each tuple in column Q is composed of 3 values of q i , i.e. (q 1 , q 2 , q 3 ) where each q i  may be +q  or -q. Here for convenience +q has been denoted as 1 and -q as 0, i.e., the first entry in the second column corresponds to (-q, -q, -q). Q shown in the third column represents a coded set of digital signals q i . This is simply obtained from the second or Q column by changing the second binary digit of each tuplet to 0. The same representation of +q as 1 and -q as 0 is used. The last or C column illustrates the digital output signals which have fewer levels, that is two levels instead of three. 
     Because the Q column has only zeros in the middle position of bits or tuples, these bits can be omitted because they represent no information. As a result decimal 0 and 2 both are represented by 00; decimal 1 and 3 are both represented by 01 and so on. 
     A code of the type illustrated in the above table can be readily obtained by using a so-called Q where the tree represents the Q space. With this information the meaning of the block diagram of FIG. 2 will become more meaningful. Thus, the compressor 21 converts the quantized digital signals Q into the digital output signals C having fewer levels. The converter 22 now converts C into Q, that is the digital output signals C having fewer levels are converted into the coded set of digital levels Q, which then flows in the predictor loop. 
     The embodiment of the invention of FIG. 2 has the advantage that it is relatively easily implemented. In this embodiment, as well as in the others, compression is achieved by limiting the number of sequences of q levels that may be fed back into the loop. The compression ratio is m/n and the circuit of FIG. 2 operates on a sample-by-sample basis. The particular code which can be used with the configuration of FIG. 2 is somewhat limited. In other words, there is a limited choice of codes available. 
     FIG. 3 illustrates schematically a receiver from which the digital speech can be recovered. This includes a converter 26 which converts C into Q followed by an adder 27. The output of the adder is fed back into the adder 27 by a digital predictive filter 28 identical to the filter 18. Such a feedback loop at the receiver is conventional. 
     Referring now to FIG. 4, there is illustrated another block diagram of an embodiment of the invention which operates on a sample-by-sample basis. It is generally similar to that of FIG. 2 except that the limiter 20 is now followed by a converter 30 which converts Q to Q. The output of the converter 30 is directly impressed on the adder 17 and the predictive feedback loop is identical to that previously described. However, outside of the feedback loop there is provided a compressor 31 which converts Q into C to derive the output tuples c k . The circuit of FIG. 4 has certain advantages in that it provides a larger choice of possible codes. However, the codes applicable to the embodiment of FIG. 2 form a subset of the codes which can be used in FIG. 4. While the embodiment of FIG. 4 can also be readily implemented, it requires more hardware than that of FIG. 2. 
     The codes required to convert Q into C and C into Q or to convert Q into Q into C will now be explained. 
     Thus a function F must be found mapping Q into Q. This may be explained as follows: Thus 
     
         F(q) = q                                                   (1) 
    
     must be decomposable as 
     
         F.sub.i (q.sub.1, q.sub.2, . . . q.sub.i) = q.sub.i, where i = 1, . . . . n (2) 
    
     In addition F must be decomposed into two functions. 
     
         G: Q→C and D:C→Q 
    
     it will be evident that since G maps n-tuples to m-tuples there must be n - m sample intervals out of every n intervals during which G produces no output. This corresponds to the speech compressor illustrated in FIG. 2. Concerning the scheme of FIG. 4, this implements any code F:Q →Q which satisfies equation (2). As indicated before, the map of the F function can be realized by an automaton, that is by the Q tree previously referred to. 
     The map 
     
         D.sup.-.sup.1 :Q→C 
    
     can be realized but with a delay of at most n sample intervals. This delay occurs outside of the feedback loop and hence is permissible. This is particularly true because greater delays do occur in practice between the transmitter and the receiver. A sample of a code selected in this manner has been shown in Table I. 
     The following Table II is similar and will now be explained. 
     
                       TABLE II______________________________________  Q         Q           C______________________________________0        000         0001        001         0012        010         010         003        011         111         014        100         000                            105        101         001                            116        110         0107        111         111______________________________________ 
    
     In the above Table II the rows for Q, Q and C are defined as before. The Q again indicates the coded set of digital levels. It will be noted that the tuples of the C column are obtained from the tuples of the Q column by omitting the first bit of each Q tuple. 
     It will be further realized by checking, for example, the coded q&#39;s corresponding to decimal numbers 2 and 3, that these tuples cannot be obtained from the corresponding q tuples by only looking at the first bit that is received. The same applies to the last two sets of q tuples, decimal numbers 6 and 7, which cannot be obtained from the last two q tuples without receiving both the first and second bit. 
     It will therefore be realized that the code represented by Table II cannot be performed with either the circuit of FIG. 2 or that of FIG. 4 because there is no provision for looking at more than one bit at a time. This can be accomplished with the circuit of FIG. 5 which includes a blocking control so that the input signals S i  are coded block by block. Each of these blocks may, for example, correspond to the number n and in the case to Table II this amounts to n = 3. 
     Accordingly, reference is now made to FIG. 5 which shows a blocking control 35 upon which the input signals S i  are impressed. The output of the blocking control is again fed to the first adder 12, the output of which is the e i  signal. It is impressed upon a decision logic circuit 36 which will be subsequently explained. The output of the decision logic circuit obtained from lead 37 corresponds to the output signals c k . A sequence generator 38 is provided which feeds sequentially coded signals into the decision logic circuit 36 and to the second adder 17. In other words the output of the sequence generator is Q. Consequently the individual sequences q which comprise Q are sequentially generated by the sequence generator 38. 
     The remainder of the circuit of FIG. 5 is similar to the circuits previously described. In other words, the output of the second adder 17, that is the r i  or reconstructed signal, is impressed upon the digital predictive filter 18 and its output is again impressed upon the two adders 12 and 17. This output is the signal S i . In other words, this is the estimate of the input signal. 
     The decision logic selects the best sequence or the minimum error (mean squared error) which is calculated as follows: ##EQU1## 
     Equation (4) will be evident from what has been explained before. In other words the difference between the actual input signal S i  and the estimate S i  corresponds to the error signal e i . 
     Thus basically the circuit of FIG. 5 operates as follows: the blocking control 35 reads and holds a block of input signals corresponding to the number n. Each signal is then fed through the circuit and passes the decision logic circuit 36. This will receive simultaneously the error signal e i  which is held by the decision logic and a q received from the sequence generator 38. Every time the mean squared error of equation (3) is determined and every time the smallest mean square and the corresponding state of the filter 18 are retained by the decision logic. Hence, if the previous mean square was smaller, the new mean square is discarded. If the new mean square is smaller it is saved in the decision logic to replace the previous mean square. This process continues until all of the q sequences in Q have been generated. At this time the smallest mean square has been found and the corresponding filter state is entered in the filter 18. At the same time the corresponding c k  is sent to the output channel. 
     Some general observations may be in order on assigning the codes and determining whether they can be carried out by the circuits of FIGS. 2, 4 or 5. Basically, these consist in selecting F, that is 
     
         F:Q→Q 
    
     words in Q with a high Hamming weight should be assigned to words in Q with a high Hamming weight and those with a low Hamming weight in Q should be assigned to a low Hamming weight in Q. The Hamming weight of a word is defined as the sum of the Hamming weights of its digits which is either 0 or 1, if the weight is not zero. 
     Q should be chosen so that the sum of the Hamming weights of all words in Q is approximately 2 m   -   1  X m. This simply means that there is an equal number of 1&#39;s and 0&#39;s in Q. Finally Q should be chosen to maximize the minimum distance between words. 
     Any code selected in this manner will work with one of the circuits of FIGS. 2, 4 and 5. 
     Referring now to FIG. 6 there is illustrated primarily the decision logic circuit of FIG. 5. Thus FIG. 6 shows the error signals e i  from the adder 12 which feed into the decision logic circuit 36 shown in dotted lines. The sequence generator 38 generates the signals q i  which are fed to the second adder 17. Also the sequence generator 38 will impress the coded set of signals q i  on the decision logic circuit 36. Finally, the filter 18 has also been shown. 
     The input signal e i  is squared by the multiplier 40 and the sum is formed by the summer 41. These two units operate for n samples. The summing circuit 41 is followed by a comparator 42 which in turn impresses its output on the decision circuit 43. A memory circuit for the current C, that is circuit 44 is connected to the decision circuit 43. In other words the memory 44 will retain the current output signal c k  corresponding to the q received from the sequence generator 38. 
     Another temporary memory 45 is connected to the output of the decision circuit 43. This will retain the filter state corresponding to the last q, that is the one having the minimum value. Another memory 46 is coupled to the memory 45 and this will retain the corresponding c k  signal corresponding to the presently best q signal and will eventually output the correct value of c k . 
     Finally a memory 47 is coupled to the decision circuit 43 and its output is fed into both the comparator 42 and the memory 45. This will retain the last value of Σe i   2 . In other words this corresponds to the best q so far found. Finally after n samples have passed through the circuit, the final decision is made, the correct c k  signal is fed into the channel, and the correct filter state is entered in the filter 18. 
     It should be noted that in the circuit shown in FIGS. 5 and 6, that is in the blocked compression, the explicit quantization function is not present but is inherently present in the circuit. Hence the blocked compression scheme is specified completely by a choice of Q. 
     The various blocks illustrated in the drawings are well known in the art. In this connection reference is generally made to a publication by Burrough Corporation entitled &#34;Digital Computer Principles&#34; published by McGraw-Hill, 1962 (Ref. 1) and to a book by H. C. Thorng entitled &#34;Switch Circuits&#34;  and published by Addison-Westley Publishing Company, 1972 (Ref. 2). 
     Thus, by way of example, the adders or subtractors 12 and 17 may be implemented with combinatorial circuits. Such circuits are referred to in Chapter 2 of Ref. 2 and are described in Chapter 19 of Ref. 1. 
     A predictor filter such as filter 18 may be constructed from adders and shift registers as discussed in Chapter 17 of Ref. 1. It may also include multipliers as disclosed on page 372 of Ref. 1. 
     The two-valued limited 20 may be implemented by a combinatorial circuit consisting of direct connections and an inverter, described on page 27 of Ref. 1. 
     A converter Q→Q such as the converter 30 of FIG. 4, a compressor Q→C such as the compressor 21 of FIG. 2 and a converter C→Q such as the converter 22 of FIG. 2 may be implemented by using sequential circuits which are discussed in Chapter 20, Ref. 2. 
     A compressor Q→C such as the compressor 31 may be implemented by the use of shift registers and combinatorial circuits which are described as indicated above. 
     Concerning the blocking control 35 and sequence generator 38 of FIG. 5, these may be implemented with shift registers and timing circuits and for a description thereof reference is made to Chapter 13, Ref. 1. 
     Finally the decision logic circuit 36 of FIGS. 5 and 6 may be realized by shift registers, an adder, a multiplier and combinatorial circuits referred to hereinabove. 
     There have thus been disclosed various digital speech compression systems where the feedback residue compression takes place in the feedback loop. The circuits are characterized in that some of them require considerably less hardware than other circuits. In other cases there is a wide choice of codes that can be selected for the compression scheme. All circuits feature a predictive loop which feeds back into two separate adders. The selection of the codes has been discussed and how it can be determined which circuit or scheme can be used for a particular code.