Abstract:
Bit rate in a PCM Companding system is reduced by transmitting sample magnitude (X n ) if the sample is near a zero-crossing, and transmitting the difference (D n ) between sequential samples if not near a zero-crossing. ROMs are used for mapping (transforming) full versus reduced data.

Description:
FIELD OF THE INVENTION 
     The present invention relates generally to PCM (Pulse Code Modulation) telecommunications and, more particularly, to a method and apparatus for reducing the bit rate of speech channels already encoded in PCM. 
     BACKGROUND OF THE INVENTION 
     PCM is a well-known method of transmitting telephone speech which consists of periodically sampling the amplitude of voice-frequency signal and translating these amplitudes into digital form. This method is well suited to the transmission of several voice channels using time division multiplex. 
     PCM transmission of telephone speech is extensively used in North America and in the world. Several schemes have been proposed for the purpose of reducing the bit rate of PC speech: in particular, the technique known as NIC (Nearly Instantenous Companding, invented by Deutweiller et Messerschmitt and described in U.S. Pat. No. 3,945,002 issued Mar. 16, 1976) which reduces from 8 bits per sample to 6 bits per sample with the provision that three overhead bits be sent every N samples (where N is some fixed integer between 6 and 128). 
     OBJECTS OF THE INVENTION 
     An object of the invention is to reduce the rate of the PCM speech representation from an 8 to an f bit/sample while preserving a high subjective quality, in particular, a better quality than that which would be obtained by simply dropping the 8-f least significant bits of the PCM representation. 
     It is a further object of the present invention to provide a reduced format which can be prescribed dynamically, that is, a different format can be prescribed from sample to sample in a given voice channel. In addition in a time-division-multiplex embodiment a different format can be prescribed from channel to channel. 
     It is still a further object of the present invention to reduce the bit rate of PCM speech in a multiplexed voice-channel system to a digital speech using 6, 5, 4 or 3 bits per sample format. 
     For each of the time-division-multiplexed channels, say channel m (where m=1, 2, 3 . . . M), the input PCM sample is denoted at time n by X n  and S n  which are respectively the sample magnitude (i.e.: absolute value: X n  =0, 1, 2, . . . , 127) and its sign (S n=  0, 1 where 0 stands for a negative sample and 1 for a positive one). 
     After the rate reduction operation, the sample is transmitted under a new representation namely: Z n  and S n  which are respectively the &#34;tag&#34; (some number Z n  =0, 1, 2, . . . , 2 f-1  -1) and the sign. 
     Finally at the receiving end, a PCM word is retrieved denoted X n  and S n  which are respectively the (output) sample magnitude and its sign. 
     While the technique does not interfere with the transmission of the sign S n , the retrieved magnitude X n  might be slightly different from the input magnitude X n  but without resulting in subjective degradation. 
     The above objects and others are achieved with the present invention where in a pulse code modulation (PCM) transmission system for communicating digitized message samples between a transmitting station and a receiving station, the transmitting station includes an apparatus for reducing the bit rate of PCM samples from an 8-bit per sample format to an f-bit per sample format; the apparatus comprises 
     (a) input means for receiving and breaking down each input PCM sample received to a magnitude X n , wherein X n  is the absolute value of the sample at time n, and to a sign S n , wherein S n  is the sign of the sample at time n; 
     (b) feedback means for transmitting a retrievable sample X n-1 , wherein X n  is the magnitude of a retrieved sample at time n; 
     (c) means for extracting an envelope information from X n  ; 
     (d) means for extracting information relating to a sign change between consecutive samples to provide a zero-crossing mode M n  ; 
     (e) means for computing the difference D n  at time n between X n  and X n-1  ; 
     (f) selecting means for transmitting 
     X n  when X n  is in the vicinity of a sign change or for transmitting D n  otherwise; and 
     a quantizer value reflecting a zero-crossing mode M n  and a signal energy indicated by said envelope extracting means; 
     (g) first mapping means for establishing a correspondence between X n  or D n  transmitted and a binary word having f-1 number of bits; 
     (h) second mapping means for providing said retrieved sample X n  or a retrieved difference D from information obtained from the binary word, the format, the zero-crossing mode M n  and the envelope extracting means; and 
     (i) means combining S n  and X n  to provide an output PCM sample. 
     The present invention also relates to a method for reducing the bit rate of digitized message PCM samples. 
    
    
     BRIEF DESCRIPTION OF THE DRAWINGS 
     The invention will be more thoroughly understood after reading the following detailed description in conjunction with the drawings wherein: 
     FIG. 1 is a simplified block diagram of the system according to the present invention; 
     FIG. 2 is a block diagram of the device according to the present invention; 
     FIG. 3 is a graph giving an envelope estimate; 
     FIGS. 4, 5 and 6 give probability distribution of PCM magnitudes and reencoder mappings for the cases J=0,1,2, . . . , 11. 
    
    
     DETAILED DESCRIPTION OF THE INVENTION 
     In PCM, the speech is band-pass filtered between 300 and 3400 Hz and sampled at 8000 samples per second. Each sample is then rounded off by a nonuniform quantizer and coded in binary by an 8-bit word. 
     Considering the sample at time n, the most significant bit is the sign bit, denoted S n . The other seven bits represent the magnitude and is denoted X n . In decimal, this magnitude can be expressed as an integer between 0 and 127. 
     
         S.sub.n =0 (negative), 1 (positive) 
    
     
         X.sub.n =0, 1, 2, . . . , 127 
    
     In the 255 companding law the magnitude X n  is essentially the log of the actual voltage of the sample. This arrangement provides a wide dynamic range for the speech signal and a signal to noise ratio which is basically constant. 
     The present invention relates to a method of reducing the bit rate of PCM speech in a multiplexed voice-channel system. 
     FIG. 1 illustrates the overall use of the device which is composed of two parts: the RR module 10 (Rate Reduction) and the RE module 12 (Rate Expansion). While the Rate Expansion function which takes place at the receiving end requires only the RE module, the Rate Reduction at the transmitting end requires that both the RR and RE modules be operative as illustrated on FIG. 2. In this case, the RE module is used to replicate locally the expansion process which takes place at the receiving end, thereby providing a feedback to the RR module. This feedback consists of two quantities: First, X n-1  which is a replicate of the retrieved magnitude at time n-1 and, second, E n-1  which is an estimate of the signal&#39;s envelope also at time n-1. 
     The RR module 10 includes a preprocessing module 14 in which the input PCM sample at time n is broken down into its magnitude, X n , and its sign, S n . The order of the binary bits of X n  are further reversed, (least significant bit leading) for subsequent serial arithmetic processing. Finally the magnitude is delayed during one sampling time to allow the sign S n+1  of the forthcoming sample to reach the ZCM (zero-crossing-mode) module 16. 
     This module 16 outputs a flag M n  (M n  =0,1). M n  =1 signals the fact that X n  is in the vicinity of a zero crossing of the speech waveform (i.e.: a sign change between two consecutive samples). More precisely: M n  =0 whenever S n-2  =S n-1  =S n  =S n+1  otherwise M n  =1. 
     Prior to entering the processing module 18, the difference D n  =X n  -X n-1  is computed. One characteristic feature of the procedure is that X n  will be processed and transmitted whenever X n  is in the vicinity of a zero crossing (M n  =1). This is the direct scheme. On the other hand, when X n  is far from any zero crossing (i.e.: usually at waveform maxima, M n  =0), it is the quantity D n  which is transmitted following adequate processing. This is the differential scheme. This feature of the procedure takes advantage of properties of the PCM logarithmic companding law. 
     The processing module 18 selects therefore either X n  or D n  on the basis of M n . The object of this module is to provide two outputs: first, a properly scaled and bounded X n  or D n  (depending on which has been selected) and second an index, (j=0,1,2, . . . , J-1), which reflects both the zero crossing mode M n  and the signal energy as indicated by the envelope information E n-1 . Basically, for a given M n  a large value of J indicates a large input signal and a small value a small signal. Typically J=0, . . . , 7 when M n  =1 and J=8,9, . . . , 11 when M n  =0. 
     The purpose of the mapping module 20 is to provide a correspondence between a given magnitude X n  (or difference D n ) and a tag Z n  with a prescribed number of bits. This number of bits is f=1 where f is the format specified by the user at time n. The mapping module is typically implemented using a Read-Only-Memory (ROM). For each format f, there are J different possible mappings between X n  (or D n ) and the tags. A preferred embodiment consists of using X n  (or D n ) with j as the address field of the ROM. In this case, the ROM is composed of J partitions each containing one of the J possible correspondences or mappings between X n  (or D n ) and the tags Z n . 
     The low bit rate output of the device is a f bit word made of S n+1  and the tag Z n  with f-1 bits. The low bit rate word which proceeds either from a distant transmitter or from the local RR function is interpreted by the reverse mapping module 22. This module is also well suited for a Read-Only-Memory type of implementation. The address field of this second memory hereafter referred to as ROM2 is made up of Z n , of the format f, the zero-crossing mode M n , and the envelope estimate E n-1 . The content of the memory corresponding to a particular address provides directly the retrieved magnitude X n , if M n  =1, or the retrieved difference D n  if M n  =0. 
     The restoration module 24 retrieves X n  from the previous magnitudes X n-1  and the transmitted difference D n  whenever the transmission is in the differential mode. 
     
         X.sub.n =X.sub.n-1 +D.sub.n 
    
     The envelope extraction module 26 receives the retrieved magnitude X n  and extracts an envelope information according to the following recursive procedure: 
     
         E.sub.n =max[E.sub.n-1 -1, X.sub.n ] 
    
     The past processing module 28 combines S n  and X n  to obtain the output PCM sample. In particular the order of the bits of the magnitude are reversed (most significant bit leading) and properly complemented to yield the standard PCM representation. 
     Other recursive forms may be selected for this estimate such as low order filtering of X n-1 . This form is selected, however, for both its simplicity of implementation and its ability to swiftly increase upon voicing attacks. Advantageously, this estimate does not have any time constant in terms of increase. By contrast, the rate of decrease is slowed down. 
     FIG. 3 exemplifies this behavior on an actual sequence of PCM magnitudes. Three pitch periods are represented. It can be seen that, with this particular time constant, the estimate is able to maintain reasonably well the pick value over the pitch interval. Some of the implementation simplicity of this estimate would be lost if a slower time constant was sought for. 
     Let us now turn to the question of using this envelope information to control the quantization stage. The approach is that of using a set of quantizers and to switch on one or the other according to the value of the envelope. It would be both prohibitive and useless to use 128 quantizers, one for each value of the envelope E n . A set of 8 quantizers is retained and labelled from 0 to 7. The rule for selecting the proper quantizer is the following. Quantizer k is to be used whenever the three most significant bits of E n  corresponds to k in decimal, or equivalently, when the integer part of E n  /16 is equal to k. This arrangement has the merit to relate the quantizer index to the chord numbers of the PCM companding law. Hence, it may be said that quantizer k will be used whenever the sample-magnitude, X n , to be quantized is most likely to occur in the kth (or a possibly lower) chord. 
     Graphical representation of the reencoders are given in FIGS. 4, 5, 6 with the probability distributions for magnitudes and increments conditioned upon the various values of k. 
     
                       TABLE 1______________________________________X = 0,127                 TABLE FOR J = 1FORMATf =       3             4     5     6______________________________________X.sub.n = 0     Z.sub.n = 0       0*  0*    0*1                   0*      0   1*    1*2                   0       1*  2*    2*3                   1       2*  3*    3*4                   1*      2   4*    4*5                   1       3*  5*    5*6                   1       3   6*    6*7                   1       4   7*    7*8                   2       4*  8*    8*9                   2       4   8     9*10                  2       4   9*    10*11                  2*      5   9     11*12                  2       5*  10*   12*13                  2       5   10    13*14                  2       5   10    14*15                  2       6   11    15*16                  3       6   11*   16*126                 3       8   16    63127                 3       8   15    63______________________________________ 
    
     This table illustrates the way the content of ROM1 and ROM2 is extracted from the graphs of FIGS. 4, 5, 6. The above example relates to the first case, J=0, namely the transcoding of X n  into Z n  by ROM1 and the reverse transcoding of Z n  back into X n  by ROM2. Suppose for instance X n  =7 (and J=0) that ROM1 will provide the outputs Z n  =1,4,7,7, corresponding respectively to formats 3,4,5,6. If the format was, say f=4, the ROM2 would receive Z n  =4 (and f=4; J=0) it would provide the output X n  =8, that is, the value of X in the table corresponding to the value Z n  =4 that is noted by an asterisk. For convenience, the values X n  (or D n ) corresponding to a Z n  with an asterisk (i.e.: the prototypes) have been listed in their natural order in Tables 2, 3 and 4 for every State J=1,2, . . . , 15 and every format f=3,4,5 and 6. Note that for format f there are 2 f-1  such prototypes. 
     
                       TABLE 2______________________________________f: Prototypes for j = 0 (Xn, k = 0)                      P(0) = .084______________________________________3    1      4       11   194    0      2       3    5     8    12    17   245    0      1       2    3     4    5     6    78      10      12   14    16   18    22   326    0      1       2    3     4    5     6    78      9       10   11    12   13    14   1516     17      18   19    20   21    22   2324     25      26   27    28   30    33   37______________________________________f: Prototypes for j = 1 (Xn, k = 1)                      P(1) = .092______________________________________3    4      16      25   364    1      6       13   18    22   29    35   445    0      2       4    7     10   13    16   1820     23      27   31    34   37    43   526    0      1       2    3     4    5     6    79      10      12   13    16   17    18   1920     21      22   23    25   27    30   3233     34      36   38    41   46    50   56______________________________________f: Prototypes for j = 2 (Xn, k = 2)                      P(2) = .074______________________________________3    11     28      40   534    5      17      24   32    37   44    51   615    2      7       13   18    22   25    30   3335     38      42   47    50   53    60   686    1      3       5    7     11   13    16   1820     22      24   26    28   30    32   3335     36      37   38    40   43    46   4849     50      52   55    58   62    66   72______________________________________f: Prototypes for j = 3 (Xn, k = 3)                      P(3) = .062______________________________________3    22     43      56   714    13     29      38   47    53   61    69   845    6      18      25   32    35   40    45   4851     54      59   64    67   72    80   936    2      8       16   19    23   26    31   3334     36      38   41    43   45    48   4950     51      53   55    57   60    63   6566     68      71   73    78   83    87   97______________________________________ 
    
     
                       TABLE 3______________________________________f: Prototypes for j = 4 (Xn, k = 4)                      P(4) = .060______________________________________3    34     57      73   954    21     41      53   62    69   79    88   995    13     28      37   45    50   55    59   6467     71      76   81    85   90    96   1036     6     17      24   31    35   38    42   4648     51      53   55    57   60    63   6566     67      69   72    74   77    80   8183     86      88   91    95   98    102  108______________________________________f: Prototypes for j = 5 (Xn, k = 5)                      P(5) = .071______________________________________3    47     72      87   1034    34     55      67   76    83   92    101  1125    21     40      51   58    65   69    73   7882     85      89   94    99   104   110  1166    12     27      36   43    49   52    56   5963     65      67   69    71   74    76   7981     82      84   85    87   90    93   9598     100     102  105   108  112   115  119______________________________________f: Prototypes for j = 6 (Xn, k = 6)                      P(6) = .048______________________________________3    54     80      95   1104    39     64      75   84    92   99    108  1155    26     48      59   67    72   78    82   8589     94      98   101   105  110   114  1186    17     34      44   51    56   61    65   6871     73      76   79    81   82    84   8687     90      92   95    97   98    100  101104    106     108  112   113  114   117  121______________________________________f: Prototypes for j = 7 (Xn, k = 7)                      P(7) = .008______________________________________3    64     94      104  1184    49     73      85   94    101  109   115  1245    35     57      68   77    82   87    91   9699     102     106  111   114  117   121  1266    22     42      53   60    65   70    74   7881     83      86   88    89   92    95   9798     100     101  103   104  107   110  112113    114     116  118   119  122   124  127______________________________________ 
    
     
                       TABLE 4______________________________________f: Prototypes for j = 8 (Dn, k = 0)                    P(8) = .071______________________________________3    -6     -1     4    114    -9     -5     -3   -1   0    3     7     135    -11    -7     -5   -4   -3   -2    -1    01      2      3    4    5    7     11    166    -15    -14    -13  -12  -11  -10   -9    -8-7     -6     -5   -4   -3   -2    -1    01      2      3    4    5    6     7     89      10     11   12   13   14    17    23______________________________________f: Prototypes for j = 9 (Dn, k = 1)                    P(9) = .068______________________________________3    -9     0      7    194    -14    -8     -5   -1   3    8     15    275    -17    -11    -9   -7   -6   -5    -4    -3-2     -1     0    2    5    10    17    296    -21    -16    -13  -12  -11  -10   -9    -8-7     -6     -5   -4   -3   -2    -1    01      2      3    4    5    6     7     89      10     11   12   14   18    24    34______________________________________f: Prototypes for j = 10 (Dn, k = 2,3,4,5,6)                    P(10) = .344______________________________________3    -2     14     49   794    -17    -5     2    11   23   39    57    785    -29    -15    -10  -7   -6   -5    -3    -12      7      13   22   34   47    60    786    -35    -21    -15  -12  -11  -10   -9    -8-7     -6     -5   -4   -3   -2    -1    01      2      3    4    5    6     7     810     14     20   28   37   48    60    78______________________________________f: Prototypes for j = 11 (Dn, k =  7)                    P(11) = .014______________________________________3    -4     17     56   954    -15    -5     2    12   30   52    75    955    -30    -16    -12  -9   -8   -6    -5    -21      6      13   24   40   56    75    956    -33    -19    -15  -12  -11  -10   -9    -8-7     -6     -5   -4   -3   -2    -1    01      2      3    4    5    6     7     912     17     25   36   46   56    75    95______________________________________