File size: 9,290 Bytes
b50f2a2 |
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 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 |
//
// Copyright © 2025 Agora
// This file is part of TEN Framework, an open source project.
// Licensed under the Apache License, Version 2.0, with certain conditions.
// Refer to the "LICENSE" file in the root directory for more information.
//
#include "biquad.h"
#include <math.h>
#include <stdlib.h>
#include <string.h>
#include <stdio.h>
#include "biquad_st.h"
#define AUP_BIQUAD_NUM_DUMP_FILES (20)
#define AUP_BIQUAD_DUMP_FILENAMES (200)
// ==========================================================================================
// internal tools
// ==========================================================================================
static int AUP_Biquad_checkStatCfg(const Biquad_StaticCfg* pCfg) {
int secIdx;
if (pCfg == NULL) {
return -1;
}
if (pCfg->maxNSample == 0 ||
pCfg->maxNSample > AGORA_UAP_BIQUAD_MAX_INPUT_LEN) {
return -1;
}
if (pCfg->nsect > AGORA_UAP_BIQUAD_MAX_SECTION) {
return -1;
}
// if external filter coefficients are required, we need to check the
// external filter coeff pointers' validness
if (pCfg->nsect > 0) {
for (secIdx = 0; secIdx < pCfg->nsect; secIdx++) {
if (pCfg->B[secIdx] == NULL || pCfg->A[secIdx] == NULL) {
return -1;
}
}
if (pCfg->G == NULL) {
return -1;
}
}
return 0;
}
static int AUP_Biquad_publishStaticCfg(Biquad_St* stHdl) {
const Biquad_StaticCfg* pStatCfg;
int idx;
if (stHdl == NULL) {
return -1;
}
pStatCfg = (const Biquad_StaticCfg*)(&(stHdl->stCfg));
stHdl->maxNSample = (int)pStatCfg->maxNSample;
// first, give default (all-pass-filter) values to filter coeffs
for (idx = 0; idx < AGORA_UAP_BIQUAD_MAX_SECTION; idx++) {
stHdl->BCoeff[idx][0] = 1.0f;
stHdl->BCoeff[idx][1] = 0;
stHdl->BCoeff[idx][2] = 0;
stHdl->ACoeff[idx][0] = 1.0f;
stHdl->ACoeff[idx][1] = 0;
stHdl->ACoeff[idx][2] = 0;
stHdl->GCoeff[idx] = 1.0f;
}
if (pStatCfg->nsect <= 0) {
stHdl->nsect = _BIQUAD_DC_REMOVAL_NSECT;
for (idx = 0; idx < stHdl->nsect; idx++) {
stHdl->BCoeff[idx][0] = _BIQUAD_DC_REMOVAL_B[idx][0];
stHdl->BCoeff[idx][1] = _BIQUAD_DC_REMOVAL_B[idx][1];
stHdl->BCoeff[idx][2] = _BIQUAD_DC_REMOVAL_B[idx][2];
stHdl->ACoeff[idx][0] = _BIQUAD_DC_REMOVAL_A[idx][0];
stHdl->ACoeff[idx][1] = _BIQUAD_DC_REMOVAL_A[idx][1];
stHdl->ACoeff[idx][2] = _BIQUAD_DC_REMOVAL_A[idx][2];
stHdl->GCoeff[idx] = _BIQUAD_DC_REMOVAL_G[idx];
}
} else {
stHdl->nsect = pStatCfg->nsect;
for (idx = 0; idx < stHdl->nsect; idx++) {
stHdl->BCoeff[idx][0] = pStatCfg->B[idx][0];
stHdl->BCoeff[idx][1] = pStatCfg->B[idx][1];
stHdl->BCoeff[idx][2] = pStatCfg->B[idx][2];
stHdl->ACoeff[idx][0] = pStatCfg->A[idx][0];
stHdl->ACoeff[idx][1] = pStatCfg->A[idx][1];
stHdl->ACoeff[idx][2] = pStatCfg->A[idx][2];
stHdl->GCoeff[idx] = pStatCfg->G[idx];
}
}
return 0;
}
static int AUP_Biquad_resetVariables(Biquad_St* stHdl) {
memset(stHdl->dynamMemPtr, 0, stHdl->dynamMemSize);
memset(stHdl->sectW, 0, sizeof(stHdl->sectW));
return 0;
}
// ==========================================================================================
// public APIS
// ==========================================================================================
int AUP_Biquad_create(void** stPtr) {
Biquad_St* tmpPtr;
if (stPtr == NULL) {
return -1;
}
*stPtr = (void*)malloc(sizeof(Biquad_St));
if (*stPtr == NULL) {
return -1;
}
memset(*stPtr, 0, sizeof(Biquad_St));
tmpPtr = (Biquad_St*)(*stPtr);
tmpPtr->dynamMemPtr = NULL;
tmpPtr->dynamMemSize = 0;
tmpPtr->stCfg.maxNSample = 768;
tmpPtr->stCfg.nsect = 0;
for (int idx = 0; idx < AGORA_UAP_BIQUAD_MAX_SECTION; idx++) {
tmpPtr->stCfg.A[idx] = NULL;
tmpPtr->stCfg.B[idx] = NULL;
}
tmpPtr->stCfg.G = NULL;
return 0;
}
int AUP_Biquad_destroy(void** stPtr) {
Biquad_St* stHdl;
if (stPtr == NULL) {
return 0;
}
stHdl = (Biquad_St*)(*stPtr);
if (stHdl == NULL) {
return 0;
}
if (stHdl->dynamMemPtr != NULL) {
free(stHdl->dynamMemPtr);
}
stHdl->dynamMemPtr = NULL;
free(stHdl);
(*stPtr) = NULL;
return 0;
}
int AUP_Biquad_memAllocate(void* stPtr, const Biquad_StaticCfg* pCfg) {
Biquad_St* stHdl = NULL;
char* memPtr = NULL;
int maxNSample, nsect, idx;
int inputTempBufMemSize = 0;
int sectOutputBufMemSize_EACH = 0;
int totalMemSize = 0;
if (stPtr == NULL || pCfg == NULL) {
return -1;
}
stHdl = (Biquad_St*)(stPtr);
if (AUP_Biquad_checkStatCfg(pCfg) < 0) {
return -1;
}
memcpy(&(stHdl->stCfg), pCfg, sizeof(Biquad_StaticCfg));
if (AUP_Biquad_publishStaticCfg(stHdl) < 0) {
return -1;
}
maxNSample = stHdl->maxNSample;
nsect = stHdl->nsect;
// check memory requirement
inputTempBufMemSize = AGORA_UAP_BIQUAD_ALIGN8(sizeof(float) * maxNSample);
totalMemSize += inputTempBufMemSize;
sectOutputBufMemSize_EACH =
AGORA_UAP_BIQUAD_ALIGN8(sizeof(float) * maxNSample);
totalMemSize += sectOutputBufMemSize_EACH * nsect;
// allocate dynamic memory
if ((size_t)totalMemSize > stHdl->dynamMemSize) {
if (stHdl->dynamMemPtr != NULL) {
free(stHdl->dynamMemPtr);
stHdl->dynamMemSize = 0;
}
stHdl->dynamMemPtr = malloc(totalMemSize);
if (stHdl->dynamMemPtr == NULL) {
return -1;
}
stHdl->dynamMemSize = totalMemSize;
}
memset(stHdl->dynamMemPtr, 0, stHdl->dynamMemSize);
// setup the pointers/variable
memPtr = (char*)(stHdl->dynamMemPtr);
stHdl->inputTempBuf = (float*)memPtr;
memPtr += inputTempBufMemSize;
for (idx = 0; idx < nsect; idx++) {
stHdl->sectOutputBuf[idx] = (float*)memPtr;
memPtr += sectOutputBufMemSize_EACH;
}
for (; idx < AGORA_UAP_BIQUAD_MAX_SECTION; idx++) {
stHdl->sectOutputBuf[idx] = NULL;
}
if (((int)(memPtr - (char*)(stHdl->dynamMemPtr))) > totalMemSize) {
return -1;
}
return 0;
}
int AUP_Biquad_init(void* stPtr) {
Biquad_St* stHdl;
if (stPtr == NULL) {
return -1;
}
stHdl = (Biquad_St*)(stPtr);
if (AUP_Biquad_resetVariables(stHdl) < 0) {
return -1;
}
return 0;
}
int AUP_Biquad_getStaticCfg(const void* stPtr, Biquad_StaticCfg* pCfg) {
const Biquad_St* stHdl;
if (stPtr == NULL || pCfg == NULL) {
return -1;
}
stHdl = (const Biquad_St*)(stPtr);
memcpy(pCfg, &(stHdl->stCfg), sizeof(Biquad_StaticCfg));
return 0;
}
int AUP_Biquad_getAlgDelay(const void* stPtr, int* delayInSamples) {
const Biquad_St* stHdl;
if (stPtr == NULL || delayInSamples == NULL) {
return -1;
}
stHdl = (const Biquad_St*)(stPtr);
*delayInSamples = stHdl->nsect;
return 0;
}
int AUP_Biquad_proc(void* stPtr, const Biquad_InputData* pIn,
Biquad_OutputData* pOut) {
Biquad_St* stHdl = NULL;
int isFloatIO = 0;
int inputNSamples, nSect;
int sectIdx, smplIdx;
float tmp1;
const short* pShortTemp;
float* src;
float* tgt;
if (stPtr == NULL || pIn == NULL || pOut == NULL) { // pCtrl == NULL
return -1;
}
if (pIn->samplesPtr == NULL || pOut->outputBuff == NULL) {
return -1;
}
stHdl = (Biquad_St*)(stPtr);
if (((int)pIn->nsamples) > stHdl->maxNSample) {
return -1;
}
isFloatIO = 0;
if (pIn->sampleType != 0) {
isFloatIO = 1;
}
inputNSamples = (int)pIn->nsamples;
nSect = stHdl->nsect;
// special handle for input
if (isFloatIO == 0) {
pShortTemp = (const short*)pIn->samplesPtr;
for (smplIdx = 0; smplIdx < inputNSamples; smplIdx++) {
stHdl->inputTempBuf[smplIdx] = (float)pShortTemp[smplIdx];
}
} else {
memcpy(stHdl->inputTempBuf, (const float*)pIn->samplesPtr,
sizeof(float) * inputNSamples);
}
for (sectIdx = 0; sectIdx < nSect; sectIdx++) {
if (sectIdx == 0) {
src = stHdl->inputTempBuf;
} else {
src = stHdl->sectOutputBuf[sectIdx - 1];
}
tgt = stHdl->sectOutputBuf[sectIdx];
for (smplIdx = 0; smplIdx < inputNSamples; smplIdx++) {
tmp1 = src[smplIdx] -
stHdl->ACoeff[sectIdx][1] * stHdl->sectW[sectIdx][0] -
stHdl->ACoeff[sectIdx][2] * stHdl->sectW[sectIdx][1];
tgt[smplIdx] = stHdl->GCoeff[sectIdx] *
(stHdl->BCoeff[sectIdx][0] * tmp1 +
stHdl->BCoeff[sectIdx][1] * stHdl->sectW[sectIdx][0] +
stHdl->BCoeff[sectIdx][2] * stHdl->sectW[sectIdx][1]);
stHdl->sectW[sectIdx][1] = stHdl->sectW[sectIdx][0];
stHdl->sectW[sectIdx][0] = tmp1;
}
}
// prepare output buffer
if (isFloatIO == 0) {
for (smplIdx = 0; smplIdx < inputNSamples; smplIdx++) {
((short*)pOut->outputBuff)[smplIdx] =
(short)_BIQUAD_FLOAT2SHORT(stHdl->sectOutputBuf[nSect - 1][smplIdx]);
}
} else {
memcpy(pOut->outputBuff, stHdl->sectOutputBuf[nSect - 1],
sizeof(float) * inputNSamples);
}
return 0;
}
|