Title of Invention	PROCESSING OF EXCITATION IN AUDIO CODING AND DECODING
Abstract	In an apparatus and method, time-varying signals are processed and encoded via a frequency domain linear prediction (FDLP) scheme to arrive at an all-pole model. Residual signals resulted from the scheme are estimated and transformed into a time domain signal. Through the process of heterodyning, the time domain signal is frequency shifted toward the baseband level as a downshifted carrier signal. Quantized values of the all-pole model and the frequency transform of the downshifted carrier signal are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process.

Title of Invention

PROCESSING OF EXCITATION IN AUDIO CODING AND DECODING

Abstract

In an apparatus and method, time-varying signals are processed and encoded via a frequency domain linear prediction (FDLP) scheme to arrive at an all-pole model. Residual signals resulted from the scheme are estimated and transformed into a time domain signal. Through the process of heterodyning, the time domain signal is frequency shifted toward the baseband level as a downshifted carrier signal. Quantized values of the all-pole model and the frequency transform of the downshifted carrier signal are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process.

Full Text	PROCESSING OF EXCITATION IN AUDIO CODING AND DECODING Claim of Priority under 35 U.S.C §119 [0001] The present application for patent claims priority to U. S Provisional Application No. 60/791,042, entitled "Processing of Excitation in Audio Coding Based on Spectral Dynamics in Sub-Bands," filed on April 10, 2006, and assigned to the assignee hereof and expressly incorporated by reference herein. BACKGROUND I. Field [0002] The present invention generally relates to signal processing, and more particularly, to encoding and decoding of signals for storage and retrieval or for communications . II. Background [0003] In digital telecommunications, signals need to be coded for transmission and decoded for reception. Coding of signals concerns with converting the original signals into a format suitable for propagation over the transmission medium. The objective is to preserve the quality of the original signals but at a low consumption of the medium's bandwidth. Decoding of signals involves the reverse of the coding process. [0004] A known coding scheme uses the technique of pulse-code modulation (PCM). Referring to FIG. 1 which shows a time-varying signal x(t) that can be a segment of a speech signal, for instance. The y-axis and the x-axis represent the amplitude and time, respectively. The analog signal x(t) is sampled by a plurality of pulses 20. Each pulse 20 has an amplitude representing the signal x(t) at a particular time. The amplitude of each of the pulses 20 can thereafter be coded in a digital value for later transmission, for example. [0005] To conserve bandwidth, the digital values of the PCM pulses 20 can be compressed using a logarithmic companding process prior to transmission. At the receiving end, the receiver merely performs the reverse of the coding process mentioned above to recover an approximate version of the original time-varying signal x(t). Apparatuses employing the aforementioned scheme are commonly called the a-law or µ-law codecs. [0006] As the number of users increases, there is a further practical need for bandwidth conservation. For instance, in a wireless communication system, a multiplicity of users can be sharing a finite frequency spectrum. Each user is normally allocated a limited bandwidth among other users. [0007] In the past decade or so, considerable progress has been made in the development of speech coders. A commonly adopted technique employs the method of code excited linear prediction (CELP). Details of CELP methodology can be found in publications, entitled "Digital Processing of Speech Signals," by Rabiner and Schafer, Prentice Hall, ISBN: 0132136031, September 1978; and entitled "Discrete-Time Processing of Speech Signals," by Deller, Proakis and Hansen, Wiley-IEEE Press, ISBN: 0780353862, September 1999. The basic principles underlying the CELP method is briefly described below. [0008] Reference is now returned to FIG. 1. Using the CELP method, instead of digitally coding and transmitting each PCM sample 20 individually, the PCM samples 20 are coded and transmitted in groups. For instance, the PCM pulses 20 of the time-varying signal x(t) in FIG. 1 are first partitioned into a plurality of frames 22. Each frame 22 is of a fixed time duration, for instance 20 ms. The PCM samples 20 within each frame 22 is collectively coded via the CELP scheme and thereafter transmitted. Exemplary frames of the sampled pulses are PCM pulse groups 22A-22C shown in FIG. 1. [0009] For simplicity, take only the three PCM pulse groups 22A-22C for illustration. During encoding prior to transmission, the digital values of the PCM pulse groups 22A-22C are consecutively fed to a linear predictor (LP) module. The resultant output is a set of frequency values, also called a "LP filter" or simply "filter" which basically represents the spectral content of the pulse groups 22A-22C. The LP filter is then quantized. [0010] The LP module generates an approximation of the spectral representation of the PCM pulse groups 22A-22C. As such, during the predicting process, errors or residual values are introduced. The residual values are mapped to a codebook which carries entries of various combinations available for close matching of the coded digital values of the PCM pulse groups 22A-22C. The best fitted values in the codebook are mapped. The mapped values are the values to be transmitted. The overall process is called time-domain linear prediction (TDLP). [0011] Thus, using the CELP method in telecommunications, the encoder (not shown) merely has to generate the LP filters and the mapped codebook values. The transmitter needs only to transmit the LP filters and the mapped codebook values, instead of the individually coded PCM pulse values as in the a- and µ- law encoders mentioned above. Consequently, substantial amount of communication channel bandwidth can be saved. [0012] On the receiver end, it also has a codebook similar to that in the transmitter. The decoder (not shown) in the receiver, relying on the same codebook, merely has to reverse the encoding process as aforementioned. Along with the received LP filters, the time -varying signal x(t) can be recovered. [0013] Heretofore, many of the known speech coding schemes, such as the CELP scheme mentioned above, are based on the assumption that the signals being coded are short-time stationary. That is, the schemes are based on the premise that frequency contents of the coded frames are stationary and can be approximated by simple (all-pole) filters and some input representation in exciting the filters. The various TDLP algorithms in arriving at the codebooks as mentioned above are based on such a model. Nevertheless, voice patterns among individuals can be very different. Non-human audio signals, such as sounds emanated from various musical instruments, are also distinguishably different from that of the human counterparts. Furthermore, in the CELP process as described above, to expedite real-time signal processing, a short time frame is normally chosen. More specifically, as shown in FIG. 1, to reduce algorithmic delays in the mapping of the values of the PCM pulse groups, such as 22A-22C, to the corresponding entries of vectors in the codebook, a short time window 22 is defined, for example 20 ms as shown in FIG. 1. However, derived spectral or formant information from each frame is mostly common and can be shared among other frames. Consequently, the formant information is more or less repetitively sent through the communication channels, in a manner not in the best interest for bandwidth conservation. [0014] Accordingly, there is a need to provide a coding and decoding scheme with improved preservation of signal quality, applicable not only to human speeches but also to a variety of other sounds, and further for efficient utilization of channel resources. [0015] Copending U.S. Patent Application No. 11/583,537, assigned to the same assignee as the current application, addresses the aforementioned need by using a frequency domain linear prediction (FDLP) scheme which first converts a time -varying signal into a frequency-domain signal. The envelope and the carrier portions of the frequency-domain signal are then identified. The frequency-domain signal is then sorted into a plurality of sub-bands. The envelope portion is approximated by the FDLP scheme as an all-pole model. The carrier portion, which also represents the residual of the all-pole model, is approximately estimated. Resulted data of the all-pole model signal envelope and the estimated carrier are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process. [0016] For improved signal quality, the signal carrier can be more accurately determined prior to packetization and encoding, yet at substantially no extra consumption of additional bandwidth. SUMMARY [0017] In an apparatus and method, a time-varying signal is partitioned into sub- bands. Each sub-band is processed and encoded via a frequency domain linear prediction (FDLP) scheme to arrive at an all-pole model. Residual signal resulted from the scheme in each sub-band is estimated. The all-pole model and the residual signal represent the Hubert envelope and the Hubert carrier, respectively, in each sub-band. Through the process of heterodyning, the time- domain residual signal is frequency shifted toward the baseband level as a downshifted carrier signal. Quantized values of the all-pole model and the downshifted carrier signal are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process. [0018] The partitioned frames can be chosen to be relatively long in duration resulting in more efficient use of format or common spectral information of the signal source. The apparatus and method implemented as described are suitable for use not only to vocalic voices but also for other sounds, such as sounds emanated from various musical instruments, or combination thereof. [0019] These and other features and advantages will be apparent to those skilled in the art from the following detailed description, taken together with the accompanying drawings, in which like reference numerals refer to like parts. BRIEF DESCRIPTION OF THE DRAWINGS [0020] FIG. 1 shows a graphical representation of a time -varying signal sampled into a discrete signal; [0021] FIG. 2 is a general schematic diagram showing the hardware implementation of the exemplified embodiment of the invention; [0022] FIG. 3 is flowchart illustrating the steps involved in the encoding process of the exemplified embodiment; [0023] FIG. 4 is a graphical representation of a time-varying signal partitioned into a plurality of frames; [0024] FIG. 5 is a graphical representation of a segment of the time-varying signal of FIG. 4; [0025] FIG. 6 is a frequency-transform of the signal shown in FIG. 5; [0026] FIG. 7 is a graphical representation of a sub-band signal of the time- varying signal shown in FIG. 5, the envelope portion of the sub-band signal is also shown; [0027] FIG. 8 is a graphical representation of the carrier portion of the sub-band signal of FIG. 7; [0028] FIG. 9 is a graphical representation of the frequency-domain transform of the sub-band signal of FIG. 7, an estimated all-pole model of the frequency- domain transform is also shown; [0029] FIG. 10 is a graphical representation of the down-shifted frequency- domain transform of FIG. 8; [0030] FIG. 11 is a graphical representation of a plurality of overlapping Gaussian windows for sorting the transformed data for a plurality of sub-bands; [0031] FIG. 12 is a graphical representation showing the frequency-domain linear prediction process; [0032] FIG. 13 is a graphical representation of the reconstructed version of the frequency-domain transform of FIG. 10; [0033] FIG. 14, is a graphical representation of the reconstructed version of the carrier portion signal of FIG. 8; [0034] FIG. 15 is flowchart illustrating the steps involved in the decoding process of the exemplified embodiment; [0035] FIG. 16 is a schematic drawing of a part of the circuitry of an encoder in accordance with the exemplary embodiment; and [0036] FIG. 17 is a schematic drawing of a part of the circuitry of an decoder in accordance with the exemplary embodiment. DETAILED DESCRIPTION [0037] The following description is presented to enable any person skilled in the art to make and use the invention. Details are set forth in the following description for purpose of explanation. It should be appreciated that one of ordinary skill in the art would realize that the invention may be practiced without the use of these specific details. In other instances, well known structures and processes are not elaborated in order not to obscure the description of the invention with unnecessary details. Thus, the present invention is not intended to be limited by the embodiments shown, but is to be accorded with the widest scope consistent with the principles and features disclosed herein. [0038] FIG. 2 is a general schematic diagram of hardware for implementing the exemplified embodiment of the invention. The system is overall signified by the reference numeral 30. The system 30 can be approximately divided into an encoding section 32 and a decoding section 34. Disposed between the sections 32 and 34 is a data handler 36. Examples of the data handler 36 can be a data storage device or a communication channel. [0039] In the encoding section 32, there is an encoder 38 connected to a data packetizer 40. A time-varying input signal x(t), after passing through the encoder 38 and the data packetizer 40 are directed to the data handler 36. [0040] In a somewhat similar manner but in the reverse order, in the decoding section 34, there is a decoder 42 tied to a data depacketizer 44. Data from the data handler 36 are fed to the data depacketizer 44 which in turn sends the depacketized data to the decoder 42 for the reconstruction of the original time- varying signal x(t). [0041] FIG. 3 is a flow diagram illustrating the steps of processing involved in the encoding section 32 of the system 30 shown in FIG. 2. In the following description, FIG. 3 is referred to in conjunction with FIGs. 4-14. [0042] In step Sl of FIG. 3, the time-varying signal x(t) is first sampled, for example, via the process of pulse-code modulation (PCM). The discrete version of the signal x(t) is represented by x(n). In FIG. 4, only the continuous signal x(t) is shown. For the sake of clarity so as not to obscure FIG. 4, the multiplicity of discrete pulses of x(n) are not shown. [0043] In this specification and the appended claims, unless specifically specified wherever appropriate, the term "signal" is broadly construed. Thus the term signal includes continuous and discrete signals, and further frequency- domain and time-domain signals. Moreover, hereinbelow, lower-case symbols denote time-domain signals and upper-case symbols denote frequency- transformed signals. The rest of the notation will be introduced in subsequent description. [0044] Progressing into step S2, the sampled signal x(n) is partitioned into a plurality of frames. One of such frame is signified by the reference numeral 46 as shown in FIG. 4. In the exemplary embodiment, the time duration for the frame 46 is chosen to be 1 second. [0045] The time-varying signal within the selected frame 46 is labeled s(t) in FIG. 4. The continuous signal s(t) is highlighted and duplicated in FIG. 5. It should be noted that the signal segment s(t) shown in FIG. 5 has a much elongated time scale compared with the same signal segment s(t) as illustrated in FIG. 4. That is, the time scale of the x-axis in FIG. 5 is significantly stretched apart in comparison with the corresponding x-axis scale of FIG. 4. The reverse holds true for the y-axis. [0046] The discrete version of the signal s(t) is represented by s(n), where n is an integer indexing the sample number. Again, for reason of clarity so as not to obscure the drawing figure, only a few samples of s(n) are shown in FIG. 5. The time-continuous signal s(t) is related to the discrete signal s(n) by the following algebraic expression: s(t) = s(nt) (1) where t is the sampling period as shown in FIG. 5. [0047] Progressing into step S3 of FIG. 3, the sampled signal s(n) undergoes a frequency transform. In this embodiment, the method of discrete cosine transform (DCT) is employed. However, other types of transforms, such as various types of orthogonal, non-orthogonal and signal-dependent transforms well-known in the art can be used. Hereinbelow, in this specification and the appended claims, the terms "frequency transform" and "frequency-domain transform" are used interchangeably. Likewise, the terms "time transform" and "time-domain transform" are used interchangeably. Mathematically, the transform of the discrete signal s(n) from the time domain into the frequency domain via the DCT process can be expressed as follows: (2) where s(n) is as defined above, f is the discrete frequency in which 0 the linear array of the N transformed values of the N pulses of s(n), and the coefficients c are given by c(0) = Jl/ N , c(f) = Jl/ N for 1 [0048] After the DCT of the time-domain parameter of s(n), the resultant frequency-domain parameter T(f) is diagrammatically shown in FIG. 6 and is designated by the reference numeral 51. The N pulsed samples of the frequency-domain transform T(f) in this embodiment are called DCT coefficients. Again, only few DCT coefficients are shown in FIG. 6. [0049] Entering into step S4 of FIG. 3, the N DCT coefficients of the DCT transform T(f) are grouped and thereafter fitted into a plurality of frequency sub- band windows. The relative arrangement of the sub-band windows is shown in FIG. 11. Each sub-band window, such as the sub-band window 50, is represented as a variable-size window. In the exemplary embodiment, Gaussian distributions are employed to represent the sub-bands. As illustrated, the centers of the sub-band windows are not linearly spaced. Rather, the windows are separated according to a Bark scale, that is, a scale implemented according to certain known properties of human perceptions. Specifically, the sub-band windows are narrower at the low- frequency end than at the high-frequency end. Such an arrangement is based on the finding that the sensory physiology of the mammalian auditory system is more attuned to the narrower frequency ranges at the low end than the wider frequency ranges at the high end of the audio frequency spectrum. It should be noted that other approaches of grouping the sub-bands can also be practical. For example, the sub-bands can be of equal bandwidths and equally spaced, instead of being grouped in accordance with the Bark scale as described in this exemplary embodiment. [0050] In selecting the number of sub-bands M, there should be a balance between complexity and signal quality. That is, if a higher quality of the encoded signal is desired, more sub-bands can be chosen but at the expense of more packetized data bits and further a more complex dealing of the residual signal, both will be explained later. On the other hand, fewer numbers of sub- bands may be selected for the sake of simplicity but may result in the encoded signal with relatively lower quality. Furthermore, the number of sub-bands can be chosen as dependent on the sampling frequency. For instance, when the sampling frequency is at 16,000 Hz, M can be selected to be 15. In the exemplary embodiment, the sampling frequency is chosen to be 8,000 Hz and with M set at 13 (i.e., M=13). [0051] After the N DCT coefficients are separated and fitted into the M sub- bands in the form of M overlapping Gaussian windows, as shown in FIG. 11 and as mentioned above, the separated DCT coefficients in each sub-bands need to be further processed. The encoding process now enters into steps S5-S16 of FIG. 3. In this embodiment, each of the steps S5-S16 includes processing M sets of sub-steps in parallel. That is, the processing of the M sets of sub-steps is more or less carried out simultaneously. Hereinbelow, for the sake of clarity and conciseness, only the set involving the sub-steps S5k-S16k for dealing with the k? sub-band is described. It should be noted that processing of other sub-band sets is substantially similar. [0052] In the following description of the embodiment, M= 13 and 1 [0053] At this juncture, it helps to make a digression to define and distinguish the various frequency-domain and time-domain terms. [0054] The time-domain signal in the k? sub-band Sk(n) can be obtained by an inverse discrete cosine transform (IDCT) of its corresponding frequency counterpart Tk(f). Mathematically, it is expressed as follows: (3) where Sk(n) and Tk(f) are as defined above. Again, f is the discrete frequency in which O = f = N , and the coefficients c are given by c(Q) = Jl/ N , for 1 [0055] Switching the discussion from the frequency domain to the time domain, the time-domain signal in the k? sub-band Sk(n) essentially composes of two parts, namely, the time-domain Hubert envelope S4 O) and the Hubert carrier Ck(n). The time-domain Hubert envelope S4 O) is diagrammatically shown in FIG. 7. However, again for reason of clarity, the discrete components of Hubert envelope S4 O) is not shown but rather the signal envelope is labeled and as denoted by the reference numeral 52 in FIG. 7. Loosely stated, underneath the Hubert envelope S4 (n) is the carrier signal which is sometimes called the excitation. Stripping away the Hubert envelope S4 O) , the carrier signal, or the Hubert carrier Ck(n), is shown in FIG. 8. Put another way, modulating the Hubert carrier Ck(n) as shown FIG. 8 with the Hubert envelope S4 (n) as shown in FIG. 7 will result in the time-domain signal in the kth sub-band Sk(n) as shown in FIG. 7. Algebraically, it can be expressed as follows: s 00 = S* O) cA O) (4) [0056] Thus, from equation (4), if the time-domain Hubert envelope S4O) and the Hubert carrier Ck(n) are known, the time-domain signal in the kth sub-band Sk(n) can be reconstructed. The reconstructed signal approximates that of a lossless reconstruction. [0057] The diagrammatical relationship between the time-domain signal Sk(n) and its frequency-domain counterpart Tk(f) can also be seen from FIGs. 7 and 9. In FIG. 7, the time-domain signal Sk(n) is shown and is also signified by the reference numeral 54. FIG. 9 illustrates the frequency-domain transform Tk(f) of the time-domain signal Sk(n) of FIG. 7. The parameter Tk(f) is also designated by the reference numeral 28. The frequency-domain transform Tk(f) can be generated from the time-domain signal Sk(n) via the DCT for example, as mentioned earlier. [0058] Returning now to FIG. 3, sub-steps S5k and S6k basically relate to determining the Hubert envelope S4 O) and the Hubert carrier Ck(n) in the sub- band k. Specifically, sub-steps S5k and S6k deal with evaluating the Hubert envelope ?A(«) , and sub-steps S7k-S16k concern with calculating the Hubert carrier Ck(n). As described above, once the two parameters ?A(«) and Ck(n) are known, the time-domain signal in the k? sub-band Sk(n) can be reconstructed in accordance with Equation (4). [0059] As also mentioned earlier, the time-domain term Hubert envelope 7k (n) in the k? sub-band can be derived from the corresponding frequency-domain parameter Tk(f). However, in sub-step S5k, instead of using the IDCT process for the exact transformation of the parameter Tk(f), the process of frequency- domain linear prediction (FDLP) of the parameter Tk(f) is employed in the exemplary embodiment. Data resulted from the FDLP process can be more streamlined, and consequently more suitable for transmission or storage. [0060] In the following paragraphs, the FDLP process is briefly described followed with a more detailed explanation. [0061] Briefly stated, in the FDLP process, the frequency-domain counterpart of the Hubert envelope Jk (n) is estimated, the estimated counterpart is algebraically expressed as Tk (/) and is shown and labeled 56 in FIG. 9. It should be noted that the parameter Tk (/) is frequency-shifted toward the baseband since the parameter Tk(f) is a frequency transform of the Hubert envelope 7k (n) which essentially is deprived of any carrier information. However, the signal intended to be encoded is Sk(n) which has carrier information. The exact (i.e., not estimated) frequency-domain counterpart of the parameter Sk(n) is Tk(f) which is also shown in FIG. 9 and is labeled 28. As shown in FIG. 9 and will also be described further below, since the parameter Tk (/) is an approximation, the difference between the approximated value Tk (/) and the actual value Tk(f) can also be determined, which difference is expressed as Ck(f). The parameter Ck(f) is called the frequency-domain Hubert carrier, and is also sometimes called the residual value. [0062] Hereinbelow, further details of the FDLP process and the estimating of the parameter Ck(f) are described. [0063] In the FDLP process, the algorithm of Levinson-Durbin can be employed. Mathematically, the parameters to be estimated by the Levinson- Durbin algorithm can be expressed as follows: 1 H(z) = - K-I l + ?a(i)z --k (5) in which H(z) is a transfer function in the z-domain; z is a complex variable in the z-domain; a(i) is the ith coefficient of the all-pole model which approximates the frequency-domain counterpart fk(f) of the Hubert envelope ?A(«) ; i = 0, ..., K-I. [0064] Fundamentals of the Z-transform in the z-domain can be found in a publication, entitled "Discrete-Time Signal Processing," 2nd Edition, by Alan V. Oppenheim, Ronald W. Schafer, John R. Buck, Prentice Hall, ISBN: 0137549202, and is not further elaborated in here. [0065] In equation (5), the value of K can be selected based on the length of the frame 46 (FIG. 4). In the exemplary embodiment, K is chosen to be 20 with the time duration of the frame 46 set at 1 sec. [0066] In essence, in the FDLP process as exemplified by Equation (5), the DCT coefficients of the frequency-domain transform in the kth sub-band Tk(f) are processed via the Levinson-Durbin algorithm resulting in a set of coefficients a(i), where 0 Diagrammatically, the FDLP process is shown in FIG. 12. [0067] The Levinson-Durbin algorithm is well known in the art and is also not explained in here. The fundamentals of the algorithm can be found in a publication, entitled "Digital Processing of Speech Signals," by Rabiner and Schafer, Prentice Hall, ISBN: 0132136031, September 1978. [0068] Advancing into sub-step S6k of FIG. 3, the resultant coefficients a(i) are quantized. That is, for each value a(i), a close fit is identified from a codebook (not shown) to arrive at an approximate value. The process is called lossy approximation. During quantization, either the entire vector of a(i), where i = 0 to i = K-I, can be quantized, or alternatively, the whole vector can be segmented and quantized separately. Again, the quantization process via codebook mapping is also well known and need not be further elaborated. [0069] The result of the FDLP process is the parameter Tk (/) , which as mentioned above, is the Hubert envelope 7k (n) expressed in the frequency- domain term. The parameter Tk (/) is identified by the reference numeral 56 in FIG. 9. The quantized coefficients a(i) of the parameter Tk(f) can also be graphically displayed in FIG. 9, wherein two of which are labeled 61 and 63 riding the envelope of the parameter fk(f) 56. [0070] The quantized coefficients a(i), where i = 0 to K-I, of the parameter Tk (/) will be part of the encoded information to be sent to the data handler 36 (FIG. 2). [0071] As mentioned above and repeated in here, since the parameter Tk (/) is a lossy approximation of the original parameter Tk(f), the difference between the two parameters can be captured and represented as the residual value, which is algebraically expressed as Ck(f). Differently put, in the fitting process in sub- steps S5k and S6k via the Levinson-Durbin algorithm as aforementioned to arrive at the all-pole model, some information about the original signal cannot be captured. If signal encoding of high quality is intended, that is, if a lossless encoding is desired, the residual value Ck(f) needs to be estimated. The residual value Ck(f) basically corresponds to the frequency components of the carrier frequency Ck(n) of the signal Sk(n) and will be further explained. [0072] Progressing into sub-step S7k of FIG. 3, this sub-step concerns with arriving at the Hubert envelope 7k (n) which can simply be obtained by performing a time-domain transform of its frequency counterpart Tk (/) . [0073] Estimation of the residual value either in the frequency-domain expressed as Ck(f) or in the time-domain expressed as Ck(n) is carried out in sub- step S 8k of FIG. 3. In this embodiment, the time-domain residual value Ck(n) is simply derived from a direct division of the original time-domain sub-band signal Sk(n) by its Hubert envelope Jk (n) . Mathematically, it is expressed as follows: ck(n) = sk(n) / 7k (n) (6) where all the parameters are as defined above. [0074] It should be noted that Equation (6) is shown a straightforard way of estimating the residual value. Other approaches can also be used for estimation. For instance, the frequency-domain residual value Ck(f) can very well be generated from the difference between the parameters Tk(f) and Tk (/) . Thereafter, the time-domain residual value Ck(n) can be obtained by a direct time-domain transform of the value Ck(f). [0075] In FIG. 3, sub-steps S9k and S 1 Ik deal with down-shifting the Hubert carrier Ck(n) towards the baseband frequency. In particular, sub-steps S9k and SlOk concern with generating an analytic signal Zk(t). Frequency down-shifting is carried out via the process of heterodyning in sub-step Sl Ik. Sub-step S 12k and S 13k depict a way of selectively selecting values of the down-shifted carrier Ck(n). [0076] Reference is now returned to sub-step S9k of FIG. 3. As is well known in the art, converting a time-domain signal into a complex analytic signal eliminates the negative frequency components in a Fourier transform. Consequently, signal calculation and signal analysis carried out thereafter can be substantially simplified. As in this case, the same treatment is applied to the time-domain residual value Ck(n). [0077] To generate an analytic signal Zk(n) of the time-domain signal Ck(n), a Hubert transform of the signal Ck(n) needs to be carried out, as shown in step S9k of FIG. 3. The Hubert transform of the signal Ck(n) is signified by the symbol Ck(n) and can be generated from the following algebraic expression: p n=_8 n -? (V) where all the parameters are as defined above. Equation (7) basically is a commonly known Hubert transform equation in the time-domain. [0078] After the Hubert transform, the analytic signal Zk(n) is simply the summation of the time-domain signal Ck(t) and the imaginary part of the Hubert transform signal Ck(t), as shown in step SlOk of FIG. 3. Mathematically, it is expressed as follows: z?n) = c?n) + Jc?n) (8) where j is an imaginary number [0079] After the derivation of the analytic signal, the process of heterodyning is performed, as shown in sub-step Sl Ik in FIG. 3. In essence, heterodyning is simply a scalar multiplication of the two parameters, that is, the analytic signal Zk(n) and the Hubert carrier Ck(n). The resultant signal is often called a down- sampled Hubert carrier dk(n). As an alternative, the signal dk(n) can be called a demodulated, down-sampled Hubert carrier, which basically is a frequency shifted and down-sampled signal of the original Hubert carrier Ck(n) towards the zero-value or baseband frequency. It should be noted that other terminology for the parameter dk(n) is also applicable. Such terminology includes demodulated, down-sifted Hubert carrier, or simply demodulated Hubert carrier, down-shifted Hubert carrier, or down-sampled Hubert carrier. Furthermore, the term "Hubert" can sometimes be omitted and used instead of the term "Hubert carrier," it is simply called "carrier." In this specification and appended claims, all these terms as mentioned above are used interchangeably. [0080] Mathematically, the demodulated signal, down-sampled Hubert carrier, dk(n) is derived from the following equation: dk(n) = zk(Rn) ck(Rn) (9) where all the terms are as defined above; R is the down-sampling rate. [0081] By down- shifting the frequency of the parameter Ck(n) to arrive at the parameter dk(n), processing of the Hubert carrier in each sub-band, such as filtering and thresholding to be described below, can be substantially made easier. Specifically, the offset frequency of the Hubert carrier in each sub-band need not be determined or known in advance. For instance, in the implementation of a filter algorithm, all the sub-bands can assume one offset frequency, i.e., the baseband frequency. [0082] After the process of frequency down-shifting, the down-sampled Hubert carrier dk(n) is then passed through a low-pass filter, as shown in the sub-step S12k of FIG. 3. [0083] It should be noted that the demodulated carrier dk(n) is complex and analytic. As such, the Fourier transform of the parameter dk(n) is not conjugate- symmetric. Phrased differently, the process of heterodyning the analytic signal Zk(n) essentially shifts the frequency of the Hubert carrier Ck(n) as dk(n) towards the baseband frequency, but without the conjugate-symmetric terms in the negative frequency. As can be seen from the frequency-domain transform Dk(f) of the down-shifted carrier dk(n) in FIG. 10, in which the parameter Dk(f) is shifted close to the origin denoted by the reference numeral 60. The process of frequency transforming the downshifted carrier dk(n) into the frequency domain counterpart Dk(f) is depicted in step S 13k of FIG. 3. [0084] Entering into step S 14k of FIG. 3, the frequency-domain transform Dk(f) of the demodulated Hubert carrier dk(n) is subject to threshold filtering. An exemplary threshold line signified by the reference numeral 62 is as shown in FIG. 10. [0085] In this exemplary embodiment, the threshold is dynamically applied. That is, for each sub-band, the threshold 62 is made adjustable based on other parameters, such as the average and maximum magnitudes of the samples of the parameter Dk(f), and/or the same parameters but of the neighboring sub-bands of the parameter Dk(f). In addition, the parameters can also include the average and maximum magnitudes of the samples of the parameter Dk(f), and/or the same parameters but of the adjacent time-frames of the parameter Dk(f). Furthermore, the threshold can also be dynamically adapted based on the number of coefficients selected. In the exemplary embodiment, only values of the frequency-domain transform Dk(f) above the threshold line 62 are selected. [0086] Thereafter, selected components of the parameter Dk(f) greater than the threshold are quantized. In this example, each selected component includes a magnitude value bm(i) and a phase value bp(i), where 0 [0087] The quantized values bm(i) and bp(i), where i = 0 to L-I, of the threshold- filtered parameter Dk(f) will be another part of the encoded information along with the quantized coefficients a(i), where i = 0 to K-I, as described above to be sent to the data handler 36 (FIG. 2). [0088] Reference is now returned to FIG. 3. After the Hubert envelope J4 (n) and the Hubert carrier Ck(n) information are acquired from the k? sub- band represented as coefficients a(i), bm(i) and bp(i) as described above, the acquired information is coded via an entropy coding scheme as shown in step S 16k. [0089] Thereafter, all the data from each of the M sub-bands are concatenated and packetized, as shown in step S 17 of FIG. 3. As needed, various algorithms well known in the art, including data compression and encryption, can be implemented in the packetization process. Afterward, the packetized data can be sent to the data handler 36 (FIG. 2) as shown in step Sl 8 of FIG. 3. [0090] Data can be retrieved from the data handler 36 for decoding and reconstruction. Referring to FIG. 2, during decoding, the packetized data from the data handler 36 are sent to the depacketizer 44 and then undergo the decoding process by the decoder 42. The decoding process is substantially the reverse of the encoding process as described above. For the sake of clarity, the decoding process is not elaborated but summarized in the flow chart of FIG. 15. [0091] During transmission, if data in few of the M frequency sub-bands are corrupted, the quality of the reconstructed signal should not be affected much. This is because the relatively long frame 46 (FIG. 4) can capture sufficient spectral information to compensate for the minor data imperfection. [0092] An exemplary reconstructed frequency-domain transform Dk(f) of the demodulated Hubert carrier dk(t) are respectively shown in FIGs. 13 and 14. [0093] FIGs. 16 and 17 are schematic drawings which illustrate exemplary hardware implementations of the encoding section 32 and the decoding section 34, respectively, of FIG. 2. [0094] Reference is first directed to the encoding section 32 of FIG. 16. The encoding section 32 can be built or incorporated in various forms, such as a computer, a mobile musical player, a personal digital assistant (PDA), a wireless telephone and so forth, to name just a few. [0095] The encoding section 32 comprises a central data bus 70 linking several circuits together. The circuits include a central processing unit (CPU) or a controller 72, an input buffer 74, and a memory unit 78. In this embodiment, a transmit circuit 76 is also included. [0096] If the encoding section 32 is part of a wireless device, the transmit circuit 74 can be connected to a radio frequency (RF) circuit but is not shown in the drawing. The transmit circuit 76 processes and buffers the data from the data bus 70 before sending out of the circuit section 32. The CPU/controller 72 performs the function of data management of the data bus 70 and further the function of general data processing, including executing the instructional contents of the memory unit 78. [0097] Instead of separately disposed as shown in FIG. 12, as an alternative, the transmit circuit 76 can be parts of the CPU/controller 72. [0098] The input buffer 74 can be tied to other devices (not shown) such as a microphone or an output of a recorder. [0099] The memory unit 78 includes a set of computer-readable instructions generally signified by the reference numeral 77. In this specification and appended claims, the terms "computer-readable instructions" and "computer- readable program code" are used interchangeably. In this embodiment, the instructions include, among other things, portions such as the DCT function 80, the windowing function 84, the FDLP function 86, the heterodyning function 88, the Hubert transform function 90, the filtering function 92, the down-sampling function 94, the dynamic thresholding function 96, the quantizer function 98, the entropy coding function 100 and the packetizer 102. [00100] The various functions have been described, e.g., in the description of the encoding process shown in FIG. 3, and are not further repeated. [00101] Reference is now directed to the decoding section 34 of FIG. 17. Again, the decoding section 34 can be built in or incorporated in various forms as the encoding section 32 described above. [00102] The decoding section 34 also has a central bus 190 connected to various circuits together, such as a CPU/controller 192, an output buffer 196, and a memory unit 197. Furthermore, a receive circuit 194 can also be included. Again, the receive circuit 194 can be connected to a RF circuit (not shown) if the decoding section 34 is part of a wireless device. The receive circuit 194 processes and buffers the data from the data bus 190 before sending into the circuit section 34. As an alternative, the receive circuit 194 can be parts of the CPU/controller 192, rather than separately disposed as shown. The CPU/controller 192 performs the function of data management of the data bus 190 and further the function of general data processing, including executing the instructional contents of the memory unit 197. [00103] The output buffer 196 can be tied to other devices (not shown) such as a loudspeaker or the input of an amplifier. [00104] The memory unit 197 includes a set of instructions generally signified by the reference numeral 199. In this embodiment, the instructions include, among other things, portions such as the depackertizer function 198, the entropy decoder function 200, the inverse quantizer function 202, the up-sampling function 204, the inverse Hubert transform function 206, the inverse heterodyning function 208, the DCT function 210, the synthesis function 212, and the IDCT function 214. [00105] The various functions have been described, e.g., in the description of the decoding process shown in FIG. 15, and again need not be further repeated. [00106] It should be noted the encoding and decoding sections 32 and 34 are shown separately in FIGs. 16 and 17, respectively. In some applications, the two sections 32 and 34 are very often implemented together. For instance, in a communication device such as a telephone, both the encoding and decoding sections 32 and 34 need to be installed. As such, certain circuits or units can be commonly shared between the sections. For example, the CPU/controller 72 in the encoding section 32 of FIG. 16 can be the same as the CPU/controller 192 in the decoding section 34 of FIG. 17. Likewise, the central data bus 70 in FIG. 16 can be connected or the same as the central data bus 190 in FIG. 17. Furthermore, all the instructions 77 and 199 for the functions in both the encoding and decoding sections 32 and 34, respectively, can be pooled together and disposed in one memory unit, similar to the memory unit 78 of FIG. 16 or the memory unit 197 of FIG. 17. [00107] In this embodiment, the memory unit 78 or 197 is a RAM (Random Access Memory) circuit. The exemplary instruction portions 80, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 197, 198, 200, 202, 204, 206, 208, 210, 212 and 214 are software routines or modules. The memory unit 78 or 197 can be tied to another memory circuit (not shown) which can either be of the volatile or nonvolatile type. As an alternative, the memory unit 78 or 197 can be made of other circuit types, such as an EEPROM (Electrically Erasable Programmable Read Only Memory), an EPROM (Electrical Programmable Read Only Memory), a ROM (Read Only Memory), a magnetic disk, an optical disk, and others well known in the art. [00108] Furthermore, the memory unit 78 or 197 can be an application specific integrated circuit (ASIC). That is, the instructions or codes 77 and 199 for the functions can be hard-wired or implemented by hardware, or a combination thereof. In addition, the instructions 77 and 199 for the functions need not be distinctly classified as hardware or software implemented. The instructions 77 and 199 surely can be implemented in a device as a combination of both software and hardware. [00109] It should be further be noted that the encoding and decoding processes as described and shown in FIGs. 3 and 15 above can also be coded as computer- readable instructions or program code carried on any computer-readable medium known in the art. In this specification and the appended claims, the term "computer-readable medium" refers to any medium that participates in providing instructions to any processor, such as the CPU/controller 72 or 192 respectively shown and described in FIGs. 16 or 17, for execution. Such a medium can be of the storage type and may take the form of a volatile or non-volatile storage medium as also described previously, for example, in the description of the memory unit 78 and 197 in FIGs. 16 and 17, respectively. Such a medium can also be of the transmission type and may include a coaxial cable, a copper wire, an optical cable, and the air interface carrying acoustic, electromagnetic or optical waves capable of carrying signals readable by machines or computers. In this specification and the appended claims, signal-carrying waves, unless specifically identified, are collectively called medium waves which include optical, electromagnetic, and acoustic waves. Finally, other changes are possible within the scope of the invention. In the exemplary embodiment as described, only processing of audio signals is depicted. However, it should be noted that the invention is not so limited. Processing of other types of signals, such as ultra sound signals, are also possible. It also should be noted that the invention can very well be used in a broadcast setting, i.e., signals from one encoder can be sent to a plurality of decoders. Furthermore, the exemplary embodiment as described need not be confined to be used in wireless applications. For instance, a conventional wireline telephone certainly can be installed with the exemplary encoder and decoder as described. In addition, in describing the embodiment, the Levinson- Durbin algorithm is used, other algorithms known in the art for estimating the predictive filter parameters can also be employed. Additionally, any logical blocks, circuits, and algorithm steps described in connection with the embodiment can be implemented in hardware, software, firmware, or combinations thereof. It will be understood by those skilled in the art that theses and other changes in form and detail may be made therein without departing from the scope and spirit of the invention. What is claimed is: 1. A method for encoding a time-varying signal, comprising: partitioning said time -varying signal into a plurality of sub-band signals; determining the envelope and carrier portions of each of said sub-band signals; frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal; selectively selecting values of said down-shifted carrier signal; and including said selected values as encoded data of said time-varying signal. 2. The method as in claim 1 further comprising converting said time -varying signal as a discrete signal prior to encoding. 3. The method as in claim 1 further comprising transforming said time-varying signal into a frequency-domain transform, wherein said plurality of sub-band signals being selected from said frequency-domain transform of said time-varying signal. 4. The method as in claim 3 wherein said envelope and carrier portions are frequency-domain signals, said method further comprising transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency. 5. A method for decoding a time-varying signal, comprising: providing a plurality sets of values corresponding to a plurality of sub-bands of said time -varying signal, said sets of values comprising envelope and carrier information of said time-varying signal; identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands; frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal; and including said up-shifted carrier signal as decoded data of said time-varying signal. 6. The method as in claim 5 further comprising inverse-heterodyning each of said plurality of carrier signals as an up-shifted carrier signal. 7. The method as in claim 6 further comprising identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and thereafter modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time -varying signal. 8. An apparatus for encoding a time-varying signal, comprising: means for partitioning said time-varying signal into a plurality of sub-band signals; means for determining the envelope and carrier portions of each of said sub- band signals; means for frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal; means for selectively selecting values of said down-shifted carrier signal; and means for including said selected values as encoded data of said time -varying signal. 9. The apparatus as in claim 8 further comprising means for converting said time -varying signal as a discrete signal prior to encoding. 10. The apparatus as in claim 8 further comprising means for transforming said time -varying signal into a frequency-domain transform, wherein said plurality of sub- band signals being selected from said frequency-domain transform of said time-varying signal. 11. The apparatus as in claim 10 wherein said envelope and carrier portions are frequency-domain signals, said apparatus further comprising means for transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency. 12. An apparatus for decoding a time-varying signal, comprising: means for providing a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, said sets of values comprising envelope and carrier information of said time-varying signal; means for identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands; means for frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time -varying signal as an up-shifted carrier signal; and means for including said up-shifted carrier signal as decoded data of said time- varying signal. 13. The apparatus as in claim 12 further comprising means for inverse- heterodyning each of said plurality of carrier signals as an up-shifted carrier signal. 14. The apparatus as in claim 12 further comprising means for identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and means for modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time -varying signal. 15. An apparatus for encoding a time-varying signal, comprising: an encoder configured to partition said time-varying signal into a plurality of sub-band signals, determine the envelope and carrier portions of each of said sub-band signals, frequency-shift said carrier portion towards the baseband frequency of said time -varying signal as a down-shifted carrier signal, and selectively select values of said down-shifted carrier signal; and a data packetizer connected to said encoder for packetizing said selected values as part of encoded data of said time -varying signal. 16. The apparatus as in claim 15 further comprising a transmit circuit connected to said data packetizer for sending said encoded data through a communication channel. 17. An apparatus for decoding a time-varying signal, comprising: a data depacketizer configured to provide a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, wherein said sets of values comprising envelope and carrier information of said time -varying signal, and further to identify said envelope and carrier information from said plurality sets of values as a plurality of envelope and carrier signals corresponding to said plurality of sub-bands, frequency-shift each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal, and a decoder connected to said data depacketizer, said decoder being configured to transform said set of values into time-domain values. 18. A computer program product, comprising: a computer-readable medium physically embodied with computer-readable program code for: partitioning said time -varying signal into a plurality of sub-band signals; determining the envelope and carrier portions of each of said sub-band signals; frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal; selectively selecting values of said down-shifted carrier signal; and including said selected values as encoded data of said time-varying signal. 19. The computer program product as in claim 18 further comprising computer- readable code for converting said time-varying signal as a discrete signal prior to encoding. 20. The computer program product as in claim 18 further comprising computer- readable code for transforming said time-varying signal into a frequency-domain transform, wherein said plurality of sub-band signals being selected from said frequency-domain transform of said time-varying signal. 21. The computer program product as in claim 20 further comprising computer- readable code for transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency. 22. A computer program product, comprising: a computer-readable medium physically embodied with computer-readable program code for: providing a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, said sets of values comprising envelope and carrier information of said time-varying signal; identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands; frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal; and including said up-shifted carrier signal as decoded data of said time-varying signal. 23. The computer product as in claim 22 further comprising computer-readable code for inverse-heterodyning each of said plurality of carrier signals as an up-shifted carrier signal. 24. The computer product as in claim 22 further comprising computer-readable code for identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and thereafter modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time-varying signal.

