arm_absmin_q7.c 15 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322
  1. /* ----------------------------------------------------------------------
  2. * Project: CMSIS DSP Library
  3. * Title: arm_absmin_q7.c
  4. * Description: Minimum value of absolute values of a Q7 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 Q7 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 <stdint.h>
  46. #include "arm_helium_utils.h"
  47. #define MAX_BLKSZ_S8 (UINT8_MAX+1)
  48. static void arm_small_blk_absmin_q7(
  49. const q7_t *pSrc,
  50. uint32_t blockSize,
  51. q7_t *pResult,
  52. uint32_t *pIndex)
  53. {
  54. uint16_t blkCnt; /* loop counters */
  55. q7x16_t vecSrc;
  56. q7_t const *pSrcVec;
  57. q7x16_t curExtremValVec = vdupq_n_s8(Q7_ABSMAX);
  58. q7_t minValue = Q7_ABSMAX;
  59. uint16_t idx = blockSize - 1;
  60. uint8x16_t indexVec;
  61. uint8x16_t curExtremIdxVec;
  62. uint32_t startIdx = 0;
  63. mve_pred16_t p0;
  64. indexVec = vidupq_wb_u8(&startIdx, 1);
  65. curExtremIdxVec = vdupq_n_u8(0);
  66. pSrcVec = (q7_t const *) pSrc;
  67. blkCnt = blockSize >> 4;
  68. while (blkCnt > 0U)
  69. {
  70. vecSrc = vld1q(pSrcVec);
  71. pSrcVec += 16;
  72. vecSrc = vabsq(vecSrc);
  73. /*
  74. * Get current min per lane and current index per lane
  75. * when a min is selected
  76. */
  77. p0 = vcmpleq(vecSrc, curExtremValVec);
  78. curExtremValVec = vpselq(vecSrc, curExtremValVec, p0);
  79. curExtremIdxVec = vpselq(indexVec, curExtremIdxVec, p0);
  80. indexVec = vidupq_wb_u8(&startIdx, 1);
  81. /*
  82. * Decrement the blockSize loop counter
  83. */
  84. blkCnt--;
  85. }
  86. /*
  87. * tail
  88. * (will be merged thru tail predication)
  89. */
  90. blkCnt = blockSize & 0xF;
  91. if (blkCnt > 0U)
  92. {
  93. vecSrc = vld1q(pSrcVec);
  94. pSrcVec += 16;
  95. vecSrc = vabsq(vecSrc);
  96. p0 = vctp8q(blkCnt);
  97. /*
  98. * Get current min per lane and current index per lane
  99. * when a min is selected
  100. */
  101. p0 = vcmpleq_m(vecSrc, curExtremValVec, p0);
  102. curExtremValVec = vpselq(vecSrc, curExtremValVec, p0);
  103. curExtremIdxVec = vpselq(indexVec, curExtremIdxVec, p0);
  104. }
  105. /*
  106. * Get min value across the vector
  107. */
  108. minValue = vminvq(minValue, curExtremValVec);
  109. /*
  110. * set index for lower values to min possible index
  111. */
  112. p0 = vcmpleq(curExtremValVec, minValue);
  113. idx = vminvq_p_u8(idx, curExtremIdxVec, p0);
  114. /*
  115. * Save result
  116. */
  117. *pIndex = idx;
  118. *pResult = minValue;
  119. }
  120. void arm_absmin_q7(
  121. const q7_t * pSrc,
  122. uint32_t blockSize,
  123. q7_t * pResult,
  124. uint32_t * pIndex)
  125. {
  126. int32_t totalSize = blockSize;
  127. if (totalSize <= MAX_BLKSZ_S8)
  128. {
  129. arm_small_blk_absmin_q7(pSrc, blockSize, pResult, pIndex);
  130. }
  131. else
  132. {
  133. uint32_t curIdx = 0;
  134. q7_t curBlkExtr = Q7_MAX;
  135. uint32_t curBlkPos = 0;
  136. uint32_t curBlkIdx = 0;
  137. /*
  138. * process blocks of 255 elts
  139. */
  140. while (totalSize >= MAX_BLKSZ_S8)
  141. {
  142. const q7_t *curSrc = pSrc;
  143. arm_small_blk_absmin_q7(curSrc, MAX_BLKSZ_S8, pResult, pIndex);
  144. if (*pResult < curBlkExtr)
  145. {
  146. /*
  147. * update partial extrema
  148. */
  149. curBlkExtr = *pResult;
  150. curBlkPos = *pIndex;
  151. curBlkIdx = curIdx;
  152. }
  153. curIdx++;
  154. pSrc += MAX_BLKSZ_S8;
  155. totalSize -= MAX_BLKSZ_S8;
  156. }
  157. /*
  158. * remainder
  159. */
  160. arm_small_blk_absmin_q7(pSrc, totalSize, pResult, pIndex);
  161. if (*pResult < curBlkExtr)
  162. {
  163. curBlkExtr = *pResult;
  164. curBlkPos = *pIndex;
  165. curBlkIdx = curIdx;
  166. }
  167. *pIndex = curBlkIdx * MAX_BLKSZ_S8 + curBlkPos;
  168. *pResult = curBlkExtr;
  169. }
  170. }
  171. #else
  172. #if defined(ARM_MATH_DSP)
  173. void arm_absmin_q7(
  174. const q7_t * pSrc,
  175. uint32_t blockSize,
  176. q7_t * pResult,
  177. uint32_t * pIndex)
  178. {
  179. q7_t cur_absmin, out; /* Temporary variables to store the output value. */\
  180. uint32_t blkCnt, outIndex; /* Loop counter */ \
  181. uint32_t index; /* index of maximum value */ \
  182. \
  183. /* Initialize index value to zero. */ \
  184. outIndex = 0U; \
  185. /* Load first input value that act as reference value for comparision */ \
  186. out = *pSrc++; \
  187. out = (out > 0) ? out : (q7_t)__QSUB8(0, out); \
  188. /* Initialize index of extrema value. */ \
  189. index = 0U; \
  190. \
  191. /* Loop unrolling: Compute 4 outputs at a time */ \
  192. blkCnt = (blockSize - 1U) >> 2U; \
  193. \
  194. while (blkCnt > 0U) \
  195. { \
  196. /* Initialize cur_absmin to next consecutive values one by one */ \
  197. cur_absmin = *pSrc++; \
  198. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q7_t)__QSUB8(0, cur_absmin); \
  199. /* compare for the extrema value */ \
  200. if (cur_absmin < out) \
  201. { \
  202. /* Update the extrema value and it's index */ \
  203. out = cur_absmin; \
  204. outIndex = index + 1U; \
  205. } \
  206. \
  207. cur_absmin = *pSrc++; \
  208. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q7_t)__QSUB8(0, cur_absmin); \
  209. if (cur_absmin < out) \
  210. { \
  211. out = cur_absmin; \
  212. outIndex = index + 2U; \
  213. } \
  214. \
  215. cur_absmin = *pSrc++; \
  216. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q7_t)__QSUB8(0, cur_absmin); \
  217. if (cur_absmin < out) \
  218. { \
  219. out = cur_absmin; \
  220. outIndex = index + 3U; \
  221. } \
  222. \
  223. cur_absmin = *pSrc++; \
  224. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q7_t)__QSUB8(0, cur_absmin); \
  225. if (cur_absmin < out) \
  226. { \
  227. out = cur_absmin; \
  228. outIndex = index + 4U; \
  229. } \
  230. \
  231. index += 4U; \
  232. \
  233. /* Decrement loop counter */ \
  234. blkCnt--; \
  235. } \
  236. \
  237. /* Loop unrolling: Compute remaining outputs */ \
  238. blkCnt = (blockSize - 1U) % 4U; \
  239. \
  240. \
  241. while (blkCnt > 0U) \
  242. { \
  243. cur_absmin = *pSrc++; \
  244. cur_absmin = (cur_absmin > 0) ? cur_absmin : (q7_t)__QSUB8(0, cur_absmin); \
  245. if (cur_absmin < out) \
  246. { \
  247. out = cur_absmin; \
  248. outIndex = blockSize - blkCnt; \
  249. } \
  250. \
  251. /* Decrement loop counter */ \
  252. blkCnt--; \
  253. } \
  254. \
  255. /* Store the extrema value and it's index into destination pointers */ \
  256. *pResult = out; \
  257. *pIndex = outIndex;
  258. }
  259. #else
  260. void arm_absmin_q7(
  261. const q7_t * pSrc,
  262. uint32_t blockSize,
  263. q7_t * pResult,
  264. uint32_t * pIndex)
  265. {
  266. q7_t minVal, out; /* Temporary variables to store the output value. */
  267. uint32_t blkCnt, outIndex; /* Loop counter */
  268. /* Initialise index value to zero. */
  269. outIndex = 0U;
  270. /* Load first input value that act as reference value for comparision */
  271. out = (*pSrc > 0) ? *pSrc : ((*pSrc == (q7_t) 0x80) ? (q7_t) 0x7f : -*pSrc);
  272. pSrc++;
  273. /* Initialize blkCnt with number of samples */
  274. blkCnt = (blockSize - 1U);
  275. while (blkCnt > 0U)
  276. {
  277. /* Initialize minVal to the next consecutive values one by one */
  278. minVal = (*pSrc > 0) ? *pSrc : ((*pSrc == (q7_t) 0x80) ? (q7_t) 0x7f : -*pSrc);
  279. pSrc++;
  280. /* compare for the minimum value */
  281. if (out > minVal)
  282. {
  283. /* Update the minimum value and it's index */
  284. out = minVal;
  285. outIndex = blockSize - blkCnt;
  286. }
  287. /* Decrement loop counter */
  288. blkCnt--;
  289. }
  290. /* Store the minimum value and it's index into destination pointers */
  291. *pResult = out;
  292. *pIndex = outIndex;
  293. }
  294. #endif /* defined(ARM_MATH_DSP) */
  295. #endif /* defined(ARM_MATH_MVEI) && !defined(ARM_MATH_AUTOVECTORIZE) */
  296. /**
  297. @} end of AbsMin group
  298. */