# Patent

## Title
Seamless audio speed change based on time scale modification

## Abstract

This invention involves time-scale modification of audio signals. The invention describes overlap and add time scale modification with variable input and output buffer sizes. Seamless speed change is achieved by keeping track of previously processed data to avoid discontinuities during playback speed transitions.

## Background
TECHNICAL FIELD OF THE INVENTION
The technical field of this invention is digital audio time scale modification.
BACKGROUND OF THE INVENTION
Time-scale modification (TSM) is an emerging topic in audio digital signal processing due to the advance of low-cost, high-speed hardware that enables real-time processing by portable devices. Possible applications include intelligible sound in fast-forward play, real-time music manipulation, foreign language training, etc. Most time scale modification algorithms can be classified as either frequency-domain time scale modification or time-domain time scale modification. Frequency-domain time scale modification provides higher quality for polyphonic sounds, while time-domain time scale modification is more suitable for narrow-band signals such as voice. Time-domain time scale modification is the natural choice in resource-limited applications due to its lower computational cost.
The basic operation of time domain time-scale modification is successively overlapping and adding audio frames, where time scaling is achieved by changing the spacing between them. It is known in the art to calculate the exact overlap point based on a measure of similarity between the signals to be overlapped. This measure of similarity is generally based on cross-correlation.
Most time-domain time-scale modification algorithms are derived from the synchronous overlap-and-add method (SOLA). The synchronous overlap-and-add algorithm and its variations are based on successive overlap and addition of audio frames. For the overlap, the overlap point is adjusted by computing a measure of signal similarity between the overlapping regions for each possible overlap position, which is limited by a minimum and maximum overlap points. The position of maximum similarity is selected. The signal similarity measure can be represented as a full cross-correlation function or simplified versions. This similarity calculation represents about 80% or more of the total computation required by the algorithm.
Even though SOLA based methods represent an attractive low-cost solution to the time-scale modification problem, their limitation stands out in the case of polyphonic music signals. Their intrinsic problem is that the audio signal is treated as a whole without consideration for its individual frequency components, so that the overlap point adjustment based on signal similarity cannot simultaneously generate smooth transitions for the multiple frequency components of the signal.
A family of methods known as phase vocoder does time-scale modification in the frequency domain. The input signal is analyzed at equally spaced overlapping windowed frames using a short-time discrete Fourier transform. Next the phase difference for spectral peaks is calculated. This phase difference is the difference in phase between an input phase and a time scale modified signal phase. An intrinsic sinusoidal model is generally used. The frequency is represented by the sum Ωk+ωik: where carrier Ωk is 2πk/N; and ωik is an instantaneous frequency modulator. This produces an estimate ωik for each spectral line by obtaining the phase difference between two consecutive analysis frames. Here, k is a spectral line number and N is the size of the short-time discrete Fourier transform. The process reconstructs an output signal from the analyzed frames using a short-time inverse discrete Fourier transform. The frames are overlapped by a different overlap factor to achieve the desired time scaling. The instantaneous frequency ωik is used to calculate the phase corresponding to each spectral line in the time shifted instant.
Even though phase vocoders can potentially achieve higher quality than time-domain methods, a severe limitation is the large amount of computation required in the forward and inverse discrete Fourier transforms and also in the spectrum manipulation process. Practical implementations on fixed-point processors result in a computational cost up to 10 times higher than time-domain time-scale modification methods. In addition, maintaining phase coherence between frames is not an easy task and can be the source of artifacts.
SUMMARY OF THE INVENTION
This invention involves time-scale modification of audio signals. The invention describes overlap and add time scale modification with variable input and output buffer sizes, where the time scale is modified in a seamless manner by keeping track of previously processed data.



