Sound synthesis with fixed partition size convolution of audio signals

• US 9,431,987 B2
• Filed: 06/04/2013
• Issued: 08/30/2016
• Est. Priority Date: 06/04/2013
• Status: Active Grant

• Current Assignee: Sony Interactive Entertainment LLC (Sony Group Corp.)
• Original Assignee: Sony Interactive Entertainment America LLC (Sony Group Corp.)
• Inventors: Betbeder, Laurent, Qureshi, Shehrzad
• Primary Examiner(s): Malzahn, David H
• Application Number:
  US13/910,040
• Publication Number:
  US 20140355786A1
• Time in Patent Office: 1,183 Days
• Field of Search: None
• US Class Current: 1/1
• CPC Class Codes: H03G 9/005 of digital or coded signals
• CPC Class Codes: H03G 9/02 in untuned amplifiers

Abstract

A method for convolving an input signal with an impulse response function, the impulse response function being partitioned into a plurality of time segments of equal size, the method including transforming a segment of an input signal into the frequency domain to generate a frequency spectrum of the segment of the input signal; multiplying the frequency spectrum of the segment of the input signal with a frequency spectrum of each of the segments of the impulse response function; scaling the results from the multiplication of frequency spectra; accumulating the scaled results; and performing an inverse transform on the accumulated signals to generate a desired convolved signal in the time domain. The scaling includes performing a bitwise shift operation on the multiplication results, and performing the bitwise shift operation includes adding a bit to the multiplication results before the bitwise shift operation. Fast convolution of uniformly partitioned impulse response functions can be achieved by performing scaling of input signals, multiplication, and accumulation using fixed-point arithmetic.

Claims

1. A method, comprising:

converting a frequency spectrum of a segment of an input signal and a frequency spectrum of a corresponding segment of an impulse response function from a floating point data format to a fixed point integer data format;

multiplying the converted frequency spectrum of the segment of the input signal with the converted frequency spectrum of the corresponding segment of the impulse response function; and

generating a desired convolved signal corresponding to a convolution involving the segment of the input signal and the corresponding segment of the impulse response function in the time domain using multiplication results from said multiplying.

2. The method of claim 1, wherein said input signal is a sound signal and said impulse response function corresponds to an environment in which said sound signal is generated.

3. The method of claim 1, wherein the frequency spectrum of the segment of the input signal and the frequency spectrum of the corresponding segment of the impulse response function are converted from 32-bit floating point format into 16-bit fixed integer format.

4. The method of claim 1, wherein the segment of the input signal is transformed into the frequency domain to generate the frequency spectrum of the segment of the input signal by performing a fast Fourier Transform (FFT) on the segment of the input signal.

5. The method of claim 1, wherein the impulse response function includes a combination of two or more different impulse response functions, wherein the method further comprises scaling the combination of two or more impulse response functions to generate a crossfaded impulse response function.

6. The method of claim 1, wherein the impulse response function is pre-computed, wherein the method further comprises scaling the impulse response function with a floating point operation.

7. The method of claim 1, wherein the spectrum of the impulse response function segment is pre-computed.

8. The method of claim 1, wherein the impulse response function is partitioned into a plurality of time segments of equal size.

9. The method of claim 1, wherein generating said desired convolved signal in the time domain includes:

scaling said multiplication results from said multiplying;

accumulating scaled results from said scaling multiplication results; and

performing an inverse transform on accumulated signals from said accumulating scaled results to generate said desired convolved signal in the time domain.

10. The method of claim 9, further comprising calculating a scale factor for said scaling multiplication results, wherein said calculating the scale factor includes determining a peak in the frequency spectrum of the segment of the input signal, and determining a next power of 2 from the peak.

11. The method of claim 9, wherein the accumulating in said accumulating scaled results is performed in a buffer separate from a delay line of the input signal.

12. The method of claim 9, wherein said scaling multiplication results includes performing a bitwise shift operation on the multiplication results after adding a bit to the multiplication results.

