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

Update bqvec code
author Chris Cannam
date Tue, 19 Nov 2019 10:13:32 +0000
parents 5d0a2ebb4d17
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 #include "KaiserWindow.h"
Chris@366 33
Chris@366 34 #include "MathUtilities.h"
Chris@366 35
Chris@366 36 KaiserWindow::Parameters
Chris@366 37 KaiserWindow::parametersForTransitionWidth(double attenuation,
Chris@366 38 double transition)
Chris@366 39 {
Chris@366 40 Parameters p;
Chris@366 41 p.length = 1 + (attenuation > 21.0 ?
Chris@366 42 ceil((attenuation - 7.95) / (2.285 * transition)) :
Chris@366 43 ceil(5.79 / transition));
Chris@366 44 p.beta = (attenuation > 50.0 ?
Chris@366 45 0.1102 * (attenuation - 8.7) :
Chris@366 46 attenuation > 21.0 ?
Chris@366 47 0.5842 * pow(attenuation - 21.0, 0.4) + 0.07886 * (attenuation - 21.0) :
Chris@366 48 0);
Chris@366 49 return p;
Chris@366 50 }
Chris@366 51
Chris@366 52 static double besselTerm(double x, int i)
Chris@366 53 {
Chris@366 54 if (i == 0) {
Chris@366 55 return 1;
Chris@366 56 } else {
Chris@366 57 double f = MathUtilities::factorial(i);
Chris@366 58 return pow(x/2, i*2) / (f*f);
Chris@366 59 }
Chris@366 60 }
Chris@366 61
Chris@366 62 static double bessel0(double x)
Chris@366 63 {
Chris@366 64 double b = 0.0;
Chris@366 65 for (int i = 0; i < 20; ++i) {
Chris@366 66 b += besselTerm(x, i);
Chris@366 67 }
Chris@366 68 return b;
Chris@366 69 }
Chris@366 70
Chris@366 71 void
Chris@366 72 KaiserWindow::init()
Chris@366 73 {
Chris@366 74 double denominator = bessel0(m_beta);
Chris@366 75 bool even = (m_length % 2 == 0);
Chris@366 76 for (int i = 0; i < (even ? m_length/2 : (m_length+1)/2); ++i) {
Chris@366 77 double k = double(2*i) / double(m_length-1) - 1.0;
Chris@366 78 m_window.push_back(bessel0(m_beta * sqrt(1.0 - k*k)) / denominator);
Chris@366 79 }
Chris@366 80 for (int i = 0; i < (even ? m_length/2 : (m_length-1)/2); ++i) {
Chris@366 81 m_window.push_back(m_window[int(m_length/2) - i - 1]);
Chris@366 82 }
Chris@366 83 }