Full Text

PROCESSING OF EXCITATION IN AUDIO CODING AND

DECODING

Claim of Priority under 35 U.S.C §119

[0001] The present application for patent claims priority to U. S Provisional

Application No. 60/791,042, entitled "Processing of Excitation in Audio Coding Based on Spectral Dynamics in Sub-Bands," filed on April 10, 2006, and assigned to the assignee hereof and expressly incorporated by reference herein.

BACKGROUND

I. Field

[0002] The present invention generally relates to signal processing, and more particularly, to encoding and decoding of signals for storage and retrieval or for communications .

II. Background

[0003] In digital telecommunications, signals need to be coded for transmission and decoded for reception. Coding of signals concerns with converting the original signals into a format suitable for propagation over the transmission medium. The objective is to preserve the quality of the original signals but at a low consumption of the medium's bandwidth. Decoding of signals involves the reverse of the coding process.

[0004] A known coding scheme uses the technique of pulse-code modulation

(PCM). Referring to FIG. 1 which shows a time-varying signal x(t) that can be a segment of a speech signal, for instance. The y-axis and the x-axis represent the amplitude and time, respectively. The analog signal x(t) is sampled by a plurality of pulses 20. Each pulse 20 has an amplitude representing the signal x(t) at a particular time. The amplitude of each of the pulses 20 can thereafter be coded in a digital value for later transmission, for example.

