annotate constant-q-cpp/src/dsp/Resampler.h @ 372:af71cbdab621 tip

Update bqvec code
author Chris Cannam
date Tue, 19 Nov 2019 10:13:32 +0000
parents 20e0443aa31c
children
rev   line source
Chris@366 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
Chris@366 2 /*
Chris@366 3 Constant-Q library
Chris@366 4 Copyright (c) 2013-2014 Queen Mary, University of London
Chris@366 5
Chris@366 6 Permission is hereby granted, free of charge, to any person
Chris@366 7 obtaining a copy of this software and associated documentation
Chris@366 8 files (the "Software"), to deal in the Software without
Chris@366 9 restriction, including without limitation the rights to use, copy,
Chris@366 10 modify, merge, publish, distribute, sublicense, and/or sell copies
Chris@366 11 of the Software, and to permit persons to whom the Software is
Chris@366 12 furnished to do so, subject to the following conditions:
Chris@366 13
Chris@366 14 The above copyright notice and this permission notice shall be
Chris@366 15 included in all copies or substantial portions of the Software.
Chris@366 16
Chris@366 17 THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
Chris@366 18 EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
Chris@366 19 MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
Chris@366 20 NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
Chris@366 21 CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
Chris@366 22 CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
Chris@366 23 WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
Chris@366 24
Chris@366 25 Except as contained in this notice, the names of the Centre for
Chris@366 26 Digital Music; Queen Mary, University of London; and Chris Cannam
Chris@366 27 shall not be used in advertising or otherwise to promote the sale,
Chris@366 28 use or other dealings in this Software without prior written
Chris@366 29 authorization.
Chris@366 30 */
Chris@366 31
Chris@366 32 #ifndef RESAMPLER_H
Chris@366 33 #define RESAMPLER_H
Chris@366 34
Chris@366 35 #include <vector>
Chris@366 36
Chris@366 37 /**
Chris@366 38 * Resampler resamples a stream from one integer sample rate to
Chris@366 39 * another (arbitrary) rate, using a kaiser-windowed sinc filter. The
Chris@366 40 * results and performance are pretty similar to libraries such as
Chris@366 41 * libsamplerate, though this implementation does not support
Chris@366 42 * time-varying ratios (the ratio is fixed on construction).
Chris@366 43 *
Chris@366 44 * See also Decimator, which is faster and rougher but supports only
Chris@366 45 * power-of-two downsampling factors.
Chris@366 46 */
Chris@366 47 class Resampler
Chris@366 48 {
Chris@366 49 public:
Chris@366 50 /**
Chris@366 51 * Construct a Resampler to resample from sourceRate to
Chris@366 52 * targetRate.
Chris@366 53 */
Chris@366 54 Resampler(int sourceRate, int targetRate);
Chris@366 55
Chris@366 56 /**
Chris@366 57 * Construct a Resampler to resample from sourceRate to
Chris@366 58 * targetRate, using the given filter parameters.
Chris@366 59 */
Chris@366 60 Resampler(int sourceRate, int targetRate,
Chris@366 61 double snr, double bandwidth);
Chris@366 62
Chris@366 63 virtual ~Resampler();
Chris@366 64
Chris@366 65 /**
Chris@366 66 * Read n input samples from src and write resampled data to
Chris@366 67 * dst. The return value is the number of samples written, which
Chris@366 68 * will be no more than ceil((n * targetRate) / sourceRate). The
Chris@366 69 * caller must ensure the dst buffer has enough space for the
Chris@366 70 * samples returned.
Chris@366 71 */
Chris@366 72 int process(const double *src, double *dst, int n);
Chris@366 73
Chris@366 74 /**
Chris@366 75 * Read n input samples from src and return resampled data by
Chris@366 76 * value.
Chris@366 77 */
Chris@366 78 std::vector<double> process(const double *src, int n);
Chris@366 79
Chris@366 80 /**
Chris@366 81 * Return the number of samples of latency at the output due by
Chris@366 82 * the filter. (That is, the output will be delayed by this number
Chris@366 83 * of samples relative to the input.)
Chris@366 84 */
Chris@366 85 int getLatency() const { return m_latency; }
Chris@366 86
Chris@366 87 /**
Chris@366 88 * Carry out a one-off resample of a single block of n
Chris@366 89 * samples. The output is latency-compensated.
Chris@366 90 */
Chris@366 91 static std::vector<double> resample
Chris@366 92 (int sourceRate, int targetRate, const double *data, int n);
Chris@366 93
Chris@366 94 private:
Chris@366 95 int m_sourceRate;
Chris@366 96 int m_targetRate;
Chris@366 97 int m_gcd;
Chris@366 98 int m_filterLength;
Chris@366 99 int m_latency;
Chris@366 100 double m_peakToPole;
Chris@366 101
Chris@366 102 struct Phase {
Chris@366 103 int nextPhase;
Chris@366 104 std::vector<double> filter;
Chris@366 105 int drop;
Chris@366 106 };
Chris@366 107
Chris@366 108 Phase *m_phaseData;
Chris@366 109 int m_phase;
Chris@366 110 std::vector<double> m_buffer;
Chris@366 111 int m_bufferOrigin;
Chris@366 112
Chris@366 113 void initialise(double, double);
Chris@366 114 double reconstructOne();
Chris@366 115 };
Chris@366 116
Chris@366 117 #endif
Chris@366 118