# Patent

## Title
Method and system for lossless value-location encoding

## Abstract

A method of encoding samples in a digital signal is provided that includes receiving a frame of N samples of the digital signal, determining L possible distinct data values in the N samples, determining a reference data value in the L possible distinct data values and a coding order of L−1 remaining possible distinct data values, wherein each of the L−1 remaining possible distinct data values is mapped to a position in the coding order, decomposing the N samples into L−1 coding vectors based on the coding order, wherein each coding vector identifies the locations of one of the L−1 remaining possible distinct data values in the N samples, and encoding the L−1 coding vectors.

## Background
CROSS-REFERENCE TO RELATED APPLICATIONS
This application is a Continuation of and claims priority to U.S. patent application Ser. No. 12/818,165, filed Jun. 18, 2010, which claims priority to Provisional Patent Application Ser. No. 61/218,307, filed Jun. 18, 2009, U.S. Provisional Patent Application Ser. No. 61/219,198, filed Jun. 22, 2009, and U.S. Provisional Patent Application Ser. No. 61/219,868, filed Jun. 24, 2009, which are incorporated herein by reference in their entirety.


BACKGROUND OF THE INVENTION
In many signal processing applications, it is desirable to transmit and/or store a digitized signal such that the exact original signal may be recovered. It is also desirable to reduce the number of bits needed to represent the signal in order to maximize the amount of data than can be handled during the transmission and/or storage process. Lossless compression techniques may be used to achieve this goal. Many techniques exist for lossless compression including Huffman coding, run-length coding, and predictive coding. Each of these coding techniques may provide comparatively better compression for certain classes of signals. However, improvements in lossless compression of digital signals are desirable.
Further, in many cases, digital signals to be encoded and transmitted include one predominant sample value, with sparse excursions to a few other sample values. For example, background noise in digital audio signals will often have a few distinct sample values. Signals with this sample characteristic are often not conducive to efficient encoding by known encoding techniques, such as linear predictive coding. When data to be transmitted includes predominantly one sample value, with sparse excursions to a single additional sample value, a run-length coding technique may be used. However, if sparse excursions occur to more than one other value, the typical run-length coding techniques may not be efficient, since such techniques may be most effective in encoding digital signals having sequences of one predominant sample value with a single other sample value sparsely included.



BRIEF DESCRIPTION OF THE DRAWINGS
Particular embodiments in accordance with the invention will now be described, by way of example only, and with reference to the accompanying drawings:
FIG. 1 shows a block diagram of a digital system in accordance with one or more embodiments of the invention;
FIG. 2 shows a flow diagram of a method in accordance with one or more embodiments of the invention;
FIGS. 3A-3E and 4A-4D show examples in accordance with one or more embodiments of the invention;
FIG. 5 shows a block diagram of an audio encoder in accordance with one or more embodiments of the invention; and
FIG. 6 shows an illustrative digital system in accordance with one or more embodiments of the invention.



