US9368121B2ActiveUtilityPatentIndex 51
Adaptations of analysis or synthesis weighting windows for transform coding or decoding
Est. expiryJul 12, 2031(~5 yrs left)· nominal 20-yr term from priority
G10L 19/022G10L 19/02G10L 19/00G10L 19/0212H03M 7/30H03M 7/3044
51
PatentIndex Score
0
Cited by
15
References
16
Claims
Abstract
A method and device are provided for coding or decoding a digital audio signal by transform using analysis or synthesis weighting windows applied to sample frames. The method includes an irregular sampling of an initial window provided for a transform of given initial size N, to apply a secondary transform of size M different from N.
Claims
exact text as granted — not AI-modifiedThe invention claimed is:
1. A method comprising:
receiving a digital audio signal or input quantization indices through an input module;
coding the digital audio signal to produce output quantization indices or decoding the input quantization indices to produce a decoded digital audio signal with a processor, the coding or decoding comprising a transform coding or decoding using at least one of analysis or synthesis weighting windows applied to sample frames and obtained from an irregular sampling of an initial window provided for a transform of given initial size N, to apply a secondary transform of size M different from N,
including storing the initial window in a non-transitory computer-readable memory cooperating with the processor, wherein sampling comprises selecting, from a first coefficient d of the initial window that is stored in the memory, with 0≦d<N/M, a defined set of coefficients N−d−1, N+d, 2N−d−1, observing a predetermined perfect reconstruction condition; and
transmitting through an output module the output quantization indices or providing the decoded digital audio signal.
2. The method as claimed in claim 1 , wherein, when N is greater than M, a decimation of the initial window is performed by retaining at least the coefficients of the defined set to obtain a decimated window.
3. The method as claimed in claim 2 , wherein the method comprises selection of a second set of coefficients spaced apart by a constant difference with the coefficients of the defined set and the decimation is performed by also retaining the coefficients of the second set to obtain the decimated window.
4. The method as claimed in claim 3 , wherein the decimation of a window of size 2N into a window of size 2M is performed according to the following equations:
for
k
∈
[
0
;
M
/
2
-
1
]
[
h
(
k
)
=
h
(
⌈
k
N
M
⌉
+
d
)
h
*
(
2
M
-
k
-
1
)
=
h
(
⌊
2
N
-
1
-
k
N
M
⌋
-
d
)
h
*
(
M
+
k
)
=
h
(
⌈
N
+
k
N
M
⌉
+
d
)
h
*
(
M
-
k
-
1
)
=
h
(
⌊
N
-
1
-
k
N
M
⌋
-
d
)
in which h* is the decimated analysis or synthesis window, h is the initial analysis or synthesis window, └X┘ is the closest integer≦X, ┌X┐ is the closest integer≧X and d is the value of the first coefficient of the defined set.
5. The method as claimed in claim 1 , wherein, when N is less than M, an interpolation is performed by inserting a coefficient between each of the coefficients of the set of defined coefficients and each of the coefficients of a set of adjacent coefficients to obtain an interpolated window.
6. The method as claimed in claim 5 , wherein the method comprises selection of a second set of coefficients spaced apart by a constant difference with the coefficients of the defined set and wherein the interpolation is performed by also inserting a coefficient between each of the coefficients of the second set and each of the coefficients of a set of adjacent coefficients to obtain the interpolated window.
7. The method as claimed in claim 5 , wherein the method comprises computation of a complementary window comprising coefficients computed from the defined coefficients of the set and from the adjacent coefficients, to interpolate said window.
8. The method as claimed in claim 7 , wherein, when the secondary transform is of size M=3/2N, the decimation of the initial window followed by an interpolation is performed during the temporal folding according to the following equations:
[
T
M
(
k
+
1
)
=
-
T
2
M
(
3
M
2
-
(
k
+
1
)
-
1
)
h
(
3
N
2
-
k
/
2
-
1
)
-
T
2
M
(
3
M
2
+
k
+
1
)
h
(
3
N
2
+
k
/
2
)
T
M
(
k
)
=
-
T
2
M
(
3
N
2
-
k
-
1
)
hcomp
(
3
N
2
-
k
/
2
-
1
)
-
T
2
M
(
3
N
2
+
k
)
hcomp
(
3
N
2
+
k
/
2
)
T
M
(
N
/
2
+
k
)
=
T
2
M
(
k
)
h
(
k
/
2
)
-
T
2
M
(
N
-
k
-
1
)
h
(
N
-
k
/
2
-
1
)
T
M
(
N
/
2
+
k
+
1
)
=
T
2
M
(
k
+
1
)
hcomp
(
k
/
2
)
-
T
2
M
(
N
-
(
k
+
1
)
-
1
)
hcomp
(
N
-
k
/
2
-
1
)
k
/
2
∈
[
0
;
N
/
2
-
1
]
with T M being a frame of M samples, T 2M , a frame of 2M samples, hcomp the complementary window.
9. The method as claimed in claim 7 , wherein, when the secondary transform is of size M=3/2N, the decimation of the initial window followed by an interpolation is performed during the temporal unfolding according to the following equations:
[
T
2
M
*
(
k
)
=
T
M
*
(
N
2
+
k
)
h
(
2
N
-
k
/
2
-
1
)
T
2
M
*
(
k
+
1
)
=
T
M
*
(
N
2
+
k
+
1
)
hcomp
(
2
N
-
k
/
2
-
1
)
T
2
M
*
(
N
2
+
k
+
1
)
=
-
T
M
*
(
N
-
(
k
+
1
)
-
1
)
h
(
3
N
2
-
k
/
2
-
1
)
T
2
M
*
(
N
2
+
k
)
=
-
T
M
*
(
N
-
k
-
1
)
hcomp
(
3
N
2
-
k
/
2
-
1
)
T
2
M
*
(
N
+
k
)
=
-
T
M
*
(
N
2
-
k
-
1
)
h
(
N
-
k
/
2
-
1
)
T
2
M
*
(
N
+
k
+
1
)
=
-
T
M
*
(
N
2
-
(
k
+
1
)
-
1
)
hcomp
(
N
-
k
/
2
-
1
)
T
2
M
*
(
3
N
2
+
k
+
1
)
=
-
T
M
*
(
k
+
1
)
h
(
N
2
-
k
/
2
-
1
)
T
2
M
*
(
3
N
2
+
k
)
=
-
T
M
*
(
k
)
hcomp
(
N
2
-
k
/
2
-
1
)
k
/
2
∈
[
0
;
N
/
2
-
1
]
with T M being a frame of M samples, T 2M , a frame of 2M samples, hcomp the complementary window.
10. The method as claimed in claim 1 , wherein the irregular sampling step and a decimation or interpolation of the initial window are performed during a step of implementing temporal folding or unfolding used for computation of the secondary transform.
11. The method as claimed in claim 10 , wherein the decimation during the temporal folding is performed according to the following equation:
[
T
M
(
k
)
=
-
T
2
M
(
3
M
2
-
k
-
1
)
h
a
(
⌈
3
N
2
-
(
k
+
1
)
N
M
⌉
+
d
)
-
T
2
M
(
3
M
2
+
k
)
h
a
(
⌊
3
N
2
-
1
+
(
k
+
1
)
N
M
⌋
-
d
)
T
M
(
M
/
2
+
k
)
=
T
2
M
(
k
)
h
a
(
⌈
k
N
M
⌉
+
d
)
-
T
2
M
(
M
-
k
-
1
)
h
a
(
⌊
N
-
1
-
k
N
M
⌋
-
d
)
k
∈
[
0
;
M
/
2
-
1
]
with T M being a frame of M samples, T 2M , a frame of 2M samples.
12. The method as claimed in claim 10 , wherein the decimation during the temporal unfolding is performed according to the following equation:
[
T
2
M
*
(
k
)
=
T
M
*
(
M
2
+
k
)
h
s
(
⌈
k
N
M
⌉
+
d
)
T
2
M
*
(
M
2
+
k
)
=
-
T
M
*
(
M
-
k
-
1
)
h
s
(
⌊
N
2
-
1
+
(
k
+
1
)
N
M
⌋
-
d
)
T
2
M
*
(
M
+
k
)
=
-
T
M
*
(
M
2
-
k
-
1
)
h
s
(
⌈
N
+
k
N
M
⌉
+
d
)
T
2
M
*
(
3
M
2
+
k
)
=
-
T
M
*
(
k
)
h
s
(
⌊
3
N
2
-
1
+
(
k
+
1
)
N
M
⌋
-
d
)
k
∈
[
0
;
N
/
2
-
1
]
with T* M being a frame of M samples, T* 2M , a frame of 2M samples.
13. The method as claimed in claim 1 , wherein both a decimation and an interpolation of the initial window are performed during a step of implementing a temporal folding or unfolding used for computation of the secondary transform.
14. A device comprising:
an input module configured to receive a digital audio signal or input quantization indices;
an output module configured to transmit output quantization indices or to provide a decoded digital audio signal;
a non-transitory computer-readable memory; and
a coder configured to code the digital audio signal to produce the output quantization indices or a decoder configured to decode the input quantization indices to produce the decoded digital audio signal, comprising a transform coder or decoder module using at least one of analysis or synthesis weighting windows applied to sample frames, the coder or decoder comprising:
a sampling module matched for irregularly sampling an initial window provided for a transform of given initial size N, in order to apply a secondary transform of size M different from N, wherein the initial window is stored in the non-transitory computer-readable memory, and wherein the sampling module is configured to select, from a first coefficient d of the initial window that is stored in the memory, with 0≦d<N/M, a defined set of coefficients N−d−1, N+d, 2N−d−1, observing a predetermined perfect reconstruction condition.
15. The device of claim 14 , wherein the coder or decoder for coding or decoding comprises:
a memory storing instructions; and
a processor, which is configured by the instructions to code or decode the digital audio signal by transform and irregularly sample the initial window provided for the transform of the given initial size N.
16. A non-transitory computer-readable medium comprising a computer program stored thereon and comprising code instructions for implementation of steps of a method of coding or decoding, when these instructions are run by a processor, wherein the method comprises:
receiving a digital audio signal or input quantization indices through an input module;
coding the digital audio signal to produce output quantization indices or decoding the input quantization indices to produce a decoded digital audio signal with the processor, the coding or decoding comprising a transform coding or decoding using at least one of analysis or synthesis weighting windows applied to sample frames and obtained from an irregular sampling of an initial window provided for a transform of given initial size N, to apply a secondary transform of size M different from N,
including storing the initial window in the computer-readable medium, and wherein sampling comprises selecting, from a first coefficient d of the initial window that is stored in the computer-readable medium with 0≦d<<N/M, a defined set of coefficients N−d−1, N+d, 2N−d−1, observing a predetermined perfect reconstruction condition; and
transmitting through an output module the output quantization indices or providing the decoded digital audio signal.Cited by (0)
No later patents cite this yet.
References (0)
No backward citations on record.