[0005] To conserve bandwidth, the digital values of the PCM pulses 20 can be compressed using a logarithmic companding process prior to transmission. At

the receiving end, the receiver merely performs the reverse of the coding process mentioned above to recover an approximate version of the original time-varying signal x(t). Apparatuses employing the aforementioned scheme are commonly called the a-law or µ-law codecs.

[0006] As the number of users increases, there is a further practical need for bandwidth conservation. For instance, in a wireless communication system, a multiplicity of users can be sharing a finite frequency spectrum. Each user is normally allocated a limited bandwidth among other users.

[0007] In the past decade or so, considerable progress has been made in the development of speech coders. A commonly adopted technique employs the method of code excited linear prediction (CELP). Details of CELP methodology can be found in publications, entitled "Digital Processing of Speech Signals," by Rabiner and Schafer, Prentice Hall, ISBN: 0132136031, September 1978; and entitled "Discrete-Time Processing of Speech Signals," by Deller, Proakis and Hansen, Wiley-IEEE Press, ISBN: 0780353862, September 1999. The basic principles underlying the CELP method is briefly described below.

[0008] Reference is now returned to FIG. 1. Using the CELP method, instead of digitally coding and transmitting each PCM sample 20 individually, the PCM samples 20 are coded and transmitted in groups. For instance, the PCM pulses 20 of the time-varying signal x(t) in FIG. 1 are first partitioned into a plurality of frames 22. Each frame 22 is of a fixed time duration, for instance 20 ms. The PCM samples 20 within each frame 22 is collectively coded via the CELP scheme and thereafter transmitted. Exemplary frames of the sampled pulses are PCM pulse groups 22A-22C shown in FIG. 1.

