c@225: /* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
c@225: 
c@225: /*
c@225:     QM DSP library
c@225:     Centre for Digital Music, Queen Mary, University of London.
c@225:     This file Copyright 2006 Chris Cannam.
c@225:     All rights reserved.
c@225: */
c@225: 
c@225: #ifndef _WINDOW_H_
c@225: #define _WINDOW_H_
c@225: 
c@225: #include <cmath>
c@225: #include <iostream>
c@225: #include <map>
c@225: 
c@225: enum WindowType {
c@225:     RectangularWindow,
c@225:     BartlettWindow,
c@225:     HammingWindow,
c@225:     HanningWindow,
c@225:     BlackmanWindow,
c@225:     GaussianWindow,
c@225:     ParzenWindow
c@225: };
c@225: 
c@225: template <typename T>
c@225: class Window
c@225: {
c@225: public:
c@225:     /**
c@225:      * Construct a windower of the given type.
c@225:      */
c@225:     Window(WindowType type, size_t size) : m_type(type), m_size(size) { encache(); }
c@225:     Window(const Window &w) : m_type(w.m_type), m_size(w.m_size) { encache(); }
c@225:     Window &operator=(const Window &w) {
c@225: 	if (&w == this) return *this;
c@225: 	m_type = w.m_type;
c@225: 	m_size = w.m_size;
c@225: 	encache();
c@225: 	return *this;
c@225:     }
c@225:     virtual ~Window() { delete m_cache; }
c@225:     
c@225:     void cut(T *src) const { cut(src, src); }
c@225:     void cut(T *src, T *dst) const {
c@225: 	for (size_t i = 0; i < m_size; ++i) dst[i] = src[i] * m_cache[i];
c@225:     }
c@225: 
c@225:     WindowType getType() const { return m_type; }
c@225:     size_t getSize() const { return m_size; }
c@225: 
c@225: protected:
c@225:     WindowType m_type;
c@225:     size_t m_size;
c@225:     T *m_cache;
c@225:     
c@225:     void encache();
c@225: };
c@225: 
c@225: template <typename T>
c@225: void Window<T>::encache()
c@225: {
c@225:     size_t n = m_size;
c@225:     T *mult = new T[n];
c@225:     size_t i;
c@225:     for (i = 0; i < n; ++i) mult[i] = 1.0;
c@225: 
c@225:     switch (m_type) {
c@225: 		
c@225:     case RectangularWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * 0.5;
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case BartlettWindow:
c@225: 	for (i = 0; i < n/2; ++i) {
c@225: 	    mult[i] = mult[i] * (i / T(n/2));
c@225: 	    mult[i + n/2] = mult[i + n/2] * (1.0 - (i / T(n/2)));
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case HammingWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * (0.54 - 0.46 * cos(2 * M_PI * i / n));
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case HanningWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * (0.50 - 0.50 * cos(2 * M_PI * i / n));
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case BlackmanWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * (0.42 - 0.50 * cos(2 * M_PI * i / n)
c@225: 				 + 0.08 * cos(4 * M_PI * i / n));
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case GaussianWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * exp((-1.0 / (n*n)) * ((T(2*i) - n) *
c@225: 						      (T(2*i) - n)));
c@225: 	}
c@225: 	break;
c@225: 	    
c@225:     case ParzenWindow:
c@225: 	for (i = 0; i < n; ++i) {
c@225: 	    mult[i] = mult[i] * (1.0 - fabs((T(2*i) - n) / T(n + 1)));
c@225: 	}
c@225: 	break;
c@225:     }
c@225: 	
c@225:     m_cache = mult;
c@225: }
c@225: 
c@225: #endif