BRIEF DESCRIPTION OF THE DRAWINGS
These and other aspects of this invention are illustrated in the drawings, in which:
FIG. 1 is a block diagram of a digital audio system to which this invention is applicable;
FIG. 2 is a flow chart illustrating the data processing operations involved in time-scale modification employing the digital audio system of FIG. 1;
FIG. 3a illustrates the analysis step in the overlap and add method of time scale modification according to the prior art;
FIG. 3b illustrates the synthesis step in the overlap and add method of time-scale modification according to the prior art;
FIG. 4a illustrates the analysis step in synchronous overlap and add method of time scale modification according to the prior art;
FIG. 4b illustrates the synthesis step in the synchronous overlap and add method of time-scale modification according to the prior art;
FIG. 5 is a flow chart illustrating the steps in the prior art phase vocoder time scale modification technique;
FIG. 6 is a view of several waveforms used in explanation of this invention;
FIG. 7A illustrates the analysis steps for a constant output buffer size according to this invention;
FIG. 7B illustrates the synthesis steps for a constant output buffer size according to this invention;
FIG. 8A illustrates the analysis steps for a controllable output buffer size according to this invention; and
FIG. 8B illustrates the synthesis steps for a controllable output buffer size according to this invention.



DETAILED DESCRIPTION OF PREFERRED EMBODIMENTS
FIG. 1 is a block diagram illustrating a system to which this invention is applicable. The preferred embodiment is a DVD player or DVD player/recorder in which the time scale modification of this invention is employed with fast forward or slow motion video to provide audio synchronized with the video in these modes.
System 100 received digital audio data on media 101 via media reader 103. In the preferred embodiment media 101 is a DVD optical disk and media reader 103 is the corresponding disk reader. It is feasible to apply this technique to other media and corresponding reader such as audio CDs, removable magnetic disks (i.e. floppy disk), memory cards or similar devices. Media reader 103 delivers digital data corresponding to the desired audio to processor 120.
Processor 120 performs data processing operations required of system 100 including the time scale modification of this invention. Processor 120 may include two different processors, microprocessor 121 and digital signal processor 123. Microprocessor 121 is preferably employed for control functions such as data movement, responding to user input and generating user output. Digital signal processor 123 is preferably employed in data filtering and manipulation functions such as the time scale modification of this invention. A Texas Instruments digital signal processor from the TMS320C5000 family is suitable for this invention.
Processor 120 is connected to several peripheral devices. Processor 120 receives user inputs via input device 113. Input device 113 can be a keypad device, a set of push buttons or a receiver for input signals from remote control 111. Input device 113 receives user inputs which control the operation of system 100. Processor 120 produces outputs via display 115. Display 115 may be a set of LCD (liquid crystal display) or LED (light emitting diode) indicators or an LCD display screen. Display 115 provides user feedback regarding the current operating condition of system 100 and may also be used to produce prompts for operator inputs. As an alternative for the case where system 100 is a DVD player or player/recorder connectable to a video display, system 100 may generate a display output using the attached video display. Memory 117 preferably stores programs for control of microprocessor 121 and digital signal processor 123, constants needed during operation and intermediate data being manipulated. Memory 117 can take many forms such as read only memory, volatile read/write memory, nonvolatile read/write memory or magnetic memory such as fixed or removable disks. Output 130 produces an output 131 of system 100. In the case of a DVD player or player/recorder, this output would be in the form of an audio/video signal such as a composite video signal, separate audio signals and video component signals and the like.
FIG. 2 is a flow chart illustrating process 200 including the major processing functions of system 100. Flow chart 200 begins with data input at input block 201. Data processing begins with an optional decryption function (block 202) to decode encrypted data delivered from media 101. Data encryption would typically be used for control of copying for theatrical movies delivered on DVD, for example. System 100 in conjunction with the data on media 101 determines if this is an authorized use and permits decryption if the use is authorized.
The next step is optional decompression (block 203). Data is often delivered in a compressed format to save memory space and transmit bandwidth. There are several motion picture data compression techniques proposed by the Motion Picture Experts Group (MPEG). These video compression standards typically include audio compression standards such as MPEG Layer 3 commonly known as MP3. There are other audio compression standards. The result of decompression for the purposes of this invention is a sampled data signal corresponding to the desired audio. Audio CDs typically directly store the sampled audio data and thus require no decompression.
The next step is audio processing (block 204). System 100 will typically include audio data processing other than the time scale modification of this invention. This might include band equalization filtering, conversion between the various surround sound formats and the like. This other audio processing is not relevant to this invention and will not be discussed further.
The next step is time scale modification (block 205). This time scale modification is the subject of this invention and various techniques of the prior art and of this invention will be described below in conjunction with FIGS. 3 to 6. Flow chart 200 ends with data output (block 206).
FIG. 3 illustrates this process. In FIG. 3(a), x(i) is the analysis signals represented as a sequence with index i. Similarly, FIG. 3(b) illustrates synthesis signal y(i) having a sequence index i. The quantity N is the frame size. Sa is the analysis frame interval between consecutive frames fj (where j=1, 2 . . . ). Ss is the similar synthesis frame interval. The relationship between the analysis frame interval Sa and the synthesis frame interval Ss sets the time scale modification. The overlap-and-add time scale modification algorithm is simple and provides acceptable results for small time-scale factors. In general this method yields poor quality compared to other methods described below.
The synchronous overlap-and-add time scale modification algorithm is an improvement over the previous overlap-and-add approach. Instead of using a fixed overlap interval for synthesis, the overlap point is adjusted by computing the normalized cross-correlation between the overlapping regions for each possible overlap position within minimum and maximum deviation values. The overlap position of maximum cross-correlation is selected. The cross-correlation is calculated using the following formula, where Lk is the length of the overlapping window:




  
    
      
        
          R
          ⁡
          
            [
            k
            ]
          
        
        =
        
          
            
              ∑
              
                i
                =
                0
              
              
                
                  L
                  k
                
                -
                1
              
            
            ⁢
            
              
            
            ⁢
            
              
                y
                ⁡
                
                  [
                  
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      
                        S
                        s
                      
                    
                    +
                    k
                    +
                    i
                  
                  ]
                
              
              ⁢
              
                x
                ⁡
                
                  [
                  
                    
                      m
                      ⁢
                      
                        
                      
                      ⁢
                      
                        S
                        a
                      
                    
                    +
                    i
                  
                  ]
                
              
            
          
          
            
              [
              
                
                  ∑
                  
                    i
                    =
                    0
                  
                  
                    
                      L
                      k
                    
                    -
                    1
                  
                
                ⁢
                
                  
                
                ⁢
                
                  
                    
                      y
                      2
                    
                    ⁡
                    
                      [
                      
                        
                          m
                          ⁢
                          
                            
                          
                          ⁢
                          
                            S
                            s
                          
                        
                        +
                        k
                        +
                        i
                      
                      ]
                    
                  
                  ⁢
                  
                    
                      ∑
                      
                        i
                        =
                        0
                      
                      
                        
                          L
                          k
                        
                        -
                        1
                      
                    
                    ⁢
                    
                      
                    
                    ⁢
                    
                      
                        x
                        2
                      
                      ⁡
                      
                        [
                        
                          
                            m
                            ⁢
                            
                              
                            
                            ⁢
                            
                              S
                              a
                            
                          
                          +
                          i
                        
                        ]
                      
                    
                  
                
              
              ]
            
            
              1
              /
              2
            
          
        
      
    
    
      
        (
        1
        )
      
    
  




