blob: 5e5adb62de983039106feadcfcd1d021d5bd7230 [file] [log] [blame]
peah522d71b2017-02-23 05:16:26 -08001/*
2 * Copyright (c) 2017 The WebRTC project authors. All Rights Reserved.
3 *
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
6 * tree. An additional intellectual property rights grant can be found
7 * in the file PATENTS. All contributing project authors may
8 * be found in the AUTHORS file in the root of the source tree.
9 */
10
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020011#ifndef MODULES_AUDIO_PROCESSING_AEC3_FFT_DATA_H_
12#define MODULES_AUDIO_PROCESSING_AEC3_FFT_DATA_H_
peah522d71b2017-02-23 05:16:26 -080013
Niels Möllera12c42a2018-07-25 16:05:48 +020014// Defines WEBRTC_ARCH_X86_FAMILY, used below.
15#include "rtc_base/system/arch.h"
16
peah522d71b2017-02-23 05:16:26 -080017#if defined(WEBRTC_ARCH_X86_FAMILY)
18#include <emmintrin.h>
19#endif
20#include <algorithm>
21#include <array>
22
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020023#include "api/array_view.h"
24#include "modules/audio_processing/aec3/aec3_common.h"
peah522d71b2017-02-23 05:16:26 -080025
26namespace webrtc {
27
28// Struct that holds imaginary data produced from 128 point real-valued FFTs.
29struct FftData {
30 // Copies the data in src.
31 void Assign(const FftData& src) {
32 std::copy(src.re.begin(), src.re.end(), re.begin());
33 std::copy(src.im.begin(), src.im.end(), im.begin());
34 im[0] = im[kFftLengthBy2] = 0;
35 }
36
37 // Clears all the imaginary.
38 void Clear() {
39 re.fill(0.f);
40 im.fill(0.f);
41 }
42
43 // Computes the power spectrum of the data.
44 void Spectrum(Aec3Optimization optimization,
Per Åhgren8ba58612017-12-01 23:01:44 +010045 rtc::ArrayView<float> power_spectrum) const {
46 RTC_DCHECK_EQ(kFftLengthBy2Plus1, power_spectrum.size());
peah522d71b2017-02-23 05:16:26 -080047 switch (optimization) {
48#if defined(WEBRTC_ARCH_X86_FAMILY)
49 case Aec3Optimization::kSse2: {
50 constexpr int kNumFourBinBands = kFftLengthBy2 / 4;
51 constexpr int kLimit = kNumFourBinBands * 4;
52 for (size_t k = 0; k < kLimit; k += 4) {
53 const __m128 r = _mm_loadu_ps(&re[k]);
54 const __m128 i = _mm_loadu_ps(&im[k]);
55 const __m128 ii = _mm_mul_ps(i, i);
56 const __m128 rr = _mm_mul_ps(r, r);
57 const __m128 rrii = _mm_add_ps(rr, ii);
Per Åhgren8ba58612017-12-01 23:01:44 +010058 _mm_storeu_ps(&power_spectrum[k], rrii);
peah522d71b2017-02-23 05:16:26 -080059 }
Per Åhgren8ba58612017-12-01 23:01:44 +010060 power_spectrum[kFftLengthBy2] = re[kFftLengthBy2] * re[kFftLengthBy2] +
61 im[kFftLengthBy2] * im[kFftLengthBy2];
peah522d71b2017-02-23 05:16:26 -080062 } break;
63#endif
64 default:
Per Åhgren8ba58612017-12-01 23:01:44 +010065 std::transform(re.begin(), re.end(), im.begin(), power_spectrum.begin(),
peah522d71b2017-02-23 05:16:26 -080066 [](float a, float b) { return a * a + b * b; });
67 }
68 }
69
70 // Copy the data from an interleaved array.
71 void CopyFromPackedArray(const std::array<float, kFftLength>& v) {
72 re[0] = v[0];
73 re[kFftLengthBy2] = v[1];
74 im[0] = im[kFftLengthBy2] = 0;
75 for (size_t k = 1, j = 2; k < kFftLengthBy2; ++k) {
76 re[k] = v[j++];
77 im[k] = v[j++];
78 }
79 }
80
81 // Copies the data into an interleaved array.
82 void CopyToPackedArray(std::array<float, kFftLength>* v) const {
83 RTC_DCHECK(v);
84 (*v)[0] = re[0];
85 (*v)[1] = re[kFftLengthBy2];
86 for (size_t k = 1, j = 2; k < kFftLengthBy2; ++k) {
87 (*v)[j++] = re[k];
88 (*v)[j++] = im[k];
89 }
90 }
91
92 std::array<float, kFftLengthBy2Plus1> re;
93 std::array<float, kFftLengthBy2Plus1> im;
94};
95
96} // namespace webrtc
97
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020098#endif // MODULES_AUDIO_PROCESSING_AEC3_FFT_DATA_H_