![]() |
LIBDSP Version 4.1.9
LIBDSP Software Library
|
#include "tpt_math.h"
Functions | |
| tpt_status | tpt_conv_partial_fast_opt_q15 (q15_t *aOutData, const q15_t *aInDataA, uint32_t aLenA, const q15_t *aInDataB, uint32_t aLenB, uint32_t firstIndex, uint32_t aCount, q15_t *aScratch1, q15_t *aScratch2) |
| Q15 partial convolution (overlap-add, index-clipped). | |
| tpt_status tpt_conv_partial_fast_opt_q15 | ( | q15_t * | aOutData, |
| const q15_t * | aInDataA, | ||
| uint32_t | aLenA, | ||
| const q15_t * | aInDataB, | ||
| uint32_t | aLenB, | ||
| uint32_t | firstIndex, | ||
| uint32_t | aCount, | ||
| q15_t * | aScratch1, | ||
| q15_t * | aScratch2 ) |
Q15 partial convolution (overlap-add, index-clipped).
===-------------------------------------------------------------------—===//
| [out] | aOutData | points to the location where the output result |
| [in] | aInDataA | longer sequence |
| [in] | aLenA | length of aInDataA |
| [in] | aInDataB | shorter sequence |
| [in] | aLenB | length of aInDataB is written. Length aLenA+aLenB-1. |
| [in] | firstIndex | first output sample to keep |
| [in] | aCount | number of output samples to compute |
| [in] | aScratch1 | points to scratch buffer of size |
| [in] | aScratch2 | points to scratch buffer of size |
firstIndex + aCount is greater than aLenA + aLenB -
1===-----------------------------------------------------------------—===//
| [out] | aOutData | points to the location where the output result is written. Length aLenA+aLenB-1. |
| [in] | aInDataA | points to the first input sequence |
| [in] | aLenA | length of the first input sequence |
| [in] | aInDataB | points to the second input sequence |
| [in] | aLenB | length of the second input sequence |
| [in] | firstIndex | first output sample to keep |
| [in] | aCount | number of output samples to compute |
| [in] | aScratch1 | points to scratch buffer of size max(aLenA,aLenB) + 2*min(aLenA, aLenB) - 2 |
| [in] | aScratch2 | points to scratch buffer of size min(aLenA,aLenB) |