[0009] For simplicity, take only the three PCM pulse groups 22A-22C for illustration. During encoding prior to transmission, the digital values of the PCM pulse groups 22A-22C are consecutively fed to a linear predictor (LP) module. The resultant output is a set of frequency values, also called a "LP filter" or simply "filter" which basically represents the spectral content of the pulse groups 22A-22C. The LP filter is then quantized.

[0010] The LP module generates an approximation of the spectral representation of the PCM pulse groups 22A-22C. As such, during the predicting process,

errors or residual values are introduced. The residual values are mapped to a codebook which carries entries of various combinations available for close matching of the coded digital values of the PCM pulse groups 22A-22C. The best fitted values in the codebook are mapped. The mapped values are the values to be transmitted. The overall process is called time-domain linear prediction (TDLP).

[0011] Thus, using the CELP method in telecommunications, the encoder (not shown) merely has to generate the LP filters and the mapped codebook values. The transmitter needs only to transmit the LP filters and the mapped codebook values, instead of the individually coded PCM pulse values as in the a- and µ- law encoders mentioned above. Consequently, substantial amount of communication channel bandwidth can be saved.

[0012] On the receiver end, it also has a codebook similar to that in the transmitter. The decoder (not shown) in the receiver, relying on the same codebook, merely has to reverse the encoding process as aforementioned. Along with the received LP filters, the time -varying signal x(t) can be recovered.

