[341e36]: auditory / audspace.m  Maximize  Restore  History

Download this file

58 lines (43 with data), 1.7 kB

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
function [y,bw] = audspace(flow,fhigh,n,varargin)
%AUDSPACE Equidistantly spaced points on auditory scale
% Usage: y=audspace(scale,flow,fhigh,n);
%
% AUDSPACE(flow,fhigh,n,scale) computes a vector of length n containing values
% equistantly scaled on the selected auditory scale between flow and fhigh. All
% frequencies are specified in Hz.
%
% See the help on FREQTOAUD to get a list of the supported values of the
% scale parameter.
%
% [y,bw]=AUDSPACE(...) does the same but outputs the bandwidth between
% each sample measured on the selected scale.
%
% See also: freqtoaud, audspacebw, audfiltbw
% AUTHOR : Peter L. Soendergaard
%% ------ Checking of input parameters ---------
if nargin<3
error('%s: Too few input parameters.',upper(mfilename));
end;
% Default parameters.
if ~isnumeric(flow) || ~isscalar(flow) || flow<0
error('%s: flow must be a non-negative scalar.',upper(mfilename));
end;
if ~isnumeric(fhigh) || ~isscalar(fhigh) || fhigh<0
error('%s: fhigh must be a non-negative scalar.',upper(mfilename));
end;
if ~isnumeric(n) || ~isscalar(n) || n<=0 || fix(n)~=n
error('%s: n must be a positive, integer scalar.',upper(mfilename));
end;
if flow>fhigh
error('%s: flow must be less than or equal to fhigh.',upper(mfilename));
end;
definput.import={'freqtoaud'};
[flags,kv]=ltfatarghelper({},definput,varargin);
%% ------ Computation --------------------------
audlimits = freqtoaud([flow,fhigh],flags.audscale);
y = audtofreq(linspace(audlimits(1),audlimits(2),n),flags.audscale);
bw=(audlimits(2)-audlimits(1))/(n-1);
% Set the endpoints to be exactly what the user specified, instead of the
% calculated values
y(1)=flow;
y(end)=fhigh;

Get latest updates about Open Source Projects, Conferences and News.

Sign up for the SourceForge newsletter:





No, thanks