DETAILED DESCRIPTION OF EMBODIMENTS OF THE INVENTION
Specific embodiments of the invention will now be described in detail with reference to the accompanying figures. Like elements in the various figures are denoted by like reference numerals for consistency.
Certain terms are used throughout the following description and the claims to refer to particular system components. As one skilled in the art will appreciate, components in digital systems may be referred to by different names and/or may be combined in ways not shown herein without departing from the described functionality. This document does not intend to distinguish between components that differ in name but not function. In the following discussion and in the claims, the terms “including” and “comprising” are used in an open-ended fashion, and thus should be interpreted to mean “including, but not limited to . . . . ” Also, the term “couple” and derivatives thereof are intended to mean an indirect, direct, optical, and/or wireless electrical connection. Thus, if a first device couples to a second device, that connection may be through a direct electrical connection, through an indirect electrical connection via other devices and connections, through an optical electrical connection, and/or through a wireless electrical connection.
In the following detailed description of embodiments of the invention, numerous specific details are set forth in order to provide a more thorough understanding of the invention. However, it will be apparent to one of ordinary skill in the art that the invention may be practiced without these specific details. In other instances, well-known features have not been described in detail to avoid unnecessarily complicating the description. In addition, although method steps may be presented and described herein in a sequential fashion, one or more of the steps shown and described may be omitted, repeated, performed concurrently, and/or performed in a different order than the order shown in the figures and/or described herein. Accordingly, embodiments of the invention should not be considered limited to the specific ordering of steps shown in the figures and/or described herein. Further, while some embodiments of the invention are described herein in reference to the ITU-T G.711.0 standard and/or audio signals, one of ordinary skill in the art will understand that embodiments of the invention are not limited to any particular signal coding standard or type of signal. Recommendation ITU-T G.711.0 (“ITU-T G.711.0”) as approved on Sep. 22, 2009 by ITU-T Study Group 16 is incorporated by reference herein in its entirety.
In general, embodiments of the invention provide for lossless value-location encoding of a digital signal in which the locations of occurrences of each possible distinct sample value in the digital signal are encoded. More specifically, in one or more embodiments of the invention, a frame of N samples with L possible distinct data values is decomposed into L−1 coding vectors where each coding vector represents the locations of one of L−1 of the possible distinct data values in the frame. The decomposition is performed by determining a reference data value in the L possible distinct data values, determining a coding order of the L−1 remaining possible distinct data values, and generating the L−1 coding vectors according to the coding order. Each of the coding vectors is then encoded in the order of generation and inserted into the output bit stream. Indicator(s) of the reference data value and the coding order may also be encoded and inserted in the output bit stream.
FIG. 1 shows a block diagram of a digital system in accordance with one or more embodiments of the invention. The digital system is configured to perform coding of digital audio sequences using embodiments of the methods described herein. The system includes a source digital system (100) that transmits encoded digital audio sequences to a destination digital system (102) via a communication channel (116). The source digital system (100) includes an audio capture component (104), an audio encoder component (106) and a transmitter component (108). The audio capture component (104) is configured to provide an audio sequence to be encoded by the audio encoder component (106). The audio capture component (104) may be, for example, a microphone, a speech synthesizer, an audio archive, or an audio feed from an audio content provider.
The audio encoder component (106) receives an audio sequence from the audio capture component (104) and encodes it for transmission by the transmitter component (108). In general, the audio encoder component (106) receives the audio sequence from the audio capture component (104) as a sequence of frames and encodes the audio data in each frame for transmission. During the encoding process, a method for lossless value-location encoding in accordance with one or more of the embodiments described herein may be used. The functionality of an embodiment of the audio encoder component (106) is described in more detail below in reference to FIG. 5.
The transmitter component (108) transmits the encoded audio data to the destination digital system (102) via the communication channel (116). The communication channel (116) may be any communication medium, or combination of communication media suitable for transmission of the encoded audio sequence, such as, for example, wired or wireless communication media, a local area network, and/or a wide area network.
The destination digital system (102) includes a receiver component (110), an audio decoder component (112) and a speaker component (114). The receiver component (110) receives the encoded audio data from the source digital system (100) via the communication channel (116) and provides the encoded audio data to the audio decoder component (112) for decoding. In general, the audio decoder component (112) reverses the encoding process performed by the audio encoder component (106) to reconstruct the frames of the audio sequence. The reconstructed audio sequence may then be reproduced by the speaker component (114). The speaker component (114) may be any suitable audio reproduction device.
In some embodiments of the invention, the source digital system (100) may also include a receiver component and an audio decoder component and/or the destination digital system (102) may include a transmitter component and an audio encoder component for transmission of audio sequences in both directions. Further, the audio encoder component (106) and the audio decoder component (112) may perform encoding and decoding in accordance with one or more audio compression standards such as, for example, ITU-T G.711 and G.711.0 standards. The audio encoder component (106) and the audio decoder component (112) may be implemented in any suitable combination of software, firmware, and hardware, such as, for example, one or more digital signal processors (DSPs), microprocessors, discrete logic, application specific integrated circuits (ASICs), field-programmable gate arrays (FPGAs), etc. Software implementing all or part of the audio encoder and/or audio decoder may be stored in a memory, e.g., internal and/or external ROM and/or RAM, and executed by a suitable instruction execution system, e.g., a microprocessor or DSP. Analog-to-digital converters and digital-to-analog converters may provide coupling to the real world, modulators and demodulators (plus antennas for air interfaces) may provide coupling for transmission waveforms, and packetizers may be included to provide formats for transmission.
FIG. 2 shows a flow diagram of a method for lossless value-location coding of one or more frames of N samples in a digital signal in accordance with one or more embodiments of the invention. As shown in FIG. 2, initially, a frame of N samples, I0 to IN-1, of the digital signal is received (200). The value of N may be any suitable value. For example, N may be 40, 80, 160, 240, or 320.
Next, the L possible distinct data values that the N samples may be determined (202). The possible distinct data values in the N samples may be determined by finding the maximum sample value Imax=max{ln: n=0, . . . N−1} and the minimum sample value Imin=min{ln: n=0, . . . N−1} in the N samples. The possible distinct data values {il: 1=0, . . . , L−1} are then the range of data values from Imin to Imax, i.e., Imin≦il≦Imax. The number of possible distinct data values L, i.e., the data value range, for the frame may be computed as the difference between the maximum and minimum values of the N samples in the frame, e.g., L=Imax−Imin+1. For example, if the actual distinct sample values in the frame are {−3, −2, 0, 1, 2}, then L=6, indicating that there are six possible distinct data values in the frame and the possible distinct data values are {3, −2, −1, 0, 1, 2}.
A reference data value v0 is then determined from the possible distinct data values il (204) and a coding order {vk: k=1, . . . , L−1} of the L−1 remaining possible distinct data values is also determined (206). As is explained in more detail below, the reference data value v0 and the coding order impact the decomposition of the N samples into coding vectors, and thus the overall coding efficiency. That is, the coding vectors, each of which represents locations of one of the L−1 remaining possible distinct data values in the N samples, are generated according to the coding order and this coding order may affect the content and length of the coding vectors. Further, as is explained in more detail below, the reference data value and coding order, unless fixed for all frames, are encoded in some fashion for communication to the decoder. The selection of the reference data value and the coding order affect how many bits are required for encoding.
The reference data value v0 may be any one of the possible distinct data values il and may be determined in any suitable way, e.g., a single empirically determined value, direct computation, table look-up, etc. For example, the reference data value v0 may be the data value that occurs most frequently in the N samples, or, if the digital signal has certain characteristics, may be set to 0 for all frames. The coding order {vk:k=1, . . . , L−1} of the L−1 remaining possible distinct data values may be also be determined in any suitable way. In general, the L−1 remaining possible distinct data values are mapped in some way to one of the vk. For example, if the possible distinct data values are {−2,−1,0,1,2} and the reference data value v0=0, one possible coding order is {−1,1,−2,2}. The technique(s) for determining the reference data value v0 and the coding order vk may be defined by a particular application, resources available, known signal characteristics, and/or performance required. Factors to be considered in the determination of the reference data value v0 and the coding order vk are discussed below.
One possible way to determine the reference data value v0 and/or the coding order vk is to calculate the compression obtained for each possible reference data value and/or coding order of the L−1 remaining possible data values and the corresponding coding vectors, and choose a reference data value and/or the coding order that provides the best compression. However, this requires computational resources that may not be available. In addition, this would require explicit encoding of the coding order. Another possible way to determine the reference data value v0 and the coding order is to select the reference data value in some suitable way and then use a specific pre-determined coding order, for example from the minimum to the maximum data value of the remaining possible data values. This does not require the computational resources mentioned above, and does not require explicitly encoding the coding order. However, this approach may not provide the best overall compression performance. Another possible way to determine the reference data value v0 and the coding order is to select the most frequently occurring data value in the N samples as the reference data value and to order the L−1 remaining possible data values in order of frequency of occurrence. This also does not require the computational resources of the initial approach but it does require explicitly encoding the reference data value and the coding order. Again, this approach may not provide the best overall compression performance.
In some embodiments of the invention, the reference data value v0 is set to the data value that occurs most often in the N samples. The coding order vk of the L−1 remaining possible distinct data values is determined by comparing the total number of occurrences of actual distinct data values in the N samples above the reference value v0, NA, to the total number of occurrences of values below the reference value v0, NB. The L−1 possible distinct data values are mapped to the coding order vk by alternating above and below the reference data value v0 as follows:




  
    
      
        
          if
          ⁢
          
            
          
          ⁢
          
            N
            A
          
        
        ≥
        
          N
          B
        
      
    
    
      
        
          if
          ⁢
          
            
          
          ⁢
          
            N
            A
          
        
        <
        
          N
          B
        
      
    
  
  
    
      
        
          v
          1
        
        =
        
          
            v
            0
          
          +
          1
        
      
    
    
      
        
          v
          1
        
        =
        
          
            v
            0
          
          -
          1
        
      
    
  
  
    
      
        
          v
          2
        
        =
        
          
            v
            0
          
          -
          1
        
      
    
    
      
        
          v
          2
        
        =
        
          
            v
            0
          
          +
          1
        
      
    
  
  
    
      
        
          v
          3
        
        =
        
          
            v
            0
          
          +
          2
        
      
    
    
      
        
          v
          3
        
        =
        
          
            v
            0
          
          -
          2
        
      
    
  
  
    
      
        
          v
          4
        
        =
        
          
            v
            0
          
          -
          2
        
      
    
    
      
        
          v
          4
        
        =
        
          
            v
            0
          
          +
          2
        
      
    
  
  
    
      ⋮
    
    
      ⋮
    
  