[0013] Heretofore, many of the known speech coding schemes, such as the

CELP scheme mentioned above, are based on the assumption that the signals being coded are short-time stationary. That is, the schemes are based on the premise that frequency contents of the coded frames are stationary and can be approximated by simple (all-pole) filters and some input representation in exciting the filters. The various TDLP algorithms in arriving at the codebooks as mentioned above are based on such a model. Nevertheless, voice patterns among individuals can be very different. Non-human audio signals, such as sounds emanated from various musical instruments, are also distinguishably different from that of the human counterparts. Furthermore, in the CELP process as described above, to expedite real-time signal processing, a short time frame is normally chosen. More specifically, as shown in FIG. 1, to reduce algorithmic delays in the mapping of the values of the PCM pulse groups, such as 22A-22C, to the corresponding entries of vectors in the codebook, a short time window 22 is defined, for example 20 ms as shown in FIG. 1. However, derived spectral or formant information from each frame is mostly common and

can be shared among other frames. Consequently, the formant information is more or less repetitively sent through the communication channels, in a manner not in the best interest for bandwidth conservation.

[0014] Accordingly, there is a need to provide a coding and decoding scheme with improved preservation of signal quality, applicable not only to human speeches but also to a variety of other sounds, and further for efficient utilization of channel resources.

[0015] Copending U.S. Patent Application No. 11/583,537, assigned to the same assignee as the current application, addresses the aforementioned need by using a frequency domain linear prediction (FDLP) scheme which first converts a time -varying signal into a frequency-domain signal. The envelope and the carrier portions of the frequency-domain signal are then identified. The frequency-domain signal is then sorted into a plurality of sub-bands. The envelope portion is approximated by the FDLP scheme as an all-pole model. The carrier portion, which also represents the residual of the all-pole model, is approximately estimated. Resulted data of the all-pole model signal envelope and the estimated carrier are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process.

[0016] For improved signal quality, the signal carrier can be more accurately determined prior to packetization and encoding, yet at substantially no extra consumption of additional bandwidth.

SUMMARY

[0017] In an apparatus and method, a time-varying signal is partitioned into sub- bands. Each sub-band is processed and encoded via a frequency domain linear prediction (FDLP) scheme to arrive at an all-pole model. Residual signal resulted from the scheme in each sub-band is estimated. The all-pole model and the residual signal represent the Hubert envelope and the Hubert carrier, respectively, in each sub-band. Through the process of heterodyning, the time-

domain residual signal is frequency shifted toward the baseband level as a downshifted carrier signal. Quantized values of the all-pole model and the downshifted carrier signal are packetized as encoded signals suitable for transmission or storage. To reconstruct the time-varying signals, the encoded signals are decoded. The decoding process is basically the reverse of the encoding process.

[0018] The partitioned frames can be chosen to be relatively long in duration resulting in more efficient use of format or common spectral information of the signal source. The apparatus and method implemented as described are suitable for use not only to vocalic voices but also for other sounds, such as sounds emanated from various musical instruments, or combination thereof.

[0019] These and other features and advantages will be apparent to those skilled in the art from the following detailed description, taken together with the accompanying drawings, in which like reference numerals refer to like parts.

BRIEF DESCRIPTION OF THE DRAWINGS

[0020] FIG. 1 shows a graphical representation of a time -varying signal sampled into a discrete signal; [0021] FIG. 2 is a general schematic diagram showing the hardware implementation of the exemplified embodiment of the invention; [0022] FIG. 3 is flowchart illustrating the steps involved in the encoding process of the exemplified embodiment; [0023] FIG. 4 is a graphical representation of a time-varying signal partitioned into a plurality of frames; [0024] FIG. 5 is a graphical representation of a segment of the time-varying signal of FIG. 4;

[0025] FIG. 6 is a frequency-transform of the signal shown in FIG. 5;

[0026] FIG. 7 is a graphical representation of a sub-band signal of the time- varying signal shown in FIG. 5, the envelope portion of the sub-band signal is also shown;

[0027] FIG. 8 is a graphical representation of the carrier portion of the sub-band signal of FIG. 7;

[0028] FIG. 9 is a graphical representation of the frequency-domain transform of the sub-band signal of FIG. 7, an estimated all-pole model of the frequency- domain transform is also shown;

[0029] FIG. 10 is a graphical representation of the down-shifted frequency- domain transform of FIG. 8;

[0030] FIG. 11 is a graphical representation of a plurality of overlapping

Gaussian windows for sorting the transformed data for a plurality of sub-bands;

[0031] FIG. 12 is a graphical representation showing the frequency-domain linear prediction process;

[0032] FIG. 13 is a graphical representation of the reconstructed version of the frequency-domain transform of FIG. 10;

[0033] FIG. 14, is a graphical representation of the reconstructed version of the carrier portion signal of FIG. 8;

[0034] FIG. 15 is flowchart illustrating the steps involved in the decoding process of the exemplified embodiment;

[0035] FIG. 16 is a schematic drawing of a part of the circuitry of an encoder in accordance with the exemplary embodiment; and

[0036] FIG. 17 is a schematic drawing of a part of the circuitry of an decoder in accordance with the exemplary embodiment.

DETAILED DESCRIPTION

[0037] The following description is presented to enable any person skilled in the art to make and use the invention. Details are set forth in the following description for purpose of explanation. It should be appreciated that one of ordinary skill in the art would realize that the invention may be practiced without the use of these specific details. In other instances, well known structures and processes are not elaborated in order not to obscure the description of the invention with unnecessary details. Thus, the present invention is not intended to be limited by the embodiments shown, but is to be accorded with the widest scope consistent with the principles and features disclosed herein.

[0038] FIG. 2 is a general schematic diagram of hardware for implementing the exemplified embodiment of the invention. The system is overall signified by the reference numeral 30. The system 30 can be approximately divided into an encoding section 32 and a decoding section 34. Disposed between the sections 32 and 34 is a data handler 36. Examples of the data handler 36 can be a data storage device or a communication channel.

[0039] In the encoding section 32, there is an encoder 38 connected to a data packetizer 40. A time-varying input signal x(t), after passing through the encoder 38 and the data packetizer 40 are directed to the data handler 36.

[0040] In a somewhat similar manner but in the reverse order, in the decoding section 34, there is a decoder 42 tied to a data depacketizer 44. Data from the data handler 36 are fed to the data depacketizer 44 which in turn sends the depacketized data to the decoder 42 for the reconstruction of the original time- varying signal x(t).

[0041] FIG. 3 is a flow diagram illustrating the steps of processing involved in the encoding section 32 of the system 30 shown in FIG. 2. In the following description, FIG. 3 is referred to in conjunction with FIGs. 4-14.

[0042] In step Sl of FIG. 3, the time-varying signal x(t) is first sampled, for example, via the process of pulse-code modulation (PCM). The discrete version of the signal x(t) is represented by x(n). In FIG. 4, only the continuous signal x(t) is shown. For the sake of clarity so as not to obscure FIG. 4, the multiplicity of discrete pulses of x(n) are not shown.

[0043] In this specification and the appended claims, unless specifically specified wherever appropriate, the term "signal" is broadly construed. Thus the term signal includes continuous and discrete signals, and further frequency- domain and time-domain signals. Moreover, hereinbelow, lower-case symbols denote time-domain signals and upper-case symbols denote frequency- transformed signals. The rest of the notation will be introduced in subsequent description.

[0044] Progressing into step S2, the sampled signal x(n) is partitioned into a plurality of frames. One of such frame is signified by the reference numeral 46

as shown in FIG. 4. In the exemplary embodiment, the time duration for the frame 46 is chosen to be 1 second.

[0045] The time-varying signal within the selected frame 46 is labeled s(t) in

FIG. 4. The continuous signal s(t) is highlighted and duplicated in FIG. 5. It should be noted that the signal segment s(t) shown in FIG. 5 has a much elongated time scale compared with the same signal segment s(t) as illustrated in FIG. 4. That is, the time scale of the x-axis in FIG. 5 is significantly stretched apart in comparison with the corresponding x-axis scale of FIG. 4. The reverse holds true for the y-axis.

[0046] The discrete version of the signal s(t) is represented by s(n), where n is an integer indexing the sample number. Again, for reason of clarity so as not to obscure the drawing figure, only a few samples of s(n) are shown in FIG. 5. The time-continuous signal s(t) is related to the discrete signal s(n) by the following algebraic expression: s(t) = s(nt)

(1) where t is the sampling period as shown in FIG. 5.

[0047] Progressing into step S3 of FIG. 3, the sampled signal s(n) undergoes a frequency transform. In this embodiment, the method of discrete cosine transform (DCT) is employed. However, other types of transforms, such as various types of orthogonal, non-orthogonal and signal-dependent transforms well-known in the art can be used. Hereinbelow, in this specification and the appended claims, the terms "frequency transform" and "frequency-domain transform" are used interchangeably. Likewise, the terms "time transform" and "time-domain transform" are used interchangeably. Mathematically, the transform of the discrete signal s(n) from the time domain into the frequency domain via the DCT process can be expressed as follows:

