15b4baba28
- minimize RAM usage of all components - use both IRAM and DRAM in player component so we can buffer up to 1s on modules without SPI RAM - support fragemented pcm chunks so we can use all available RAM if there isn't a big enough block available but still enough HEAP - reinclude all components from jorgen's master branch - add custom i2s driver to get a precise timing of initial sync - change wrong usage of esp_timer for latency measurement of snapcast protocol - add player component
102 lines
3.1 KiB
C
102 lines
3.1 KiB
C
// Copyright 2018-2019 Espressif Systems (Shanghai) PTE LTD
|
|
//
|
|
// Licensed under the Apache License, Version 2.0 (the "License");
|
|
// you may not use this file except in compliance with the License.
|
|
// You may obtain a copy of the License at
|
|
//
|
|
// http://www.apache.org/licenses/LICENSE-2.0
|
|
//
|
|
// Unless required by applicable law or agreed to in writing, software
|
|
// distributed under the License is distributed on an "AS IS" BASIS,
|
|
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
// See the License for the specific language governing permissions and
|
|
// limitations under the License.
|
|
|
|
#include <string.h>
|
|
#include "unity.h"
|
|
#include "dsp_platform.h"
|
|
#include "esp_log.h"
|
|
|
|
#include "dsps_tone_gen.h"
|
|
#include "dsps_d_gen.h"
|
|
#include "dsps_biquad_gen.h"
|
|
#include "dsps_biquad.h"
|
|
|
|
static const char *TAG = "dsps_biquad_f32_ae32";
|
|
const int bq_len = 1024;
|
|
TEST_CASE("dsps_biquad_f32_ae32 functionality", "[dsps]")
|
|
{
|
|
float* x = calloc(bq_len,sizeof(float));
|
|
float* y = calloc(bq_len,sizeof(float));
|
|
float* z = calloc(bq_len,sizeof(float));
|
|
|
|
// In the test we generate filter with cutt off frequency 0.1
|
|
// and then filtering 0.1 and 0.3 frequencis.
|
|
// Result must be better then 24 dB
|
|
int len = bq_len;
|
|
|
|
dsps_d_gen_f32(x, len, 0);
|
|
float coeffs[5];
|
|
float w1[2] = {0};
|
|
float w2[2] = {0};
|
|
dsps_biquad_gen_lpf_f32(coeffs, 0.1, 1);
|
|
dsps_biquad_f32_ae32(x, y, len, coeffs, w1);
|
|
dsps_biquad_f32_ansi(x, z, len, coeffs, w2);
|
|
|
|
for (int i = 0 ; i < 32 ; i++) {
|
|
ESP_LOGD(TAG, "[%i]calc = %f, expected=%f", i, y[i], z[i]);
|
|
if (y[i] != z[i]) {
|
|
TEST_ASSERT_EQUAL( y[i], z[i]);
|
|
}
|
|
}
|
|
free(x);
|
|
free(y);
|
|
free(z);
|
|
}
|
|
|
|
TEST_CASE("dsps_biquad_f32_ae32 benchmark", "[dsps]")
|
|
{
|
|
float* x = calloc(bq_len,sizeof(float));
|
|
float* y = calloc(bq_len,sizeof(float));
|
|
float* z = calloc(bq_len,sizeof(float));
|
|
|
|
float w1[2] = {0};
|
|
int len = bq_len;
|
|
int repeat_count = 1024;
|
|
dsps_d_gen_f32(x, len, 0);
|
|
float coeffs[5];
|
|
dsps_biquad_gen_lpf_f32(coeffs, 0.1, 1);
|
|
|
|
|
|
unsigned int start_b = xthal_get_ccount();
|
|
for (int i = 0 ; i < repeat_count ; i++) {
|
|
dsps_biquad_f32_ae32(x, y, len, coeffs, w1);
|
|
}
|
|
unsigned int end_b = xthal_get_ccount();
|
|
|
|
float total_b = end_b - start_b;
|
|
float cycles = total_b / (len * repeat_count);
|
|
|
|
start_b = xthal_get_ccount();
|
|
for (int i = 0 ; i < repeat_count ; i++) {
|
|
dsps_biquad_f32_ansi(x, y, len, coeffs, w1);
|
|
}
|
|
end_b = xthal_get_ccount();
|
|
float total_b_ansi = end_b - start_b;
|
|
float cycles_ansi = total_b_ansi / (len * repeat_count);
|
|
|
|
ESP_LOGI(TAG, "dsps_biquad_f32_ae32 - %f per sample\n", cycles);
|
|
ESP_LOGI(TAG, "dsps_biquad_f32_ansi - %f per sample\n", cycles_ansi);
|
|
// float min_exec = 10;
|
|
// float max_exec = 20;
|
|
// if (cycles >= max_exec) {
|
|
// TEST_ASSERT_MESSAGE (false, "Exec time takes more than expected!");
|
|
// }
|
|
// if (cycles < min_exec) {
|
|
// TEST_ASSERT_MESSAGE (false, "Exec time takes less then expected!");
|
|
// }
|
|
free(x);
|
|
free(y);
|
|
free(z);
|
|
|
|
} |