Assignment above and below the reference value v0 is done as long as data values are available for alternating; any remaining data values are then assigned to the remaining vk.

For example, consider the example signal of FIG. 3A. In this signal, N=20, L=5, and the possible distinct data values are {−2,−1,0,1,2}. The most frequently occurring data value is 0, so the reference data value v0 is set to 0. Further, NA=7 and NB=4. Since NA>NB, the coding order will be {1,−1,2,−2}. If this approach for determining the reference data value v0 and the coding order vk is used, the information to be encoded for the decoder is the reference data value v0 and an indication of whether the first data value in the coding order is the data value above or below the reference data value v0, e.g., a single bit.
Referring again to FIG. 2, once the reference data value v0 and the coding order are determined, the N samples are decomposed into L−1 coding vectors based on the coding order where each coding vector identifies the locations of one of the L−1 remaining possible data values, i.e., the locations of one of the vk, in the N samples (208). In some embodiments of the invention, the N samples are first decomposed into L−1 interim coding vectors ck with a 1 at locations where the respective vk value occurs and a 0 in all other locations. The interim coding vectors ck are then processed to generate reduced-length coding vectors zk.
More specifically, the N samples, denoted as s, may be decomposed as




  s
  =
  
    
      v
      0
    
    +
    
      
        ∑
        
          k
          =
          1
        
        
          L
          -
          1
        
      
      ⁢
      
        
          (
          
            
              v
              k
            
            -
            
              v
              0
            
          
          )
        
        ⁢
        
          c
          k
        
      
    
  




where the interim coding vectors ck represent the locations of all values vk within the N samples. An interim coding vector ck contains 1 at the locations at which the value vk occurs, and 0 elsewhere. The number of occurrences of each vk value, Nk, equals the number of non-zero elements in the corresponding ck vector,




  
    
      
        N
        k
      
      =
      
        
          ∑
          
            i
            =
            1
          
          N
        
        ⁢
        
          
            c
            k
          
          ⁡
          
            (
            i
            )
          
        
      
    
    ,
    
      

    
    ⁢
    with
  




  
    
      N
      0
    
    =
    
      N
      -
      
        
          ∑
          
            k
            =
            1
          
          
            L
            -
            1
          
        
        ⁢
        
          
            N
            k
          
          .
        
      
    
  



To encode the N samples, it is sufficient to specify the number of possible data values L the reference data value v0, and the coding order vk with the corresponding interim coding vectors ck.

FIGS. 3A-3E show an example of a digital signal decomposition into interim coding vectors ck. In the original digital signal of FIG. 3A, N=20, L=5, and the possible distinct data values are {−2,−1,0,1,2}. For the decomposition, the reference value v0=0, and the coding order is v1=1, v2=−1, v3=2, and v4=−2. The corresponding interim coding vectors ck are shown in FIGS. 3B-3E.
The interim coding vectors ck are then reduced in length to generate the coding vectors zk. The approach to generating the coding vectors zk takes advantage of the fact that the interim coding vectors ck contain non-zero elements in unique locations, i.e.,

    
    
        if ck (n)=1
        then cl (n)=0 for all/k

