annotate src/libsamplerate-0.1.9/tests/calc_snr.c @ 147:45360b968bf4

Cap'n Proto v0.6 + build for OSX
author Chris Cannam <cannam@all-day-breakfast.com>
date Mon, 22 May 2017 10:01:37 +0100
parents 4a7071416412
children
rev   line source
cannam@126 1 /*
cannam@126 2 ** Copyright (c) 2002-2016, Erik de Castro Lopo <erikd@mega-nerd.com>
cannam@126 3 ** All rights reserved.
cannam@126 4 **
cannam@126 5 ** This code is released under 2-clause BSD license. Please see the
cannam@126 6 ** file at : https://github.com/erikd/libsamplerate/blob/master/COPYING
cannam@126 7 */
cannam@126 8
cannam@126 9 #include "config.h"
cannam@126 10
cannam@126 11 #include "util.h"
cannam@126 12
cannam@126 13 #if (HAVE_FFTW3 == 1)
cannam@126 14
cannam@126 15 #include <stdio.h>
cannam@126 16 #include <stdlib.h>
cannam@126 17 #include <string.h>
cannam@126 18 #include <math.h>
cannam@126 19
cannam@126 20 #include <fftw3.h>
cannam@126 21
cannam@126 22 #define MAX_SPEC_LEN (1<<18)
cannam@126 23 #define MAX_PEAKS 10
cannam@126 24
cannam@126 25 static void log_mag_spectrum (double *input, int len, double *magnitude) ;
cannam@126 26 static void smooth_mag_spectrum (double *magnitude, int len) ;
cannam@126 27 static double find_snr (const double *magnitude, int len, int expected_peaks) ;
cannam@126 28
cannam@126 29 typedef struct
cannam@126 30 { double peak ;
cannam@126 31 int index ;
cannam@126 32 } PEAK_DATA ;
cannam@126 33
cannam@126 34 double
cannam@126 35 calculate_snr (float *data, int len, int expected_peaks)
cannam@126 36 { static double magnitude [MAX_SPEC_LEN] ;
cannam@126 37 static double datacopy [MAX_SPEC_LEN] ;
cannam@126 38
cannam@126 39 double snr = 200.0 ;
cannam@126 40 int k ;
cannam@126 41
cannam@126 42 if (len > MAX_SPEC_LEN)
cannam@126 43 { printf ("%s : line %d : data length too large.\n", __FILE__, __LINE__) ;
cannam@126 44 exit (1) ;
cannam@126 45 } ;
cannam@126 46
cannam@126 47 for (k = 0 ; k < len ; k++)
cannam@126 48 datacopy [k] = data [k] ;
cannam@126 49
cannam@126 50 /* Pad the data just a little to speed up the FFT. */
cannam@126 51 while ((len & 0x1F) && len < MAX_SPEC_LEN)
cannam@126 52 { datacopy [len] = 0.0 ;
cannam@126 53 len ++ ;
cannam@126 54 } ;
cannam@126 55
cannam@126 56 log_mag_spectrum (datacopy, len, magnitude) ;
cannam@126 57 smooth_mag_spectrum (magnitude, len / 2) ;
cannam@126 58
cannam@126 59 snr = find_snr (magnitude, len, expected_peaks) ;
cannam@126 60
cannam@126 61 return snr ;
cannam@126 62 } /* calculate_snr */
cannam@126 63
cannam@126 64 /*==============================================================================
cannam@126 65 ** There is a slight problem with trying to measure SNR with the method used
cannam@126 66 ** here; the side lobes of the windowed FFT can look like a noise/aliasing peak.
cannam@126 67 ** The solution is to smooth the magnitude spectrum by wiping out troughs
cannam@126 68 ** between adjacent peaks as done here.
cannam@126 69 ** This removes side lobe peaks without affecting noise/aliasing peaks.
cannam@126 70 */
cannam@126 71
cannam@126 72 static void linear_smooth (double *mag, PEAK_DATA *larger, PEAK_DATA *smaller) ;
cannam@126 73
cannam@126 74 static void
cannam@126 75 smooth_mag_spectrum (double *mag, int len)
cannam@126 76 { PEAK_DATA peaks [2] ;
cannam@126 77
cannam@126 78 int k ;
cannam@126 79
cannam@126 80 memset (peaks, 0, sizeof (peaks)) ;
cannam@126 81
cannam@126 82 /* Find first peak. */
cannam@126 83 for (k = 1 ; k < len - 1 ; k++)
cannam@126 84 { if (mag [k - 1] < mag [k] && mag [k] >= mag [k + 1])
cannam@126 85 { peaks [0].peak = mag [k] ;
cannam@126 86 peaks [0].index = k ;
cannam@126 87 break ;
cannam@126 88 } ;
cannam@126 89 } ;
cannam@126 90
cannam@126 91 /* Find subsequent peaks ans smooth between peaks. */
cannam@126 92 for (k = peaks [0].index + 1 ; k < len - 1 ; k++)
cannam@126 93 { if (mag [k - 1] < mag [k] && mag [k] >= mag [k + 1])
cannam@126 94 { peaks [1].peak = mag [k] ;
cannam@126 95 peaks [1].index = k ;
cannam@126 96
cannam@126 97 if (peaks [1].peak > peaks [0].peak)
cannam@126 98 linear_smooth (mag, &peaks [1], &peaks [0]) ;
cannam@126 99 else
cannam@126 100 linear_smooth (mag, &peaks [0], &peaks [1]) ;
cannam@126 101 peaks [0] = peaks [1] ;
cannam@126 102 } ;
cannam@126 103 } ;
cannam@126 104
cannam@126 105 } /* smooth_mag_spectrum */
cannam@126 106
cannam@126 107 static void
cannam@126 108 linear_smooth (double *mag, PEAK_DATA *larger, PEAK_DATA *smaller)
cannam@126 109 { int k ;
cannam@126 110
cannam@126 111 if (smaller->index < larger->index)
cannam@126 112 { for (k = smaller->index + 1 ; k < larger->index ; k++)
cannam@126 113 mag [k] = (mag [k] < mag [k - 1]) ? 0.999 * mag [k - 1] : mag [k] ;
cannam@126 114 }
cannam@126 115 else
cannam@126 116 { for (k = smaller->index - 1 ; k >= larger->index ; k--)
cannam@126 117 mag [k] = (mag [k] < mag [k + 1]) ? 0.999 * mag [k + 1] : mag [k] ;
cannam@126 118 } ;
cannam@126 119
cannam@126 120 } /* linear_smooth */
cannam@126 121
cannam@126 122 /*==============================================================================
cannam@126 123 */
cannam@126 124
cannam@126 125 static int
cannam@126 126 peak_compare (const void *vp1, const void *vp2)
cannam@126 127 { const PEAK_DATA *peak1, *peak2 ;
cannam@126 128
cannam@126 129 peak1 = (const PEAK_DATA*) vp1 ;
cannam@126 130 peak2 = (const PEAK_DATA*) vp2 ;
cannam@126 131
cannam@126 132 return (peak1->peak < peak2->peak) ? 1 : -1 ;
cannam@126 133 } /* peak_compare */
cannam@126 134
cannam@126 135 static double
cannam@126 136 find_snr (const double *magnitude, int len, int expected_peaks)
cannam@126 137 { PEAK_DATA peaks [MAX_PEAKS] ;
cannam@126 138
cannam@126 139 int k, peak_count = 0 ;
cannam@126 140 double snr ;
cannam@126 141
cannam@126 142 memset (peaks, 0, sizeof (peaks)) ;
cannam@126 143
cannam@126 144 /* Find the MAX_PEAKS largest peaks. */
cannam@126 145 for (k = 1 ; k < len - 1 ; k++)
cannam@126 146 { if (magnitude [k - 1] < magnitude [k] && magnitude [k] >= magnitude [k + 1])
cannam@126 147 { if (peak_count < MAX_PEAKS)
cannam@126 148 { peaks [peak_count].peak = magnitude [k] ;
cannam@126 149 peaks [peak_count].index = k ;
cannam@126 150 peak_count ++ ;
cannam@126 151 qsort (peaks, peak_count, sizeof (PEAK_DATA), peak_compare) ;
cannam@126 152 }
cannam@126 153 else if (magnitude [k] > peaks [MAX_PEAKS - 1].peak)
cannam@126 154 { peaks [MAX_PEAKS - 1].peak = magnitude [k] ;
cannam@126 155 peaks [MAX_PEAKS - 1].index = k ;
cannam@126 156 qsort (peaks, MAX_PEAKS, sizeof (PEAK_DATA), peak_compare) ;
cannam@126 157 } ;
cannam@126 158 } ;
cannam@126 159 } ;
cannam@126 160
cannam@126 161 if (peak_count < expected_peaks)
cannam@126 162 { printf ("\n%s : line %d : bad peak_count (%d), expected %d.\n\n", __FILE__, __LINE__, peak_count, expected_peaks) ;
cannam@126 163 return -1.0 ;
cannam@126 164 } ;
cannam@126 165
cannam@126 166 /* Sort the peaks. */
cannam@126 167 qsort (peaks, peak_count, sizeof (PEAK_DATA), peak_compare) ;
cannam@126 168
cannam@126 169 snr = peaks [0].peak ;
cannam@126 170 for (k = 1 ; k < peak_count ; k++)
cannam@126 171 if (fabs (snr - peaks [k].peak) > 10.0)
cannam@126 172 return fabs (peaks [k].peak) ;
cannam@126 173
cannam@126 174 return snr ;
cannam@126 175 } /* find_snr */
cannam@126 176
cannam@126 177 static void
cannam@126 178 log_mag_spectrum (double *input, int len, double *magnitude)
cannam@126 179 { fftw_plan plan = NULL ;
cannam@126 180
cannam@126 181 double maxval ;
cannam@126 182 int k ;
cannam@126 183
cannam@126 184 if (input == NULL || magnitude == NULL)
cannam@126 185 return ;
cannam@126 186
cannam@126 187 plan = fftw_plan_r2r_1d (len, input, magnitude, FFTW_R2HC, FFTW_ESTIMATE | FFTW_PRESERVE_INPUT) ;
cannam@126 188 if (plan == NULL)
cannam@126 189 { printf ("%s : line %d : create plan failed.\n", __FILE__, __LINE__) ;
cannam@126 190 exit (1) ;
cannam@126 191 } ;
cannam@126 192
cannam@126 193 fftw_execute (plan) ;
cannam@126 194
cannam@126 195 fftw_destroy_plan (plan) ;
cannam@126 196
cannam@126 197 maxval = 0.0 ;
cannam@126 198 for (k = 1 ; k < len / 2 ; k++)
cannam@126 199 { /*
cannam@126 200 ** From : http://www.fftw.org/doc/Real_002dto_002dReal-Transform-Kinds.html#Real_002dto_002dReal-Transform-Kinds
cannam@126 201 **
cannam@126 202 ** FFTW_R2HC computes a real-input DFT with output in “halfcomplex” format, i.e. real and imaginary parts
cannam@126 203 ** for a transform of size n stored as:
cannam@126 204 **
cannam@126 205 ** r0, r1, r2, ..., rn/2, i(n+1)/2-1, ..., i2, i1
cannam@126 206 */
cannam@126 207 double re = magnitude [k] ;
cannam@126 208 double im = magnitude [len - k] ;
cannam@126 209 magnitude [k] = sqrt (re * re + im * im) ;
cannam@126 210 maxval = (maxval < magnitude [k]) ? magnitude [k] : maxval ;
cannam@126 211 } ;
cannam@126 212
cannam@126 213 memset (magnitude + len / 2, 0, len / 2 * sizeof (magnitude [0])) ;
cannam@126 214
cannam@126 215 /* Don't care about DC component. Make it zero. */
cannam@126 216 magnitude [0] = 0.0 ;
cannam@126 217
cannam@126 218 /* log magnitude. */
cannam@126 219 for (k = 0 ; k < len ; k++)
cannam@126 220 { magnitude [k] = magnitude [k] / maxval ;
cannam@126 221 magnitude [k] = (magnitude [k] < 1e-15) ? -200.0 : 20.0 * log10 (magnitude [k]) ;
cannam@126 222 } ;
cannam@126 223
cannam@126 224 return ;
cannam@126 225 } /* log_mag_spectrum */
cannam@126 226
cannam@126 227 #else /* ! (HAVE_LIBFFTW && HAVE_LIBRFFTW) */
cannam@126 228
cannam@126 229 double
cannam@126 230 calculate_snr (float *data, int len, int expected_peaks)
cannam@126 231 { double snr = 200.0 ;
cannam@126 232
cannam@126 233 data = data ;
cannam@126 234 len = len ;
cannam@126 235 expected_peaks = expected_peaks ;
cannam@126 236
cannam@126 237 return snr ;
cannam@126 238 } /* calculate_snr */
cannam@126 239
cannam@126 240 #endif
cannam@126 241