blob: 4881fb7f8b824945c1a2723db43d1ba151e1b77a [file] [log] [blame]
andrew@webrtc.org325cff02014-10-01 17:42:18 +00001/*
2 * Copyright (c) 2014 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 COMMON_AUDIO_REAL_FOURIER_H_
12#define COMMON_AUDIO_REAL_FOURIER_H_
andrew@webrtc.org325cff02014-10-01 17:42:18 +000013
Yves Gerey988cc082018-10-23 12:03:01 +020014#include <stddef.h>
Jonas Olssona4d87372019-07-05 19:08:33 +020015
andrew@webrtc.org325cff02014-10-01 17:42:18 +000016#include <complex>
kwibergbfefb032016-05-01 14:53:46 -070017#include <memory>
andrew@webrtc.org325cff02014-10-01 17:42:18 +000018
Karl Wiberg29e7bee2018-03-22 14:11:52 +010019#include "rtc_base/memory/aligned_malloc.h"
andrew@webrtc.org325cff02014-10-01 17:42:18 +000020
21// Uniform interface class for the real DFT and its inverse, for power-of-2
22// input lengths. Also contains helper functions for buffer allocation, taking
23// care of any memory alignment requirements the underlying library might have.
24
25namespace webrtc {
26
27class RealFourier {
28 public:
29 // Shorthand typenames for the scopers used by the buffer allocation helpers.
kwibergbfefb032016-05-01 14:53:46 -070030 typedef std::unique_ptr<float[], AlignedFreeDeleter> fft_real_scoper;
31 typedef std::unique_ptr<std::complex<float>[], AlignedFreeDeleter>
kwiberg@webrtc.org00b8f6b2015-02-26 14:34:55 +000032 fft_cplx_scoper;
andrew@webrtc.org325cff02014-10-01 17:42:18 +000033
andrew@webrtc.org325cff02014-10-01 17:42:18 +000034 // The alignment required for all input and output buffers, in bytes.
pkasting25702cb2016-01-08 13:50:27 -080035 static const size_t kFftBufferAlignment;
andrew@webrtc.org325cff02014-10-01 17:42:18 +000036
37 // Construct a wrapper instance for the given input order, which must be
38 // between 1 and kMaxFftOrder, inclusively.
kwibergbfefb032016-05-01 14:53:46 -070039 static std::unique_ptr<RealFourier> Create(int fft_order);
oprypin67fdb802017-03-09 06:25:06 -080040 virtual ~RealFourier() {}
andrew@webrtc.org325cff02014-10-01 17:42:18 +000041
andrew@webrtc.org04c50982015-03-19 20:06:29 +000042 // Helper to compute the smallest FFT order (a power of 2) which will contain
43 // the given input length.
Peter Kastingdce40cf2015-08-24 14:52:23 -070044 static int FftOrder(size_t length);
andrew@webrtc.org325cff02014-10-01 17:42:18 +000045
andrew@webrtc.org04c50982015-03-19 20:06:29 +000046 // Helper to compute the input length from the FFT order.
Peter Kastingdce40cf2015-08-24 14:52:23 -070047 static size_t FftLength(int order);
andrew@webrtc.org04c50982015-03-19 20:06:29 +000048
49 // Helper to compute the exact length, in complex floats, of the transform
50 // output (i.e. |2^order / 2 + 1|).
Peter Kastingdce40cf2015-08-24 14:52:23 -070051 static size_t ComplexLength(int order);
andrew@webrtc.org325cff02014-10-01 17:42:18 +000052
53 // Buffer allocation helpers. The buffers are large enough to hold |count|
54 // floats/complexes and suitably aligned for use by the implementation.
55 // The returned scopers are set up with proper deleters; the caller owns
56 // the allocated memory.
57 static fft_real_scoper AllocRealBuffer(int count);
58 static fft_cplx_scoper AllocCplxBuffer(int count);
59
60 // Main forward transform interface. The output array need only be big
61 // enough for |2^order / 2 + 1| elements - the conjugate pairs are not
62 // returned. Input and output must be properly aligned (e.g. through
63 // AllocRealBuffer and AllocCplxBuffer) and input length must be
64 // |2^order| (same as given at construction time).
andrew@webrtc.org04c50982015-03-19 20:06:29 +000065 virtual void Forward(const float* src, std::complex<float>* dest) const = 0;
andrew@webrtc.org325cff02014-10-01 17:42:18 +000066
67 // Inverse transform. Same input format as output above, conjugate pairs
68 // not needed.
andrew@webrtc.org04c50982015-03-19 20:06:29 +000069 virtual void Inverse(const std::complex<float>* src, float* dest) const = 0;
andrew@webrtc.org325cff02014-10-01 17:42:18 +000070
andrew@webrtc.org04c50982015-03-19 20:06:29 +000071 virtual int order() const = 0;
andrew@webrtc.org325cff02014-10-01 17:42:18 +000072};
73
74} // namespace webrtc
75
Mirko Bonadei92ea95e2017-09-15 06:47:31 +020076#endif // COMMON_AUDIO_REAL_FOURIER_H_