(2) where s(n) is as defined above, f is the discrete frequency in which 0
the linear array of the N transformed values of the N pulses of s(n), and the coefficients c are given by c(0) = *Jl/ N , c(f) = *Jl/ N for 1
[0048] After the DCT of the time-domain parameter of s(n), the resultant frequency-domain parameter T(f) is diagrammatically shown in FIG. 6 and is designated by the reference numeral 51. The N pulsed samples of the frequency-domain transform T(f) in this embodiment are called DCT coefficients. Again, only few DCT coefficients are shown in FIG. 6.

[0049] Entering into step S4 of FIG. 3, the N DCT coefficients of the DCT transform T(f) are grouped and thereafter fitted into a plurality of frequency sub- band windows. The relative arrangement of the sub-band windows is shown in FIG. 11. Each sub-band window, such as the sub-band window 50, is represented as a variable-size window. In the exemplary embodiment, Gaussian distributions are employed to represent the sub-bands. As illustrated, the centers of the sub-band windows are not linearly spaced. Rather, the windows are separated according to a Bark scale, that is, a scale implemented according to certain known properties of human perceptions. Specifically, the sub-band windows are narrower at the low- frequency end than at the high-frequency end. Such an arrangement is based on the finding that the sensory physiology of the mammalian auditory system is more attuned to the narrower frequency ranges at the low end than the wider frequency ranges at the high end of the audio frequency spectrum. It should be noted that other approaches of grouping the sub-bands can also be practical. For example, the sub-bands can be of equal bandwidths and equally spaced, instead of being grouped in accordance with the Bark scale as described in this exemplary embodiment.

[0050] In selecting the number of sub-bands M, there should be a balance between complexity and signal quality. That is, if a higher quality of the encoded signal is desired, more sub-bands can be chosen but at the expense of more packetized data bits and further a more complex dealing of the residual signal, both will be explained later. On the other hand, fewer numbers of sub- bands may be selected for the sake of simplicity but may result in the encoded signal with relatively lower quality. Furthermore, the number of sub-bands can be chosen as dependent on the sampling frequency. For instance, when the

sampling frequency is at 16,000 Hz, M can be selected to be 15. In the exemplary embodiment, the sampling frequency is chosen to be 8,000 Hz and with M set at 13 (i.e., M=13).

[0051] After the N DCT coefficients are separated and fitted into the M sub- bands in the form of M overlapping Gaussian windows, as shown in FIG. 11 and as mentioned above, the separated DCT coefficients in each sub-bands need to be further processed. The encoding process now enters into steps S5-S16 of FIG. 3. In this embodiment, each of the steps S5-S16 includes processing M sets of sub-steps in parallel. That is, the processing of the M sets of sub-steps is more or less carried out simultaneously. Hereinbelow, for the sake of clarity and conciseness, only the set involving the sub-steps S5k-S16k for dealing with the k? sub-band is described. It should be noted that processing of other sub-band sets is substantially similar.

[0052] In the following description of the embodiment, M= 13 and 1
[0053] At this juncture, it helps to make a digression to define and distinguish the various frequency-domain and time-domain terms.

[0054] The time-domain signal in the k? sub-band Sk(n) can be obtained by an inverse discrete cosine transform (IDCT) of its corresponding frequency counterpart Tk(f). Mathematically, it is expressed as follows:

(3) where Sk(n) and Tk(f) are as defined above. Again, f is the discrete frequency in which O = f = N , and the coefficients c are given by c(Q) = *Jl/ N ,

for 1
[0055] Switching the discussion from the frequency domain to the time domain, the time-domain signal in the k? sub-band Sk(n) essentially composes of two parts, namely, the time-domain Hubert envelope S4 O) and the Hubert carrier

Ck(n). The time-domain Hubert envelope S4 O) is diagrammatically shown in FIG. 7. However, again for reason of clarity, the discrete components of Hubert envelope S4 O) is not shown but rather the signal envelope is labeled and as denoted by the reference numeral 52 in FIG. 7. Loosely stated, underneath the Hubert envelope S4 (n) is the carrier signal which is sometimes called the excitation. Stripping away the Hubert envelope S4 O) , the carrier signal, or the Hubert carrier Ck(n), is shown in FIG. 8. Put another way, modulating the Hubert carrier Ck(n) as shown FIG. 8 with the Hubert envelope S4 (n) as shown in FIG. 7 will result in the time-domain signal in the kth sub-band Sk(n) as shown in FIG. 7. Algebraically, it can be expressed as follows: s* 00 = S* O) cA O)

(4) [0056] Thus, from equation (4), if the time-domain Hubert envelope S4O) and the Hubert carrier Ck(n) are known, the time-domain signal in the kth sub-band Sk(n) can be reconstructed. The reconstructed signal approximates that of a lossless reconstruction.

[0057] The diagrammatical relationship between the time-domain signal Sk(n) and its frequency-domain counterpart Tk(f) can also be seen from FIGs. 7 and 9. In FIG. 7, the time-domain signal Sk(n) is shown and is also signified by the reference numeral 54. FIG. 9 illustrates the frequency-domain transform Tk(f) of the time-domain signal Sk(n) of FIG. 7. The parameter Tk(f) is also designated by the reference numeral 28. The frequency-domain transform Tk(f) can be generated from the time-domain signal Sk(n) via the DCT for example, as mentioned earlier.

[0058] Returning now to FIG. 3, sub-steps S5k and S6k basically relate to determining the Hubert envelope S4 O) and the Hubert carrier Ck(n) in the sub- band k. Specifically, sub-steps S5k and S6k deal with evaluating the Hubert

envelope ?A(«) , and sub-steps S7k-S16k concern with calculating the Hubert carrier Ck(n). As described above, once the two parameters ?A(«) and Ck(n) are known, the time-domain signal in the k? sub-band Sk(n) can be reconstructed in accordance with Equation (4). [0059] As also mentioned earlier, the time-domain term Hubert envelope 7k (n) in the k? sub-band can be derived from the corresponding frequency-domain parameter Tk(f). However, in sub-step S5k, instead of using the IDCT process for the exact transformation of the parameter Tk(f), the process of frequency- domain linear prediction (FDLP) of the parameter Tk(f) is employed in the exemplary embodiment. Data resulted from the FDLP process can be more streamlined, and consequently more suitable for transmission or storage.

[0060] In the following paragraphs, the FDLP process is briefly described followed with a more detailed explanation.

[0061] Briefly stated, in the FDLP process, the frequency-domain counterpart of the Hubert envelope Jk (n) is estimated, the estimated counterpart is algebraically expressed as Tk (/) and is shown and labeled 56 in FIG. 9. It should be noted that the parameter Tk (/) is frequency-shifted toward the baseband since the parameter Tk(f) is a frequency transform of the Hubert envelope 7k (n) which essentially is deprived of any carrier information.

However, the signal intended to be encoded is Sk(n) which has carrier information. The exact (i.e., not estimated) frequency-domain counterpart of the parameter Sk(n) is Tk(f) which is also shown in FIG. 9 and is labeled 28. As shown in FIG. 9 and will also be described further below, since the parameter

Tk (/) is an approximation, the difference between the approximated value Tk (/) and the actual value Tk(f) can also be determined, which difference is expressed as Ck(f). The parameter Ck(f) is called the frequency-domain Hubert carrier, and is also sometimes called the residual value.

[0062] Hereinbelow, further details of the FDLP process and the estimating of the parameter Ck(f) are described.

[0063] In the FDLP process, the algorithm of Levinson-Durbin can be employed. Mathematically, the parameters to be estimated by the Levinson- Durbin algorithm can be expressed as follows:

1

H(z) = - K-I l + ?a(i)z --k

(5) in which H(z) is a transfer function in the z-domain; z is a complex variable in the z-domain; a(i) is the ith coefficient of the all-pole model which approximates the frequency-domain counterpart fk(f) of the Hubert envelope ?A(«) ; i = 0, ...,

K-I.

[0064] Fundamentals of the Z-transform in the z-domain can be found in a publication, entitled "Discrete-Time Signal Processing," 2nd Edition, by Alan V.

Oppenheim, Ronald W. Schafer, John R. Buck, Prentice Hall, ISBN:

0137549202, and is not further elaborated in here. [0065] In equation (5), the value of K can be selected based on the length of the frame 46 (FIG. 4). In the exemplary embodiment, K is chosen to be 20 with the time duration of the frame 46 set at 1 sec. [0066] In essence, in the FDLP process as exemplified by Equation (5), the DCT coefficients of the frequency-domain transform in the kth sub-band Tk(f) are processed via the Levinson-Durbin algorithm resulting in a set of coefficients a(i), where 0
Diagrammatically, the FDLP process is shown in FIG. 12.

[0067] The Levinson-Durbin algorithm is well known in the art and is also not explained in here. The fundamentals of the algorithm can be found in a publication, entitled "Digital Processing of Speech Signals," by Rabiner and Schafer, Prentice Hall, ISBN: 0132136031, September 1978.

[0068] Advancing into sub-step S6k of FIG. 3, the resultant coefficients a(i) are quantized. That is, for each value a(i), a close fit is identified from a codebook (not shown) to arrive at an approximate value. The process is called lossy

approximation. During quantization, either the entire vector of a(i), where i = 0 to i = K-I, can be quantized, or alternatively, the whole vector can be segmented and quantized separately. Again, the quantization process via codebook mapping is also well known and need not be further elaborated.

[0069] The result of the FDLP process is the parameter Tk (/) , which as mentioned above, is the Hubert envelope 7k (n) expressed in the frequency- domain term. The parameter Tk (/) is identified by the reference numeral 56 in

FIG. 9. The quantized coefficients a(i) of the parameter Tk(f) can also be graphically displayed in FIG. 9, wherein two of which are labeled 61 and 63 riding the envelope of the parameter fk(f) 56. [0070] The quantized coefficients a(i), where i = 0 to K-I, of the parameter

Tk (/) will be part of the encoded information to be sent to the data handler 36

(FIG. 2). [0071] As mentioned above and repeated in here, since the parameter Tk (/) is a lossy approximation of the original parameter Tk(f), the difference between the two parameters can be captured and represented as the residual value, which is algebraically expressed as Ck(f). Differently put, in the fitting process in sub- steps S5k and S6k via the Levinson-Durbin algorithm as aforementioned to arrive at the all-pole model, some information about the original signal cannot be captured. If signal encoding of high quality is intended, that is, if a lossless encoding is desired, the residual value Ck(f) needs to be estimated. The residual value Ck(f) basically corresponds to the frequency components of the carrier frequency Ck(n) of the signal Sk(n) and will be further explained. [0072] Progressing into sub-step S7k of FIG. 3, this sub-step concerns with arriving at the Hubert envelope 7k (n) which can simply be obtained by performing a time-domain transform of its frequency counterpart Tk (/) .

[0073] Estimation of the residual value either in the frequency-domain expressed as Ck(f) or in the time-domain expressed as Ck(n) is carried out in sub- step S 8k of FIG. 3. In this embodiment, the time-domain residual value Ck(n) is simply derived from a direct division of the original time-domain sub-band

signal Sk(n) by its Hubert envelope Jk (n) . Mathematically, it is expressed as follows: ck(n) = sk(n) / 7k (n)

(6) where all the parameters are as defined above. [0074] It should be noted that Equation (6) is shown a straightforard way of estimating the residual value. Other approaches can also be used for estimation. For instance, the frequency-domain residual value Ck(f) can very well be generated from the difference between the parameters Tk(f) and Tk (/) .

Thereafter, the time-domain residual value Ck(n) can be obtained by a direct time-domain transform of the value Ck(f).

