Efficient system and method for converting between different transform-domain signal representations

• US 6,963,842 B2
• Filed: 09/05/2001
• Issued: 11/08/2005
• Est. Priority Date: 09/05/2001
• Status: Active Grant

• Current Assignee: Creative Technology Ltd.
• Original Assignee: Creative Technology Ltd.
• Inventors: Goodwin, Michael M.
• Primary Examiner(s): Ometz, David L.
• Assistant Examiner(s): JACKSON, JAKIEDA R
• Application Number:
  US09/948,053
• Publication Number:
  US 20030093282A1
• Time in Patent Office: 1,525 Days
• Field of Search: 704/500, 704/200.1, 704/203, 704/269, 704/230, 341/50, 395/238
• US Class Current: 704/500
• CPC Class Codes: G06F 17/147 Discrete orthonormal transforms, e.g. discrete cosine transform, discrete sine transform, and variations therefrom, e.g. modified discrete cosine transform, integer transforms approximating the discrete cosine transform G06F17/145 takes precedence
• CPC Class Codes: G10L 19/0212 using orthogonal transformation

Abstract

A memory-efficient system converting a signal from a first transform domain to a second transform domain. The system includes a first mechanism that obtains an input signal expressed via a first transform-domain signal representation. A second mechanism expresses the input signal via a second transform-domain signal representation without intermediate time-domain conversion. In the specific embodiment, the input signal is a Modified Discrete Cosine Transform (MDCT) signal. The second transform-domain signal representation is a Discrete Fourier Transform (DFT) signal. The second mechanism further includes a third mechanism that combines effects of an inverse MDCT, a synthesis window function, and an analysis window function, and provides a first signal in response thereto. A fourth mechanism converts the MDCT signal to the DFT signal based on the first signal. In a more specific embodiment, the synthesis window function is an MDCT synthesis window function, while the analysis window function is a DFT analysis window function. The fourth mechanism includes a mechanism for performing a fast transform on the MDCT signal and providing a first transformed signal in response thereto. The fourth mechanism further includes a mechanism for selectively delaying and updating the first transformed signal to yield second and third transformed signals, respectively, in response thereto. The fourth mechanism further includes a mechanism for operating on the first, second, and third transformed signals via third, second, and first combined window functions, respectively, and providing third, second, and first windowed signals, respectively, in response thereto. An adder adds the first, second, and third windowed functions to provide an added digital signal. An inverse DFT circuit performs an inverse DFT on the added digital signal to provide the DFT signal as output.

Claims

1. A system for efficiently converting a signal from a first transform-domain representation to a second transform-domain representation comprising:

first means for obtaining an input signal expressed via said first transform-domain signal representation and

second means for expressing said input signal via a second transform-domain signal representation without intermediate time-domain conversion, in response to the receipt of said input signal.

2. The system of claim 1 wherein said first transform-domain signal representation represents a Modified Discrete Cosine Transform (MDCT) signal, and said second transform-domain signal representation represents a Discrete Fourier Transform (DFT) signal.

3. The system of claim 2 wherein said second means further includes third means for combining effects of an Inverse Modified Discrete Cosine Transform (IMDCT), a synthesis window function, and an analysis window function and providing a first signal in response thereto.

4. The system of claim 3 wherein said second means further includes fourth means for converting said MDCT signal to a DFT signal based on said first signal.

5. The system of claim 4 wherein said synthesis window function is an MDCT synthesis window function associated with said MDCT signal, and wherein said analysis window function is a DFT analysis window function associated with a DFT domain.

6. The system of claim 5 wherein said fourth means includes a means for performing a fast transform on said MDCT signal and providing a first transformed signal in response thereto.

7. The system of claim 6 wherein said first transformed signal is characterized by the following equation:

