OLD | NEW |
---|---|
1 // | 1 // |
2 // Copyright (c) 2013 The WebRTC project authors. All Rights Reserved. | 2 // Copyright (c) 2013 The WebRTC project authors. All Rights Reserved. |
3 // | 3 // |
4 // Use of this source code is governed by a BSD-style license | 4 // Use of this source code is governed by a BSD-style license |
5 // that can be found in the LICENSE file in the root of the source | 5 // that can be found in the LICENSE file in the root of the source |
6 // tree. An additional intellectual property rights grant can be found | 6 // tree. An additional intellectual property rights grant can be found |
7 // in the file PATENTS. All contributing project authors may | 7 // in the file PATENTS. All contributing project authors may |
8 // be found in the AUTHORS file in the root of the source tree. | 8 // be found in the AUTHORS file in the root of the source tree. |
9 // | 9 // |
10 // This is a modification of | 10 // This is a modification of |
(...skipping 93 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
104 | 104 |
105 #define dY2 v4.2s | 105 #define dY2 v4.2s |
106 #define dY3 v5.2s | 106 #define dY3 v5.2s |
107 #define dW0 v6.2s | 107 #define dW0 v6.2s |
108 #define dW1 v7.2s | 108 #define dW1 v7.2s |
109 #define dW0Tmp v10.2s | 109 #define dW0Tmp v10.2s |
110 #define dW1Neg v11.2s | 110 #define dW1Neg v11.2s |
111 | 111 |
112 #define dZip v19.2s | 112 #define dZip v19.2s |
113 #define dZip8b v19.8b | 113 #define dZip8b v19.8b |
114 #define half v13.2s | 114 #define half v13.s |
115 | 115 |
116 .macro FFTSTAGE scaled, inverse, name | 116 .macro FFTSTAGE scaled, inverse, name |
117 | 117 |
118 fmov half, 0.5 | 118 fmov v13.2s, 0.5 |
Raymond Toy (Google)
2015/10/30 22:38:46
This makes it really hard to follow that half belo
Riku Voipio
2015/11/02 12:24:12
Likewise, will keep half as it used be and use hal
| |
119 | 119 |
120 asr size, subFFTNum, #1 // preserve the contents of N = su bFFTNum | 120 asr size, subFFTNum, #1 // preserve the contents of N = su bFFTNum |
121 lsl step, subFFTNum, #2 // step = N/2 * 8 bytes | 121 lsl step, subFFTNum, #2 // step = N/2 * 8 bytes |
122 | 122 |
123 | 123 |
124 // Z(k) = 1/2 {[F(k) + F'(N/2-k)] +j*W^(-k) [F(k) - F'(N/2-k)]} | 124 // Z(k) = 1/2 {[F(k) + F'(N/2-k)] +j*W^(-k) [F(k) - F'(N/2-k)]} |
125 // Note: W^(k) is stored as negated value and also need to | 125 // Note: W^(k) is stored as negated value and also need to |
126 // conjugate the values from the table | 126 // conjugate the values from the table |
127 | 127 |
128 // Z(0) : no need of twiddle multiply | 128 // Z(0) : no need of twiddle multiply |
(...skipping 142 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... | |
271 | 271 |
272 decrementScale\name : | 272 decrementScale\name : |
273 | 273 |
274 .endm | 274 .endm |
275 | 275 |
276 M_START armSP_FFTInv_CCSToR_F32_preTwiddleRadix2,,d15 | 276 M_START armSP_FFTInv_CCSToR_F32_preTwiddleRadix2,,d15 |
277 FFTSTAGE "FALSE","TRUE",Inv | 277 FFTSTAGE "FALSE","TRUE",Inv |
278 M_END | 278 M_END |
279 | 279 |
280 .end | 280 .end |
OLD | NEW |