Welcome to mirror list, hosted at ThFree Co, Russian Federation.

github.com/Flipper-Zero/STM32CubeWB.git - Unnamed repository; edit this file 'description' to name the repository.
summaryrefslogtreecommitdiff
diff options
context:
space:
mode:
Diffstat (limited to 'Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c')
-rw-r--r--Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c351
1 files changed, 93 insertions, 258 deletions
diff --git a/Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c b/Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c
index c6e05b8d7..ed2aea940 100644
--- a/Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c
+++ b/Drivers/CMSIS/DSP/Source/FilteringFunctions/arm_conv_fast_opt_q15.c
@@ -3,13 +3,13 @@
* Title: arm_conv_fast_opt_q15.c
* Description: Fast Q15 Convolution
*
- * $Date: 27. January 2017
- * $Revision: V.1.5.1
+ * $Date: 18. March 2019
+ * $Revision: V1.6.0
*
* Target Processor: Cortex-M cores
* -------------------------------------------------------------------- */
/*
- * Copyright (C) 2010-2017 ARM Limited or its affiliates. All rights reserved.
+ * Copyright (C) 2010-2019 ARM Limited or its affiliates. All rights reserved.
*
* SPDX-License-Identifier: Apache-2.0
*
@@ -29,71 +29,65 @@
#include "arm_math.h"
/**
- * @ingroup groupFilters
+ @ingroup groupFilters
*/
/**
- * @addtogroup Conv
- * @{
+ @addtogroup Conv
+ @{
*/
/**
- * @brief Convolution of Q15 sequences (fast version) for Cortex-M3 and Cortex-M4.
- * @param[in] *pSrcA points to the first input sequence.
- * @param[in] srcALen length of the first input sequence.
- * @param[in] *pSrcB points to the second input sequence.
- * @param[in] srcBLen length of the second input sequence.
- * @param[out] *pDst points to the location where the output result is written. Length srcALen+srcBLen-1.
- * @param[in] *pScratch1 points to scratch buffer of size max(srcALen, srcBLen) + 2*min(srcALen, srcBLen) - 2.
- * @param[in] *pScratch2 points to scratch buffer of size min(srcALen, srcBLen).
- * @return none.
- *
- * \par Restrictions
- * If the silicon does not support unaligned memory access enable the macro UNALIGNED_SUPPORT_DISABLE
- * In this case input, output, scratch1 and scratch2 buffers should be aligned by 32-bit
- *
- * <b>Scaling and Overflow Behavior:</b>
- *
- * \par
- * This fast version uses a 32-bit accumulator with 2.30 format.
- * The accumulator maintains full precision of the intermediate multiplication results
- * but provides only a single guard bit. There is no saturation on intermediate additions.
- * Thus, if the accumulator overflows it wraps around and distorts the result.
- * The input signals should be scaled down to avoid intermediate overflows.
- * Scale down the inputs by log2(min(srcALen, srcBLen)) (log2 is read as log to the base 2) times to avoid overflows,
- * as maximum of min(srcALen, srcBLen) number of additions are carried internally.
- * The 2.30 accumulator is right shifted by 15 bits and then saturated to 1.15 format to yield the final result.
- *
- * \par
- * See <code>arm_conv_q15()</code> for a slower implementation of this function which uses 64-bit accumulation to avoid wrap around distortion.
+ @brief Convolution of Q15 sequences (fast version).
+ @param[in] pSrcA points to the first input sequence
+ @param[in] srcALen length of the first input sequence
+ @param[in] pSrcB points to the second input sequence
+ @param[in] srcBLen length of the second input sequence
+ @param[out] pDst points to the location where the output result is written. Length srcALen+srcBLen-1
+ @param[in] pScratch1 points to scratch buffer of size max(srcALen, srcBLen) + 2*min(srcALen, srcBLen) - 2
+ @param[in] pScratch2 points to scratch buffer of size min(srcALen, srcBLen
+ @return none
+
+ @par Scaling and Overflow Behavior
+ This fast version uses a 32-bit accumulator with 2.30 format.
+ The accumulator maintains full precision of the intermediate multiplication results
+ but provides only a single guard bit. There is no saturation on intermediate additions.
+ Thus, if the accumulator overflows it wraps around and distorts the result.
+ The input signals should be scaled down to avoid intermediate overflows.
+ Scale down the inputs by log2(min(srcALen, srcBLen)) (log2 is read as log to the base 2) times to avoid overflows,
+ as maximum of min(srcALen, srcBLen) number of additions are carried internally.
+ The 2.30 accumulator is right shifted by 15 bits and then saturated to 1.15 format to yield the final result.
+
+ @remark
+ Refer to \ref arm_conv_q15() for a slower implementation of this function which uses 64-bit accumulation to avoid wrap around distortion.
*/
void arm_conv_fast_opt_q15(
- q15_t * pSrcA,
- uint32_t srcALen,
- q15_t * pSrcB,
- uint32_t srcBLen,
- q15_t * pDst,
- q15_t * pScratch1,
- q15_t * pScratch2)
+ const q15_t * pSrcA,
+ uint32_t srcALen,
+ const q15_t * pSrcB,
+ uint32_t srcBLen,
+ q15_t * pDst,
+ q15_t * pScratch1,
+ q15_t * pScratch2)
{
- q31_t acc0, acc1, acc2, acc3; /* Accumulators */
- q31_t x1, x2, x3; /* Temporary variables to hold state and coefficient values */
- q31_t y1, y2; /* State variables */
- q15_t *pOut = pDst; /* output pointer */
- q15_t *pScr1 = pScratch1; /* Temporary pointer for scratch1 */
- q15_t *pScr2 = pScratch2; /* Temporary pointer for scratch1 */
- q15_t *pIn1; /* inputA pointer */
- q15_t *pIn2; /* inputB pointer */
- q15_t *px; /* Intermediate inputA pointer */
- q15_t *py; /* Intermediate inputB pointer */
- uint32_t j, k, blkCnt; /* loop counter */
- uint32_t tapCnt; /* loop count */
-#ifdef UNALIGNED_SUPPORT_DISABLE
-
- q15_t a, b;
-
-#endif /* #ifdef UNALIGNED_SUPPORT_DISABLE */
+ q31_t acc0; /* Accumulators */
+ const q15_t *pIn1; /* InputA pointer */
+ const q15_t *pIn2; /* InputB pointer */
+ q15_t *pOut = pDst; /* Output pointer */
+ q15_t *pScr1 = pScratch1; /* Temporary pointer for scratch1 */
+ q15_t *pScr2 = pScratch2; /* Temporary pointer for scratch1 */
+ const q15_t *px; /* Intermediate inputA pointer */
+ q15_t *py; /* Intermediate inputB pointer */
+ uint32_t j, k, blkCnt; /* Loop counter */
+ uint32_t tapCnt; /* Loop count */
+
+#if defined (ARM_MATH_LOOPUNROLL)
+ q31_t acc1, acc2, acc3; /* Accumulators */
+ q31_t x1, x2, x3; /* Temporary variables to hold state and coefficient values */
+ q31_t y1, y2; /* State variables */
+#endif
+
/* The algorithm implementation is based on the lengths of the inputs. */
/* srcB is always made to slide across srcA. */
@@ -126,11 +120,10 @@ void arm_conv_fast_opt_q15(
/* points to smaller length sequence */
px = pIn2;
- /* Apply loop unrolling and do 4 Copies simultaneously. */
- k = srcBLen >> 2U;
+#if defined (ARM_MATH_LOOPUNROLL)
- /* First part of the processing with loop unrolling copies 4 data points at a time.
- ** a second loop below copies for the remaining 1 to 3 samples. */
+ /* Loop unrolling: Compute 4 outputs at a time */
+ k = srcBLen >> 2U;
/* Copy smaller length input sequence in reverse order into second scratch buffer */
while (k > 0U)
@@ -141,20 +134,26 @@ void arm_conv_fast_opt_q15(
*pScr2-- = *px++;
*pScr2-- = *px++;
- /* Decrement the loop counter */
+ /* Decrement loop counter */
k--;
}
- /* If the count is not a multiple of 4, copy remaining samples here.
- ** No loop unrolling is used. */
+ /* Loop unrolling: Compute remaining outputs */
k = srcBLen % 0x4U;
+#else
+
+ /* Initialize k with number of samples */
+ k = srcBLen;
+
+#endif /* #if defined (ARM_MATH_LOOPUNROLL) */
+
while (k > 0U)
{
/* copy second buffer in reversal manner for remaining samples */
*pScr2-- = *px++;
- /* Decrement the loop counter */
+ /* Decrement loop counter */
k--;
}
@@ -170,50 +169,12 @@ void arm_conv_fast_opt_q15(
/* Copy bigger length sequence(srcALen) samples in scratch1 buffer */
-#ifndef UNALIGNED_SUPPORT_DISABLE
-
/* Copy (srcALen) samples in scratch buffer */
arm_copy_q15(pIn1, pScr1, srcALen);
/* Update pointers */
pScr1 += srcALen;
-#else
-
- /* Apply loop unrolling and do 4 Copies simultaneously. */
- k = srcALen >> 2U;
-
- /* First part of the processing with loop unrolling copies 4 data points at a time.
- ** a second loop below copies for the remaining 1 to 3 samples. */
- while (k > 0U)
- {
- /* copy second buffer in reversal manner */
- *pScr1++ = *pIn1++;
- *pScr1++ = *pIn1++;
- *pScr1++ = *pIn1++;
- *pScr1++ = *pIn1++;
-
- /* Decrement the loop counter */
- k--;
- }
-
- /* If the count is not a multiple of 4, copy remaining samples here.
- ** No loop unrolling is used. */
- k = srcALen % 0x4U;
-
- while (k > 0U)
- {
- /* copy second buffer in reversal manner for remaining samples */
- *pScr1++ = *pIn1++;
-
- /* Decrement the loop counter */
- k--;
- }
-
-#endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
-
-
-#ifndef UNALIGNED_SUPPORT_DISABLE
/* Fill (srcBLen - 1U) zeros at end of scratch buffer */
arm_fill_q15(0, pScr1, (srcBLen - 1U));
@@ -221,40 +182,6 @@ void arm_conv_fast_opt_q15(
/* Update pointer */
pScr1 += (srcBLen - 1U);
-#else
-
- /* Apply loop unrolling and do 4 Copies simultaneously. */
- k = (srcBLen - 1U) >> 2U;
-
- /* First part of the processing with loop unrolling copies 4 data points at a time.
- ** a second loop below copies for the remaining 1 to 3 samples. */
- while (k > 0U)
- {
- /* copy second buffer in reversal manner */
- *pScr1++ = 0;
- *pScr1++ = 0;
- *pScr1++ = 0;
- *pScr1++ = 0;
-
- /* Decrement the loop counter */
- k--;
- }
-
- /* If the count is not a multiple of 4, copy remaining samples here.
- ** No loop unrolling is used. */
- k = (srcBLen - 1U) % 0x4U;
-
- while (k > 0U)
- {
- /* copy second buffer in reversal manner for remaining samples */
- *pScr1++ = 0;
-
- /* Decrement the loop counter */
- k--;
- }
-
-#endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
-
/* Temporary pointer for scratch2 */
py = pScratch2;
@@ -262,10 +189,9 @@ void arm_conv_fast_opt_q15(
/* Initialization of pIn2 pointer */
pIn2 = py;
- /* First part of the processing with loop unrolling process 4 data points at a time.
- ** a second loop below process for the remaining 1 to 3 samples. */
+#if defined (ARM_MATH_LOOPUNROLL)
- /* Actual convolution process starts here */
+ /* Loop unrolling: Compute 4 outputs at a time */
blkCnt = (srcALen + srcBLen - 1U) >> 2;
while (blkCnt > 0)
@@ -280,21 +206,19 @@ void arm_conv_fast_opt_q15(
acc3 = 0;
/* Read two samples from scratch1 buffer */
- x1 = *__SIMD32(pScr1)++;
+ x1 = read_q15x2_ia (&pScr1);
/* Read next two samples from scratch1 buffer */
- x2 = *__SIMD32(pScr1)++;
+ x2 = read_q15x2_ia (&pScr1);
tapCnt = (srcBLen) >> 2U;
while (tapCnt > 0U)
{
-#ifndef UNALIGNED_SUPPORT_DISABLE
-
/* Read four samples from smaller buffer */
- y1 = _SIMD32_OFFSET(pIn2);
- y2 = _SIMD32_OFFSET(pIn2 + 2U);
+ y1 = read_q15x2_ia ((q15_t **) &pIn2);
+ y2 = read_q15x2_ia ((q15_t **) &pIn2);
/* multiply and accumlate */
acc0 = __SMLAD(x1, y1, acc0);
@@ -311,7 +235,7 @@ void arm_conv_fast_opt_q15(
acc1 = __SMLADX(x3, y1, acc1);
/* Read next two samples from scratch1 buffer */
- x1 = _SIMD32_OFFSET(pScr1);
+ x1 = read_q15x2_ia (&pScr1);
/* multiply and accumlate */
acc0 = __SMLAD(x2, y2, acc0);
@@ -327,79 +251,7 @@ void arm_conv_fast_opt_q15(
acc3 = __SMLADX(x3, y1, acc3);
acc1 = __SMLADX(x3, y2, acc1);
- x2 = _SIMD32_OFFSET(pScr1 + 2U);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- x3 = __PKHBT(x2, x1, 0);
-#else
- x3 = __PKHBT(x1, x2, 0);
-#endif
-
- acc3 = __SMLADX(x3, y2, acc3);
-
-#else
-
- /* Read four samples from smaller buffer */
- a = *pIn2;
- b = *(pIn2 + 1);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- y1 = __PKHBT(a, b, 16);
-#else
- y1 = __PKHBT(b, a, 16);
-#endif
-
- a = *(pIn2 + 2);
- b = *(pIn2 + 3);
-#ifndef ARM_MATH_BIG_ENDIAN
- y2 = __PKHBT(a, b, 16);
-#else
- y2 = __PKHBT(b, a, 16);
-#endif
-
- acc0 = __SMLAD(x1, y1, acc0);
-
- acc2 = __SMLAD(x2, y1, acc2);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- x3 = __PKHBT(x2, x1, 0);
-#else
- x3 = __PKHBT(x1, x2, 0);
-#endif
-
- acc1 = __SMLADX(x3, y1, acc1);
-
- a = *pScr1;
- b = *(pScr1 + 1);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- x1 = __PKHBT(a, b, 16);
-#else
- x1 = __PKHBT(b, a, 16);
-#endif
-
- acc0 = __SMLAD(x2, y2, acc0);
-
- acc2 = __SMLAD(x1, y2, acc2);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- x3 = __PKHBT(x1, x2, 0);
-#else
- x3 = __PKHBT(x2, x1, 0);
-#endif
-
- acc3 = __SMLADX(x3, y1, acc3);
-
- acc1 = __SMLADX(x3, y2, acc1);
-
- a = *(pScr1 + 2);
- b = *(pScr1 + 3);
-
-#ifndef ARM_MATH_BIG_ENDIAN
- x2 = __PKHBT(a, b, 16);
-#else
- x2 = __PKHBT(b, a, 16);
-#endif
+ x2 = read_q15x2_ia (&pScr1);
#ifndef ARM_MATH_BIG_ENDIAN
x3 = __PKHBT(x2, x1, 0);
@@ -409,14 +261,7 @@ void arm_conv_fast_opt_q15(
acc3 = __SMLADX(x3, y2, acc3);
-#endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
-
- /* update scratch pointers */
- pIn2 += 4U;
- pScr1 += 4U;
-
-
- /* Decrement the loop counter */
+ /* Decrement loop counter */
tapCnt--;
}
@@ -428,7 +273,6 @@ void arm_conv_fast_opt_q15(
while (tapCnt > 0U)
{
-
/* accumlate the results */
acc0 += (*pScr1++ * *pIn2);
acc1 += (*pScr1++ * *pIn2);
@@ -437,46 +281,37 @@ void arm_conv_fast_opt_q15(
pScr1 -= 3U;
- /* Decrement the loop counter */
+ /* Decrement loop counter */
tapCnt--;
}
blkCnt--;
-
/* Store the results in the accumulators in the destination buffer. */
-
#ifndef ARM_MATH_BIG_ENDIAN
-
- *__SIMD32(pOut)++ =
- __PKHBT(__SSAT((acc0 >> 15), 16), __SSAT((acc1 >> 15), 16), 16);
-
- *__SIMD32(pOut)++ =
- __PKHBT(__SSAT((acc2 >> 15), 16), __SSAT((acc3 >> 15), 16), 16);
-
-
+ write_q15x2_ia (&pOut, __PKHBT(__SSAT((acc0 >> 15), 16), __SSAT((acc1 >> 15), 16), 16));
+ write_q15x2_ia (&pOut, __PKHBT(__SSAT((acc2 >> 15), 16), __SSAT((acc3 >> 15), 16), 16));
#else
-
- *__SIMD32(pOut)++ =
- __PKHBT(__SSAT((acc1 >> 15), 16), __SSAT((acc0 >> 15), 16), 16);
-
- *__SIMD32(pOut)++ =
- __PKHBT(__SSAT((acc3 >> 15), 16), __SSAT((acc2 >> 15), 16), 16);
-
-
-
-#endif /* #ifndef ARM_MATH_BIG_ENDIAN */
+ write_q15x2_ia (&pOut, __PKHBT(__SSAT((acc1 >> 15), 16), __SSAT((acc0 >> 15), 16), 16));
+ write_q15x2_ia (&pOut, __PKHBT(__SSAT((acc3 >> 15), 16), __SSAT((acc2 >> 15), 16), 16));
+#endif /* #ifndef ARM_MATH_BIG_ENDIAN */
/* Initialization of inputB pointer */
pIn2 = py;
pScratch1 += 4U;
-
}
-
+ /* Loop unrolling: Compute remaining outputs */
blkCnt = (srcALen + srcBLen - 1U) & 0x3;
+#else
+
+ /* Initialize blkCnt with number of samples */
+ blkCnt = (srcALen + srcBLen - 1U);
+
+#endif /* #if defined (ARM_MATH_LOOPUNROLL) */
+
/* Calculate convolution for remaining samples of Bigger length sequence */
while (blkCnt > 0)
{
@@ -491,10 +326,11 @@ void arm_conv_fast_opt_q15(
while (tapCnt > 0U)
{
+ /* Read next two samples from scratch1 buffer */
acc0 += (*pScr1++ * *pIn2++);
acc0 += (*pScr1++ * *pIn2++);
- /* Decrement the loop counter */
+ /* Decrement loop counter */
tapCnt--;
}
@@ -507,25 +343,24 @@ void arm_conv_fast_opt_q15(
/* accumlate the results */
acc0 += (*pScr1++ * *pIn2++);
- /* Decrement the loop counter */
+ /* Decrement loop counter */
tapCnt--;
}
blkCnt--;
/* The result is in 2.30 format. Convert to 1.15 with saturation.
- ** Then store the output in the destination buffer. */
+ Then store the output in the destination buffer. */
*pOut++ = (q15_t) (__SSAT((acc0 >> 15), 16));
/* Initialization of inputB pointer */
pIn2 = py;
pScratch1 += 1U;
-
}
}
/**
- * @} end of Conv group
+ @} end of Conv group
*/