$g_i<br><br>\left[r\right]={\mathrm{e<br><br>}}^{-j<br><br>\frac{\mathrm{\pi <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>r}{n}}<br><br>F_N<br><br>\left\{X_N<br><br>\left[i,k\right]<br><br>{\mathrm{e<br><br>}}^{{\left({\mathrm{j\varphi <br><br>}}_k<br><br>\left(-1\right)\right)}^k}<br><br>\left(-j\right)\right\}$

where g_i[r] represents said first transformed signal;

k and r are integer index variables;

j=√

{square root over (−

1)};

F_N{ }is an N-point DFT function;

X_N[i,k] represents an N-point MDCT associated with an i^th frame of said MDCT signal;

N is the length of the N-point MDCT; and

φ

_k is a phase term defined by ${\mathrm{\varphi <br><br>}}_k=\frac{2<br><br>\mathrm{\pi <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>n_0}{N}<br><br>\left(k+1\right),$

where $n_0=\frac{N}{4}+\frac{1}{2}.$

8. The system of claim 6 wherein said means for performing a fast transform includes means for computing said first transformed signal via a quarter point complex inverse DFT.

9. The system of claim 8 wherein said first transformed signal is computed in accordance with the following expressions via said means for computing said first transformed signal:

${\stackrel{.}{A}}_i<br><br>\left[r+\frac{N}{4}\right]+j<br><br>\text{\hspace{1em}<br><br>}<br><br>{\stackrel{.}{A}}_i<br><br>\left[r\right]=\frac{N}{2}<br><br>{\mathrm{e<br><br>}}^{j<br><br>\frac{\mathrm{\pi <br><br>}}{N}<br><br>\left(2<br><br>r-n_0\right)}<br><br>F_{\frac{N}{4}}^{-1}<br><br>\left\{{\left(-1\right)}^{k+1}<br><br>{\mathrm{e<br><br>}}^{-j<br><br>\frac{2<br><br>\mathrm{\pi <br><br>}<br><br>\text{\hspace{1em}<br><br>}<br><br>k}{N}}<br><br>\left(X_N<br><br>\left[i,k\right]+j<br><br>\text{\hspace{1em}<br><br>}<br><br>X_N<br><br>\left[i,\frac{N}{2}-2<br><br>k-1\right]\right)\right\}$

where $0\le <br><br>k\le <br><br>\frac{N}{4}-1<br><br>\text{\hspace{1em}<br><br>}<br><br>a<br><br>\text{\hspace{1em}<br><br>}<br><br>n<br><br>\text{\hspace{1em}<br><br>}<br><br>d<br><br>\text{\hspace{1em}<br><br>}<br><br>0\le <br><br>r\le <br><br>\frac{N}{4}-1,$

and ${\stackrel{.}{B}}_i<br><br>\left[r\right]=\{\begin{array}{cc}-{\stackrel{.}{A}}_i<br><br>\left[\frac{N}{4}-r\right]& 0\le <br><br>r\le <br><br>\frac{N}{4}\\ {\stackrel{.}{A}}_i<br><br>\left[\frac{3<br><br>N}{4}-r\right]& \frac{N}{4}+1\le <br><br>r\le <br><br>\frac{N}{2}-1\end{array},$

where ${\stackrel{.}{A}}_i<br><br>\left[\frac{N}{4}-r\right],\text{\hspace{1em}<br><br>}<br><br>0\le <br><br>r\le <br><br>\frac{N}{4}$

are the even samples of the first transformed signal for the first half of the i^th frame;

${\stackrel{.}{A}}_i<br><br>\left[\frac{3<br><br>N}{4}-r\right],\text{\hspace{1em}<br><br>}<br><br>\frac{N}{4}+1\le <br><br>r\le <br><br>\frac{N}{2}-1$

are the even samples of the first transformed signal for the second half of the i^th frame;

{dot over (B)}_i[r] represents the odd samples of the first transformed signal; and

where $F_{\frac{N}{4}}^{-1}<br><br>\left\{\text{\hspace{1em}<br><br>}\right\}$

is a quarter-point complex inverse DFT function.

10. The system of claim 7 wherein said fourth means further includes means for selectively delaying and updating said first transformed signal to yield second and third transformed signals, respectively, in response thereto.

11. The system of claim 10 wherein said second transformed signal is characterized by the following equation:

${\stackrel{\_}{g}}_i<br><br>\left[r\right]=g_i<br><br>\left[r-\frac{N}{2}\right]<br><br>\mathrm{sgn}<br><br>\left(r-\frac{N}{2}\right),$

where {overscore (g)}_i[r] represents said second transformed signal, and $g_i<br><br>\left[r-\frac{N}{2}\right]$

represents said first transformed signal delayed by a circular delay of $\frac{N}{2}.$

12. The system of claim 11 wherein said third transformed signal is characterized by the following equation:

${\stackrel{\_}{\stackrel{\_}{g}}}_i<br><br>\left[r\right]={\stackrel{\_}{g}}_i<br><br>\left[r-\frac{N}{2}\right]<br><br>\mathrm{sgn}<br><br>\left(r-\frac{N}{2}\right),$

where {double overscore (g)}_i[r] represents said third transformed signal, and ${\stackrel{\_}{g}}_i<br><br>\left[r-\frac{N}{2}\right]$

represents said second transformed signal delayed by a circular delay of $\frac{N}{2}.$

13. The system of claim 10 wherein said fourth means further includes means for operating on said first, second, and third transformed signals via third, second, and first combined window functions, respectively, and providing third, second, and first windowed signals, respectively, in response thereto.

14. The system of claim 13 wherein said first combined window function (σ

₀[r]) is defined in accordance with the following equation;

${\mathrm{\sigma <br><br>}}_0<br><br>\left[r\right]=w<br><br>\left[-r\right]<br><br>f<br><br>\left[-r+\frac{N}{2}\right]-w<br><br>\left[N-r\right]<br><br>f<br><br>\left[\frac{3<br><br>N}{2}-r\right],$

where 0≦

r≦

N−

1 and w[r] and ƒ

[r] are zero outside this interval;

w[r] represents said analysis window function;

ƒ

[r] represents said synthesis window function; and

r and N are as defined above.

15. The system of claim 14 wherein said second combined window function (σ

₁[r]) is defined in accordance with the following equation;

σ

₁[r]=w[−

r]ƒ

[−

r]−

w[N−

r]ƒ

[N−

r].

16. The system of claim 15 wherein said third combined window function (σ

₂[r]) is defined in accordance with the following equation;

${\mathrm{\sigma <br><br>}}_0<br><br>\left[r\right]=w<br><br>\left[-r\right]<br><br>f<br><br>\left[-r-\frac{N}{2}\right]-w<br><br>\left[N-r\right]<br><br>f<br><br>\left[\frac{N}{2}-r\right].$

17. The system of claim 13 wherein said fourth means includes an adder for adding said first, second, and third windowed functions and providing an added digital signal in response thereto.

18. The system of claim 17 wherein said fourth means further includes means for performing an Inverse Discrete Fourier Transform (IDFT) on said added digital signal and providing said DFT signal as output in response thereto.

19. A system for facilitating compression-domain modification of a digital signal comprising:

first means for converting a compression-domain signal to a modification-domain signal without intermediate time-domain conversion and

second means for modifying signal components of said modification-domain signal and providing a modified modification-domain signal in response thereto.

20. The system of claim 19 wherein said compression-domain signal is a Modified Discrete Cosine Transform (MDCT) signal;

said modification-domain signal is a Discrete Fourier Transform (DFT) signal; and

said modified modification-domain signal is a modified DFT signal.

21. The system of claim 20 further including third means for converting said modified DFT signal to a desired domain and providing an output signal in response thereto.

22. The system of claim 21 wherein said desired domain is the MDCT domain.

23. The system of claim 21 wherein said desired domain is the time domain.

24. An efficient digital system for facilitating coding and signal component modification comprising:

first means for converting a time-domain digital input signal to a first frequency domain that accommodates coding and providing a first transform-domain digital signal in response thereto;

second means for coding said first transform-domain digital signal and providing an encoded signal in response thereto;

third means for decoding said encoded signal and providing a decoded signal in response thereto;

fourth means for transforming said decoded signal from a first transform domain directly to a second transform domain for accommodating signal component modification and providing a second transform-domain digital signal in response thereto;

sixth means for modifying components of said second transform-domain digital signal and providing a modified signal in response thereto; and

seventh means for converting said modified signal to a digital output time-domain signal.

25. The system of claim 24 wherein said first means further includes an analog-to-digital converter for converting an analog input signal into said time-domain digital input signal.

26. The system of claim 25 wherein said seventh means further includes means for converting said digital output time-domain signal to an analog output signal.

27. The system of claim 25 wherein said second means for coding includes an encoder for performing signal compression via psychoacoustics, quantization, and/or entropy coding.

28. The system of claim 27 further including eighth means for transferring said encoded signal through an intermediate medium before implementation of said third means.

29. The system of claim 28 wherein said intermediate medium is a channel.

30. The system of claim 29 wherein said intermediate medium is a memory.

31. The system of claim 24 wherein said first transform domain is the Modified Discrete Cosine Transform (MDCT) domain.

32. The system of claim 31 wherein said second transform domain is the Discrete Fourier Transform (DFT) domain.

33. The system of claim 32 wherein said fourth means includes an MDCT-to-DFT conversion circuit for implementing the following conversion function:

χ

_N[i+1,l]=F_N<sup>−

1</sup>{σ

₀[r]{double overscore (g)}_i[r]+σ

₁[r]{overscore (g)}_i+1[r]+σ

₂[r]g_i+2[r]}

where χ

_N[i+1,l] is the N-point DFT for frame i+1 of said decoded signal;

i is an integer frame index;

l is an integer variable representing the frequency index of χ

_N[i,l];

N is a predetermined integer corresponding to the length of said N-point DFT;

F_N<sup>−

1</sup> is an N-point inverse DFT function that operates on σ

₀[r]{double overscore (g)}_i[r]+σ

₁[r]{overscore (g)}_i+1[r]+σ

₂[r]g_i+2[r];

r is an integer variable representing an index into the sequence to be processed by the inverse DFT;

σ

₀[r], σ

₁[r], and σ

₂[r] are a first, second and third combined window functions, respectively, that represents the combined effects of a predetermined MDCT synthesis window function and a DFT analysis window function associated with a first frame, a second frame, and a third frame, respectively;

g_i+2[r] is a function of a DFT of an MDCT associated with an i+2 frame of said decoded signal;

{overscore (g)}_i+1[r] is a delayed version of a g_i+1[r] function associated with an i+1 frame of said decoded signal;

{double overscore (g)}_i[r] is a delayed version of {overscore (g)}_i[r], which is a delayed version of a g_i[r] function associated with an i^th frame of said decoded signal.

34. A system for efficiently transforming a digital signal from the Modified Discrete Cosine Transform (MDCT) domain to the Discrete Fourier Transform (DFT) domain comprising:

a fast transform circuit in communication with an input MDCT digital signal in an MDCT domain;

a first delay and update circuit having an input connected to an output of said fast transform circuit;

a second delay and update circuit having an input connected to an output of said first delay and update circuit;

a first combined window multiplier incorporating a first MDCT synthesis window function and a first DFT analysis window function and having an input connected to an output of said second delay and update circuit;

a second combined window multiplier incorporating a second MDCT synthesis window function and a second DFT analysis window function and having an input connected to an output of said first delay and update circuit;

a third combined window multiplier incorporating a third MDCT synthesis window function and a third DFT analysis window function and having an input connected to an output of said fast transform circuit;

an adder having inputs connected to outputs of said first combined window multiplier, said second combined window multiplier, and said third combined window multiplier; and

an Inverse Discrete Fourier Transform (IDFT) circuit having an input connected to an output of said adder, an output of said IDFT circuit representing a DFT signal associated with said input MDCT digital signal.

35. An efficient method for facilitating coding and signal component modification of a digital signal comprising the steps of:

converting a time-domain digital input signal to a first frequency domain that accommodates coding and providing a first transform-domain digital signal in response thereto;

coding said first transform-domain digital signal and providing an encoded signal in response thereto;

transferring said encoded signal through an intermediate medium;

decoding said encoded signal and providing a decoded signal in response thereto;

transforming said decoded signal from a first transform domain directly to a second transform domain that accommodates signal component modification and providing a second transform-domain digital signal in response thereto;

modifying components of said second transform-domain digital signal and providing a modified signal in response thereto; and

converting said modified signal to a digital output time-domain signal.

36. The method of claim 35 wherein said first transform domain is a compression domain.

37. The method of claim 36 wherein said second transform domain is a modification domain.

38. A method for efficiently converting a signal from a first transform domain to a second transform domain comprising the steps of:

determining steps required to convert a first signal from said first transform domain to a time domain and then to a second transform domain and

selectively combining said steps to eliminate intermediate time-domain conversion.

39. A method for converting a signal from a first transform domain to a second transform domain comprising the steps of:

determining an expression for a segment of an intermediate time-domain signal based on a first transform-domain signal expression, said expression incorporating a second transform-domain analysis window and a first transform-domain synthesis window;

applying a second transform associated with said second transform domain to said expression to yield a second transform-domain expression;

computing a first transform-domain function and a second transform-domain function from said second transform-domain expression;

expressing a second transform-domain signal in terms that may include a convolution of the first transform-domain function with the second transform-domain function and/or corresponding conjugate functions;

performing an inverse second transform of the product between the second transform of the first transform-domain function and the second transform of the second transform-domain function and/or the product between corresponding conjugate functions to yield a second transform-domain representation; and

employing a fast algorithm based on said second transform-domain representation and symmetry thereof to compute a second transform-domain signal corresponding to said first transform-domain signal.

40. The method of claim 39 further including the step of employing said first transform-domain signal as computed for a first frame to determine transform-domain signals for subsequent frames.