mbed official / mbed-dsp

CMSIS DSP library

Dependents:   performance_timer Surfboard_ gps2rtty Capstone ... more

Legacy Warning

This is an mbed 2 library. To learn more about mbed OS 5, visit the docs.

cmsis_dsp/StatisticsFunctions/arm_min_f32.c@5:3762170b6d4d, 2015-11-20 (annotated)

Committer:
mbed_official
Date:
Fri Nov 20 08:45:18 2015 +0000
Revision:
5:3762170b6d4d
Parent:
3:7a284390b0ce 
Synchronized with git revision 2eb940b9a73af188d3004a2575fdfbb05febe62b



Full URL: https://github.com/mbedmicro/mbed/commit/2eb940b9a73af188d3004a2575fdfbb05febe62b/



Added option to build rpc library. closes #1426

Who changed what in which revision?

UserRevisionLine numberNew contents of line
emilmont 1:fdd22bb7aa52 1 /* ----------------------------------------------------------------------
mbed_official 5:3762170b6d4d 2 * Copyright (C) 2010-2014 ARM Limited. All rights reserved.
emilmont 1:fdd22bb7aa52 3 *
mbed_official 5:3762170b6d4d 4 * $Date: 19. March 2015
mbed_official 5:3762170b6d4d 5 * $Revision: V.1.4.5
emilmont 1:fdd22bb7aa52 6 *
emilmont 2:da51fb522205 7 * Project: CMSIS DSP Library
emilmont 2:da51fb522205 8 * Title: arm_min_f32.c
emilmont 1:fdd22bb7aa52 9 *
emilmont 2:da51fb522205 10 * Description: Minimum value of a floating-point vector.
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 groupStats
emilmont 1:fdd22bb7aa52 45 */
emilmont 1:fdd22bb7aa52 46
emilmont 1:fdd22bb7aa52 47 /**
emilmont 1:fdd22bb7aa52 48 * @defgroup Min Minimum
emilmont 1:fdd22bb7aa52 49 *
emilmont 1:fdd22bb7aa52 50 * Computes the minimum value of an array of data.
emilmont 1:fdd22bb7aa52 51 * The function returns both the minimum value and its position within the array.
emilmont 1:fdd22bb7aa52 52 * There are separate functions for floating-point, Q31, Q15, and Q7 data types.
emilmont 1:fdd22bb7aa52 53 */
emilmont 1:fdd22bb7aa52 54
emilmont 1:fdd22bb7aa52 55 /**
emilmont 1:fdd22bb7aa52 56 * @addtogroup Min
emilmont 1:fdd22bb7aa52 57 * @{
emilmont 1:fdd22bb7aa52 58 */
emilmont 1:fdd22bb7aa52 59
emilmont 1:fdd22bb7aa52 60
emilmont 1:fdd22bb7aa52 61 /**
emilmont 1:fdd22bb7aa52 62 * @brief Minimum value of a floating-point vector.
emilmont 1:fdd22bb7aa52 63 * @param[in] *pSrc points to the input vector
emilmont 1:fdd22bb7aa52 64 * @param[in] blockSize length of the input vector
emilmont 1:fdd22bb7aa52 65 * @param[out] *pResult minimum value returned here
emilmont 1:fdd22bb7aa52 66 * @param[out] *pIndex index of minimum value returned here
emilmont 1:fdd22bb7aa52 67 * @return none.
emilmont 1:fdd22bb7aa52 68 *
emilmont 1:fdd22bb7aa52 69 */
emilmont 1:fdd22bb7aa52 70
emilmont 1:fdd22bb7aa52 71 void arm_min_f32(
emilmont 1:fdd22bb7aa52 72 float32_t * pSrc,
emilmont 1:fdd22bb7aa52 73 uint32_t blockSize,
emilmont 1:fdd22bb7aa52 74 float32_t * pResult,
emilmont 1:fdd22bb7aa52 75 uint32_t * pIndex)
emilmont 1:fdd22bb7aa52 76 {
mbed_official 3:7a284390b0ce 77 #ifndef ARM_MATH_CM0_FAMILY
emilmont 1:fdd22bb7aa52 78
emilmont 1:fdd22bb7aa52 79 /* Run the below code for Cortex-M4 and Cortex-M3 */
emilmont 1:fdd22bb7aa52 80
emilmont 1:fdd22bb7aa52 81 float32_t minVal1, minVal2, out; /* Temporary variables to store the output value. */
emilmont 1:fdd22bb7aa52 82 uint32_t blkCnt, outIndex, count; /* loop counter */
emilmont 1:fdd22bb7aa52 83
emilmont 1:fdd22bb7aa52 84 /* Initialise the count value. */
emilmont 1:fdd22bb7aa52 85 count = 0u;
emilmont 1:fdd22bb7aa52 86 /* Initialise the index value to zero. */
emilmont 1:fdd22bb7aa52 87 outIndex = 0u;
emilmont 1:fdd22bb7aa52 88 /* Load first input value that act as reference value for comparision */
emilmont 1:fdd22bb7aa52 89 out = *pSrc++;
emilmont 1:fdd22bb7aa52 90
emilmont 1:fdd22bb7aa52 91 /* Loop unrolling */
emilmont 1:fdd22bb7aa52 92 blkCnt = (blockSize - 1u) >> 2u;
emilmont 1:fdd22bb7aa52 93
emilmont 1:fdd22bb7aa52 94 while(blkCnt > 0)
emilmont 1:fdd22bb7aa52 95 {
emilmont 1:fdd22bb7aa52 96 /* Initialize minVal to the next consecutive values one by one */
emilmont 1:fdd22bb7aa52 97 minVal1 = *pSrc++;
emilmont 1:fdd22bb7aa52 98 minVal2 = *pSrc++;
emilmont 1:fdd22bb7aa52 99
emilmont 1:fdd22bb7aa52 100 /* compare for the minimum value */
emilmont 1:fdd22bb7aa52 101 if(out > minVal1)
emilmont 1:fdd22bb7aa52 102 {
emilmont 1:fdd22bb7aa52 103 /* Update the minimum value and its index */
emilmont 1:fdd22bb7aa52 104 out = minVal1;
emilmont 1:fdd22bb7aa52 105 outIndex = count + 1u;
emilmont 1:fdd22bb7aa52 106 }
emilmont 1:fdd22bb7aa52 107
emilmont 1:fdd22bb7aa52 108 minVal1 = *pSrc++;
emilmont 1:fdd22bb7aa52 109
emilmont 1:fdd22bb7aa52 110 /* compare for the minimum value */
emilmont 1:fdd22bb7aa52 111 if(out > minVal2)
emilmont 1:fdd22bb7aa52 112 {
emilmont 1:fdd22bb7aa52 113 /* Update the minimum value and its index */
emilmont 1:fdd22bb7aa52 114 out = minVal2;
emilmont 1:fdd22bb7aa52 115 outIndex = count + 2u;
emilmont 1:fdd22bb7aa52 116 }
emilmont 1:fdd22bb7aa52 117
emilmont 1:fdd22bb7aa52 118 minVal2 = *pSrc++;
emilmont 1:fdd22bb7aa52 119
emilmont 1:fdd22bb7aa52 120 /* compare for the minimum value */
emilmont 1:fdd22bb7aa52 121 if(out > minVal1)
emilmont 1:fdd22bb7aa52 122 {
emilmont 1:fdd22bb7aa52 123 /* Update the minimum value and its index */
emilmont 1:fdd22bb7aa52 124 out = minVal1;
emilmont 1:fdd22bb7aa52 125 outIndex = count + 3u;
emilmont 1:fdd22bb7aa52 126 }
emilmont 1:fdd22bb7aa52 127
emilmont 1:fdd22bb7aa52 128 /* compare for the minimum value */
emilmont 1:fdd22bb7aa52 129 if(out > minVal2)
emilmont 1:fdd22bb7aa52 130 {
emilmont 1:fdd22bb7aa52 131 /* Update the minimum value and its index */
emilmont 1:fdd22bb7aa52 132 out = minVal2;
emilmont 1:fdd22bb7aa52 133 outIndex = count + 4u;
emilmont 1:fdd22bb7aa52 134 }
emilmont 1:fdd22bb7aa52 135
emilmont 1:fdd22bb7aa52 136 count += 4u;
emilmont 1:fdd22bb7aa52 137
emilmont 1:fdd22bb7aa52 138 blkCnt--;
emilmont 1:fdd22bb7aa52 139 }
emilmont 1:fdd22bb7aa52 140
emilmont 1:fdd22bb7aa52 141 /* if (blockSize - 1u ) is not multiple of 4 */
emilmont 1:fdd22bb7aa52 142 blkCnt = (blockSize - 1u) % 4u;
emilmont 1:fdd22bb7aa52 143
emilmont 1:fdd22bb7aa52 144 #else
emilmont 1:fdd22bb7aa52 145
emilmont 1:fdd22bb7aa52 146 /* Run the below code for Cortex-M0 */
emilmont 1:fdd22bb7aa52 147 float32_t minVal1, out; /* Temporary variables to store the output value. */
emilmont 1:fdd22bb7aa52 148 uint32_t blkCnt, outIndex; /* loop counter */
emilmont 1:fdd22bb7aa52 149
emilmont 1:fdd22bb7aa52 150 /* Initialise the index value to zero. */
emilmont 1:fdd22bb7aa52 151 outIndex = 0u;
emilmont 1:fdd22bb7aa52 152 /* Load first input value that act as reference value for comparision */
emilmont 1:fdd22bb7aa52 153 out = *pSrc++;
emilmont 1:fdd22bb7aa52 154
emilmont 1:fdd22bb7aa52 155 blkCnt = (blockSize - 1u);
emilmont 1:fdd22bb7aa52 156
mbed_official 3:7a284390b0ce 157 #endif // #ifndef ARM_MATH_CM0_FAMILY
emilmont 1:fdd22bb7aa52 158
emilmont 1:fdd22bb7aa52 159 while(blkCnt > 0)
emilmont 1:fdd22bb7aa52 160 {
emilmont 1:fdd22bb7aa52 161 /* Initialize minVal to the next consecutive values one by one */
emilmont 1:fdd22bb7aa52 162 minVal1 = *pSrc++;
emilmont 1:fdd22bb7aa52 163
emilmont 1:fdd22bb7aa52 164 /* compare for the minimum value */
emilmont 1:fdd22bb7aa52 165 if(out > minVal1)
emilmont 1:fdd22bb7aa52 166 {
emilmont 1:fdd22bb7aa52 167 /* Update the minimum value and it's index */
emilmont 1:fdd22bb7aa52 168 out = minVal1;
emilmont 1:fdd22bb7aa52 169 outIndex = blockSize - blkCnt;
emilmont 1:fdd22bb7aa52 170 }
emilmont 1:fdd22bb7aa52 171
emilmont 1:fdd22bb7aa52 172 blkCnt--;
emilmont 1:fdd22bb7aa52 173
emilmont 1:fdd22bb7aa52 174 }
emilmont 1:fdd22bb7aa52 175
emilmont 1:fdd22bb7aa52 176 /* Store the minimum value and it's index into destination pointers */
emilmont 1:fdd22bb7aa52 177 *pResult = out;
emilmont 1:fdd22bb7aa52 178 *pIndex = outIndex;
emilmont 1:fdd22bb7aa52 179 }
emilmont 1:fdd22bb7aa52 180
emilmont 1:fdd22bb7aa52 181 /**
emilmont 1:fdd22bb7aa52 182 * @} end of Min group
emilmont 1:fdd22bb7aa52 183 */