Line data Source code
1 : /******************************************************************************************************
2 :
3 : (C) 2022-2025 IVAS codec Public Collaboration with portions copyright Dolby International AB, Ericsson AB,
4 : Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V., Huawei Technologies Co. LTD.,
5 : Koninklijke Philips N.V., Nippon Telegraph and Telephone Corporation, Nokia Technologies Oy, Orange,
6 : Panasonic Holdings Corporation, Qualcomm Technologies, Inc., VoiceAge Corporation, and other
7 : contributors to this repository. All Rights Reserved.
8 :
9 : This software is protected by copyright law and by international treaties.
10 : The IVAS codec Public Collaboration consisting of Dolby International AB, Ericsson AB,
11 : Fraunhofer-Gesellschaft zur Foerderung der angewandten Forschung e.V., Huawei Technologies Co. LTD.,
12 : Koninklijke Philips N.V., Nippon Telegraph and Telephone Corporation, Nokia Technologies Oy, Orange,
13 : Panasonic Holdings Corporation, Qualcomm Technologies, Inc., VoiceAge Corporation, and other
14 : contributors to this repository retain full ownership rights in their respective contributions in
15 : the software. This notice grants no license of any kind, including but not limited to patent
16 : license, nor is any license granted by implication, estoppel or otherwise.
17 :
18 : Contributors are required to enter into the IVAS codec Public Collaboration agreement before making
19 : contributions.
20 :
21 : This software is provided "AS IS", without any express or implied warranties. The software is in the
22 : development stage. It is intended exclusively for experts who have experience with such software and
23 : solely for the purpose of inspection. All implied warranties of non-infringement, merchantability
24 : and fitness for a particular purpose are hereby disclaimed and excluded.
25 :
26 : Any dispute, controversy or claim arising under or in relation to providing this software shall be
27 : submitted to and settled by the final, binding jurisdiction of the courts of Munich, Germany in
28 : accordance with the laws of the Federal Republic of Germany excluding its conflict of law rules and
29 : the United Nations Convention on Contracts on the International Sales of Goods.
30 :
31 : *******************************************************************************************************/
32 :
33 : /*====================================================================================
34 : EVS Codec 3GPP TS26.443 Nov 04, 2021. Version 12.14.0 / 13.10.0 / 14.6.0 / 15.4.0 / 16.3.0
35 : ====================================================================================*/
36 :
37 : #include <stdint.h>
38 : #include "options.h"
39 : #ifdef DEBUGGING
40 : #include "debug.h"
41 : #endif
42 : #include "prot.h"
43 : #include "rom_com.h"
44 : #include "wmc_auto.h"
45 :
46 : /*-----------------------------------------------------------------*
47 : * Local constants
48 : *-----------------------------------------------------------------*/
49 :
50 : #define N_MAX_FFT 1024
51 :
52 : /*---------------------------------------------------------------------*
53 : * ifft_rel()
54 : *
55 : * Calculate the inverse FFT of a real signal
56 : *
57 : * Based on the FORTRAN code from the article "Real-valued Fast Fourier Transform Algorithms"
58 : * by Sorensen, ... in IEEE Trans. on ASSP, Vol. ASSP-35, No. June 6th 1987.
59 : *
60 : * Input: the io[] signal containing the spectrum in the following order :
61 : *
62 : * Re[0], Re[1], .. Re[n/2], Im[n/2-1], .. Im[1]
63 : *---------------------------------------------------------------------*/
64 :
65 1525576 : void ifft_rel(
66 : float io[], /* i/o: input/output vector */
67 : const int16_t n, /* i : vector length */
68 : const int16_t m /* i : log2 of vector length */
69 : )
70 : {
71 : int16_t i, j, k;
72 : int16_t step;
73 : int16_t n2, n4, n8, i0;
74 : int16_t is, id;
75 : float *x, *xi0, *xi1, *xi2, *xi3, *xi4, *xup1, *xdn6, *xup3, *xdn8;
76 : float xt;
77 : float r1;
78 : float t1, t2, t3, t4, t5;
79 : float cc1, cc3, ss1, ss3;
80 : const float *s, *s3, *c, *c3;
81 : const int16_t *idx;
82 : float temp[512];
83 : float n_inv;
84 :
85 1525576 : n_inv = 1.0f / n;
86 :
87 : /*-----------------------------------------------------------------*
88 : * IFFT
89 : *-----------------------------------------------------------------*/
90 :
91 1525576 : x = &io[-1];
92 1525576 : n2 = 2 * n;
93 11091050 : for ( k = 1; k < m; k++ )
94 : {
95 9565474 : is = 0;
96 9565474 : id = n2;
97 9565474 : n2 = n2 >> 1;
98 9565474 : n4 = n2 >> 2;
99 9565474 : n8 = n4 >> 1;
100 30862754 : while ( is < n - 1 )
101 : {
102 21297280 : xi1 = x + is + 1;
103 21297280 : xi2 = xi1 + n4;
104 21297280 : xi3 = xi2 + n4;
105 21297280 : xi4 = xi3 + n4;
106 :
107 164105604 : for ( i = is; i < n; i += id )
108 : {
109 142808324 : t1 = *xi1 - *xi3;
110 142808324 : *xi1 += *xi3;
111 142808324 : *xi2 = 2.0f * *xi2;
112 142808324 : *xi3 = t1 - 2.0f * *xi4;
113 142808324 : *xi4 = t1 + 2.0f * *xi4;
114 142808324 : if ( n4 != 1 )
115 : {
116 71073504 : t1 = ( *( xi2 + n8 ) - *( xi1 + n8 ) ) * INV_SQRT_2;
117 71073504 : t2 = ( *( xi4 + n8 ) + *( xi3 + n8 ) ) * INV_SQRT_2;
118 :
119 71073504 : *( xi1 + n8 ) += *( xi2 + n8 );
120 71073504 : *( xi2 + n8 ) = *( xi4 + n8 ) - *( xi3 + n8 );
121 71073504 : *( xi3 + n8 ) = (float) ( 2.0f * ( -t2 - t1 ) );
122 71073504 : *( xi4 + n8 ) = (float) ( 2.0f * ( -t2 + t1 ) );
123 : }
124 142808324 : xi1 += id;
125 142808324 : xi2 += id;
126 142808324 : xi3 += id;
127 142808324 : xi4 += id;
128 : }
129 21297280 : is = 2 * id - n2;
130 21297280 : id = 4 * id;
131 : }
132 9565474 : step = N_MAX_FFT / n2;
133 9565474 : if ( n8 < 2 )
134 : {
135 3051152 : continue;
136 : }
137 6514322 : s = sincos_t_ext + step;
138 6514322 : c = s + N_MAX_FFT / 4;
139 6514322 : s3 = sincos_t_ext + 3 * step;
140 6514322 : c3 = s3 + N_MAX_FFT / 4;
141 104652550 : for ( j = 2; j <= n8; j++ )
142 : {
143 98138228 : cc1 = *c;
144 98138228 : ss1 = *s;
145 98138228 : cc3 = *c3;
146 98138228 : ss3 = *s3;
147 :
148 98138228 : is = 0;
149 98138228 : id = 2 * n2;
150 :
151 98138228 : c += step;
152 98138228 : s += step;
153 :
154 98138228 : c3 += 3 * step;
155 98138228 : s3 += 3 * step;
156 219649272 : while ( is < n - 1 )
157 : {
158 121511044 : xup1 = x + j + is;
159 121511044 : xup3 = xup1 + 2 * n4;
160 121511044 : xdn6 = xup3 - 2 * j + 2;
161 121511044 : xdn8 = xdn6 + 2 * n4;
162 :
163 302642380 : for ( i = is; i < n; i += id )
164 : {
165 181131336 : t1 = *xup1 - *xdn6;
166 181131336 : *xup1 = *xup1 + *xdn6;
167 181131336 : xup1 += n4;
168 181131336 : xdn6 -= n4;
169 :
170 181131336 : t2 = *xdn6 - *xup1;
171 181131336 : *xdn6 = *xup1 + *xdn6;
172 :
173 181131336 : xdn6 += n4;
174 181131336 : t3 = *xdn8 + *xup3;
175 181131336 : *xdn6 = *xdn8 - *xup3;
176 :
177 181131336 : xup3 += n4;
178 181131336 : xdn8 -= n4;
179 :
180 181131336 : t4 = *xup3 + *xdn8;
181 181131336 : *xup1 = *xup3 - *xdn8;
182 :
183 181131336 : t5 = t1 - t4;
184 181131336 : t1 = t1 + t4;
185 181131336 : t4 = t2 - t3;
186 181131336 : t2 = t2 + t3;
187 181131336 : *xup3 = t1 * cc3 - t2 * ss3;
188 181131336 : xup3 -= n4;
189 181131336 : *xup3 = t5 * cc1 + t4 * ss1;
190 181131336 : *xdn8 = -t4 * cc1 + t5 * ss1;
191 :
192 181131336 : xdn8 += n4;
193 181131336 : *xdn8 = t2 * cc3 + t1 * ss3;
194 :
195 181131336 : xup1 -= n4;
196 181131336 : xup1 += id;
197 181131336 : xup3 += id;
198 181131336 : xdn6 += id;
199 181131336 : xdn8 += id;
200 : }
201 121511044 : is = 2 * id - n2;
202 121511044 : id = 4 * id;
203 : }
204 : }
205 : }
206 :
207 : /*-----------------------------------------------------------------*
208 : * Length two butterflies
209 : *-----------------------------------------------------------------*/
210 :
211 1525576 : is = 1;
212 1525576 : id = 4;
213 7503231 : while ( is < n )
214 : {
215 5977655 : xi0 = x + is;
216 5977655 : xi1 = xi0 + 1;
217 :
218 149650239 : for ( i0 = is; i0 <= n; i0 += id )
219 : {
220 143672584 : r1 = *xi0;
221 143672584 : *xi0 = r1 + *xi1;
222 143672584 : *xi1 = r1 - *xi1;
223 143672584 : xi0 += id;
224 143672584 : xi1 += id;
225 : }
226 5977655 : is = 2 * id - 1;
227 5977655 : id = 4 * id;
228 : }
229 :
230 : /*-----------------------------------------------------------------*
231 : * Digit reverse counter
232 : *-----------------------------------------------------------------*/
233 :
234 1525576 : idx = fft256_read_indexes;
235 1525576 : xi0 = &temp[0] - 1;
236 1525576 : if ( n == 128 )
237 : {
238 0 : for ( i = 0; i < n; i++ )
239 : {
240 0 : j = *idx++;
241 0 : temp[i] = x[1 + ( j >> 1 )];
242 : }
243 : }
244 1525576 : else if ( n == 256 )
245 : {
246 5838526 : for ( i = 0; i < n; i++ )
247 : {
248 5815808 : j = *idx++;
249 5815808 : temp[i] = x[1 + j];
250 : }
251 : }
252 1502858 : else if ( n == 512 )
253 : {
254 191973089 : for ( i = 0; i < 256; i++ )
255 : {
256 191226112 : j = *idx++;
257 191226112 : temp[i] = x[1 + 2 * j];
258 191226112 : temp[i + 256] = x[2 + 2 * j];
259 : }
260 : }
261 : else
262 : {
263 755881 : xi0 = x;
264 755881 : j = 1;
265 42546776 : for ( i = 1; i < n; i++ )
266 : {
267 41790895 : if ( i < j )
268 : {
269 18475202 : xt = x[j];
270 18475202 : x[j] = x[i];
271 18475202 : x[i] = xt;
272 : }
273 41790895 : k = n >> 1;
274 79395277 : while ( k < j )
275 : {
276 37604382 : j = j - k;
277 37604382 : k = k >> 1;
278 : }
279 41790895 : j = j + k;
280 : }
281 : }
282 :
283 : /*-----------------------------------------------------------------*
284 : * Normalization
285 : *-----------------------------------------------------------------*/
286 :
287 432340384 : for ( i = 1; i <= n; i++ )
288 : {
289 430814808 : x[i] = xi0[i] * n_inv;
290 : }
291 :
292 1525576 : return;
293 : }
|