FIG. 4 illustrates the synchronous overlap-and-add time scale modification algorithm. The same variables are used in FIG. 4(a) for analysis as FIG. 3(a) and used in FIG. 4(b) for synthesis as in 3(b). In FIG. 4, k is the deviation of the overlap position, with k limited to the range between kmin and kmax. Note that k=0 is equivalent to the overlap-and-add time scale modification algorithm illustrated in FIGS. 3(a) and 3(b). The synchronous overlap-and-add time scale modification algorithm requires a large amount of computation to calculate the normalized cross-correlation used in equation 1. The similarity computation can be reduced using a more efficient normalized cross-correlation formula or another measure of signal similarity instead of equation 1. Even such a reduced computation will still be the most computation-expensive part of the algorithm. The following discussion applies to whatever normalized cross-correlation formula or measure of signal similarity is used. This computation enables better phase matching for each overlapping frame, thus improving the resulting sound quality.

FIG. 5 is a flow chart illustrating process 500 including the basic phase vocoder as known in the art. At block 501 the input signal is analyzed at equally spaced overlapping windowed frames using a short-time discrete Fourier transform. The resulting data describes short time intervals of the audio data in the frequency domain. Next the phase difference for spectral peaks is calculated (block 502). This phase difference is the difference in phase between an input phase and a time scale modified signal phase. Block 502 uses an intrinsic sinusoidal model where the frequency is represented by the sum Ωk+ωik: where carrier Ωk is 2πk/N; and ωik is an instantaneous frequency modulator. Block 502 estimates ωik for each spectral line by obtaining the phase difference between two consecutive analysis frames. Here, k is a spectral line number and N is the size of the short-time discrete Fourier transform.
Process 500 reconstructs an output signal from the analyzed frames using a short-time inverse discrete Fourier transform (block 503). The frames are overlapped by a different overlap factor to achieve the desired time scaling. The instantaneous frequency ωik is used to calculate the phase corresponding to each spectral line in the time shifted instant.
Consider a simple signal consisting of non-harmonically related frequencies, such as f1=0.5 sin(x) and f2=0.25 sin(√{square root over (2)}x) and their sum f3 illustrated in FIG. 6. Because the signals f1 and f2 are not harmonically related, any instantaneous relationship between their respective phases will never be repeated exactly because a perfect match would require an integer number of periods of both signals. Thus a time-domain time-scale modification technique would try to find a close match within signal f3 but there will always be some phase disruption when jumping to a different location. This phase match problem causes artifacts for many time-domain time-scale modification techniques. Now consider separating these components and performing a similar operation on each signal individually. In this case, there is little problem finding a perfect phase match for each signal, though it will be at different locations. Combining the resulting time-scaled signals produces an artifact-free time-scaled whole. Unfortunately in the real world, even narrow band signals do not repeat perfectly due to changes in pitch and amplitude, and to interference among close frequencies. However analysis in separate frequency bands gives each band great flexibility in finding the best overlap point. This improves overall quality.
TSM (time-scale modification) for audio and video equipment is becoming increasingly popular due to its wide range of applications: highly intelligible fast forward playback, audio “slow-motion” for foreign language training or the elderly, etc.
In high-end audio and video equipment, the switching between speed modes should be as imperceptible as possible, since any abrupt change or silence can be easily perceived by the listener as annoying artifacts. Ideally, the user should not be able to perceive speed transitions that would otherwise destroy the sensation of continuity. Once implemented as a speed control function, such feature would enable an array of special effects unseen in current audio equipment, such as a karaoke accompaniment system that can chase the solo singer instead of the other way round, or a song being continuously accelerated or slowed down during playback.
This invention shows a simple solution to the problem based on an improved time scale modification algorithm that keeps track of previously processed data to achieve continuity.
A practical problem has to be solved when implementing the time scale modification algorithm in a real-time system. Usually the speed change ratio and thus the size of input and output buffers has to meet some restrictions related to audio/video synchronization. However, the overlap offset varies between kmin and kmax as previously explained, and the desired ratio would be attained exactly only for k=0. Additionally, the difference would accumulate along successive frames. The solution is to compensate the previous value of k before setting the initial target for the next overlap value. In that manner, the total accumulated error would never exceed max (|kmin|, |kmax|). For applications that require exact input and output buffer sizes for every frame, a natural solution is to store one output chunk Ss of delayed y[ ] and output the processed result of the previous frame. This is illustrated in FIGS. 7A and 7B. FIG. 7A illustrates the analysis steps for a constant output buffer size. FIG. 7B illustrates the synthesis steps for a constant output buffer size. The figure describes the situation where the previous overlap offset kprev was negative, so that the initial overlap target is positively compensated by −kprev. The figure also shows the delayed y[ ] ready for output.
The system of FIGS. 7A and 7B can be generalized in order to enable controllable output buffer size. The initial overlap target for the overlap-and-add processing (corresponding to k=0) is Ss−kprev where Ss is the desired output buffer size and kprev is the previous offset value. The generalization consists of using a generic output buffer size Ss′ instead of Ss that can be arbitrarily defined upon each frame. To ensure continuity of the processed data, the number of data to be actually output is no longer Ss but Ss—prev, which is the value of Ss′ corresponding to the last-processed frame. FIGS. 8A and 8B illustrate the process. FIG. 8A illustrates the analysis steps for a controllable output buffer size. FIG. 8B illustrates the synthesis steps for a controllable output buffer size according to this invention.
Using this algorithm, a system can be implemented where the client program requests an arbitrary number of output data, and the time scale modification system returns the number of data points corresponding to the last request.
The method shown in this invention was implemented and tested using 13 speed multipliers ranging from 0.5× to 2.0× normal playback in steps of 1⁄8, as shown in Table 1. The speed transitions during playback were found to be imperceptible.









