Update audio_processing module
Corresponds to upstream commit 524e9b043e7e86fd72353b987c9d5f6a1ebf83e1 Update notes: * Pull in third party license file * Replace .gypi files with BUILD.gn to keep track of what changes upstream * Bunch of new filse pulled in as dependencies * Won't build yet due to changes needed on top of these
This commit is contained in:
@ -1,12 +0,0 @@
|
||||
noinst_LTLIBRARIES = libapm_util.la
|
||||
|
||||
libapm_util_la_SOURCES = delay_estimator_float.c \
|
||||
delay_estimator_float.h \
|
||||
delay_estimator.c \
|
||||
delay_estimator.h \
|
||||
fft4g.c \
|
||||
fft4g.h \
|
||||
ring_buffer.c \
|
||||
ring_buffer.h
|
||||
libapm_util_la_CFLAGS = $(AM_CFLAGS) $(COMMON_CFLAGS) \
|
||||
-I$(top_srcdir)/src/common_audio/signal_processing_library/main/interface
|
File diff suppressed because it is too large
Load Diff
@ -1,5 +1,5 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
@ -8,147 +8,244 @@
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
// Performs delay estimation on a block by block basis
|
||||
// Performs delay estimation on binary converted spectra.
|
||||
// The return value is 0 - OK and -1 - Error, unless otherwise stated.
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_H_
|
||||
|
||||
#include "typedefs.h"
|
||||
#include "webrtc/typedefs.h"
|
||||
|
||||
// Releases the memory allocated by WebRtc_CreateDelayEstimator(...)
|
||||
static const int32_t kMaxBitCountsQ9 = (32 << 9); // 32 matching bits in Q9.
|
||||
|
||||
typedef struct {
|
||||
// Pointer to bit counts.
|
||||
int* far_bit_counts;
|
||||
// Binary history variables.
|
||||
uint32_t* binary_far_history;
|
||||
int history_size;
|
||||
} BinaryDelayEstimatorFarend;
|
||||
|
||||
typedef struct {
|
||||
// Pointer to bit counts.
|
||||
int32_t* mean_bit_counts;
|
||||
// Array only used locally in ProcessBinarySpectrum() but whose size is
|
||||
// determined at run-time.
|
||||
int32_t* bit_counts;
|
||||
|
||||
// Binary history variables.
|
||||
uint32_t* binary_near_history;
|
||||
int near_history_size;
|
||||
int history_size;
|
||||
|
||||
// Delay estimation variables.
|
||||
int32_t minimum_probability;
|
||||
int last_delay_probability;
|
||||
|
||||
// Delay memory.
|
||||
int last_delay;
|
||||
|
||||
// Robust validation
|
||||
int robust_validation_enabled;
|
||||
int allowed_offset;
|
||||
int last_candidate_delay;
|
||||
int compare_delay;
|
||||
int candidate_hits;
|
||||
float* histogram;
|
||||
float last_delay_histogram;
|
||||
|
||||
// For dynamically changing the lookahead when using SoftReset...().
|
||||
int lookahead;
|
||||
|
||||
// Far-end binary spectrum history buffer etc.
|
||||
BinaryDelayEstimatorFarend* farend;
|
||||
} BinaryDelayEstimator;
|
||||
|
||||
// Releases the memory allocated by
|
||||
// WebRtc_CreateBinaryDelayEstimatorFarend(...).
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - self : Pointer to the binary delay estimation far-end
|
||||
// instance which is the return value of
|
||||
// WebRtc_CreateBinaryDelayEstimatorFarend().
|
||||
//
|
||||
int WebRtc_FreeDelayEstimator(void* handle);
|
||||
void WebRtc_FreeBinaryDelayEstimatorFarend(BinaryDelayEstimatorFarend* self);
|
||||
|
||||
// Allocates the memory needed by the delay estimation. The memory needs to be
|
||||
// initialized separately using the WebRtc_InitDelayEstimator(...)
|
||||
// function.
|
||||
// Allocates the memory needed by the far-end part of the binary delay
|
||||
// estimation. The memory needs to be initialized separately through
|
||||
// WebRtc_InitBinaryDelayEstimatorFarend(...).
|
||||
//
|
||||
// Inputs:
|
||||
// - handle : Instance that should be created
|
||||
// - spectrum_size : Size of the spectrum used both in far end and
|
||||
// near end. Used to allocate memory for spectrum
|
||||
// specific buffers.
|
||||
// - history_size : Size of the far end history used to estimate the
|
||||
// delay from. Used to allocate memory for history
|
||||
// specific buffers.
|
||||
// - enable_alignment : With this mode set to 1, a far end history is
|
||||
// created, so that the user can retrieve aligned
|
||||
// far end spectra using
|
||||
// WebRtc_AlignedFarend(...). Otherwise, only delay
|
||||
// values are calculated.
|
||||
// - history_size : Size of the far-end binary spectrum history.
|
||||
//
|
||||
// Return value:
|
||||
// - BinaryDelayEstimatorFarend*
|
||||
// : Created |handle|. If the memory can't be allocated
|
||||
// or if any of the input parameters are invalid NULL
|
||||
// is returned.
|
||||
//
|
||||
BinaryDelayEstimatorFarend* WebRtc_CreateBinaryDelayEstimatorFarend(
|
||||
int history_size);
|
||||
|
||||
// Re-allocates the buffers.
|
||||
//
|
||||
// Inputs:
|
||||
// - self : Pointer to the binary estimation far-end instance
|
||||
// which is the return value of
|
||||
// WebRtc_CreateBinaryDelayEstimatorFarend().
|
||||
// - history_size : Size of the far-end binary spectrum history.
|
||||
//
|
||||
// Return value:
|
||||
// - history_size : The history size allocated.
|
||||
int WebRtc_AllocateFarendBufferMemory(BinaryDelayEstimatorFarend* self,
|
||||
int history_size);
|
||||
|
||||
// Initializes the delay estimation far-end instance created with
|
||||
// WebRtc_CreateBinaryDelayEstimatorFarend(...).
|
||||
//
|
||||
// Input:
|
||||
// - self : Pointer to the delay estimation far-end instance.
|
||||
//
|
||||
// Output:
|
||||
// - handle : Created instance
|
||||
// - self : Initialized far-end instance.
|
||||
//
|
||||
int WebRtc_CreateDelayEstimator(void** handle,
|
||||
int spectrum_size,
|
||||
int history_size,
|
||||
int enable_alignment);
|
||||
void WebRtc_InitBinaryDelayEstimatorFarend(BinaryDelayEstimatorFarend* self);
|
||||
|
||||
// Soft resets the delay estimation far-end instance created with
|
||||
// WebRtc_CreateBinaryDelayEstimatorFarend(...).
|
||||
//
|
||||
// Input:
|
||||
// - delay_shift : The amount of blocks to shift history buffers.
|
||||
//
|
||||
void WebRtc_SoftResetBinaryDelayEstimatorFarend(
|
||||
BinaryDelayEstimatorFarend* self, int delay_shift);
|
||||
|
||||
// Adds the binary far-end spectrum to the internal far-end history buffer. This
|
||||
// spectrum is used as reference when calculating the delay using
|
||||
// WebRtc_ProcessBinarySpectrum().
|
||||
//
|
||||
// Inputs:
|
||||
// - self : Pointer to the delay estimation far-end
|
||||
// instance.
|
||||
// - binary_far_spectrum : Far-end binary spectrum.
|
||||
//
|
||||
// Output:
|
||||
// - self : Updated far-end instance.
|
||||
//
|
||||
void WebRtc_AddBinaryFarSpectrum(BinaryDelayEstimatorFarend* self,
|
||||
uint32_t binary_far_spectrum);
|
||||
|
||||
// Releases the memory allocated by WebRtc_CreateBinaryDelayEstimator(...).
|
||||
//
|
||||
// Note that BinaryDelayEstimator utilizes BinaryDelayEstimatorFarend, but does
|
||||
// not take ownership of it, hence the BinaryDelayEstimator has to be torn down
|
||||
// before the far-end.
|
||||
//
|
||||
// Input:
|
||||
// - self : Pointer to the binary delay estimation instance
|
||||
// which is the return value of
|
||||
// WebRtc_CreateBinaryDelayEstimator().
|
||||
//
|
||||
void WebRtc_FreeBinaryDelayEstimator(BinaryDelayEstimator* self);
|
||||
|
||||
// Allocates the memory needed by the binary delay estimation. The memory needs
|
||||
// to be initialized separately through WebRtc_InitBinaryDelayEstimator(...).
|
||||
//
|
||||
// See WebRtc_CreateDelayEstimator(..) in delay_estimator_wrapper.c for detailed
|
||||
// description.
|
||||
BinaryDelayEstimator* WebRtc_CreateBinaryDelayEstimator(
|
||||
BinaryDelayEstimatorFarend* farend, int max_lookahead);
|
||||
|
||||
// Re-allocates |history_size| dependent buffers. The far-end buffers will be
|
||||
// updated at the same time if needed.
|
||||
//
|
||||
// Input:
|
||||
// - self : Pointer to the binary estimation instance which is
|
||||
// the return value of
|
||||
// WebRtc_CreateBinaryDelayEstimator().
|
||||
// - history_size : Size of the history buffers.
|
||||
//
|
||||
// Return value:
|
||||
// - history_size : The history size allocated.
|
||||
int WebRtc_AllocateHistoryBufferMemory(BinaryDelayEstimator* self,
|
||||
int history_size);
|
||||
|
||||
// Initializes the delay estimation instance created with
|
||||
// WebRtc_CreateDelayEstimator(...)
|
||||
// WebRtc_CreateBinaryDelayEstimator(...).
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - self : Pointer to the delay estimation instance.
|
||||
//
|
||||
// Output:
|
||||
// - handle : Initialized instance
|
||||
// - self : Initialized instance.
|
||||
//
|
||||
int WebRtc_InitDelayEstimator(void* handle);
|
||||
void WebRtc_InitBinaryDelayEstimator(BinaryDelayEstimator* self);
|
||||
|
||||
// Estimates and returns the delay between the far end and near end blocks.
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - far_spectrum : Pointer to the far end spectrum data
|
||||
// - near_spectrum : Pointer to the near end spectrum data of the current
|
||||
// block
|
||||
// - spectrum_size : The size of the data arrays (same for both far and
|
||||
// near end)
|
||||
// - far_q : The Q-domain of the far end data
|
||||
// - vad_value : The VAD decision of the current block
|
||||
// Soft resets the delay estimation instance created with
|
||||
// WebRtc_CreateBinaryDelayEstimator(...).
|
||||
//
|
||||
// Output:
|
||||
// - handle : Updated instance
|
||||
// Input:
|
||||
// - delay_shift : The amount of blocks to shift history buffers.
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Calculated delay value
|
||||
// -1 - Error
|
||||
// - actual_shifts : The actual number of shifts performed.
|
||||
//
|
||||
int WebRtc_DelayEstimatorProcess(void* handle,
|
||||
uint16_t* far_spectrum,
|
||||
uint16_t* near_spectrum,
|
||||
int spectrum_size,
|
||||
int far_q,
|
||||
int vad_value);
|
||||
int WebRtc_SoftResetBinaryDelayEstimator(BinaryDelayEstimator* self,
|
||||
int delay_shift);
|
||||
|
||||
// Returns a pointer to the far end spectrum aligned to current near end
|
||||
// spectrum. The function WebRtc_DelayEstimatorProcess(...) should have been
|
||||
// called before WebRtc_AlignedFarend(...). Otherwise, you get the pointer to
|
||||
// the previous frame. The memory is only valid until the next call of
|
||||
// WebRtc_DelayEstimatorProcess(...).
|
||||
// Estimates and returns the delay between the binary far-end and binary near-
|
||||
// end spectra. It is assumed the binary far-end spectrum has been added using
|
||||
// WebRtc_AddBinaryFarSpectrum() prior to this call. The value will be offset by
|
||||
// the lookahead (i.e. the lookahead should be subtracted from the returned
|
||||
// value).
|
||||
//
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - far_spectrum_size : Size of far_spectrum allocated by the caller
|
||||
// - self : Pointer to the delay estimation instance.
|
||||
// - binary_near_spectrum : Near-end binary spectrum of the current block.
|
||||
//
|
||||
// Output:
|
||||
// - far_q : The Q-domain of the aligned far end spectrum
|
||||
// - self : Updated instance.
|
||||
//
|
||||
// Return value:
|
||||
// - far_spectrum : Pointer to the aligned far end spectrum
|
||||
// NULL - Error
|
||||
// - delay : >= 0 - Calculated delay value.
|
||||
// -2 - Insufficient data for estimation.
|
||||
//
|
||||
const uint16_t* WebRtc_AlignedFarend(void* handle,
|
||||
int far_spectrum_size,
|
||||
int* far_q);
|
||||
int WebRtc_ProcessBinarySpectrum(BinaryDelayEstimator* self,
|
||||
uint32_t binary_near_spectrum);
|
||||
|
||||
// Returns the last calculated delay updated by the function
|
||||
// WebRtc_DelayEstimatorProcess(...)
|
||||
// WebRtc_ProcessBinarySpectrum(...).
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - self : Pointer to the delay estimation instance.
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Last calculated delay value
|
||||
// -1 - Error
|
||||
// - delay : >= 0 - Last calculated delay value
|
||||
// -2 - Insufficient data for estimation.
|
||||
//
|
||||
int WebRtc_last_delay(void* handle);
|
||||
int WebRtc_binary_last_delay(BinaryDelayEstimator* self);
|
||||
|
||||
// Returns the history size used in the far end buffers to calculate the delay
|
||||
// over.
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// Returns the estimation quality of the last calculated delay updated by the
|
||||
// function WebRtc_ProcessBinarySpectrum(...). The estimation quality is a value
|
||||
// in the interval [0, 1]. The higher the value, the better the quality.
|
||||
//
|
||||
// Return value:
|
||||
// - history_size : > 0 - Far end history size
|
||||
// -1 - Error
|
||||
//
|
||||
int WebRtc_history_size(void* handle);
|
||||
// - delay_quality : >= 0 - Estimation quality of last calculated
|
||||
// delay value.
|
||||
float WebRtc_binary_last_delay_quality(BinaryDelayEstimator* self);
|
||||
|
||||
// Returns the fixed spectrum size used in the algorithm.
|
||||
// Updates the |mean_value| recursively with a step size of 2^-|factor|. This
|
||||
// function is used internally in the Binary Delay Estimator as well as the
|
||||
// Fixed point wrapper.
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// Inputs:
|
||||
// - new_value : The new value the mean should be updated with.
|
||||
// - factor : The step size, in number of right shifts.
|
||||
//
|
||||
// Return value:
|
||||
// - spectrum_size : > 0 - Spectrum size
|
||||
// -1 - Error
|
||||
// Input/Output:
|
||||
// - mean_value : Pointer to the mean value.
|
||||
//
|
||||
int WebRtc_spectrum_size(void* handle);
|
||||
|
||||
// Returns 1 if the far end alignment is enabled and 0 otherwise.
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
//
|
||||
// Return value:
|
||||
// - alignment_enabled : 1 - Enabled
|
||||
// 0 - Disabled
|
||||
// -1 - Error
|
||||
//
|
||||
int WebRtc_is_alignment_enabled(void* handle);
|
||||
void WebRtc_MeanEstimatorFix(int32_t new_value,
|
||||
int factor,
|
||||
int32_t* mean_value);
|
||||
|
||||
#endif // WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_H_
|
||||
|
@ -1,288 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
#include "delay_estimator_float.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <math.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "delay_estimator.h"
|
||||
#include "signal_processing_library.h"
|
||||
|
||||
typedef struct {
|
||||
// Fixed point spectra
|
||||
uint16_t* far_spectrum_u16;
|
||||
uint16_t* near_spectrum_u16;
|
||||
|
||||
// Far end history variables
|
||||
float* far_history;
|
||||
int far_history_pos;
|
||||
|
||||
// Fixed point delay estimator
|
||||
void* fixed_handle;
|
||||
|
||||
} DelayEstimatorFloat_t;
|
||||
|
||||
// Moves the pointer to the next buffer entry and inserts new far end spectrum.
|
||||
// Only used when alignment is enabled.
|
||||
//
|
||||
// Inputs:
|
||||
// - self : Pointer to the delay estimation instance
|
||||
// - far_spectrum : Pointer to the far end spectrum
|
||||
//
|
||||
static void UpdateFarHistory(DelayEstimatorFloat_t* self, float* far_spectrum) {
|
||||
int spectrum_size = WebRtc_spectrum_size(self->fixed_handle);
|
||||
// Get new buffer position
|
||||
self->far_history_pos++;
|
||||
if (self->far_history_pos >= WebRtc_history_size(self->fixed_handle)) {
|
||||
self->far_history_pos = 0;
|
||||
}
|
||||
// Update far end spectrum buffer
|
||||
memcpy(&(self->far_history[self->far_history_pos * spectrum_size]),
|
||||
far_spectrum,
|
||||
sizeof(float) * spectrum_size);
|
||||
}
|
||||
|
||||
int WebRtc_FreeDelayEstimatorFloat(void* handle) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (self->far_history != NULL) {
|
||||
free(self->far_history);
|
||||
self->far_history = NULL;
|
||||
}
|
||||
if (self->far_spectrum_u16 != NULL) {
|
||||
free(self->far_spectrum_u16);
|
||||
self->far_spectrum_u16 = NULL;
|
||||
}
|
||||
if (self->near_spectrum_u16 != NULL) {
|
||||
free(self->near_spectrum_u16);
|
||||
self->near_spectrum_u16 = NULL;
|
||||
}
|
||||
|
||||
WebRtc_FreeDelayEstimator(self->fixed_handle);
|
||||
free(self);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_CreateDelayEstimatorFloat(void** handle,
|
||||
int spectrum_size,
|
||||
int history_size,
|
||||
int enable_alignment) {
|
||||
DelayEstimatorFloat_t *self = NULL;
|
||||
if ((enable_alignment != 0) && (enable_alignment != 1)) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
self = malloc(sizeof(DelayEstimatorFloat_t));
|
||||
*handle = self;
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
self->far_history = NULL;
|
||||
self->far_spectrum_u16 = NULL;
|
||||
self->near_spectrum_u16 = NULL;
|
||||
|
||||
// Create fixed point core delay estimator
|
||||
if (WebRtc_CreateDelayEstimator(&self->fixed_handle,
|
||||
spectrum_size,
|
||||
history_size,
|
||||
enable_alignment) != 0) {
|
||||
WebRtc_FreeDelayEstimatorFloat(self);
|
||||
self = NULL;
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Allocate memory for far history buffer
|
||||
if (enable_alignment) {
|
||||
self->far_history = malloc(spectrum_size * history_size * sizeof(float));
|
||||
if (self->far_history == NULL) {
|
||||
WebRtc_FreeDelayEstimatorFloat(self);
|
||||
self = NULL;
|
||||
return -1;
|
||||
}
|
||||
}
|
||||
// Allocate memory for fixed point spectra
|
||||
self->far_spectrum_u16 = malloc(spectrum_size * sizeof(uint16_t));
|
||||
if (self->far_spectrum_u16 == NULL) {
|
||||
WebRtc_FreeDelayEstimatorFloat(self);
|
||||
self = NULL;
|
||||
return -1;
|
||||
}
|
||||
self->near_spectrum_u16 = malloc(spectrum_size * sizeof(uint16_t));
|
||||
if (self->near_spectrum_u16 == NULL) {
|
||||
WebRtc_FreeDelayEstimatorFloat(self);
|
||||
self = NULL;
|
||||
return -1;
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_InitDelayEstimatorFloat(void* handle) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
if (WebRtc_InitDelayEstimator(self->fixed_handle) != 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
{
|
||||
int history_size = WebRtc_history_size(self->fixed_handle);
|
||||
int spectrum_size = WebRtc_spectrum_size(self->fixed_handle);
|
||||
if (WebRtc_is_alignment_enabled(self->fixed_handle) == 1) {
|
||||
// Set far end histories to zero
|
||||
memset(self->far_history,
|
||||
0,
|
||||
sizeof(float) * spectrum_size * history_size);
|
||||
self->far_history_pos = history_size;
|
||||
}
|
||||
// Set fixed point spectra to zero
|
||||
memset(self->far_spectrum_u16, 0, sizeof(uint16_t) * spectrum_size);
|
||||
memset(self->near_spectrum_u16, 0, sizeof(uint16_t) * spectrum_size);
|
||||
}
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_DelayEstimatorProcessFloat(void* handle,
|
||||
float* far_spectrum,
|
||||
float* near_spectrum,
|
||||
int spectrum_size,
|
||||
int vad_value) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
|
||||
const float kFftSize = (float) (2 * (spectrum_size - 1));
|
||||
const float kLogOf2Inverse = 1.4426950f;
|
||||
float max_value = 0.0f;
|
||||
float scaling = 0;
|
||||
|
||||
int far_q = 0;
|
||||
int scaling_log = 0;
|
||||
int i = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (far_spectrum == NULL) {
|
||||
// Empty far end spectrum
|
||||
return -1;
|
||||
}
|
||||
if (near_spectrum == NULL) {
|
||||
// Empty near end spectrum
|
||||
return -1;
|
||||
}
|
||||
if (spectrum_size != WebRtc_spectrum_size(self->fixed_handle)) {
|
||||
// Data sizes don't match
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Convert floating point spectrum to fixed point
|
||||
// 1) Find largest value
|
||||
// 2) Scale largest value to fit in Word16
|
||||
for (i = 0; i < spectrum_size; ++i) {
|
||||
if (near_spectrum[i] > max_value) {
|
||||
max_value = near_spectrum[i];
|
||||
}
|
||||
}
|
||||
// Find the largest possible scaling that is a multiple of two.
|
||||
// With largest we mean to fit in a Word16.
|
||||
// TODO(bjornv): I've taken the size of FFT into account, since there is a
|
||||
// different scaling in float vs fixed point FFTs. I'm not completely sure
|
||||
// this is necessary.
|
||||
scaling_log = 14 - (int) (log(max_value / kFftSize + 1) * kLogOf2Inverse);
|
||||
scaling = (float) (1 << scaling_log) / kFftSize;
|
||||
for (i = 0; i < spectrum_size; ++i) {
|
||||
self->near_spectrum_u16[i] = (uint16_t) (near_spectrum[i] * scaling);
|
||||
}
|
||||
|
||||
// Same for far end
|
||||
max_value = 0.0f;
|
||||
for (i = 0; i < spectrum_size; ++i) {
|
||||
if (far_spectrum[i] > max_value) {
|
||||
max_value = far_spectrum[i];
|
||||
}
|
||||
}
|
||||
// Find the largest possible scaling that is a multiple of two.
|
||||
// With largest we mean to fit in a Word16.
|
||||
scaling_log = 14 - (int) (log(max_value / kFftSize + 1) * kLogOf2Inverse);
|
||||
scaling = (float) (1 << scaling_log) / kFftSize;
|
||||
for (i = 0; i < spectrum_size; ++i) {
|
||||
self->far_spectrum_u16[i] = (uint16_t) (far_spectrum[i] * scaling);
|
||||
}
|
||||
far_q = (int) scaling_log;
|
||||
assert(far_q < 16); // Catch too large scaling, which should never be able to
|
||||
// occur.
|
||||
|
||||
if (WebRtc_is_alignment_enabled(self->fixed_handle) == 1) {
|
||||
// Update far end history
|
||||
UpdateFarHistory(self, far_spectrum);
|
||||
}
|
||||
|
||||
return WebRtc_DelayEstimatorProcess(self->fixed_handle,
|
||||
self->far_spectrum_u16,
|
||||
self->near_spectrum_u16,
|
||||
spectrum_size,
|
||||
far_q,
|
||||
vad_value);
|
||||
}
|
||||
|
||||
const float* WebRtc_AlignedFarendFloat(void* handle, int far_spectrum_size) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
int buffer_pos = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return NULL;
|
||||
}
|
||||
if (far_spectrum_size != WebRtc_spectrum_size(self->fixed_handle)) {
|
||||
return NULL;
|
||||
}
|
||||
if (WebRtc_is_alignment_enabled(self->fixed_handle) != 1) {
|
||||
return NULL;
|
||||
}
|
||||
|
||||
// Get buffer position
|
||||
buffer_pos = self->far_history_pos - WebRtc_last_delay(self->fixed_handle);
|
||||
if (buffer_pos < 0) {
|
||||
buffer_pos += WebRtc_history_size(self->fixed_handle);
|
||||
}
|
||||
// Return pointer to far end spectrum
|
||||
return (self->far_history + (buffer_pos * far_spectrum_size));
|
||||
}
|
||||
|
||||
int WebRtc_last_delay_float(void* handle) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
return WebRtc_last_delay(self->fixed_handle);
|
||||
}
|
||||
|
||||
int WebRtc_is_alignment_enabled_float(void* handle) {
|
||||
DelayEstimatorFloat_t* self = (DelayEstimatorFloat_t*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
return WebRtc_is_alignment_enabled(self->fixed_handle);
|
||||
}
|
@ -1,125 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
// Performs delay estimation on a block by block basis
|
||||
// The return value is 0 - OK and -1 - Error, unless otherwise stated.
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_FLOAT_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_FLOAT_H_
|
||||
|
||||
// Releases the memory allocated by WebRtc_CreateDelayEstimatorFloat(...)
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
//
|
||||
int WebRtc_FreeDelayEstimatorFloat(void* handle);
|
||||
|
||||
// Allocates the memory needed by the delay estimation. The memory needs to be
|
||||
// initialized separately using the WebRtc_InitDelayEstimatorFloat(...)
|
||||
// function.
|
||||
//
|
||||
// Inputs:
|
||||
// - handle : Instance that should be created
|
||||
// - spectrum_size : Size of the spectrum used both in far end and
|
||||
// near end. Used to allocate memory for spectrum
|
||||
// specific buffers.
|
||||
// - history_size : Size of the far end history used to estimate the
|
||||
// delay from. Used to allocate memory for history
|
||||
// specific buffers.
|
||||
// - enable_alignment : With this mode set to 1, a far end history is
|
||||
// created, so that the user can retrieve aligned
|
||||
// far end spectra using
|
||||
// WebRtc_AlignedFarendFloat(...). Otherwise, only
|
||||
// delay values are calculated.
|
||||
//
|
||||
// Output:
|
||||
// - handle : Created instance
|
||||
//
|
||||
int WebRtc_CreateDelayEstimatorFloat(void** handle,
|
||||
int spectrum_size,
|
||||
int history_size,
|
||||
int enable_alignment);
|
||||
|
||||
// Initializes the delay estimation instance created with
|
||||
// WebRtc_CreateDelayEstimatorFloat(...)
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
//
|
||||
// Output:
|
||||
// - handle : Initialized instance
|
||||
//
|
||||
int WebRtc_InitDelayEstimatorFloat(void* handle);
|
||||
|
||||
// Estimates and returns the delay between the far end and near end blocks.
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - far_spectrum : Pointer to the far end spectrum data
|
||||
// - near_spectrum : Pointer to the near end spectrum data of the current
|
||||
// block
|
||||
// - spectrum_size : The size of the data arrays (same for both far and
|
||||
// near end)
|
||||
// - far_q : The Q-domain of the far end data
|
||||
// - vad_value : The VAD decision of the current block
|
||||
//
|
||||
// Output:
|
||||
// - handle : Updated instance
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Calculated delay value
|
||||
// -1 - Error
|
||||
//
|
||||
int WebRtc_DelayEstimatorProcessFloat(void* handle,
|
||||
float* far_spectrum,
|
||||
float* near_spectrum,
|
||||
int spectrum_size,
|
||||
int vad_value);
|
||||
|
||||
// Returns a pointer to the far end spectrum aligned to current near end
|
||||
// spectrum. The function WebRtc_DelayEstimatorProcessFloat(...) should
|
||||
// have been called before WebRtc_AlignedFarendFloat(...). Otherwise, you get
|
||||
// the pointer to the previous frame. The memory is only valid until the
|
||||
// next call of WebRtc_DelayEstimatorProcessFloat(...).
|
||||
//
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
// - far_spectrum_size : Size of far_spectrum allocated by the caller
|
||||
//
|
||||
// Output:
|
||||
//
|
||||
// Return value:
|
||||
// - far_spectrum : Pointer to the aligned far end spectrum
|
||||
// NULL - Error
|
||||
//
|
||||
const float* WebRtc_AlignedFarendFloat(void* handle, int far_spectrum_size);
|
||||
|
||||
// Returns the last calculated delay updated by the function
|
||||
// WebRtcApm_DelayEstimatorProcessFloat(...)
|
||||
//
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Last calculated delay value
|
||||
// -1 - Error
|
||||
//
|
||||
int WebRtc_last_delay_float(void* handle);
|
||||
|
||||
// Returns 1 if the far end alignment is enabled and 0 otherwise.
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance
|
||||
//
|
||||
// Return value:
|
||||
// - alignment_enabled : 1 - Enabled
|
||||
// 0 - Disabled
|
||||
// -1 - Error
|
||||
//
|
||||
int WebRtc_is_alignment_enabled_float(void* handle);
|
||||
|
||||
#endif // WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_FLOAT_H_
|
@ -0,0 +1,48 @@
|
||||
/*
|
||||
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
// Header file including the delay estimator handle used for testing.
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_INTERNAL_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_INTERNAL_H_
|
||||
|
||||
#include "webrtc/modules/audio_processing/utility/delay_estimator.h"
|
||||
#include "webrtc/typedefs.h"
|
||||
|
||||
typedef union {
|
||||
float float_;
|
||||
int32_t int32_;
|
||||
} SpectrumType;
|
||||
|
||||
typedef struct {
|
||||
// Pointers to mean values of spectrum.
|
||||
SpectrumType* mean_far_spectrum;
|
||||
// |mean_far_spectrum| initialization indicator.
|
||||
int far_spectrum_initialized;
|
||||
|
||||
int spectrum_size;
|
||||
|
||||
// Far-end part of binary spectrum based delay estimation.
|
||||
BinaryDelayEstimatorFarend* binary_farend;
|
||||
} DelayEstimatorFarend;
|
||||
|
||||
typedef struct {
|
||||
// Pointers to mean values of spectrum.
|
||||
SpectrumType* mean_near_spectrum;
|
||||
// |mean_near_spectrum| initialization indicator.
|
||||
int near_spectrum_initialized;
|
||||
|
||||
int spectrum_size;
|
||||
|
||||
// Binary spectrum based delay estimator
|
||||
BinaryDelayEstimator* binary_handle;
|
||||
} DelayEstimator;
|
||||
|
||||
#endif // WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_INTERNAL_H_
|
@ -0,0 +1,485 @@
|
||||
/*
|
||||
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
#include "webrtc/modules/audio_processing/utility/delay_estimator_wrapper.h"
|
||||
|
||||
#include <assert.h>
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
|
||||
#include "webrtc/modules/audio_processing/utility/delay_estimator.h"
|
||||
#include "webrtc/modules/audio_processing/utility/delay_estimator_internal.h"
|
||||
#include "webrtc/system_wrappers/interface/compile_assert_c.h"
|
||||
|
||||
// Only bit |kBandFirst| through bit |kBandLast| are processed and
|
||||
// |kBandFirst| - |kBandLast| must be < 32.
|
||||
enum { kBandFirst = 12 };
|
||||
enum { kBandLast = 43 };
|
||||
|
||||
static __inline uint32_t SetBit(uint32_t in, int pos) {
|
||||
uint32_t mask = (1 << pos);
|
||||
uint32_t out = (in | mask);
|
||||
|
||||
return out;
|
||||
}
|
||||
|
||||
// Calculates the mean recursively. Same version as WebRtc_MeanEstimatorFix(),
|
||||
// but for float.
|
||||
//
|
||||
// Inputs:
|
||||
// - new_value : New additional value.
|
||||
// - scale : Scale for smoothing (should be less than 1.0).
|
||||
//
|
||||
// Input/Output:
|
||||
// - mean_value : Pointer to the mean value for updating.
|
||||
//
|
||||
static void MeanEstimatorFloat(float new_value,
|
||||
float scale,
|
||||
float* mean_value) {
|
||||
assert(scale < 1.0f);
|
||||
*mean_value += (new_value - *mean_value) * scale;
|
||||
}
|
||||
|
||||
// Computes the binary spectrum by comparing the input |spectrum| with a
|
||||
// |threshold_spectrum|. Float and fixed point versions.
|
||||
//
|
||||
// Inputs:
|
||||
// - spectrum : Spectrum of which the binary spectrum should be
|
||||
// calculated.
|
||||
// - threshold_spectrum : Threshold spectrum with which the input
|
||||
// spectrum is compared.
|
||||
// Return:
|
||||
// - out : Binary spectrum.
|
||||
//
|
||||
static uint32_t BinarySpectrumFix(const uint16_t* spectrum,
|
||||
SpectrumType* threshold_spectrum,
|
||||
int q_domain,
|
||||
int* threshold_initialized) {
|
||||
int i = kBandFirst;
|
||||
uint32_t out = 0;
|
||||
|
||||
assert(q_domain < 16);
|
||||
|
||||
if (!(*threshold_initialized)) {
|
||||
// Set the |threshold_spectrum| to half the input |spectrum| as starting
|
||||
// value. This speeds up the convergence.
|
||||
for (i = kBandFirst; i <= kBandLast; i++) {
|
||||
if (spectrum[i] > 0) {
|
||||
// Convert input spectrum from Q(|q_domain|) to Q15.
|
||||
int32_t spectrum_q15 = ((int32_t) spectrum[i]) << (15 - q_domain);
|
||||
threshold_spectrum[i].int32_ = (spectrum_q15 >> 1);
|
||||
*threshold_initialized = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
for (i = kBandFirst; i <= kBandLast; i++) {
|
||||
// Convert input spectrum from Q(|q_domain|) to Q15.
|
||||
int32_t spectrum_q15 = ((int32_t) spectrum[i]) << (15 - q_domain);
|
||||
// Update the |threshold_spectrum|.
|
||||
WebRtc_MeanEstimatorFix(spectrum_q15, 6, &(threshold_spectrum[i].int32_));
|
||||
// Convert |spectrum| at current frequency bin to a binary value.
|
||||
if (spectrum_q15 > threshold_spectrum[i].int32_) {
|
||||
out = SetBit(out, i - kBandFirst);
|
||||
}
|
||||
}
|
||||
|
||||
return out;
|
||||
}
|
||||
|
||||
static uint32_t BinarySpectrumFloat(const float* spectrum,
|
||||
SpectrumType* threshold_spectrum,
|
||||
int* threshold_initialized) {
|
||||
int i = kBandFirst;
|
||||
uint32_t out = 0;
|
||||
const float kScale = 1 / 64.0;
|
||||
|
||||
if (!(*threshold_initialized)) {
|
||||
// Set the |threshold_spectrum| to half the input |spectrum| as starting
|
||||
// value. This speeds up the convergence.
|
||||
for (i = kBandFirst; i <= kBandLast; i++) {
|
||||
if (spectrum[i] > 0.0f) {
|
||||
threshold_spectrum[i].float_ = (spectrum[i] / 2);
|
||||
*threshold_initialized = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
for (i = kBandFirst; i <= kBandLast; i++) {
|
||||
// Update the |threshold_spectrum|.
|
||||
MeanEstimatorFloat(spectrum[i], kScale, &(threshold_spectrum[i].float_));
|
||||
// Convert |spectrum| at current frequency bin to a binary value.
|
||||
if (spectrum[i] > threshold_spectrum[i].float_) {
|
||||
out = SetBit(out, i - kBandFirst);
|
||||
}
|
||||
}
|
||||
|
||||
return out;
|
||||
}
|
||||
|
||||
void WebRtc_FreeDelayEstimatorFarend(void* handle) {
|
||||
DelayEstimatorFarend* self = (DelayEstimatorFarend*) handle;
|
||||
|
||||
if (handle == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
free(self->mean_far_spectrum);
|
||||
self->mean_far_spectrum = NULL;
|
||||
|
||||
WebRtc_FreeBinaryDelayEstimatorFarend(self->binary_farend);
|
||||
self->binary_farend = NULL;
|
||||
|
||||
free(self);
|
||||
}
|
||||
|
||||
void* WebRtc_CreateDelayEstimatorFarend(int spectrum_size, int history_size) {
|
||||
DelayEstimatorFarend* self = NULL;
|
||||
|
||||
// Check if the sub band used in the delay estimation is small enough to fit
|
||||
// the binary spectra in a uint32_t.
|
||||
COMPILE_ASSERT(kBandLast - kBandFirst < 32);
|
||||
|
||||
if (spectrum_size >= kBandLast) {
|
||||
self = malloc(sizeof(DelayEstimatorFarend));
|
||||
}
|
||||
|
||||
if (self != NULL) {
|
||||
int memory_fail = 0;
|
||||
|
||||
// Allocate memory for the binary far-end spectrum handling.
|
||||
self->binary_farend = WebRtc_CreateBinaryDelayEstimatorFarend(history_size);
|
||||
memory_fail |= (self->binary_farend == NULL);
|
||||
|
||||
// Allocate memory for spectrum buffers.
|
||||
self->mean_far_spectrum = malloc(spectrum_size * sizeof(SpectrumType));
|
||||
memory_fail |= (self->mean_far_spectrum == NULL);
|
||||
|
||||
self->spectrum_size = spectrum_size;
|
||||
|
||||
if (memory_fail) {
|
||||
WebRtc_FreeDelayEstimatorFarend(self);
|
||||
self = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
return self;
|
||||
}
|
||||
|
||||
int WebRtc_InitDelayEstimatorFarend(void* handle) {
|
||||
DelayEstimatorFarend* self = (DelayEstimatorFarend*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Initialize far-end part of binary delay estimator.
|
||||
WebRtc_InitBinaryDelayEstimatorFarend(self->binary_farend);
|
||||
|
||||
// Set averaged far and near end spectra to zero.
|
||||
memset(self->mean_far_spectrum, 0,
|
||||
sizeof(SpectrumType) * self->spectrum_size);
|
||||
// Reset initialization indicators.
|
||||
self->far_spectrum_initialized = 0;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void WebRtc_SoftResetDelayEstimatorFarend(void* handle, int delay_shift) {
|
||||
DelayEstimatorFarend* self = (DelayEstimatorFarend*) handle;
|
||||
assert(self != NULL);
|
||||
WebRtc_SoftResetBinaryDelayEstimatorFarend(self->binary_farend, delay_shift);
|
||||
}
|
||||
|
||||
int WebRtc_AddFarSpectrumFix(void* handle,
|
||||
const uint16_t* far_spectrum,
|
||||
int spectrum_size,
|
||||
int far_q) {
|
||||
DelayEstimatorFarend* self = (DelayEstimatorFarend*) handle;
|
||||
uint32_t binary_spectrum = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (far_spectrum == NULL) {
|
||||
// Empty far end spectrum.
|
||||
return -1;
|
||||
}
|
||||
if (spectrum_size != self->spectrum_size) {
|
||||
// Data sizes don't match.
|
||||
return -1;
|
||||
}
|
||||
if (far_q > 15) {
|
||||
// If |far_q| is larger than 15 we cannot guarantee no wrap around.
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Get binary spectrum.
|
||||
binary_spectrum = BinarySpectrumFix(far_spectrum, self->mean_far_spectrum,
|
||||
far_q, &(self->far_spectrum_initialized));
|
||||
WebRtc_AddBinaryFarSpectrum(self->binary_farend, binary_spectrum);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_AddFarSpectrumFloat(void* handle,
|
||||
const float* far_spectrum,
|
||||
int spectrum_size) {
|
||||
DelayEstimatorFarend* self = (DelayEstimatorFarend*) handle;
|
||||
uint32_t binary_spectrum = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (far_spectrum == NULL) {
|
||||
// Empty far end spectrum.
|
||||
return -1;
|
||||
}
|
||||
if (spectrum_size != self->spectrum_size) {
|
||||
// Data sizes don't match.
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Get binary spectrum.
|
||||
binary_spectrum = BinarySpectrumFloat(far_spectrum, self->mean_far_spectrum,
|
||||
&(self->far_spectrum_initialized));
|
||||
WebRtc_AddBinaryFarSpectrum(self->binary_farend, binary_spectrum);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
void WebRtc_FreeDelayEstimator(void* handle) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
|
||||
if (handle == NULL) {
|
||||
return;
|
||||
}
|
||||
|
||||
free(self->mean_near_spectrum);
|
||||
self->mean_near_spectrum = NULL;
|
||||
|
||||
WebRtc_FreeBinaryDelayEstimator(self->binary_handle);
|
||||
self->binary_handle = NULL;
|
||||
|
||||
free(self);
|
||||
}
|
||||
|
||||
void* WebRtc_CreateDelayEstimator(void* farend_handle, int max_lookahead) {
|
||||
DelayEstimator* self = NULL;
|
||||
DelayEstimatorFarend* farend = (DelayEstimatorFarend*) farend_handle;
|
||||
|
||||
if (farend_handle != NULL) {
|
||||
self = malloc(sizeof(DelayEstimator));
|
||||
}
|
||||
|
||||
if (self != NULL) {
|
||||
int memory_fail = 0;
|
||||
|
||||
// Allocate memory for the farend spectrum handling.
|
||||
self->binary_handle =
|
||||
WebRtc_CreateBinaryDelayEstimator(farend->binary_farend, max_lookahead);
|
||||
memory_fail |= (self->binary_handle == NULL);
|
||||
|
||||
// Allocate memory for spectrum buffers.
|
||||
self->mean_near_spectrum = malloc(farend->spectrum_size *
|
||||
sizeof(SpectrumType));
|
||||
memory_fail |= (self->mean_near_spectrum == NULL);
|
||||
|
||||
self->spectrum_size = farend->spectrum_size;
|
||||
|
||||
if (memory_fail) {
|
||||
WebRtc_FreeDelayEstimator(self);
|
||||
self = NULL;
|
||||
}
|
||||
}
|
||||
|
||||
return self;
|
||||
}
|
||||
|
||||
int WebRtc_InitDelayEstimator(void* handle) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Initialize binary delay estimator.
|
||||
WebRtc_InitBinaryDelayEstimator(self->binary_handle);
|
||||
|
||||
// Set averaged far and near end spectra to zero.
|
||||
memset(self->mean_near_spectrum, 0,
|
||||
sizeof(SpectrumType) * self->spectrum_size);
|
||||
// Reset initialization indicators.
|
||||
self->near_spectrum_initialized = 0;
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_SoftResetDelayEstimator(void* handle, int delay_shift) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
assert(self != NULL);
|
||||
return WebRtc_SoftResetBinaryDelayEstimator(self->binary_handle, delay_shift);
|
||||
}
|
||||
|
||||
int WebRtc_set_history_size(void* handle, int history_size) {
|
||||
DelayEstimator* self = handle;
|
||||
|
||||
if ((self == NULL) || (history_size <= 1)) {
|
||||
return -1;
|
||||
}
|
||||
return WebRtc_AllocateHistoryBufferMemory(self->binary_handle, history_size);
|
||||
}
|
||||
|
||||
int WebRtc_history_size(const void* handle) {
|
||||
const DelayEstimator* self = handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (self->binary_handle->farend->history_size !=
|
||||
self->binary_handle->history_size) {
|
||||
// Non matching history sizes.
|
||||
return -1;
|
||||
}
|
||||
return self->binary_handle->history_size;
|
||||
}
|
||||
|
||||
int WebRtc_set_lookahead(void* handle, int lookahead) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
assert(self != NULL);
|
||||
assert(self->binary_handle != NULL);
|
||||
if ((lookahead > self->binary_handle->near_history_size - 1) ||
|
||||
(lookahead < 0)) {
|
||||
return -1;
|
||||
}
|
||||
self->binary_handle->lookahead = lookahead;
|
||||
return self->binary_handle->lookahead;
|
||||
}
|
||||
|
||||
int WebRtc_lookahead(void* handle) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
assert(self != NULL);
|
||||
assert(self->binary_handle != NULL);
|
||||
return self->binary_handle->lookahead;
|
||||
}
|
||||
|
||||
int WebRtc_set_allowed_offset(void* handle, int allowed_offset) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
|
||||
if ((self == NULL) || (allowed_offset < 0)) {
|
||||
return -1;
|
||||
}
|
||||
self->binary_handle->allowed_offset = allowed_offset;
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_get_allowed_offset(const void* handle) {
|
||||
const DelayEstimator* self = (const DelayEstimator*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
return self->binary_handle->allowed_offset;
|
||||
}
|
||||
|
||||
int WebRtc_enable_robust_validation(void* handle, int enable) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if ((enable < 0) || (enable > 1)) {
|
||||
return -1;
|
||||
}
|
||||
assert(self->binary_handle != NULL);
|
||||
self->binary_handle->robust_validation_enabled = enable;
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtc_is_robust_validation_enabled(const void* handle) {
|
||||
const DelayEstimator* self = (const DelayEstimator*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
return self->binary_handle->robust_validation_enabled;
|
||||
}
|
||||
|
||||
int WebRtc_DelayEstimatorProcessFix(void* handle,
|
||||
const uint16_t* near_spectrum,
|
||||
int spectrum_size,
|
||||
int near_q) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
uint32_t binary_spectrum = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (near_spectrum == NULL) {
|
||||
// Empty near end spectrum.
|
||||
return -1;
|
||||
}
|
||||
if (spectrum_size != self->spectrum_size) {
|
||||
// Data sizes don't match.
|
||||
return -1;
|
||||
}
|
||||
if (near_q > 15) {
|
||||
// If |near_q| is larger than 15 we cannot guarantee no wrap around.
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Get binary spectra.
|
||||
binary_spectrum = BinarySpectrumFix(near_spectrum,
|
||||
self->mean_near_spectrum,
|
||||
near_q,
|
||||
&(self->near_spectrum_initialized));
|
||||
|
||||
return WebRtc_ProcessBinarySpectrum(self->binary_handle, binary_spectrum);
|
||||
}
|
||||
|
||||
int WebRtc_DelayEstimatorProcessFloat(void* handle,
|
||||
const float* near_spectrum,
|
||||
int spectrum_size) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
uint32_t binary_spectrum = 0;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
if (near_spectrum == NULL) {
|
||||
// Empty near end spectrum.
|
||||
return -1;
|
||||
}
|
||||
if (spectrum_size != self->spectrum_size) {
|
||||
// Data sizes don't match.
|
||||
return -1;
|
||||
}
|
||||
|
||||
// Get binary spectrum.
|
||||
binary_spectrum = BinarySpectrumFloat(near_spectrum, self->mean_near_spectrum,
|
||||
&(self->near_spectrum_initialized));
|
||||
|
||||
return WebRtc_ProcessBinarySpectrum(self->binary_handle, binary_spectrum);
|
||||
}
|
||||
|
||||
int WebRtc_last_delay(void* handle) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
|
||||
if (self == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
return WebRtc_binary_last_delay(self->binary_handle);
|
||||
}
|
||||
|
||||
float WebRtc_last_delay_quality(void* handle) {
|
||||
DelayEstimator* self = (DelayEstimator*) handle;
|
||||
assert(self != NULL);
|
||||
return WebRtc_binary_last_delay_quality(self->binary_handle);
|
||||
}
|
@ -0,0 +1,244 @@
|
||||
/*
|
||||
* Copyright (c) 2012 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
// Performs delay estimation on block by block basis.
|
||||
// The return value is 0 - OK and -1 - Error, unless otherwise stated.
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_WRAPPER_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_WRAPPER_H_
|
||||
|
||||
#include "webrtc/typedefs.h"
|
||||
|
||||
// Releases the memory allocated by WebRtc_CreateDelayEstimatorFarend(...)
|
||||
void WebRtc_FreeDelayEstimatorFarend(void* handle);
|
||||
|
||||
// Allocates the memory needed by the far-end part of the delay estimation. The
|
||||
// memory needs to be initialized separately through
|
||||
// WebRtc_InitDelayEstimatorFarend(...).
|
||||
//
|
||||
// Inputs:
|
||||
// - spectrum_size : Size of the spectrum used both in far-end and
|
||||
// near-end. Used to allocate memory for spectrum
|
||||
// specific buffers.
|
||||
// - history_size : The far-end history buffer size. A change in buffer
|
||||
// size can be forced with WebRtc_set_history_size().
|
||||
// Note that the maximum delay which can be estimated is
|
||||
// determined together with WebRtc_set_lookahead().
|
||||
//
|
||||
// Return value:
|
||||
// - void* : Created |handle|. If the memory can't be allocated or
|
||||
// if any of the input parameters are invalid NULL is
|
||||
// returned.
|
||||
void* WebRtc_CreateDelayEstimatorFarend(int spectrum_size, int history_size);
|
||||
|
||||
// Initializes the far-end part of the delay estimation instance returned by
|
||||
// WebRtc_CreateDelayEstimatorFarend(...)
|
||||
int WebRtc_InitDelayEstimatorFarend(void* handle);
|
||||
|
||||
// Soft resets the far-end part of the delay estimation instance returned by
|
||||
// WebRtc_CreateDelayEstimatorFarend(...).
|
||||
// Input:
|
||||
// - delay_shift : The amount of blocks to shift history buffers.
|
||||
void WebRtc_SoftResetDelayEstimatorFarend(void* handle, int delay_shift);
|
||||
|
||||
// Adds the far-end spectrum to the far-end history buffer. This spectrum is
|
||||
// used as reference when calculating the delay using
|
||||
// WebRtc_ProcessSpectrum().
|
||||
//
|
||||
// Inputs:
|
||||
// - far_spectrum : Far-end spectrum.
|
||||
// - spectrum_size : The size of the data arrays (same for both far- and
|
||||
// near-end).
|
||||
// - far_q : The Q-domain of the far-end data.
|
||||
//
|
||||
// Output:
|
||||
// - handle : Updated far-end instance.
|
||||
//
|
||||
int WebRtc_AddFarSpectrumFix(void* handle,
|
||||
const uint16_t* far_spectrum,
|
||||
int spectrum_size,
|
||||
int far_q);
|
||||
|
||||
// See WebRtc_AddFarSpectrumFix() for description.
|
||||
int WebRtc_AddFarSpectrumFloat(void* handle,
|
||||
const float* far_spectrum,
|
||||
int spectrum_size);
|
||||
|
||||
// Releases the memory allocated by WebRtc_CreateDelayEstimator(...)
|
||||
void WebRtc_FreeDelayEstimator(void* handle);
|
||||
|
||||
// Allocates the memory needed by the delay estimation. The memory needs to be
|
||||
// initialized separately through WebRtc_InitDelayEstimator(...).
|
||||
//
|
||||
// Inputs:
|
||||
// - farend_handle : Pointer to the far-end part of the delay estimation
|
||||
// instance created prior to this call using
|
||||
// WebRtc_CreateDelayEstimatorFarend().
|
||||
//
|
||||
// Note that WebRtc_CreateDelayEstimator does not take
|
||||
// ownership of |farend_handle|, which has to be torn
|
||||
// down properly after this instance.
|
||||
//
|
||||
// - max_lookahead : Maximum amount of non-causal lookahead allowed. The
|
||||
// actual amount of lookahead used can be controlled by
|
||||
// WebRtc_set_lookahead(...). The default |lookahead| is
|
||||
// set to |max_lookahead| at create time. Use
|
||||
// WebRtc_set_lookahead(...) before start if a different
|
||||
// value is desired.
|
||||
//
|
||||
// Using lookahead can detect cases in which a near-end
|
||||
// signal occurs before the corresponding far-end signal.
|
||||
// It will delay the estimate for the current block by an
|
||||
// equal amount, and the returned values will be offset
|
||||
// by it.
|
||||
//
|
||||
// A value of zero is the typical no-lookahead case.
|
||||
// This also represents the minimum delay which can be
|
||||
// estimated.
|
||||
//
|
||||
// Note that the effective range of delay estimates is
|
||||
// [-|lookahead|,... ,|history_size|-|lookahead|)
|
||||
// where |history_size| is set through
|
||||
// WebRtc_set_history_size().
|
||||
//
|
||||
// Return value:
|
||||
// - void* : Created |handle|. If the memory can't be allocated or
|
||||
// if any of the input parameters are invalid NULL is
|
||||
// returned.
|
||||
void* WebRtc_CreateDelayEstimator(void* farend_handle, int max_lookahead);
|
||||
|
||||
// Initializes the delay estimation instance returned by
|
||||
// WebRtc_CreateDelayEstimator(...)
|
||||
int WebRtc_InitDelayEstimator(void* handle);
|
||||
|
||||
// Soft resets the delay estimation instance returned by
|
||||
// WebRtc_CreateDelayEstimator(...)
|
||||
// Input:
|
||||
// - delay_shift : The amount of blocks to shift history buffers.
|
||||
//
|
||||
// Return value:
|
||||
// - actual_shifts : The actual number of shifts performed.
|
||||
int WebRtc_SoftResetDelayEstimator(void* handle, int delay_shift);
|
||||
|
||||
// Sets the effective |history_size| used. Valid values from 2. We simply need
|
||||
// at least two delays to compare to perform an estimate. If |history_size| is
|
||||
// changed, buffers are reallocated filling in with zeros if necessary.
|
||||
// Note that changing the |history_size| affects both buffers in far-end and
|
||||
// near-end. Hence it is important to change all DelayEstimators that use the
|
||||
// same reference far-end, to the same |history_size| value.
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
// - history_size : Effective history size to be used.
|
||||
// Return value:
|
||||
// - new_history_size : The new history size used. If the memory was not able
|
||||
// to be allocated 0 is returned.
|
||||
int WebRtc_set_history_size(void* handle, int history_size);
|
||||
|
||||
// Returns the history_size currently used.
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
int WebRtc_history_size(const void* handle);
|
||||
|
||||
// Sets the amount of |lookahead| to use. Valid values are [0, max_lookahead]
|
||||
// where |max_lookahead| was set at create time through
|
||||
// WebRtc_CreateDelayEstimator(...).
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
// - lookahead : The amount of lookahead to be used.
|
||||
//
|
||||
// Return value:
|
||||
// - new_lookahead : The actual amount of lookahead set, unless |handle| is
|
||||
// a NULL pointer or |lookahead| is invalid, for which an
|
||||
// error is returned.
|
||||
int WebRtc_set_lookahead(void* handle, int lookahead);
|
||||
|
||||
// Returns the amount of lookahead we currently use.
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
int WebRtc_lookahead(void* handle);
|
||||
|
||||
// Sets the |allowed_offset| used in the robust validation scheme. If the
|
||||
// delay estimator is used in an echo control component, this parameter is
|
||||
// related to the filter length. In principle |allowed_offset| should be set to
|
||||
// the echo control filter length minus the expected echo duration, i.e., the
|
||||
// delay offset the echo control can handle without quality regression. The
|
||||
// default value, used if not set manually, is zero. Note that |allowed_offset|
|
||||
// has to be non-negative.
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
// - allowed_offset : The amount of delay offset, measured in partitions,
|
||||
// the echo control filter can handle.
|
||||
int WebRtc_set_allowed_offset(void* handle, int allowed_offset);
|
||||
|
||||
// Returns the |allowed_offset| in number of partitions.
|
||||
int WebRtc_get_allowed_offset(const void* handle);
|
||||
|
||||
// Enables/Disables a robust validation functionality in the delay estimation.
|
||||
// This is by default set to disabled at create time. The state is preserved
|
||||
// over a reset.
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
// - enable : Enable (1) or disable (0) this feature.
|
||||
int WebRtc_enable_robust_validation(void* handle, int enable);
|
||||
|
||||
// Returns 1 if robust validation is enabled and 0 if disabled.
|
||||
int WebRtc_is_robust_validation_enabled(const void* handle);
|
||||
|
||||
// Estimates and returns the delay between the far-end and near-end blocks. The
|
||||
// value will be offset by the lookahead (i.e. the lookahead should be
|
||||
// subtracted from the returned value).
|
||||
// Inputs:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
// - near_spectrum : Pointer to the near-end spectrum data of the current
|
||||
// block.
|
||||
// - spectrum_size : The size of the data arrays (same for both far- and
|
||||
// near-end).
|
||||
// - near_q : The Q-domain of the near-end data.
|
||||
//
|
||||
// Output:
|
||||
// - handle : Updated instance.
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Calculated delay value.
|
||||
// -1 - Error.
|
||||
// -2 - Insufficient data for estimation.
|
||||
int WebRtc_DelayEstimatorProcessFix(void* handle,
|
||||
const uint16_t* near_spectrum,
|
||||
int spectrum_size,
|
||||
int near_q);
|
||||
|
||||
// See WebRtc_DelayEstimatorProcessFix() for description.
|
||||
int WebRtc_DelayEstimatorProcessFloat(void* handle,
|
||||
const float* near_spectrum,
|
||||
int spectrum_size);
|
||||
|
||||
// Returns the last calculated delay updated by the function
|
||||
// WebRtc_DelayEstimatorProcess(...).
|
||||
//
|
||||
// Input:
|
||||
// - handle : Pointer to the delay estimation instance.
|
||||
//
|
||||
// Return value:
|
||||
// - delay : >= 0 - Last calculated delay value.
|
||||
// -1 - Error.
|
||||
// -2 - Insufficient data for estimation.
|
||||
int WebRtc_last_delay(void* handle);
|
||||
|
||||
// Returns the estimation quality/probability of the last calculated delay
|
||||
// updated by the function WebRtc_DelayEstimatorProcess(...). The estimation
|
||||
// quality is a value in the interval [0, 1]. The higher the value, the better
|
||||
// the quality.
|
||||
//
|
||||
// Return value:
|
||||
// - delay_quality : >= 0 - Estimation quality of last calculated delay.
|
||||
float WebRtc_last_delay_quality(void* handle);
|
||||
|
||||
#endif // WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_DELAY_ESTIMATOR_WRAPPER_H_
|
File diff suppressed because it is too large
Load Diff
@ -1,18 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_FFT4G_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_FFT4G_H_
|
||||
|
||||
void rdft(int, int, float *, int *, float *);
|
||||
void cdft(int, int, float *, int *, float *);
|
||||
|
||||
#endif
|
||||
|
@ -1,239 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
/*
|
||||
* Provides a generic ring buffer that can be written to and read from with
|
||||
* arbitrarily sized blocks. The AEC uses this for several different tasks.
|
||||
*/
|
||||
|
||||
#include <stdlib.h>
|
||||
#include <string.h>
|
||||
#include "ring_buffer.h"
|
||||
|
||||
typedef struct {
|
||||
int readPos;
|
||||
int writePos;
|
||||
int size;
|
||||
char rwWrap;
|
||||
bufdata_t *data;
|
||||
} buf_t;
|
||||
|
||||
enum {SAME_WRAP, DIFF_WRAP};
|
||||
|
||||
int WebRtcApm_CreateBuffer(void **bufInst, int size)
|
||||
{
|
||||
buf_t *buf = NULL;
|
||||
|
||||
if (size < 0) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
buf = malloc(sizeof(buf_t));
|
||||
*bufInst = buf;
|
||||
if (buf == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
buf->data = malloc(size*sizeof(bufdata_t));
|
||||
if (buf->data == NULL) {
|
||||
free(buf);
|
||||
buf = NULL;
|
||||
return -1;
|
||||
}
|
||||
|
||||
buf->size = size;
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtcApm_InitBuffer(void *bufInst)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
|
||||
buf->readPos = 0;
|
||||
buf->writePos = 0;
|
||||
buf->rwWrap = SAME_WRAP;
|
||||
|
||||
// Initialize buffer to zeros
|
||||
memset(buf->data, 0, sizeof(bufdata_t)*buf->size);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtcApm_FreeBuffer(void *bufInst)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
|
||||
if (buf == NULL) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
free(buf->data);
|
||||
free(buf);
|
||||
|
||||
return 0;
|
||||
}
|
||||
|
||||
int WebRtcApm_ReadBuffer(void *bufInst, bufdata_t *data, int size)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
int n = 0, margin = 0;
|
||||
|
||||
if (size <= 0 || size > buf->size) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
n = size;
|
||||
if (buf->rwWrap == DIFF_WRAP) {
|
||||
margin = buf->size - buf->readPos;
|
||||
if (n > margin) {
|
||||
buf->rwWrap = SAME_WRAP;
|
||||
memcpy(data, buf->data + buf->readPos,
|
||||
sizeof(bufdata_t)*margin);
|
||||
buf->readPos = 0;
|
||||
n = size - margin;
|
||||
}
|
||||
else {
|
||||
memcpy(data, buf->data + buf->readPos,
|
||||
sizeof(bufdata_t)*n);
|
||||
buf->readPos += n;
|
||||
return n;
|
||||
}
|
||||
}
|
||||
|
||||
if (buf->rwWrap == SAME_WRAP) {
|
||||
margin = buf->writePos - buf->readPos;
|
||||
if (margin > n)
|
||||
margin = n;
|
||||
memcpy(data + size - n, buf->data + buf->readPos,
|
||||
sizeof(bufdata_t)*margin);
|
||||
buf->readPos += margin;
|
||||
n -= margin;
|
||||
}
|
||||
|
||||
return size - n;
|
||||
}
|
||||
|
||||
int WebRtcApm_WriteBuffer(void *bufInst, const bufdata_t *data, int size)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
int n = 0, margin = 0;
|
||||
|
||||
if (size < 0 || size > buf->size) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
n = size;
|
||||
if (buf->rwWrap == SAME_WRAP) {
|
||||
margin = buf->size - buf->writePos;
|
||||
if (n > margin) {
|
||||
buf->rwWrap = DIFF_WRAP;
|
||||
memcpy(buf->data + buf->writePos, data,
|
||||
sizeof(bufdata_t)*margin);
|
||||
buf->writePos = 0;
|
||||
n = size - margin;
|
||||
}
|
||||
else {
|
||||
memcpy(buf->data + buf->writePos, data,
|
||||
sizeof(bufdata_t)*n);
|
||||
buf->writePos += n;
|
||||
return n;
|
||||
}
|
||||
}
|
||||
|
||||
if (buf->rwWrap == DIFF_WRAP) {
|
||||
margin = buf->readPos - buf->writePos;
|
||||
if (margin > n)
|
||||
margin = n;
|
||||
memcpy(buf->data + buf->writePos, data + size - n,
|
||||
sizeof(bufdata_t)*margin);
|
||||
buf->writePos += margin;
|
||||
n -= margin;
|
||||
}
|
||||
|
||||
return size - n;
|
||||
}
|
||||
|
||||
int WebRtcApm_FlushBuffer(void *bufInst, int size)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
int n = 0, margin = 0;
|
||||
|
||||
if (size <= 0 || size > buf->size) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
n = size;
|
||||
if (buf->rwWrap == DIFF_WRAP) {
|
||||
margin = buf->size - buf->readPos;
|
||||
if (n > margin) {
|
||||
buf->rwWrap = SAME_WRAP;
|
||||
buf->readPos = 0;
|
||||
n = size - margin;
|
||||
}
|
||||
else {
|
||||
buf->readPos += n;
|
||||
return n;
|
||||
}
|
||||
}
|
||||
|
||||
if (buf->rwWrap == SAME_WRAP) {
|
||||
margin = buf->writePos - buf->readPos;
|
||||
if (margin > n)
|
||||
margin = n;
|
||||
buf->readPos += margin;
|
||||
n -= margin;
|
||||
}
|
||||
|
||||
return size - n;
|
||||
}
|
||||
|
||||
int WebRtcApm_StuffBuffer(void *bufInst, int size)
|
||||
{
|
||||
buf_t *buf = (buf_t*)bufInst;
|
||||
int n = 0, margin = 0;
|
||||
|
||||
if (size <= 0 || size > buf->size) {
|
||||
return -1;
|
||||
}
|
||||
|
||||
n = size;
|
||||
if (buf->rwWrap == SAME_WRAP) {
|
||||
margin = buf->readPos;
|
||||
if (n > margin) {
|
||||
buf->rwWrap = DIFF_WRAP;
|
||||
buf->readPos = buf->size - 1;
|
||||
n -= margin + 1;
|
||||
}
|
||||
else {
|
||||
buf->readPos -= n;
|
||||
return n;
|
||||
}
|
||||
}
|
||||
|
||||
if (buf->rwWrap == DIFF_WRAP) {
|
||||
margin = buf->readPos - buf->writePos;
|
||||
if (margin > n)
|
||||
margin = n;
|
||||
buf->readPos -= margin;
|
||||
n -= margin;
|
||||
}
|
||||
|
||||
return size - n;
|
||||
}
|
||||
|
||||
int WebRtcApm_get_buffer_size(const void *bufInst)
|
||||
{
|
||||
const buf_t *buf = (buf_t*)bufInst;
|
||||
|
||||
if (buf->rwWrap == SAME_WRAP)
|
||||
return buf->writePos - buf->readPos;
|
||||
else
|
||||
return buf->size - buf->readPos + buf->writePos;
|
||||
}
|
@ -1,41 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
*
|
||||
* Use of this source code is governed by a BSD-style license
|
||||
* that can be found in the LICENSE file in the root of the source
|
||||
* tree. An additional intellectual property rights grant can be found
|
||||
* in the file PATENTS. All contributing project authors may
|
||||
* be found in the AUTHORS file in the root of the source tree.
|
||||
*/
|
||||
|
||||
/*
|
||||
* Specifies the interface for the AEC generic buffer.
|
||||
*/
|
||||
|
||||
#ifndef WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_RING_BUFFER_H_
|
||||
#define WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_RING_BUFFER_H_
|
||||
|
||||
// Determines buffer datatype
|
||||
typedef short bufdata_t;
|
||||
|
||||
// Unless otherwise specified, functions return 0 on success and -1 on error
|
||||
int WebRtcApm_CreateBuffer(void **bufInst, int size);
|
||||
int WebRtcApm_InitBuffer(void *bufInst);
|
||||
int WebRtcApm_FreeBuffer(void *bufInst);
|
||||
|
||||
// Returns number of samples read
|
||||
int WebRtcApm_ReadBuffer(void *bufInst, bufdata_t *data, int size);
|
||||
|
||||
// Returns number of samples written
|
||||
int WebRtcApm_WriteBuffer(void *bufInst, const bufdata_t *data, int size);
|
||||
|
||||
// Returns number of samples flushed
|
||||
int WebRtcApm_FlushBuffer(void *bufInst, int size);
|
||||
|
||||
// Returns number of samples stuffed
|
||||
int WebRtcApm_StuffBuffer(void *bufInst, int size);
|
||||
|
||||
// Returns number of samples in buffer
|
||||
int WebRtcApm_get_buffer_size(const void *bufInst);
|
||||
|
||||
#endif // WEBRTC_MODULES_AUDIO_PROCESSING_UTILITY_RING_BUFFER_H_
|
@ -1,40 +0,0 @@
|
||||
# Copyright (c) 2011 The WebRTC project authors. All Rights Reserved.
|
||||
#
|
||||
# Use of this source code is governed by a BSD-style license
|
||||
# that can be found in the LICENSE file in the root of the source
|
||||
# tree. An additional intellectual property rights grant can be found
|
||||
# in the file PATENTS. All contributing project authors may
|
||||
# be found in the AUTHORS file in the root of the source tree.
|
||||
|
||||
{
|
||||
'targets': [
|
||||
{
|
||||
'target_name': 'apm_util',
|
||||
'type': '<(library)',
|
||||
'dependencies': [
|
||||
'<(webrtc_root)/common_audio/common_audio.gyp:spl',
|
||||
],
|
||||
'direct_dependent_settings': {
|
||||
'include_dirs': [
|
||||
'.',
|
||||
],
|
||||
},
|
||||
'sources': [
|
||||
'delay_estimator_float.c',
|
||||
'delay_estimator_float.h',
|
||||
'delay_estimator.c',
|
||||
'delay_estimator.h',
|
||||
'fft4g.c',
|
||||
'fft4g.h',
|
||||
'ring_buffer.c',
|
||||
'ring_buffer.h',
|
||||
],
|
||||
},
|
||||
],
|
||||
}
|
||||
|
||||
# Local Variables:
|
||||
# tab-width:2
|
||||
# indent-tabs-mode:nil
|
||||
# End:
|
||||
# vim: set expandtab tabstop=2 shiftwidth=2:
|
Reference in New Issue
Block a user