[0075] In FIG. 3, sub-steps S9k and S 1 Ik deal with down-shifting the Hubert carrier Ck(n) towards the baseband frequency. In particular, sub-steps S9k and SlOk concern with generating an analytic signal Zk(t). Frequency down-shifting is carried out via the process of heterodyning in sub-step Sl Ik. Sub-step S 12k and S 13k depict a way of selectively selecting values of the down-shifted carrier Ck(n).

[0076] Reference is now returned to sub-step S9k of FIG. 3. As is well known in the art, converting a time-domain signal into a complex analytic signal eliminates the negative frequency components in a Fourier transform. Consequently, signal calculation and signal analysis carried out thereafter can be substantially simplified. As in this case, the same treatment is applied to the time-domain residual value Ck(n).

[0077] To generate an analytic signal Zk(n) of the time-domain signal Ck(n), a

Hubert transform of the signal Ck(n) needs to be carried out, as shown in step S9k of FIG. 3. The Hubert transform of the signal Ck(n) is signified by the symbol Ck(n) and can be generated from the following algebraic expression:

p n=_8 n -?

(V) where all the parameters are as defined above. Equation (7) basically is a

commonly known Hubert transform equation in the time-domain. [0078] After the Hubert transform, the analytic signal Zk(n) is simply the summation of the time-domain signal Ck(t) and the imaginary part of the Hubert transform signal Ck(t), as shown in step SlOk of FIG. 3. Mathematically, it is expressed as follows:

z?n) = c?n) + Jc?n)

(8) where j is an imaginary number

[0079] After the derivation of the analytic signal, the process of heterodyning is performed, as shown in sub-step Sl Ik in FIG. 3. In essence, heterodyning is simply a scalar multiplication of the two parameters, that is, the analytic signal Zk(n) and the Hubert carrier Ck(n). The resultant signal is often called a down- sampled Hubert carrier dk(n). As an alternative, the signal dk(n) can be called a demodulated, down-sampled Hubert carrier, which basically is a frequency shifted and down-sampled signal of the original Hubert carrier Ck(n) towards the zero-value or baseband frequency. It should be noted that other terminology for the parameter dk(n) is also applicable. Such terminology includes demodulated, down-sifted Hubert carrier, or simply demodulated Hubert carrier, down-shifted Hubert carrier, or down-sampled Hubert carrier. Furthermore, the term "Hubert" can sometimes be omitted and used instead of the term "Hubert carrier," it is simply called "carrier." In this specification and appended claims, all these terms as mentioned above are used interchangeably.

[0080] Mathematically, the demodulated signal, down-sampled Hubert carrier, dk(n) is derived from the following equation: dk(n) = zk(Rn) ck(Rn)

(9) where all the terms are as defined above; R is the down-sampling rate. [0081] By down- shifting the frequency of the parameter Ck(n) to arrive at the parameter dk(n), processing of the Hubert carrier in each sub-band, such as filtering and thresholding to be described below, can be substantially made easier. Specifically, the offset frequency of the Hubert carrier in each sub-band

need not be determined or known in advance. For instance, in the implementation of a filter algorithm, all the sub-bands can assume one offset frequency, i.e., the baseband frequency.

[0082] After the process of frequency down-shifting, the down-sampled Hubert carrier dk(n) is then passed through a low-pass filter, as shown in the sub-step S12k of FIG. 3.

[0083] It should be noted that the demodulated carrier dk(n) is complex and analytic. As such, the Fourier transform of the parameter dk(n) is not conjugate- symmetric. Phrased differently, the process of heterodyning the analytic signal Zk(n) essentially shifts the frequency of the Hubert carrier Ck(n) as dk(n) towards the baseband frequency, but without the conjugate-symmetric terms in the negative frequency. As can be seen from the frequency-domain transform Dk(f) of the down-shifted carrier dk(n) in FIG. 10, in which the parameter Dk(f) is shifted close to the origin denoted by the reference numeral 60. The process of frequency transforming the downshifted carrier dk(n) into the frequency domain counterpart Dk(f) is depicted in step S 13k of FIG. 3.

[0084] Entering into step S 14k of FIG. 3, the frequency-domain transform Dk(f) of the demodulated Hubert carrier dk(n) is subject to threshold filtering. An exemplary threshold line signified by the reference numeral 62 is as shown in FIG. 10.

[0085] In this exemplary embodiment, the threshold is dynamically applied.

That is, for each sub-band, the threshold 62 is made adjustable based on other parameters, such as the average and maximum magnitudes of the samples of the parameter Dk(f), and/or the same parameters but of the neighboring sub-bands of the parameter Dk(f). In addition, the parameters can also include the average and maximum magnitudes of the samples of the parameter Dk(f), and/or the same parameters but of the adjacent time-frames of the parameter Dk(f). Furthermore, the threshold can also be dynamically adapted based on the number of coefficients selected. In the exemplary embodiment, only values of the frequency-domain transform Dk(f) above the threshold line 62 are selected.

[0086] Thereafter, selected components of the parameter Dk(f) greater than the threshold are quantized. In this example, each selected component includes a

magnitude value bm(i) and a phase value bp(i), where 0
[0087] The quantized values bm(i) and bp(i), where i = 0 to L-I, of the threshold- filtered parameter Dk(f) will be another part of the encoded information along with the quantized coefficients a(i), where i = 0 to K-I, as described above to be sent to the data handler 36 (FIG. 2).

[0088] Reference is now returned to FIG. 3. After the Hubert envelope

J4 (n) and the Hubert carrier Ck(n) information are acquired from the k? sub- band represented as coefficients a(i), bm(i) and bp(i) as described above, the acquired information is coded via an entropy coding scheme as shown in step S 16k.

[0089] Thereafter, all the data from each of the M sub-bands are concatenated and packetized, as shown in step S 17 of FIG. 3. As needed, various algorithms well known in the art, including data compression and encryption, can be implemented in the packetization process. Afterward, the packetized data can be sent to the data handler 36 (FIG. 2) as shown in step Sl 8 of FIG. 3.

[0090] Data can be retrieved from the data handler 36 for decoding and reconstruction. Referring to FIG. 2, during decoding, the packetized data from the data handler 36 are sent to the depacketizer 44 and then undergo the decoding process by the decoder 42. The decoding process is substantially the reverse of the encoding process as described above. For the sake of clarity, the decoding process is not elaborated but summarized in the flow chart of FIG. 15.

[0091] During transmission, if data in few of the M frequency sub-bands are corrupted, the quality of the reconstructed signal should not be affected much. This is because the relatively long frame 46 (FIG. 4) can capture sufficient spectral information to compensate for the minor data imperfection.

[0092] An exemplary reconstructed frequency-domain transform Dk(f) of the demodulated Hubert carrier dk(t) are respectively shown in FIGs. 13 and 14.

[0093] FIGs. 16 and 17 are schematic drawings which illustrate exemplary hardware implementations of the encoding section 32 and the decoding section 34, respectively, of FIG. 2.

[0094] Reference is first directed to the encoding section 32 of FIG. 16. The encoding section 32 can be built or incorporated in various forms, such as a computer, a mobile musical player, a personal digital assistant (PDA), a wireless telephone and so forth, to name just a few.

[0095] The encoding section 32 comprises a central data bus 70 linking several circuits together. The circuits include a central processing unit (CPU) or a controller 72, an input buffer 74, and a memory unit 78. In this embodiment, a transmit circuit 76 is also included.

[0096] If the encoding section 32 is part of a wireless device, the transmit circuit

74 can be connected to a radio frequency (RF) circuit but is not shown in the drawing. The transmit circuit 76 processes and buffers the data from the data bus 70 before sending out of the circuit section 32. The CPU/controller 72 performs the function of data management of the data bus 70 and further the function of general data processing, including executing the instructional contents of the memory unit 78.

[0097] Instead of separately disposed as shown in FIG. 12, as an alternative, the transmit circuit 76 can be parts of the CPU/controller 72.

[0098] The input buffer 74 can be tied to other devices (not shown) such as a microphone or an output of a recorder.

[0099] The memory unit 78 includes a set of computer-readable instructions generally signified by the reference numeral 77. In this specification and appended claims, the terms "computer-readable instructions" and "computer- readable program code" are used interchangeably. In this embodiment, the instructions include, among other things, portions such as the DCT function 80, the windowing function 84, the FDLP function 86, the heterodyning function 88, the Hubert transform function 90, the filtering function 92, the down-sampling function 94, the dynamic thresholding function 96, the quantizer function 98, the entropy coding function 100 and the packetizer 102.

[00100] The various functions have been described, e.g., in the description of the encoding process shown in FIG. 3, and are not further repeated.

[00101] Reference is now directed to the decoding section 34 of FIG. 17. Again, the decoding section 34 can be built in or incorporated in various forms as the encoding section 32 described above.

[00102] The decoding section 34 also has a central bus 190 connected to various circuits together, such as a CPU/controller 192, an output buffer 196, and a memory unit 197. Furthermore, a receive circuit 194 can also be included. Again, the receive circuit 194 can be connected to a RF circuit (not shown) if the decoding section 34 is part of a wireless device. The receive circuit 194 processes and buffers the data from the data bus 190 before sending into the circuit section 34. As an alternative, the receive circuit 194 can be parts of the CPU/controller 192, rather than separately disposed as shown. The CPU/controller 192 performs the function of data management of the data bus 190 and further the function of general data processing, including executing the instructional contents of the memory unit 197.

[00103] The output buffer 196 can be tied to other devices (not shown) such as a loudspeaker or the input of an amplifier.

[00104] The memory unit 197 includes a set of instructions generally signified by the reference numeral 199. In this embodiment, the instructions include, among other things, portions such as the depackertizer function 198, the entropy decoder function 200, the inverse quantizer function 202, the up-sampling function 204, the inverse Hubert transform function 206, the inverse heterodyning function 208, the DCT function 210, the synthesis function 212, and the IDCT function 214.

[00105] The various functions have been described, e.g., in the description of the decoding process shown in FIG. 15, and again need not be further repeated.

[00106] It should be noted the encoding and decoding sections 32 and 34 are shown separately in FIGs. 16 and 17, respectively. In some applications, the two sections 32 and 34 are very often implemented together. For instance, in a communication device such as a telephone, both the encoding and decoding sections 32 and 34 need to be installed. As such, certain circuits or units can be commonly shared between the sections. For example, the CPU/controller 72 in the encoding section 32 of FIG. 16 can be the same as the CPU/controller 192 in

the decoding section 34 of FIG. 17. Likewise, the central data bus 70 in FIG. 16 can be connected or the same as the central data bus 190 in FIG. 17. Furthermore, all the instructions 77 and 199 for the functions in both the encoding and decoding sections 32 and 34, respectively, can be pooled together and disposed in one memory unit, similar to the memory unit 78 of FIG. 16 or the memory unit 197 of FIG. 17.

[00107] In this embodiment, the memory unit 78 or 197 is a RAM (Random

Access Memory) circuit. The exemplary instruction portions 80, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 197, 198, 200, 202, 204, 206, 208, 210, 212 and 214 are software routines or modules. The memory unit 78 or 197 can be tied to another memory circuit (not shown) which can either be of the volatile or nonvolatile type. As an alternative, the memory unit 78 or 197 can be made of other circuit types, such as an EEPROM (Electrically Erasable Programmable Read Only Memory), an EPROM (Electrical Programmable Read Only Memory), a ROM (Read Only Memory), a magnetic disk, an optical disk, and others well known in the art.

