mirror of
https://github.com/IcedRooibos/py32f0-template.git
synced 2025-10-31 09:52:05 -07:00
155 lines
5.2 KiB
C
155 lines
5.2 KiB
C
/* ----------------------------------------------------------------------
|
|
* Copyright (C) 2010-2014 ARM Limited. All rights reserved.
|
|
*
|
|
* $Date: 19. October 2015
|
|
* $Revision: V.1.4.5 a
|
|
*
|
|
* Project: CMSIS DSP Library
|
|
* Title: arm_mult_q15.c
|
|
*
|
|
* Description: Q15 vector multiplication.
|
|
*
|
|
* Target Processor: Cortex-M4/Cortex-M3/Cortex-M0
|
|
*
|
|
* Redistribution and use in source and binary forms, with or without
|
|
* modification, are permitted provided that the following conditions
|
|
* are met:
|
|
* - Redistributions of source code must retain the above copyright
|
|
* notice, this list of conditions and the following disclaimer.
|
|
* - Redistributions in binary form must reproduce the above copyright
|
|
* notice, this list of conditions and the following disclaimer in
|
|
* the documentation and/or other materials provided with the
|
|
* distribution.
|
|
* - Neither the name of ARM LIMITED nor the names of its contributors
|
|
* may be used to endorse or promote products derived from this
|
|
* software without specific prior written permission.
|
|
*
|
|
* THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
|
|
* "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
|
|
* LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
|
|
* FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
|
|
* COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
|
|
* INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
|
|
* BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
|
|
* LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
|
|
* CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
|
|
* ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
|
|
* POSSIBILITY OF SUCH DAMAGE.
|
|
* -------------------------------------------------------------------- */
|
|
|
|
#include "arm_math.h"
|
|
|
|
/**
|
|
* @ingroup groupMath
|
|
*/
|
|
|
|
/**
|
|
* @addtogroup BasicMult
|
|
* @{
|
|
*/
|
|
|
|
|
|
/**
|
|
* @brief Q15 vector multiplication
|
|
* @param[in] *pSrcA points to the first input vector
|
|
* @param[in] *pSrcB points to the second input vector
|
|
* @param[out] *pDst points to the output vector
|
|
* @param[in] blockSize number of samples in each vector
|
|
* @return none.
|
|
*
|
|
* <b>Scaling and Overflow Behavior:</b>
|
|
* \par
|
|
* The function uses saturating arithmetic.
|
|
* Results outside of the allowable Q15 range [0x8000 0x7FFF] will be saturated.
|
|
*/
|
|
|
|
void arm_mult_q15(
|
|
q15_t * pSrcA,
|
|
q15_t * pSrcB,
|
|
q15_t * pDst,
|
|
uint32_t blockSize)
|
|
{
|
|
uint32_t blkCnt; /* loop counters */
|
|
|
|
#ifndef ARM_MATH_CM0_FAMILY
|
|
|
|
/* Run the below code for Cortex-M4 and Cortex-M3 */
|
|
q31_t inA1, inA2, inB1, inB2; /* temporary input variables */
|
|
q15_t out1, out2, out3, out4; /* temporary output variables */
|
|
q31_t mul1, mul2, mul3, mul4; /* temporary variables */
|
|
|
|
/* loop Unrolling */
|
|
blkCnt = blockSize >> 2u;
|
|
|
|
/* First part of the processing with loop unrolling. Compute 4 outputs at a time.
|
|
** a second loop below computes the remaining 1 to 3 samples. */
|
|
while(blkCnt > 0u)
|
|
{
|
|
/* read two samples at a time from sourceA */
|
|
inA1 = *__SIMD32(pSrcA)++;
|
|
/* read two samples at a time from sourceB */
|
|
inB1 = *__SIMD32(pSrcB)++;
|
|
/* read two samples at a time from sourceA */
|
|
inA2 = *__SIMD32(pSrcA)++;
|
|
/* read two samples at a time from sourceB */
|
|
inB2 = *__SIMD32(pSrcB)++;
|
|
|
|
/* multiply mul = sourceA * sourceB */
|
|
mul1 = (q31_t) ((q15_t) (inA1 >> 16) * (q15_t) (inB1 >> 16));
|
|
mul2 = (q31_t) ((q15_t) inA1 * (q15_t) inB1);
|
|
mul3 = (q31_t) ((q15_t) (inA2 >> 16) * (q15_t) (inB2 >> 16));
|
|
mul4 = (q31_t) ((q15_t) inA2 * (q15_t) inB2);
|
|
|
|
/* saturate result to 16 bit */
|
|
out1 = (q15_t) __SSAT(mul1 >> 15, 16);
|
|
out2 = (q15_t) __SSAT(mul2 >> 15, 16);
|
|
out3 = (q15_t) __SSAT(mul3 >> 15, 16);
|
|
out4 = (q15_t) __SSAT(mul4 >> 15, 16);
|
|
|
|
/* store the result */
|
|
#ifndef ARM_MATH_BIG_ENDIAN
|
|
|
|
*__SIMD32(pDst)++ = __PKHBT(out2, out1, 16);
|
|
*__SIMD32(pDst)++ = __PKHBT(out4, out3, 16);
|
|
|
|
#else
|
|
|
|
*__SIMD32(pDst)++ = __PKHBT(out2, out1, 16);
|
|
*__SIMD32(pDst)++ = __PKHBT(out4, out3, 16);
|
|
|
|
#endif /* #ifndef ARM_MATH_BIG_ENDIAN */
|
|
|
|
/* Decrement the blockSize loop counter */
|
|
blkCnt--;
|
|
}
|
|
|
|
/* If the blockSize is not a multiple of 4, compute any remaining output samples here.
|
|
** No loop unrolling is used. */
|
|
blkCnt = blockSize % 0x4u;
|
|
|
|
#else
|
|
|
|
/* Run the below code for Cortex-M0 */
|
|
|
|
/* Initialize blkCnt with number of samples */
|
|
blkCnt = blockSize;
|
|
|
|
#endif /* #ifndef ARM_MATH_CM0_FAMILY */
|
|
|
|
|
|
while(blkCnt > 0u)
|
|
{
|
|
/* C = A * B */
|
|
/* Multiply the inputs and store the result in the destination buffer */
|
|
*pDst++ = (q15_t) __SSAT((((q31_t) (*pSrcA++) * (*pSrcB++)) >> 15), 16);
|
|
|
|
/* Decrement the blockSize loop counter */
|
|
blkCnt--;
|
|
}
|
|
}
|
|
|
|
/**
|
|
* @} end of BasicMult group
|
|
*/
|