annotate dsp/rateconversion/Decimator.h @ 499:af5b7ef02aa7

Style fixes: avoid unsigned, fix formatting
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 03 Jun 2019 14:20:39 +0100
parents 701233f8ed41
children
rev   line source
c@225 1 /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*- vi:set ts=8 sts=4 sw=4: */
c@225 2 /*
c@225 3 QM DSP Library
c@225 4
c@225 5 Centre for Digital Music, Queen Mary, University of London.
c@309 6 This file 2005-2006 Christian Landone.
c@309 7
c@309 8 This program is free software; you can redistribute it and/or
c@309 9 modify it under the terms of the GNU General Public License as
c@309 10 published by the Free Software Foundation; either version 2 of the
c@309 11 License, or (at your option) any later version. See the file
c@309 12 COPYING included with this distribution for more information.
c@225 13 */
c@225 14
cannam@489 15 #ifndef QM_DSP_DECIMATOR_H
cannam@489 16 #define QM_DSP_DECIMATOR_H
c@225 17
c@375 18 /**
c@375 19 * Decimator carries out a fast downsample by a power-of-two
c@375 20 * factor. Only a limited number of factors are supported, from two to
c@375 21 * whatever getHighestSupportedFactor() returns. This is much faster
c@375 22 * than Resampler but has a worse signal-noise ratio.
c@375 23 */
c@225 24 class Decimator
c@225 25 {
c@225 26 public:
c@279 27 /**
c@279 28 * Construct a Decimator to operate on input blocks of length
c@279 29 * inLength, with decimation factor decFactor. inLength should be
c@279 30 * a multiple of decFactor. Output blocks will be of length
c@279 31 * inLength / decFactor.
c@279 32 *
c@279 33 * decFactor must be a power of two. The highest supported factor
c@279 34 * is obtained through getHighestSupportedFactor(); for higher
c@279 35 * factors, you will need to chain more than one decimator.
c@279 36 */
cannam@499 37 Decimator(int inLength, int decFactor);
c@225 38 virtual ~Decimator();
c@225 39
c@388 40 /**
c@388 41 * Process inLength samples (as supplied to constructor) from src
c@388 42 * and write inLength / decFactor samples to dst. Note that src
c@388 43 * and dst may be the same or overlap (an intermediate buffer is
c@388 44 * used).
c@388 45 */
c@388 46 void process( const double* src, double* dst );
c@388 47
c@388 48 /**
c@388 49 * Process inLength samples (as supplied to constructor) from src
c@388 50 * and write inLength / decFactor samples to dst. Note that src
c@388 51 * and dst may be the same or overlap (an intermediate buffer is
c@388 52 * used).
c@388 53 */
c@388 54 void process( const float* src, float* dst );
c@388 55
c@247 56 int getFactor() const { return m_decFactor; }
c@247 57 static int getHighestSupportedFactor() { return 8; }
c@247 58
c@388 59 void resetFilter();
c@388 60
c@225 61 private:
c@225 62 void deInitialise();
cannam@499 63 void initialise( int inLength, int decFactor );
cannam@499 64 void doAntiAlias( const double* src, double* dst, int length );
cannam@499 65 void doAntiAlias( const float* src, double* dst, int length );
c@225 66
cannam@499 67 int m_inputLength;
cannam@499 68 int m_outputLength;
cannam@499 69 int m_decFactor;
c@225 70
c@225 71 double Input;
c@225 72 double Output ;
c@225 73
c@225 74 double o1,o2,o3,o4,o5,o6,o7;
c@225 75
c@225 76 double a[ 9 ];
c@225 77 double b[ 9 ];
cannam@483 78
c@225 79 double* decBuffer;
c@225 80 };
c@225 81
c@225 82 #endif //