arm_absmin_q31.c 14 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269
  1. /* ----------------------------------------------------------------------
  2. * Project: CMSIS DSP Library
  3. * Title: arm_absmin_q31.c
  4. * Description: Minimum value of absolute values of a Q31 vector
  5. *
  6. * $Date: 23 April 2021
  7. * $Revision: V1.9.0
  8. *
  9. * Target Processor: Cortex-M and Cortex-A cores
  10. * -------------------------------------------------------------------- */
  11. /*
  12. * Copyright (C) 2010-2021 ARM Limited or its affiliates. All rights reserved.
  13. *
  14. * SPDX-License-Identifier: Apache-2.0
  15. *
  16. * Licensed under the Apache License, Version 2.0 (the License); you may
  17. * not use this file except in compliance with the License.
  18. * You may obtain a copy of the License at
  19. *
  20. * www.apache.org/licenses/LICENSE-2.0
  21. *
  22. * Unless required by applicable law or agreed to in writing, software
  23. * distributed under the License is distributed on an AS IS BASIS, WITHOUT
  24. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  25. * See the License for the specific language governing permissions and
  26. * limitations under the License.
  27. */
  28. #include "dsp/statistics_functions.h"
  29. /**
  30. @ingroup groupStats
  31. */
  32. /**
  33. @addtogroup AbsMin
  34. @{
  35. */
  36. /**
  37. @brief Minimum value of absolute values of a Q31 vector.
  38. @param[in] pSrc points to the input vector
  39. @param[in] blockSize number of samples in input vector
  40. @param[out] pResult minimum value returned here
  41. @param[out] pIndex index of minimum value returned here
  42. @return none
  43. */
  44. #if defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE)
  45. #include "arm_helium_utils.h"
  46. void arm_absmin_q31(
  47. const q31_t * pSrc,
  48. uint32_t blockSize,
  49. q31_t * pResult,
  50. uint32_t * pIndex)
  51. {
  52. uint16_t blkCnt; /* loop counters */
  53. q31x4_t vecSrc;
  54. q31_t const *pSrcVec;
  55. q31x4_t curExtremValVec = vdupq_n_s32(Q31_ABSMAX);
  56. q31_t minValue = Q31_ABSMAX;
  57. uint16_t idx = blockSize;
  58. uint32x4_t indexVec;
  59. uint32x4_t curExtremIdxVec;
  60. uint32_t startIdx = 0;
  61. mve_pred16_t p0;
  62. indexVec = vidupq_wb_u32(&startIdx, 1);
  63. curExtremIdxVec = vdupq_n_u32(0);
  64. pSrcVec = (q31_t const *) pSrc;
  65. blkCnt = blockSize >> 2;
  66. while (blkCnt > 0U)
  67. {
  68. vecSrc = vldrwq_s32(pSrcVec);
  69. pSrcVec += 4;
  70. vecSrc = vabsq(vecSrc);
  71. /*
  72. * Get current min per lane and current index per lane
  73. * when a min is selected
  74. */
  75. p0 = vcmpleq(vecSrc, curExtremValVec);
  76. curExtremValVec = vpselq(vecSrc, curExtremValVec, p0);
  77. curExtremIdxVec = vpselq(indexVec, curExtremIdxVec, p0);
  78. indexVec = vidupq_wb_u32(&startIdx, 1);
  79. /*
  80. * Decrement the blockSize loop counter
  81. */
  82. blkCnt--;
  83. }
  84. /*
  85. * tail
  86. * (will be merged thru tail predication)
  87. */
  88. blkCnt = blockSize & 3;
  89. if (blkCnt > 0U)
  90. {
  91. vecSrc = vldrwq_s32(pSrcVec);
  92. pSrcVec += 4;
  93. vecSrc = vabsq(vecSrc);
  94. p0 = vctp32q(blkCnt);
  95. /*
  96. * Get current min per lane and current index per lane
  97. * when a min is selected
  98. */
  99. p0 = vcmpleq_m(vecSrc, curExtremValVec, p0);
  100. curExtremValVec = vpselq(vecSrc, curExtremValVec, p0);
  101. curExtremIdxVec = vpselq(indexVec, curExtremIdxVec, p0);
  102. }
  103. /*
  104. * Get min value across the vector
  105. */
  106. minValue = vminvq(minValue, curExtremValVec);
  107. /*
  108. * set index for lower values to min possible index
  109. */
  110. p0 = vcmpleq(curExtremValVec, minValue);
  111. indexVec = vpselq(curExtremIdxVec, vdupq_n_u32(blockSize), p0);
  112. /*
  113. * Get min index which is thus for a min value
  114. */
  115. idx = vminvq(idx, indexVec);
  116. /*
  117. * Save result
  118. */
  119. *pIndex = idx;
  120. *pResult = minValue;
  121. }
  122. #else
  123. #if defined(ARM_MATH_DSP)
  124. void arm_absmin_q31(
  125. const q31_t * pSrc,
  126. uint32_t blockSize,
  127. q31_t * pResult,
  128. uint32_t * pIndex)
  129. {
  130. q31_t cur_absmin, out; /* Temporary variables to store the output value. */\
  131. uint32_t blkCnt, outIndex; /* Loop counter */ \
  132. uint32_t index; /* index of maximum value */ \
  133. \
  134. /* Initialize index value to zero. */ \
  135. outIndex = 0U; \
  136. /* Load first input value that act as reference value for comparision */ \
  137. out = *pSrc++; \
  138. out = (out > 0) ? out : (q31_t)__QSUB(0, out); \
  139. /* Initialize index of extrema value. */ \
  140. index = 0U; \
  141. \
  142. /* Loop unrolling: Compute 4 outputs at a time */ \
  143. blkCnt = (blockSize - 1U) >> 2U; \
  144. \
  145. while (blkCnt > 0U) \
  146. { \
  147. /* Initialize cur_absmin to next consecutive values one by one */ \
  148. cur_absmin = *pSrc++; \
  149. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q31_t)__QSUB(0, cur_absmin); \
  150. /* compare for the extrema value */ \
  151. if (cur_absmin < out) \
  152. { \
  153. /* Update the extrema value and it's index */ \
  154. out = cur_absmin; \
  155. outIndex = index + 1U; \
  156. } \
  157. \
  158. cur_absmin = *pSrc++; \
  159. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q31_t)__QSUB(0, cur_absmin); \
  160. if (cur_absmin < out) \
  161. { \
  162. out = cur_absmin; \
  163. outIndex = index + 2U; \
  164. } \
  165. \
  166. cur_absmin = *pSrc++; \
  167. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q31_t)__QSUB(0, cur_absmin); \
  168. if (cur_absmin < out) \
  169. { \
  170. out = cur_absmin; \
  171. outIndex = index + 3U; \
  172. } \
  173. \
  174. cur_absmin = *pSrc++; \
  175. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q31_t)__QSUB(0, cur_absmin); \
  176. if (cur_absmin < out) \
  177. { \
  178. out = cur_absmin; \
  179. outIndex = index + 4U; \
  180. } \
  181. \
  182. index += 4U; \
  183. \
  184. /* Decrement loop counter */ \
  185. blkCnt--; \
  186. } \
  187. \
  188. /* Loop unrolling: Compute remaining outputs */ \
  189. blkCnt = (blockSize - 1U) % 4U; \
  190. \
  191. \
  192. while (blkCnt > 0U) \
  193. { \
  194. cur_absmin = *pSrc++; \
  195. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q31_t)__QSUB(0, cur_absmin); \
  196. if (cur_absmin < out) \
  197. { \
  198. out = cur_absmin; \
  199. outIndex = blockSize - blkCnt; \
  200. } \
  201. \
  202. /* Decrement loop counter */ \
  203. blkCnt--; \
  204. } \
  205. \
  206. /* Store the extrema value and it's index into destination pointers */ \
  207. *pResult = out; \
  208. *pIndex = outIndex;
  209. }
  210. #else
  211. void arm_absmin_q31(
  212. const q31_t * pSrc,
  213. uint32_t blockSize,
  214. q31_t * pResult,
  215. uint32_t * pIndex)
  216. {
  217. q31_t minVal, out; /* Temporary variables to store the output value. */
  218. uint32_t blkCnt, outIndex; /* Loop counter */
  219. /* Initialise index value to zero. */
  220. outIndex = 0U;
  221. /* Load first input value that act as reference value for comparision */
  222. out = (*pSrc > 0) ? *pSrc : ((*pSrc == INT32_MIN) ? INT32_MAX : -*pSrc);
  223. pSrc++;
  224. /* Initialize blkCnt with number of samples */
  225. blkCnt = (blockSize - 1U);
  226. while (blkCnt > 0U)
  227. {
  228. /* Initialize minVal to the next consecutive values one by one */
  229. minVal = (*pSrc > 0) ? *pSrc : ((*pSrc == INT32_MIN) ? INT32_MAX : -*pSrc);
  230. pSrc++;
  231. /* compare for the minimum value */
  232. if (out > minVal)
  233. {
  234. /* Update the minimum value and it's index */
  235. out = minVal;
  236. outIndex = blockSize - blkCnt;
  237. }
  238. /* Decrement loop counter */
  239. blkCnt--;
  240. }
  241. /* Store the minimum value and it's index into destination pointers */
  242. *pResult = out;
  243. *pIndex = outIndex;
  244. }
  245. #endif /* defined(ARM_MATH_DSP) */
  246. #endif /* defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE) */
  247. /**
  248. @} end of AbsMin group
  249. */