mbed-os 6.10 versione
cmsis_dsp/BasicMathFunctions/arm_mult_q31.c@3:7a284390b0ce, 2013-11-08 (annotated)
- Committer:
- mbed_official
- Date:
- Fri Nov 08 13:45:10 2013 +0000
- Revision:
- 3:7a284390b0ce
- Parent:
- 2:da51fb522205
Synchronized with git revision e69956aba2f68a2a26ac26b051f8d349deaa1ce8
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
emilmont | 1:fdd22bb7aa52 | 1 | /* ---------------------------------------------------------------------- |
mbed_official | 3:7a284390b0ce | 2 | * Copyright (C) 2010-2013 ARM Limited. All rights reserved. |
emilmont | 1:fdd22bb7aa52 | 3 | * |
mbed_official | 3:7a284390b0ce | 4 | * $Date: 17. January 2013 |
mbed_official | 3:7a284390b0ce | 5 | * $Revision: V1.4.1 |
emilmont | 1:fdd22bb7aa52 | 6 | * |
emilmont | 2:da51fb522205 | 7 | * Project: CMSIS DSP Library |
emilmont | 2:da51fb522205 | 8 | * Title: arm_mult_q31.c |
emilmont | 1:fdd22bb7aa52 | 9 | * |
emilmont | 2:da51fb522205 | 10 | * Description: Q31 vector multiplication. |
emilmont | 1:fdd22bb7aa52 | 11 | * |
emilmont | 1:fdd22bb7aa52 | 12 | * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0 |
emilmont | 1:fdd22bb7aa52 | 13 | * |
mbed_official | 3:7a284390b0ce | 14 | * Redistribution and use in source and binary forms, with or without |
mbed_official | 3:7a284390b0ce | 15 | * modification, are permitted provided that the following conditions |
mbed_official | 3:7a284390b0ce | 16 | * are met: |
mbed_official | 3:7a284390b0ce | 17 | * - Redistributions of source code must retain the above copyright |
mbed_official | 3:7a284390b0ce | 18 | * notice, this list of conditions and the following disclaimer. |
mbed_official | 3:7a284390b0ce | 19 | * - Redistributions in binary form must reproduce the above copyright |
mbed_official | 3:7a284390b0ce | 20 | * notice, this list of conditions and the following disclaimer in |
mbed_official | 3:7a284390b0ce | 21 | * the documentation and/or other materials provided with the |
mbed_official | 3:7a284390b0ce | 22 | * distribution. |
mbed_official | 3:7a284390b0ce | 23 | * - Neither the name of ARM LIMITED nor the names of its contributors |
mbed_official | 3:7a284390b0ce | 24 | * may be used to endorse or promote products derived from this |
mbed_official | 3:7a284390b0ce | 25 | * software without specific prior written permission. |
mbed_official | 3:7a284390b0ce | 26 | * |
mbed_official | 3:7a284390b0ce | 27 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
mbed_official | 3:7a284390b0ce | 28 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
mbed_official | 3:7a284390b0ce | 29 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
mbed_official | 3:7a284390b0ce | 30 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
mbed_official | 3:7a284390b0ce | 31 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
mbed_official | 3:7a284390b0ce | 32 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
mbed_official | 3:7a284390b0ce | 33 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
mbed_official | 3:7a284390b0ce | 34 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
mbed_official | 3:7a284390b0ce | 35 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
mbed_official | 3:7a284390b0ce | 36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
mbed_official | 3:7a284390b0ce | 37 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
mbed_official | 3:7a284390b0ce | 38 | * POSSIBILITY OF SUCH DAMAGE. |
emilmont | 1:fdd22bb7aa52 | 39 | * -------------------------------------------------------------------- */ |
emilmont | 1:fdd22bb7aa52 | 40 | |
emilmont | 1:fdd22bb7aa52 | 41 | #include "arm_math.h" |
emilmont | 1:fdd22bb7aa52 | 42 | |
emilmont | 1:fdd22bb7aa52 | 43 | /** |
emilmont | 1:fdd22bb7aa52 | 44 | * @ingroup groupMath |
emilmont | 1:fdd22bb7aa52 | 45 | */ |
emilmont | 1:fdd22bb7aa52 | 46 | |
emilmont | 1:fdd22bb7aa52 | 47 | /** |
emilmont | 1:fdd22bb7aa52 | 48 | * @addtogroup BasicMult |
emilmont | 1:fdd22bb7aa52 | 49 | * @{ |
emilmont | 1:fdd22bb7aa52 | 50 | */ |
emilmont | 1:fdd22bb7aa52 | 51 | |
emilmont | 1:fdd22bb7aa52 | 52 | /** |
emilmont | 1:fdd22bb7aa52 | 53 | * @brief Q31 vector multiplication. |
emilmont | 1:fdd22bb7aa52 | 54 | * @param[in] *pSrcA points to the first input vector |
emilmont | 1:fdd22bb7aa52 | 55 | * @param[in] *pSrcB points to the second input vector |
emilmont | 1:fdd22bb7aa52 | 56 | * @param[out] *pDst points to the output vector |
emilmont | 1:fdd22bb7aa52 | 57 | * @param[in] blockSize number of samples in each vector |
emilmont | 1:fdd22bb7aa52 | 58 | * @return none. |
emilmont | 1:fdd22bb7aa52 | 59 | * |
emilmont | 1:fdd22bb7aa52 | 60 | * <b>Scaling and Overflow Behavior:</b> |
emilmont | 1:fdd22bb7aa52 | 61 | * \par |
emilmont | 1:fdd22bb7aa52 | 62 | * The function uses saturating arithmetic. |
emilmont | 1:fdd22bb7aa52 | 63 | * Results outside of the allowable Q31 range[0x80000000 0x7FFFFFFF] will be saturated. |
emilmont | 1:fdd22bb7aa52 | 64 | */ |
emilmont | 1:fdd22bb7aa52 | 65 | |
emilmont | 1:fdd22bb7aa52 | 66 | void arm_mult_q31( |
emilmont | 1:fdd22bb7aa52 | 67 | q31_t * pSrcA, |
emilmont | 1:fdd22bb7aa52 | 68 | q31_t * pSrcB, |
emilmont | 1:fdd22bb7aa52 | 69 | q31_t * pDst, |
emilmont | 1:fdd22bb7aa52 | 70 | uint32_t blockSize) |
emilmont | 1:fdd22bb7aa52 | 71 | { |
emilmont | 1:fdd22bb7aa52 | 72 | uint32_t blkCnt; /* loop counters */ |
emilmont | 1:fdd22bb7aa52 | 73 | |
mbed_official | 3:7a284390b0ce | 74 | #ifndef ARM_MATH_CM0_FAMILY |
emilmont | 1:fdd22bb7aa52 | 75 | |
emilmont | 1:fdd22bb7aa52 | 76 | /* Run the below code for Cortex-M4 and Cortex-M3 */ |
emilmont | 1:fdd22bb7aa52 | 77 | q31_t inA1, inA2, inA3, inA4; /* temporary input variables */ |
emilmont | 1:fdd22bb7aa52 | 78 | q31_t inB1, inB2, inB3, inB4; /* temporary input variables */ |
emilmont | 1:fdd22bb7aa52 | 79 | q31_t out1, out2, out3, out4; /* temporary output variables */ |
emilmont | 1:fdd22bb7aa52 | 80 | |
emilmont | 1:fdd22bb7aa52 | 81 | /* loop Unrolling */ |
emilmont | 1:fdd22bb7aa52 | 82 | blkCnt = blockSize >> 2u; |
emilmont | 1:fdd22bb7aa52 | 83 | |
emilmont | 1:fdd22bb7aa52 | 84 | /* First part of the processing with loop unrolling. Compute 4 outputs at a time. |
emilmont | 1:fdd22bb7aa52 | 85 | ** a second loop below computes the remaining 1 to 3 samples. */ |
emilmont | 1:fdd22bb7aa52 | 86 | while(blkCnt > 0u) |
emilmont | 1:fdd22bb7aa52 | 87 | { |
emilmont | 1:fdd22bb7aa52 | 88 | /* C = A * B */ |
emilmont | 1:fdd22bb7aa52 | 89 | /* Multiply the inputs and then store the results in the destination buffer. */ |
emilmont | 1:fdd22bb7aa52 | 90 | inA1 = *pSrcA++; |
emilmont | 1:fdd22bb7aa52 | 91 | inA2 = *pSrcA++; |
emilmont | 1:fdd22bb7aa52 | 92 | inA3 = *pSrcA++; |
emilmont | 1:fdd22bb7aa52 | 93 | inA4 = *pSrcA++; |
emilmont | 1:fdd22bb7aa52 | 94 | inB1 = *pSrcB++; |
emilmont | 1:fdd22bb7aa52 | 95 | inB2 = *pSrcB++; |
emilmont | 1:fdd22bb7aa52 | 96 | inB3 = *pSrcB++; |
emilmont | 1:fdd22bb7aa52 | 97 | inB4 = *pSrcB++; |
emilmont | 1:fdd22bb7aa52 | 98 | |
emilmont | 1:fdd22bb7aa52 | 99 | out1 = ((q63_t) inA1 * inB1) >> 32; |
emilmont | 1:fdd22bb7aa52 | 100 | out2 = ((q63_t) inA2 * inB2) >> 32; |
emilmont | 1:fdd22bb7aa52 | 101 | out3 = ((q63_t) inA3 * inB3) >> 32; |
emilmont | 1:fdd22bb7aa52 | 102 | out4 = ((q63_t) inA4 * inB4) >> 32; |
emilmont | 1:fdd22bb7aa52 | 103 | |
emilmont | 1:fdd22bb7aa52 | 104 | out1 = __SSAT(out1, 31); |
emilmont | 1:fdd22bb7aa52 | 105 | out2 = __SSAT(out2, 31); |
emilmont | 1:fdd22bb7aa52 | 106 | out3 = __SSAT(out3, 31); |
emilmont | 1:fdd22bb7aa52 | 107 | out4 = __SSAT(out4, 31); |
emilmont | 1:fdd22bb7aa52 | 108 | |
emilmont | 1:fdd22bb7aa52 | 109 | *pDst++ = out1 << 1u; |
emilmont | 1:fdd22bb7aa52 | 110 | *pDst++ = out2 << 1u; |
emilmont | 1:fdd22bb7aa52 | 111 | *pDst++ = out3 << 1u; |
emilmont | 1:fdd22bb7aa52 | 112 | *pDst++ = out4 << 1u; |
emilmont | 1:fdd22bb7aa52 | 113 | |
emilmont | 1:fdd22bb7aa52 | 114 | /* Decrement the blockSize loop counter */ |
emilmont | 1:fdd22bb7aa52 | 115 | blkCnt--; |
emilmont | 1:fdd22bb7aa52 | 116 | } |
emilmont | 1:fdd22bb7aa52 | 117 | |
emilmont | 1:fdd22bb7aa52 | 118 | /* If the blockSize is not a multiple of 4, compute any remaining output samples here. |
emilmont | 1:fdd22bb7aa52 | 119 | ** No loop unrolling is used. */ |
emilmont | 1:fdd22bb7aa52 | 120 | blkCnt = blockSize % 0x4u; |
emilmont | 1:fdd22bb7aa52 | 121 | |
emilmont | 1:fdd22bb7aa52 | 122 | #else |
emilmont | 1:fdd22bb7aa52 | 123 | |
emilmont | 1:fdd22bb7aa52 | 124 | /* Run the below code for Cortex-M0 */ |
emilmont | 1:fdd22bb7aa52 | 125 | |
emilmont | 1:fdd22bb7aa52 | 126 | /* Initialize blkCnt with number of samples */ |
emilmont | 1:fdd22bb7aa52 | 127 | blkCnt = blockSize; |
emilmont | 1:fdd22bb7aa52 | 128 | |
mbed_official | 3:7a284390b0ce | 129 | #endif /* #ifndef ARM_MATH_CM0_FAMILY */ |
emilmont | 1:fdd22bb7aa52 | 130 | |
emilmont | 1:fdd22bb7aa52 | 131 | while(blkCnt > 0u) |
emilmont | 1:fdd22bb7aa52 | 132 | { |
emilmont | 1:fdd22bb7aa52 | 133 | /* C = A * B */ |
emilmont | 1:fdd22bb7aa52 | 134 | /* Multiply the inputs and then store the results in the destination buffer. */ |
emilmont | 1:fdd22bb7aa52 | 135 | *pDst++ = |
emilmont | 1:fdd22bb7aa52 | 136 | (q31_t) clip_q63_to_q31(((q63_t) (*pSrcA++) * (*pSrcB++)) >> 31); |
emilmont | 1:fdd22bb7aa52 | 137 | |
emilmont | 1:fdd22bb7aa52 | 138 | /* Decrement the blockSize loop counter */ |
emilmont | 1:fdd22bb7aa52 | 139 | blkCnt--; |
emilmont | 1:fdd22bb7aa52 | 140 | } |
emilmont | 1:fdd22bb7aa52 | 141 | } |
emilmont | 1:fdd22bb7aa52 | 142 | |
emilmont | 1:fdd22bb7aa52 | 143 | /** |
emilmont | 1:fdd22bb7aa52 | 144 | * @} end of BasicMult group |
emilmont | 1:fdd22bb7aa52 | 145 | */ |