where n=1, . . . , N. Using this property, once a given interim coding vector ck is reduced to a coding vector zk, the elements corresponding to the Nk non-zero ck locations need not be considered when reducing all subsequent interim encoding vectors ci, i>k.

    
    


The coding vectors zk may be generated from the interim coding vectors ck as follows. Let zk denote a vector obtained from the code vector ck by removing elements corresponding to all non-zero-value locations in vectors c1, . . . , ck-1 (or, equivalently, by preserving those elements corresponding to zero-value locations). The Dk dimension (length) of a vector zk is given by




  
    
      D
      k
    
    =
    
      N
      -
      
        
          ∑
          
            i
            =
            1
          
          
            k
            -
            1
          
        
        ⁢
        
          N
          i
        
      
    
  
  ,
  
    k
    =
    2
  
  ,
  ...
  ⁢
  
    
  
  ,
  
    L
    -
    1.
  




Let vectors δk specify the non-zero-value and zero-value locations observed in the interim coding vectors c1, . . . , ck,





  
    
      
        δ
        k
      
      ⁡
      
        (
        n
        )
      
    
    =
    
      
        ∑
        
          i
          =
          1
        
        k
      
      ⁢
      
        
          c
          i
        
        ⁡
        
          (
          n
          )
        
      
    
  
  ,
  
    k
    =
    1
  
  ,
  ...
  ⁢
  
    
  
  ,
  
    L
    -
    1.
  




Note that the vectors δk may be calculated recursively:

δ1(n)=c1(n)

δk(n)=δk-1(n)+ck(n),k=2, . . . ,L−1,

Further, let

z1(n)=c1(n),n=1, . . . ,N 

with the D1 dimension equal to N. The coding vectors zk, k=2, . . . , L−1, may be computed as follows:

set m=1
for each n=1, . . . , N

    
    
        if δk-1(n)=0
        then zk(m)=ck(n) and m=m+1

Note that the coding vectors zk, k=2, . . . , L−1 are generated sequentially in the coding order. The resulting coding vectors zk are summarized in Table 1 below.

    
    











TABLE 1






Number of



Coding vector
elements
Description







z1
N
equivalent to c1


z2
N − N1
c2 with elements corresponding to non-




zero locations in c1 removed


z3
N − N1 − N2
c3 with elements corresponding to non-




zero locations in c1 and c2 removed


.




.




.




 


zL−1




  N
  -
  
    
      ∑
      
        i
        =
        1
      
      
        L
        -
        2
      
    
    ⁢
    
      N
      i
    
  




cL−1 with elements corresponding to non-zero locations in c1, . . . , cL−2 removed









Note that as elements are removed from the interim coding vectors ck, the coding vectors become shorter with each processing step k which helps to improve coding efficiency. While the total number of elements in the interim coding vectors ck equals N(L−1), the total number of elements in coding vectors zk is reduced to




  
    
      
        ∑
        
          k
          =
          1
        
        
          L
          -
          1
        
      
      ⁢
      
        (
        
          N
          -
          
            
              ∑
              
                i
                =
                1
              
              
                k
                -
                1
              
            
            ⁢
            
              N
              i
            
          
        
        )
      
    
    =
    
      
        N
        ⁡
        
          (
          
            L
            -
            1
          
          )
        
      
      -
      
        
          ∑
          
            k
            =
            1
          
          
            L
            -
            2
          
        
        ⁢
        
          
            ∑
            
              i
              =
              1
            
            k
          
          ⁢
          
            N
            i
          
        
      
    
  
  ,




i.e., reduced by





  
    
      ∑
      
        k
        =
        1
      
      
        L
        -
        2
      
    
    ⁢
    
      
        ∑
        
          i
          =
          1
        
        k
      
      ⁢
      
        N
        i
      
    
  
  =
  
    
      ∑
      
        k
        =
        1
      
      
        L
        -
        2
      
    
    ⁢
    
      
        N
        k
      
      ⁡
      
        (
        
          L
          -
          1
          -
          k
        
        )
      
    
  




which is maximized when N1≧N2≧ . . . ≧NL-1.