TABLE 1





Speed
Input
Output


(vs. normal
buffer
buffer


playback)
size (Sa)
size (Ss)

















 4/8
512
1024


 5/8
640
1024


 6/8
768
1024


 7/8
896
1024


 8/8
1024
1024


 9/8
1024
910


10/8
1024
820


11/8
1024
744


12/8
1024
682


13/8
1024
630


14/8
1024
586


15/8
1024
546


16/8
1024
512

## Claims

1. A method of time-scale modification of a digital audio signal comprising the steps of:
analyzing the digital audio signal in a set of first equally spaced, overlapping time windows having a first overlap amount Sa,
selecting a base overlap Ss for output synthesis corresponding to a desired time scale modification,
calculating a measure of similarity between overlapping frames for a range of overlaps k between Ss+kmin to Ss+kmax of the single audio signal setting the initial target for a next overlap value k equal to Ss−kprev where kmin is a minimum overlap deviation, kmax is a maximum overlap deviation and kprev is the previous offset value,
determining an overlap deviation k yielding the largest measure of similarity for each frequency band,
synthesizing an output signal in a set of second equally spaced, overlapping time windows having a second overlap amount equal to Ss+k; and
producing a sound corresponding to said output signal.

2. The method of claim 1, wherein:
the digital audio signal is separated into a plurality of frequency bands;
each of the plurality of frequency bands is separately time-scale modified producing corresponding time-scale modified frequency band signals; and
the separate time-scale modified frequency band signals are combined.

