view Spectrogram.cpp @ 11:09fb76606b2b

* Removed many unnecessary heap allocations with objects
author Carl Bussey <c.bussey@se10.qmul.ac.uk>
date Wed, 13 Aug 2014 10:45:46 +0100
parents be59b4a73f49
children d58409ecd720
line wrap: on
line source
//
//  Spectrogram.cpp
//  Tempogram
//
//  Created by Carl Bussey on 07/08/2014.
//  Copyright (c) 2014 Carl Bussey. All rights reserved.
//

#include "Spectrogram.h"
using namespace std;
using Vamp::FFT;

SpectrogramProcessor::SpectrogramProcessor(unsigned int inputLength, unsigned int windowLength, unsigned int fftLength, unsigned int hopSize) :
    m_inputLength(inputLength),
    m_windowLength(windowLength),
    m_fftLength(fftLength),
    m_hopSize(hopSize),
    m_numberOfOutputBins(ceil(fftLength/2) + 1),
    fftInput(NULL),
    fftOutputReal(NULL),
    fftOutputImag(NULL)
{
    initialise();
}

SpectrogramProcessor::~SpectrogramProcessor(){
    cleanup();
}

void SpectrogramProcessor::initialise(){
    fftInput = new double [m_fftLength];
    fftOutputReal = new double [m_fftLength];
    fftOutputImag = new double [m_fftLength];
    
    int numberOfBlocks = ceil(m_inputLength/m_hopSize) + 2*(ceil(m_windowLength/m_hopSize)-1); //The last term corresponds to overlaps at the beginning and end with padded zeros. I.e., if m_hopSize = m_windowLength/2, there'll be 1 overlap at each end. If m_hopSize = m_windowLength/4, there'll be 3 overlaps at each end, etc...
    spectrogramOutput = vector< vector<float> >(m_numberOfOutputBins, vector<float>(numberOfBlocks));
}

void SpectrogramProcessor::cleanup(){
    delete []fftInput;
    delete []fftOutputReal;
    delete []fftOutputImag;
    
    fftInput = fftOutputReal = fftOutputImag = NULL;
}

//process method
vector< vector<float> > SpectrogramProcessor::process(const float * const input, const float * window){
    
    int readPointerBeginIndex = m_hopSize-m_windowLength;
    int writeBlockPointer = 0;
    
    while(readPointerBeginIndex < m_inputLength){
        
        int readPointer = readPointerBeginIndex;
        for (int n = 0; n < m_windowLength; n++){
            if(readPointer < 0 || readPointer >= m_inputLength){
                fftInput[n] = 0.0; //pad with zeros
            }
            else{
                fftInput[n] = input[readPointer] * window[n];
            }
            readPointer++;
        }
        for (int n = m_windowLength; n < m_fftLength; n++){
            fftInput[n] = 0.0;
        }
        
        FFT::forward(m_fftLength, fftInput, NULL, fftOutputReal, fftOutputImag);
        
        //@todo: sample at logarithmic spacing? Leave for host?
        for(int k = 0; k < m_numberOfOutputBins; k++){
            spectrogramOutput[k][writeBlockPointer] = (fftOutputReal[k]*fftOutputReal[k] + fftOutputImag[k]*fftOutputImag[k]); //Magnitude or power?
        }
        
        readPointerBeginIndex += m_hopSize;
        writeBlockPointer++;
    }
    
    return spectrogramOutput;
}