FIGS. 4A-4D show an example of the generation of the L−1 reduced-length coding vectors z.sub.k from the interim coding vectors c.sub.k of FIGS. 3B-3E. The z.sub.1 coding vector of FIG. 4A is equivalent to the interim coding vector c.sub.1 in FIG. 3B. The reduced-length coding vector z.sub.2 of FIG. 4B is formed by removing the five non-zero locations in c.sub.1 from the interim coding vector c.sub.2 of FIG. 3C. The reduced-length vector z.sub.3 of FIG. 4C is then formed by removing the eight non-zero locations in c.sub.1 and c.sub.2 from c.sub.3 in FIG. 3D. This process continues until all L−1 reduced-length coding vectors are generated. As such, due to the removal of non-zero elements in prior vectors, vectors z1 through z4 as shown in FIG. 4A-D may be decreasing in number of locations. Vectors z1 through z4 also may have the locations renumbered so that they all start at 1 and are sequential. Vector z1 may contain 20 locations. Vector c1, of FIG. 3B, may contain five non-zero values, for example, at locations 1, 7, 13, 17, and 18. Therefore, in such an embodiment, vector z2 will contain 15 locations (i.e. locations 20-5). In one embodiment, Vector z2 is formed by removing locations 1, 7, 13, 17, and 18 from c2, as shown in FIG. 3C. Thus, the reduced vector z2, shown in FIG. 4B, may consist of fifteen locations, i.e. 2-6, 8-12, 14-16, and 19-20 of vector c2. These locations may be renumbered such that vector z2 has locations 1-15. To form vector z3, shown FIG. 4C, the non-zero locations of vectors c1 and c2 may be removed from vector c3, of FIG. 3D. Since vector c1 may have five non-zero values at locations, i.e. 1, 7, 13, 17, and 18, and since vector c2 may have three non-zero values at, i.e. 8, 16, and 19, there will be eight (5+3) locations removed, and vector z3 of FIG. 4C may have twelve (20-8) locations, consisting of the remaining locations, i.e. 2-6, 9-12, 14-15, and 20. Vector z3 may be formed by selecting those remaining locations from vector c3, and renumbering the locations. In such an embodiment, vector z3 would have locations 1-12. Vector z4 of FIG. 4D may be formed by removing the non-zero locations of vectors c1, c2, and c3 from vector c4 of FIG. 3E. As such, vector c1 may have five non-zero values at locations, i.e. 1, 7, 13, 17, and 18, and since vector c2 may have three non-zero values at, i.e. 8, 16, and 19, and since vector c3 may have two non-zero values at locations, i.e. 10 and 15, there will be 10 (5+3+2) locations removed and vector z4 of FIG. 4D may have ten (20−10) locations, consisting of the remaining locations, i.e. 2-6, 9, 11-12, 14, and 20. Vector z4 may be formed by selection the remaining locations from vector c4 of FIG. 3E and renumbering the locations to 1-10.
Referring again to FIG. 2, in some embodiments of the invention, as an alternative to calculating interim coding vectors ck and the coding vectors zk, the vector of the N samples is directly decomposed into reduced-length coding vectors sk computed as follows. Let sl=s; the reduced-length coding vectors sk, k=2, . . . , L−1, may be computed as follows:

    
    
        set m=1
        for each n=1, . . . , Dk-1 
        
            if sk-1(n)≠vk-1 
            then sk(m)=sk-1(n) and m=m+1

Note that the reduced-length coding vectors zk and the reduced-length coding vectors sk have the same length, Dk, and that the locations in the coding vectors zk which contain 1 are the locations in the coding vectors sk which contain vk. Thus, encoding the locations of the vk values in the coding vectors sk is equivalent to encoding the locations of 1's in the coding vectors zk.

        
        
    
    


The resulting coding vectors, i.e., the coding vectors zk or the coding vectors sk are then encoded along with an appropriate indication of the reference data value v0 and the coding order used in generating the coding vectors (210) and inserted into the output bit stream. Any suitable encoding technique may be used to encode the coding vectors. Further, an encoding technique may be selected for each coding vector. That is, several encoding techniques may be available for use and the encoding technique that provides the best compression for a particular coding vector may be selected for that coding vector. For example, the coding vectors zk contain a series of zeros and ones, and there are many known techniques for encoding such vectors, such as run-length coding methods like Golomb or Rice encoding. However, for a particular coding vector zk, run-length coding may not be optimum. When the number of non-zero elements Nk is small, explicit encoding of the Nk locations may result in a fewer number of bits. In this encoding technique, the number of non-zero locations Nk and the locations themselves may be encoded using binary representation or other known pulse-coding techniques. In other cases, Nk may be such that encoding zk (n) as binary bits may be more efficient than either run-length or explicit location encoding. Accordingly, the technique(s) used to encode the coding vectors zk may be defined by a particular application, resources available, signal characteristics and performance required.
In some embodiments of the invention, three encoding techniques are provided to be selected for encoding the coding vectors zk, Rice run-length encoding, explicit location encoding, and binary encoding. Further, whenever for some k there are no occurrences of a particular value vk, an indicator of a zero vector, zk=0, is encoded in the output bit stream. The Rice run-length method encodes the length of segments between the occurrences of ones in a coding vector zk (which in essence defines the locations of all occurrences of a value vk). Compression is maximized by determining the Rice exponent for each zk to be encoded. The Rice exponent is the power of two used in the Rice run-length encoding technique. In one or more embodiments, a search for the best exponent in the range of one to four is performed, and the exponent that provides the best compression is selected. The selected Rice exponent is encoded in the bit stream followed by the run-length encoding of the coding vector zk.
Explicit location encoding may be used to improve compression when the number of non-zero elements Nk in a coding vector zk is small. In this case, compression may be achieved by a straightforward encoding of a location offset within the coding vector. In one or more embodiments, if Nk≦4, explicit location encoding is used. In this case, the number of locations Nk is encoded in the output bit stream followed by the offsets of each of the locations. Since the length of a coding vector zk is Dk, binary encoding of each location may be done in ┌log2(Dk)┐ bits. In some embodiments of the invention, if the number of bits needed to run length encode a coding vector zk is greater than Dk, binary encoding is used. The binary coding technique writes the Dk bits of the coding vector zk into the output bit stream. For each of these encoding techniques, an identifier of the selected encoding technique is also inserted in the output bit stream prior to the encoding bits of the coding vector zk.
In some embodiments of the invention, three encoding techniques are provided to be selected for encoding the coding vectors sk, Rice run-length encoding (with four possible exponents), explicit location encoding, and binary encoding. Further, whenever for some k there are no occurrences of a particular value vk, an indicator of a zero vector, zk=0, is encoded in the output bit stream. One possible indicator of a zero vector is shown in Table 2 below. When one of these coding techniques is selected for encoding a coding vector sk, an indicator of the selected coding technique is inserted in the output bit stream prior to the encoding bits of the coding vector sk. One set of possible indicators for the coding techniques is shown in Table 2 below.