[00108] Furthermore, the memory unit 78 or 197 can be an application specific integrated circuit (ASIC). That is, the instructions or codes 77 and 199 for the functions can be hard-wired or implemented by hardware, or a combination thereof. In addition, the instructions 77 and 199 for the functions need not be distinctly classified as hardware or software implemented. The instructions 77 and 199 surely can be implemented in a device as a combination of both software and hardware.

[00109] It should be further be noted that the encoding and decoding processes as described and shown in FIGs. 3 and 15 above can also be coded as computer- readable instructions or program code carried on any computer-readable medium known in the art. In this specification and the appended claims, the term "computer-readable medium" refers to any medium that participates in providing instructions to any processor, such as the CPU/controller 72 or 192 respectively shown and described in FIGs. 16 or 17, for execution. Such a medium can be of the storage type and may take the form of a volatile or non-volatile storage medium as also described previously, for example, in the description of the

memory unit 78 and 197 in FIGs. 16 and 17, respectively. Such a medium can also be of the transmission type and may include a coaxial cable, a copper wire, an optical cable, and the air interface carrying acoustic, electromagnetic or optical waves capable of carrying signals readable by machines or computers. In this specification and the appended claims, signal-carrying waves, unless specifically identified, are collectively called medium waves which include optical, electromagnetic, and acoustic waves. Finally, other changes are possible within the scope of the invention. In the exemplary embodiment as described, only processing of audio signals is depicted. However, it should be noted that the invention is not so limited. Processing of other types of signals, such as ultra sound signals, are also possible. It also should be noted that the invention can very well be used in a broadcast setting, i.e., signals from one encoder can be sent to a plurality of decoders. Furthermore, the exemplary embodiment as described need not be confined to be used in wireless applications. For instance, a conventional wireline telephone certainly can be installed with the exemplary encoder and decoder as described. In addition, in describing the embodiment, the Levinson- Durbin algorithm is used, other algorithms known in the art for estimating the predictive filter parameters can also be employed. Additionally, any logical blocks, circuits, and algorithm steps described in connection with the embodiment can be implemented in hardware, software, firmware, or combinations thereof. It will be understood by those skilled in the art that theses and other changes in form and detail may be made therein without departing from the scope and spirit of the invention.

What is claimed is:

1. A method for encoding a time-varying signal, comprising:

partitioning said time -varying signal into a plurality of sub-band signals;

determining the envelope and carrier portions of each of said sub-band signals;

frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal;

selectively selecting values of said down-shifted carrier signal; and

including said selected values as encoded data of said time-varying signal.

2. The method as in claim 1 further comprising converting said time -varying signal as a discrete signal prior to encoding.

3. The method as in claim 1 further comprising transforming said time-varying signal into a frequency-domain transform, wherein said plurality of sub-band signals being selected from said frequency-domain transform of said time-varying signal.

4. The method as in claim 3 wherein said envelope and carrier portions are frequency-domain signals, said method further comprising transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency.

5. A method for decoding a time-varying signal, comprising:

providing a plurality sets of values corresponding to a plurality of sub-bands of said time -varying signal, said sets of values comprising envelope and carrier information of said time-varying signal;

identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands;

frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal; and

including said up-shifted carrier signal as decoded data of said time-varying signal.

6. The method as in claim 5 further comprising inverse-heterodyning each of said plurality of carrier signals as an up-shifted carrier signal.

7. The method as in claim 6 further comprising identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and thereafter modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time -varying signal.

8. An apparatus for encoding a time-varying signal, comprising:

means for partitioning said time-varying signal into a plurality of sub-band signals;

means for determining the envelope and carrier portions of each of said sub- band signals;

means for frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal;

means for selectively selecting values of said down-shifted carrier signal; and

means for including said selected values as encoded data of said time -varying signal.

9. The apparatus as in claim 8 further comprising means for converting said time -varying signal as a discrete signal prior to encoding.

10. The apparatus as in claim 8 further comprising means for transforming said time -varying signal into a frequency-domain transform, wherein said plurality of sub- band signals being selected from said frequency-domain transform of said time-varying signal.

11. The apparatus as in claim 10 wherein said envelope and carrier portions are frequency-domain signals, said apparatus further comprising means for transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency.

12. An apparatus for decoding a time-varying signal, comprising:

means for providing a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, said sets of values comprising envelope and carrier information of said time-varying signal;

means for identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands;

means for frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time -varying signal as an up-shifted carrier signal; and

means for including said up-shifted carrier signal as decoded data of said time- varying signal.

13. The apparatus as in claim 12 further comprising means for inverse- heterodyning each of said plurality of carrier signals as an up-shifted carrier signal.

14. The apparatus as in claim 12 further comprising means for identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and means for modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time -varying signal.

15. An apparatus for encoding a time-varying signal, comprising:

an encoder configured to partition said time-varying signal into a plurality of sub-band signals, determine the envelope and carrier portions of each of said sub-band signals, frequency-shift said carrier portion towards the baseband frequency of said time -varying signal as a down-shifted carrier signal, and selectively select values of said down-shifted carrier signal; and

a data packetizer connected to said encoder for packetizing said selected values as part of encoded data of said time -varying signal.

16. The apparatus as in claim 15 further comprising a transmit circuit connected to said data packetizer for sending said encoded data through a communication channel.

17. An apparatus for decoding a time-varying signal, comprising:

a data depacketizer configured to provide a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, wherein said sets of values comprising envelope and carrier information of said time -varying signal, and further to identify said envelope and carrier information from said plurality sets of values as a plurality of envelope and carrier signals corresponding to said plurality of sub-bands, frequency-shift each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal, and

a decoder connected to said data depacketizer, said decoder being configured to transform said set of values into time-domain values.

18. A computer program product, comprising:

a computer-readable medium physically embodied with computer-readable program code for:

partitioning said time -varying signal into a plurality of sub-band signals;

determining the envelope and carrier portions of each of said sub-band signals;

frequency-shifting said carrier portion towards the baseband frequency of said time-varying signal as a down-shifted carrier signal;

selectively selecting values of said down-shifted carrier signal; and

including said selected values as encoded data of said time-varying signal.

19. The computer program product as in claim 18 further comprising computer- readable code for converting said time-varying signal as a discrete signal prior to encoding.

20. The computer program product as in claim 18 further comprising computer- readable code for transforming said time-varying signal into a frequency-domain transform, wherein said plurality of sub-band signals being selected from said frequency-domain transform of said time-varying signal.

21. The computer program product as in claim 20 further comprising computer- readable code for transforming said carrier portion of said frequency-domain signals into a time-domain transform prior to frequency-shifting said carrier portion towards the baseband frequency.

22. A computer program product, comprising:

a computer-readable medium physically embodied with computer-readable program code for:

providing a plurality sets of values corresponding to a plurality of sub-bands of said time-varying signal, said sets of values comprising envelope and carrier information of said time-varying signal;

identifying said carrier information from said plurality sets of values as a plurality of carrier signals corresponding to said plurality of sub-bands;

frequency-shifting each of said plurality of carrier signals away from the baseband frequency of said time-varying signal as an up-shifted carrier signal; and

including said up-shifted carrier signal as decoded data of said time-varying signal.

23. The computer product as in claim 22 further comprising computer-readable code for inverse-heterodyning each of said plurality of carrier signals as an up-shifted carrier signal.

24. The computer product as in claim 22 further comprising computer-readable code for identifying said envelope information from said plurality sets of values as a plurality of envelope signals corresponding to said plurality of sub-bands, and thereafter modulating said plurality of carrier signals by said plurality of envelope signals as a reconstructed version of said time-varying signal.

Documents:

1961-MUMNP-2008-ABSTRACT(12-9-2008).pdf

1961-MUMNP-2008-ABSTRACT(2-12-2013).pdf

1961-MUMNP-2008-CLAIMS(12-9-2008).pdf

1961-MUMNP-2008-CLAIMS(AMENDED)-(2-12-2013).pdf

1961-MUMNP-2008-CLAIMS(AMENDED)-(28-3-2014).pdf

1961-MUMNP-2008-CORRESPONDENCE(17-9-2008).pdf

1961-MUMNP-2008-CORRESPONDENCE(19-5-2009).pdf

1961-MUMNP-2008-CORRESPONDENCE(26-3-2009).pdf

1961-MUMNP-2008-CORRESPONDENCE(3-8-2012).pdf

1961-MUMNP-2008-DESCRIPTION(COMPLETE)-(12-9-2008).pdf

1961-MUMNP-2008-DRAWING(12-9-2008).pdf

1961-MUMNP-2008-DRAWING(2-12-2013).pdf

1961-MUMNP-2008-FORM 1(12-9-2008).pdf

1961-MUMNP-2008-FORM 1(3-8-2012).pdf

1961-MUMNP-2008-FORM 13(3-8-2012).pdf

1961-MUMNP-2008-FORM 18(17-9-2008).pdf

1961-MUMNP-2008-FORM 2(COMPLETE)-(12-9-2008).pdf

1961-MUMNP-2008-FORM 2(TITLE PAGE)-(12-9-2008).pdf

1961-MUMNP-2008-FORM 26(12-9-2008).pdf

1961-MUMNP-2008-FORM 26(2-12-2013).pdf

1961-MUMNP-2008-FORM 3(12-9-2008).pdf

1961-MUMNP-2008-FORM 3(2-12-2013).pdf

1961-MUMNP-2008-FORM 3(26-3-2009).pdf

1961-MUMNP-2008-FORM 5(12-9-2008).pdf

1961-MUMNP-2008-FORM 5(2-12-2013).pdf

1961-MUMNP-2008-FORM PCT-IB-373(2-12-2013).pdf

1961-MUMNP-2008-FORM PCT-ISA-237(2-12-2013).pdf

1961-MUMNP-2008-MARKED COPY(2-12-2013).pdf

1961-MUMNP-2008-MARKED COPY(28-3-2014).pdf

1961-MUMNP-2008-OTHER DOCUMENT(2-12-2013).pdf

1961-MUMNP-2008-PETITION UNDER RULE-137(2-12-2013).pdf

1961-MUMNP-2008-REPLY TO EXAMINATION REPORT(2-12-2013).pdf

1961-MUMNP-2008-REPLY TO HEARING(28-3-2014).pdf

1961-MUMNP-2008-SPECIFICATION(AMENDED)-(2-12-2013).pdf

1961-MUMNP-2008-SPECIFICATION(AMENDED)-(28-3-2014).pdf

1961-MUMNP-2008-WO INTERNATIONAL PUBLICATION REPORT(12-9-2008).pdf

« Previous Patent

Next Patent »

Patent Number

260277

Indian Patent Application Number

1961/MUMNP/2008

PG Journal Number

17/2014

Publication Date

25-Apr-2014

Grant Date

17-Apr-2014

Date of Filing

12-Sep-2008

Name of Patentee

QUALCOMM INCORPORATED

Applicant Address

5775 MOREHOUSE DRIVE, SAN DIEGO, CALIFORNIA

Inventors:

#	Inventor's Name	Inventor's Address
1	GARUDADRI, HARINATH	9435 OVIEDO STREET, SAN DIEGO,CALIFORNIA 92129
2	SRINIVASAMURTHY, NAVEEN	10898 CAMINO RUIZ, #B, SAN DIEGO, CALIFORNIA 92126

PCT International Classification Number

G10L19/06

PCT International Application Number

PCT/US2007/066243

PCT International Filing date

2007-04-09

PCT Conventions:

#	PCT Application Number	Date of Convention	Priority Country
1	11/696,974	2007-04-05	U.S.A.
2	60/791,042	2006-04-10	U.S.A.