13. The method of claim 9, wherein the accumulating in said accumulating scaled results is performed in a buffer separate from a delay line of the input signal.

14. The method of claim 9, wherein said performing an inverse transform on accumulated signals includes performing an inverse FFT (IFFT) on the accumulated signals.

15. The method of claim 9, wherein the method further comprises scaling the inverse transform of said performing an inverse transform on accumulated signals with a floating point operation.

16. A system comprising:

a processor;

a memory coupled to the processor;

program instructions embodied in the memory an executable by the processor, wherein execution of the program instructions by the processor causes the processor to implement a method, the method comprising;

converting a frequency spectrum of a segment of an input signal and a frequency spectrum of a corresponding segment of an impulse response function from a floating point data format to a fixed point integer data format;

multiplying the converted frequency spectrum of the segment of the input signal with the converted frequency spectrum of the corresponding segment of the impulse response function; and

generating a desired convolved signal corresponding to a convolution involving the segment of the input signal and the corresponding segment of the impulse response function in the time domain using multiplication results from said multiplying the converted frequency spectrum.

17. The system of claim 16, further comprising a speaker coupled to the processor, the method further comprising playing the convolved signal through the speaker.

18. The system of claim 16, wherein said input signal is a sound signal and said impulse response function corresponds to an environment in which said sound signal is generated.

19. The system of claim 16, wherein the frequency spectrum of the segment of the input signal and the frequency spectrum of the corresponding segment of the impulse response function are converted from 32-bit floating point format into 16-bit fixed integer format.

20. The system of claim 16, wherein the segment of the input signal is transformed into the frequency domain to generate the frequency spectrum of the segment of the input signal by performing a fast Fourier transform (FFT) on the segment of the input signal.

21. The system of claim 16, wherein the impulse response function includes a crossfaded signal, wherein the method further comprises scaling a linear combination of a plurality of impulse response functions to generate the crossfaded signal for the impulse response function of said multiplying the frequency spectrum.

22. The system of claim 16, wherein the impulse response function is pre-computed, wherein the method further comprises scaling the impulse response function with a floating point operation.

23. The system of claim 16, further comprising a user interface unit, wherein the input signal includes sounds generated by inputs from the user interface unit.

24. The system of claim 16, wherein generating said desired convolved signal in the time domain includes:

scaling said multiplication results from said multiplying;

accumulating scaled results from said scaling multiplication results; and

performing an inverse transform on accumulated signals from said accumulating scaled results to generate said desired convolved signal in the time domain.

25. The system of claim 24, wherein said scaling multiplication results includes performing a bitwise shift operation on the multiplication results after adding a bit to the multiplication results.

26. The system of claim 24, wherein the accumulating in said accumulating scaled results is performed in a buffer separate from a delay line of the input signal.

27. The system of claim 24, wherein said performing an inverse transform on accumulated signals includes performing an inverse FFT (IFFT) on the accumulated signals.

28. The system of claim 24, wherein said inverse transform on accumulated signals is scaled with a floating point operation.

29. A non-transitory computer readable medium having program instructions, wherein execution of the program instructions by one or more processors causes the one or more processors to perform a method, the method comprising:

converting a frequency spectrum of a segment of an input signal and a frequency spectrum of corresponding segment of an impulse response function from a floating point data format to a fixed point integer data format;

multiplying the converted frequency spectrum of the segment of the input signal with the converted frequency spectrum of a corresponding segment of the impulse response function;

scaling multiplication results from said multiplying the converted frequency spectrum;

accumulating scaled results from said scaling multiplication results; and

performing an inverse transform on accumulated signals from said accumulating scaled results to generate a desired convolved signal corresponding to a convolution involving the segment of the input signal and the corresponding segment of the impulse response function in the time domain.

30. The non-transitory computer readable medium of claim 29, wherein said scaling multiplication results includes performing a bitwise shift operation on the multiplication results after adding a bit to the multiplication results.