To check out this repository please hg clone the following URL, or open the URL using EasyMercurial or your preferred Mercurial client.

The primary repository for this project is hosted at https://github.com/cannam/constant-q-cpp/ .
This repository is a read-only copy which is updated automatically every hour.

Statistics Download as Zip
| Branch: | Revision:

root / cq / ConstantQ.h @ 194:705be3bb9472

History | View | Annotate | Download (4.88 KB)

1
/* -*- c-basic-offset: 4 indent-tabs-mode: nil -*-  vi:set ts=8 sts=4 sw=4: */
2
/*
3
    Constant-Q library
4
    Copyright (c) 2013-2014 Queen Mary, University of London
5

6
    Permission is hereby granted, free of charge, to any person
7
    obtaining a copy of this software and associated documentation
8
    files (the "Software"), to deal in the Software without
9
    restriction, including without limitation the rights to use, copy,
10
    modify, merge, publish, distribute, sublicense, and/or sell copies
11
    of the Software, and to permit persons to whom the Software is
12
    furnished to do so, subject to the following conditions:
13

14
    The above copyright notice and this permission notice shall be
15
    included in all copies or substantial portions of the Software.
16

17
    THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
18
    EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF
19
    MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
20
    NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY
21
    CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
22
    CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN CONNECTION
23
    WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
24

25
    Except as contained in this notice, the names of the Centre for
26
    Digital Music; Queen Mary, University of London; and Chris Cannam
27
    shall not be used in advertising or otherwise to promote the sale,
28
    use or other dealings in this Software without prior written
29
    authorization.
30
*/
31

    
32
#ifndef CONSTANTQ_H
33
#define CONSTANTQ_H
34

    
35
#include "CQBase.h"
36
#include "CQParameters.h"
37
#include "CQKernel.h"
38

    
39
class Resampler;
40
class FFTReal;
41

    
42
/**
43
 * Calculate a complex sparse constant-Q representation from
44
 * time-domain input. The input of each \ref process call is a single
45
 * frame of time-domain samples; the output is a series of columns of
46
 * varying height. See \ref process for details.
47
 *
48
 * For a real (magnitude-only) interpolated dense representation, see
49
 * CQSpectrogram.
50
 */
51
class ConstantQ : public CQBase
52
{
53
public:
54
    /**
55
     * Construct a complex Constant-Q transform object using the given
56
     * transform parameters.
57
     */
58
    ConstantQ(CQParameters params);
59
    virtual ~ConstantQ();
60

    
61
    // CQBase methods, see CQBase.h for documentation
62
    virtual bool isValid() const { return m_kernel && m_kernel->isValid(); }
63
    virtual double getSampleRate() const { return m_sampleRate; }
64
    virtual int getBinsPerOctave() const { return m_binsPerOctave; }
65
    virtual int getOctaves() const { return m_octaves; }
66
    virtual int getTotalBins() const { return m_octaves * m_binsPerOctave; }
67
    virtual int getColumnHop() const { return m_p.fftHop / m_p.atomsPerFrame; }
68
    virtual int getLatency() const { return m_outputLatency; } 
69
    virtual double getMaxFrequency() const { return m_p.maxFrequency; }
70
    virtual double getMinFrequency() const;
71
    virtual double getBinFrequency(double bin) const; // bin may be nonintegral
72

    
73
    /**
74
     * Given a series of time-domain samples, return a series of
75
     * constant-Q columns. Any samples left over (that did not fit
76
     * into a constant-Q processing block) are saved for the next call
77
     * to process or getRemainingBlocks. 
78
     *
79
     * The input is assumed to be a single frame of time-domain sample
80
     * values, such that consecutive calls to \ref process receive
81
     * contiguous frames from the source signal. Each frame may be of
82
     * any length in samples.
83
     *
84
     * Each output column contains a series of constant-Q bin values
85
     * ordered from highest to lowest frequency.
86
     *
87
     * Output columns are of varying height: each will contain at
88
     * least getBinsPerOctave() values, because the highest-frequency
89
     * octave is always present, but a second octave (if requested)
90
     * will appear only in alternate columns, a third octave only in
91
     * every fourth column, and so on.
92
     *
93
     * If you need a format in which all columns are of equal height
94
     * and every bin contains a value, use \ref CQSpectrogram instead
95
     * of ConstantQ.
96
     */
97
    ComplexBlock process(const RealSequence &);
98

    
99
    /**
100
     * Return the remaining constant-Q columns following the end of
101
     * processing. Any buffered input is padded so as to ensure that
102
     * all input provided to process() will have been returned.
103
     */
104
    ComplexBlock getRemainingOutput();
105

    
106
private:
107
    const CQParameters m_inparams;
108
    const double m_sampleRate;
109
    const double m_maxFrequency;
110
    const double m_minFrequency;
111
    const int m_binsPerOctave;
112

    
113
    int m_octaves;
114
    CQKernel *m_kernel;
115
    CQKernel::Properties m_p;
116
    int m_bigBlockSize;
117

    
118
    std::vector<Resampler *> m_decimators;
119
    std::vector<RealSequence> m_buffers;
120

    
121
    int m_outputLatency;
122

    
123
    FFTReal *m_fft;
124

    
125
    void initialise();
126
    ComplexBlock processOctaveBlock(int octave);
127

    
128
    // Not provided
129
    ConstantQ(const ConstantQ &);
130
    ConstantQ &operator=(const ConstantQ &);
131
};
132

    
133
#endif
134