3. The method of claim 1, wherein:
said step of time-domain time-scale modification of the digital audio signal includes time-domain time-scale modification.

4. The method of claim 1, wherein:
said step of synthesizing an output signal includes storing one fixed output chunk SS of delayed output.

5. The method of claim 1, wherein:
said step of synthesizing an output signal includes using a variable output buffer size Ss′, where Ss′ may be arbitrarily defined for each frame and the number of data points generated in Ss′ corresponding to the last processed frame.

6. A digital audio apparatus comprising:
a source of a digital audio signal;
a digital signal processor connected to said source of a digital audio signal programmed to perform time scale modification on the digital audio signal by
analyzing the digital audio signal in a set of first equally spaced, overlapping time windows having a first overlap amount Sa,
selecting a base overlap Ss for output synthesis corresponding to a desired time scale modification,
calculating a measure of similarity between overlapping frames of each frequency band for a range of overlaps k between Ss+kmin to Ss+kmax of the single audio signal setting the initial target for a next overlap value k equal to Ss−kprev where kmin is a minimum overlap deviation, kmax is a maximum overlap deviation and kprev is the previous offset value,
determining an overlap deviation k yielding the largest measure of similarity for each frequency band,
synthesizing an output signal in a set of second equally spaced, overlapping time windows having a second overlap amount equal to Ss+k; and

an output device connected to the digital signal processor for outputting the time scale modified digital audio signal.

7. The digital audio apparatus of claim 6, wherein:
the digital audio signal is separated into a plurality of frequency bands;
each of the plurality of frequency bands is separately time-scale modified producing corresponding time-scale modified frequency band signals; and
the separate time-scale modified frequency band signals are combined.

8. The digital audio apparatus of claim 6, wherein:
said digital signal processor is programmed to implement time-domain time-scale modification of the digital audio signal.

9. The digital audio apparatus of claim 6, wherein:
said digital signal processor is programmed to synthesize an output signal using a variable output buffer size Ss′, where Ss′ may be arbitrarily defined for each frame and the number of data points generated in Ss′ corresponding to the last processed frame.

10. The digital audio apparatus of claim 6, wherein:
said digital signal processor is programmed to synthesize output signal including storing one fixed output chunk SS of delayed output.