TABLE 2







Encoding
Bit stream sequence









Binary encoding
000



Run length Rice encoding (S = 1)
001



Run length Rice encoding (S = 2)
010



Run length Rice encoding (S = 3)
011



Run length Rice encoding (S = 4)
100



Value not occurring
101



Unused
110



Explicit location encoding
111










In some embodiments of the invention, if the number of bits needed to run-length encode the locations of vk in a coding vector sk is greater than Dk, then binary encoding is used. Specifically, Dk bits are written into the output bit stream, where binary 1's and 0's are written when sk(n)=vk and sk(n)≠vk, respectively, with n=0, . . . , Dk−1.
In some embodiments of the invention, Rice run length encoding is used to encode the locations of vk in a coding vector sk if the number of bits required to encode the segment lengths between the occurrences of vk within the sk(n) sequence (which in essence defines the locations of all occurrences of values vk provides the best compression. Rice parameters over the range of one to four are tried, and the one that provides the best compression is selected. If Rice run length coding provides the best compression, then the coding vector sk is run length encoded in the output bit stream.
In some embodiments of the invention, if binary encoding is not used and 1≦Nk≦4 and the number of bits needed to run-length encode the locations of vk a coding vector sk is greater than Nk┌log2(Dk)┐+2, then explicit location encoding is used. The Nk locations lk(m) of vk are determined such that sk(lk(m))=vk, for m=0, . . . , Nk−1. The binary value of Nk−1 is encoded in the output bit stream in two bits and then the Nk indices lk(m) are written to the output bit stream with ┌log2(Dk)┐ bits each.
Referring again to FIG. 2, the steps 200-210 are repeated (212) for each frame in the digital signal that is to be encoded using lossless value-location encoding. As is explained in more detail below in reference to FIG. 5, lossless value-location encoding may be used in combination with other methods for compressing digital signals. In such embodiments, the lossless value-location encoding may be selected for encoding some frames in the digital signal and other encoding methods may be used for other frames in the digital signal. Criteria for determining when lossless value-location encoding is used in preference to other coding methods may depend on the application. For example, lossless value-location encoding may be used whenever the number of possible distinct data values to encode, L, is within some desired range, or when the minimum and maximum values of a frame are within a desired range, or whenever else the signal is expected to be efficiently encoded by this method.
In some embodiments of the invention, lossless value-location encoding is selected according to criteria empirically determined by statistical analysis of relevant test signals. More specifically, lossless value-location encoding is used when L≦4 and the maximum and minimum data values are in one of four desired ranges. The frame length N is also considered for one of the four desired ranges. Table 3 below summarizes these selection criteria. If the data values in the frame meet one of the criteria in specified Table 3 and the most frequently occurring data value in the frame is 0, then lossless value-location encoding is used for the frame with the reference data value v0=0. If lossless value-location encoding is used, an indicator of the specific criteria met is written into the output stream, i.e., one of the values in the column of Table 3 labeled “Bit stream sequence.”














TABLE 3











Data-range
Bit stream



L
lmin
lmax
Frame length
case
sequence























4
−2
1
240, 320
0
00



3
−1
1
All
1
01



3
−2
0
All
2
10



2
0
1
All
3
11










In the above method, the mapping of the possible distinct data values to the coding order vk impacts the achievable maximum compression of the N samples. Encoding a vector first that has a larger number of elements Nk may require more bits to encode the locations of the vk, but more elements may be removed in the generation of subsequent coding vectors. On the other hand, encoding a coding vector with a smaller number of elements before one with a larger number of elements may require fewer bits, but fewer elements may be removed in the generation of subsequent coding vectors.
Further, the value determined for the reference data value v0 and/or the coding order vk affects the achievable maximum compression. For example, some choices of the reference data value v0 and the coding order vk may required the explicit encoding of the reference data value and each of the vk. If Bv bits are required to encode one value, then LBv bits are needed to encode the v0 and vk values. If the values in the frame are such that values are within some small offset of a particular value of v0 and Bo bits are required to specify this offset, with Bo<Bv, then the v0 and the vk offsets may be encoded in Bv+(L−1)Bo bits.
Encoding efficiency may be further improved if a known relationship between the vk values exists, so that mapping of the remaining possible data values to the vk may be done in a pre-determined order. For example, if the v0 and vk values are mapped sequentially from the minimum to maximum data values, then v0 may be encoded with all other vk being explicitly known. In general, it is desirable that the choice of the reference data value v0 and the coding order vk is made such that when combined with encoding of the code vectors, maximum coding efficiency is achieved.
FIG. 5 shows a block diagram of an audio encoder (500), e.g., the audio encoder (106) of FIG. 1, configured to perform lossless value-location encoding in accordance with one or more embodiments of the invention. More specifically, FIG. 5 shows a high level block diagram of the ITU-T G.711.0 audio encoder for illustrative purposes. The audio encoder (500) includes a frame buffer (502), two coding tool selection components (504, 506), twelve coding tools, and a multiplexer (508). The audio encoder (500) receives G.711 audio frames in the frame buffer (502). The frame size N may be 40, 80, 160, 240, or 320 samples. Each frame is then provided to input selection component (504).
The input selection component (504) may select one of seven encoding tools, i.e., the three constant coding tools, the PM zero Rice coding tool, the binary coding tool, the pulse mode coding tool, and the value-location coding tool, to which it is connected for encoding the frame based on an analysis of the audio frame and/or determine that the frame should be encoded by one of the five other coding tools, i.e., the mapped domain LP coding tool, the fractional-bit coding tool, the min-max level coding tool, the direct LP coding tool, and the uncompressed coding tool. The outputs of the latter five coding tools are provided to output selection component (506) which selects the best output of the five coding tools by analyzing the results of the coding tools. The output selection component (506) may not require a complete encoding by each of the five coding tools, but rather may estimate the resulting encoded frame sizes and select one of the coding tools for performing the actual encoding based on the estimates. The multiplexer (508) selects which coding tool bit stream to output: the bit stream of the coding tool selected by the input selection component (504) or the bit stream of the coding tool selected by the output selection component (506).
The coding techniques provided by each of the coding tools are described in ITU-T G.711.0. Further, the fractional-bit coding tool may provide a coding technique as described in U.S. patent application Ser. No. 12/818,164, entitled “Method and System for Block Adaptive Fractional-Bit Per Sample Encoding, filed on Jun. 18, 2010, which is incorporated by reference herein in its entirety. The coding technique described in ITU-T G.711.0 for the value-location coding tool is an embodiment of the method for lossless value-location encoding of FIG. 2. In the described embodiment, the value-location coding tool is selected according to the criteria shown in Table 3 above and when the most frequently occurring data value in a frame is 0. When selected, the value-location coding tool assumes that the reference data value v0 is 0 and determines the coding order vk using the previously describing alternating technique. Further, the N samples in the frame are decomposed into coding vectors sk as previously described, and are selectively encoded using one of Rice run-length encoding, explicit location encoding, or binary encoding as previously described.
In one or more embodiments of the invention, the value-location coding tool may provide coding functionality in accordance with one or more other embodiments of the method of FIG. 2. For example, interim coding vectors ck may be computed and then reduced in length to generate reduced-length coding vectors zk. Further, different techniques may be used to determine the reference data value v0 and/or the coding order vk.
Embodiments of the methods and encoders described herein may be implemented in hardware, software, firmware, or any combination thereof. If implemented in software, the software may be executed in one or more processors, such as a microprocessor, application specific integrated circuit (ASIC), field programmable gate array (FPGA), or digital signal processor (DSP). Any included software may be initially stored in a computer-readable medium such as compact disc (CD), a diskette, a tape, a file, memory, or any other computer readable storage device and loaded and executed in the processor. In some cases, the software may also be sold in a computer program product, which includes the computer-readable medium and packaging materials for the computer-readable medium. In some cases, the software instructions may be distributed via removable computer readable media (e.g., floppy disk, optical disk, flash memory, USB key), via a transmission path from computer readable media on another digital system, etc.
Embodiments of the methods and encoders for lossless value-location encoding as described herein may be implemented for virtually any type of digital system (e.g., a desk top computer, a laptop computer, a handheld device such as a mobile (i.e., cellular) phone, a personal digital assistant, a Voice over Internet Protocol (VoIP) communication device such as a telephone, server or personal computer, etc.) with functionality to capture or otherwise generate digital signals. FIG. 6 shows a block diagram of an illustrative digital system (600) (e.g., a personal computer) that includes a processor (602), associated memory (604), a storage device (606), and numerous other elements and functionalities typical of digital systems (not shown). In one or more embodiments of the invention, the digital system (600) may include multiple processors and/or one or more of the processors may be digital signal processors.
The digital system (600) may also include input means, such as a keyboard (608) and a mouse (610) (or other cursor control device), and output means, such as a monitor (612) (or other display device). The digital system (600) may also include an audio capture device (not shown) that includes circuitry (e.g., a microphone) for capturing audio sequences. The digital system (600) may include an audio encoder, e.g., the encoder of FIG. 5, with functionality to perform embodiments of the method of FIG. 2 as described herein. The digital system (600) may be connected to a network (not shown) (e.g., a local area network (LAN), a wide area network (WAN) such as the Internet, a cellular network, any other similar type of network and/or any combination thereof) via a network interface connection (not shown). Those skilled in the art will appreciate that the input and output means may take other forms.
Further, those skilled in the art will appreciate that one or more elements of the aforementioned digital system (600) may be located at a remote location and connected to the other elements over a network. Further, embodiments of the invention may be implemented on a distributed system having a plurality of nodes, where each portion of the system and software instructions may be located on a different node within the distributed system. In one embodiment of the invention, the node may be a digital system. Alternatively, the node may be a processor with associated physical memory. The node may alternatively be a processor with shared memory and/or resources.
Software instructions to perform embodiments of the invention may be stored on a computer readable medium such as a compact disc (CD), a diskette, a tape, a file, memory, or any other computer readable storage device. The software instructions may be distributed to the digital system (600) via removable computer readable media (e.g., floppy disk, optical disk, flash memory, USB key), via a transmission path from computer readable media on another digital system, etc.
While the invention has been described with respect to a limited number of embodiments, those skilled in the art, having benefit of this disclosure, will appreciate that other embodiments can be devised which do not depart from the scope of the invention as disclosed herein. Accordingly, the scope of the invention should be limited only by the attached claims. It is therefore contemplated that the appended claims will cover any such modifications of the embodiments as fall within the true scope and spirit of the invention.

## Claims

1. A method of encoding samples in a digital signal, wherein the digital signal is a digital audio signal, the method comprising:
receiving a frame of N samples of the digital signal; determining L possible distinct data values in the N samples;
determining a reference data value in the L possible distinct data values and a coding order of L−1 remaining possible distinct data values, wherein each of the L−1 remaining possible distinct data values is mapped to a position in the coding order;
decomposing the N samples into L−1 coding vectors based on the coding order, wherein each coding vector identifies the locations of one of the L−1 remaining possible distinct data values in the N samples;
encoding the L−1 coding vectors; and
transmitting the encoded coding vector to a receiver,
wherein decomposing the N samples comprises:
computing L−1 interim coding vectors based on the coding order, wherein an interim coding vector includes a first value at locations where the one of the L−1 remaining possible distinct data values occurs and a second value in all other locations, and
computing the L−1 coding vectors in the coding order from the L−1 interim coding vectors, and

wherein a coding vector of the L−1 coding vectors is equivalent to an interim coding vector of the L−1 interim coding vectors with data values corresponding to locations having the first value in at least one previous interim coding vector removed.

2. The method of claim 1, wherein decomposing the N samples further comprises:
Computing the L−1 coding vectors,
wherein an initial coding vector of the L−1 coding vectors consists of the N samples, and a subsequent coding vector of the L−1 coding vectors is generated by removing all occurrences of one or more data values in the coding order from the initial coding vector.

3. The method of claim 1, wherein the coding order is determined by alternating assignment of the L−1 remaining possible data values to the coding order based on whether a remaining possible data value is above or below the reference data value.

4. The method of claim 3, wherein the reference data value is 0.

5. The method of claim 1, wherein encoding the L−1 coding vectors comprises selecting an encoding technique for at least one of the L−1 coding vectors.

6. The method of claim 5, wherein the encoding technique is one selected from a group consisting of Rice run-length encoding, explicit location encoding, and binary encoding.

7. The method of claim 1, wherein encoding the L−1 coding vectors comprises encoding an indicator when a possible distinct data value in the L possible distinct data values is not found in the N samples.

8. An encoder for encoding a digital signal, wherein the digital signal is a digital audio signal, the encoder comprising:
a frame buffer configured to receive a frame of N samples of the digital signal; and
a value-location coding component implemented in hardware and configured to encode the frame by performing the following:
determining L possible distinct data values in the N samples;
determining a reference data value in the L possible distinct data values and a coding order of L−1 remaining possible distinct data values, wherein each of the L−1 remaining possible distinct data values is mapped to a position in the coding order; and
decomposing the N samples into L−1 coding vectors based on the coding order,

wherein each coding vector identifies the locations of one of the L−1 remaining possible distinct data values in the N samples; and encoding the L−1 coding vectors,
wherein the value-location coding component is further configured to decompose the N samples by:
computing L−1 interim coding vectors based on the coding order, wherein an interim coding vector includes a first value at locations where the one of the L−1 remaining possible distinct data values occurs and a second value in all other locations; and
computing the L−1 coding vectors in the coding order from the L−1 interim coding vectors, and

wherein a coding vector of the L−1 coding vectors is equivalent to an interim coding vector of the L−1 interim coding vectors with data values corresponding to locations having the first value in at least one previous interim coding vector removed.

9. The encoder of claim 8, wherein the value-location coding component is further configured to decompose the N samples by
computing the L−1 coding vectors, wherein an initial coding vector of the L−1 coding vectors consists of the N samples, and a subsequent coding vector of the L−1 coding vectors is generated by removing all occurrences of one or more data values in the coding order from the initial coding vector.

10. The encoder of claim 8, wherein the coding order is determined by alternating assignment of the L−1 remaining possible data values to the coding order based on whether a remaining possible data value is above or below the reference data value.

11. The encoder of claim 8, wherein the value-location coding component is configured to encode the L−1 coding vectors by selecting an encoding technique from a plurality of encoding techniques for at least one of the L−1 coding vectors, wherein the plurality of encoding techniques comprises Rice run-length encoding, explicit location encoding, and binary encoding.

12. A digital system configured to encode samples in a digital signal, wherein the digital signal is a digital audio signal, the digital system comprising:
means for receiving a frame of N samples of the digital signal;
means for determining L possible distinct data values in the N samples;
means for determining a reference data value in the L possible distinct data values and a coding order of L−1 remaining possible distinct data values, wherein each of the L−1 remaining possible distinct data values is mapped to a position in the coding order;
means for decomposing the N samples into L−1 coding vectors based on the coding order, wherein each coding vector identifies the locations of one of the L−1 remaining possible distinct data values in the N samples; and
means for encoding the L−1 coding vectors,
wherein the means for decomposing the N samples is configured to
compute L−1 interim coding vectors based on the coding order, wherein an interim coding vector includes a first value at locations where the one of the L−1 remaining possible distinct data values occurs and a second value in all other locations; and
compute the L−1 coding vectors in the coding order from the L−1 interim coding vectors, and

wherein a coding vector of the L−1 coding vectors is equivalent to an interim coding vector of the L−1 interim coding vectors with data values corresponding to locations having the first value in at least one previous interim coding vector removed.

13. The digital system of claim 12, wherein the means for decomposing the N samples is further configured to
compute the L−1 coding vectors, wherein an initial coding vector of the L−1 coding vectors consists of the N samples, and a subsequent coding vector of the L−1 coding vectors is generated by removing all occurrences of one or more data values in the coding order from the initial coding vector.

14. The digital system of claim 12, wherein the coding order is determined by alternating mapping of the L−1 remaining possible data values to positions in the coding order based on whether a remaining possible data value is above or below the reference data value.

15. The digital system of claim 12, wherein the means for encoding is configured to encode the L−1 coding vectors by selecting an encoding technique from a plurality of encoding techniques for each of the L−1 coding vectors.