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 / CQBase.h

History | View | Annotate | Download (4.67 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 CQBASE_H
33
#define CQBASE_H
34

    
35
#include <vector>
36
#include <complex>
37

    
38
/**
39
 * Interface class for Constant-Q implementations, containing common
40
 * type declarations and means to query configuration parameters.
41
 */
42
class CQBase
43
{
44
public:
45
    /// A single complex-valued sample.
46
    typedef std::complex<double> Complex;
47

    
48
    /// A series of real-valued samples ordered in time.
49
    typedef std::vector<double> RealSequence;
50

    
51
    /// A series of real-valued samples ordered by bin (frequency or similar).
52
    typedef std::vector<double> RealColumn;
53

    
54
    /// A series of complex-valued samples ordered in time.
55
    typedef std::vector<Complex> ComplexSequence;
56

    
57
    /// A series of complex-valued samples ordered by bin (frequency or similar).
58
    typedef std::vector<Complex> ComplexColumn;
59

    
60
    /// A matrix of real-valued samples, indexed by time then bin number.
61
    typedef std::vector<RealColumn> RealBlock;
62

    
63
    /// A matrix of complex-valued samples, indexed by time then bin number.
64
    typedef std::vector<ComplexColumn> ComplexBlock;
65

    
66
    /**
67
     * Return true if the Constant-Q implementation was successfully
68
     * constructed, with a valid set of initialisation parameters.
69
     */
70
    virtual bool isValid() const = 0;
71
    
72
    /**
73
     * Return the sample rate used when constructing the specific
74
     * Constant-Q implementation.
75
     */
76
    virtual double getSampleRate() const = 0;
77

    
78
    /**
79
     * Return the number of bins per octave specified when
80
     * constructing the Constant-Q implementation.
81
     */
82
    virtual int getBinsPerOctave() const = 0;
83

    
84
    /**
85
     * Return the number of octaves spanned by the Constant-Q
86
     * transform.
87
     */
88
    virtual int getOctaves() const = 0; 
89

    
90
    /**
91
     * Return the total number of bins in each Constant-Q column
92
     * (i.e. bins-per-octave times number of octaves).
93
     */
94
    virtual int getTotalBins() const = 0;
95

    
96
    /**
97
     * Return the spacing, in samples at the sample rate returned from
98
     * getSampleRate(), between one column and the next.
99
     */
100
    virtual int getColumnHop() const = 0;
101

    
102
    /**
103
     * Return the latency of Constant-Q calculation, in samples at the
104
     * sample rate returned from getSampleRate().
105
     */
106
    virtual int getLatency() const = 0;
107

    
108
    /**
109
     * Return the maximum frequency of the Constant-Q output, i.e. the
110
     * frequency of the highest bin in the output. This will normally
111
     * be the same as the maximum frequency passed to the constructor
112
     * of the specific Constant-Q implementation.
113
     */
114
    virtual double getMaxFrequency() const = 0;
115

    
116
    /**
117
     * Return the minimum frequency of the Constant-Q output, i.e. the
118
     * frequency of the lowest bin in the output. This is derived from
119
     * the maximum frequency and octave count, and is not necessarily
120
     * the same as any minimum frequency requested when constructing
121
     * the Constant-Q implementation.
122
     */
123
    virtual double getMinFrequency() const = 0;
124

    
125
    /**
126
     * Return the frequency of a given bin in the Constant-Q
127
     * output. This actually maps a continuous "bin scale" value to 
128
     * frequency: the bin parameter does not have to be an integer.
129
     */
130
    virtual double getBinFrequency(double bin) const = 0;
131
};
132

    
133
#endif