arm_mean_q31.c 3.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123
  1. /* ----------------------------------------------------------------------
  2. * Project: CMSIS DSP Library
  3. * Title: arm_mean_q31.c
  4. * Description: Mean value of a Q31 vector
  5. *
  6. * $Date: 27. January 2017
  7. * $Revision: V.1.5.1
  8. *
  9. * Target Processor: Cortex-M cores
  10. * -------------------------------------------------------------------- */
  11. /*
  12. * Copyright (C) 2010-2017 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 "arm_math.h"
  29. /**
  30. * @ingroup groupStats
  31. */
  32. /**
  33. * @addtogroup mean
  34. * @{
  35. */
  36. /**
  37. * @brief Mean value of a Q31 vector.
  38. * @param[in] *pSrc points to the input vector
  39. * @param[in] blockSize length of the input vector
  40. * @param[out] *pResult mean value returned here
  41. * @return none.
  42. *
  43. * @details
  44. * <b>Scaling and Overflow Behavior:</b>
  45. *\par
  46. * The function is implemented using a 64-bit internal accumulator.
  47. * The input is represented in 1.31 format and is accumulated in a 64-bit
  48. * accumulator in 33.31 format.
  49. * There is no risk of internal overflow with this approach, and the
  50. * full precision of intermediate result is preserved.
  51. * Finally, the accumulator is truncated to yield a result of 1.31 format.
  52. *
  53. */
  54. void arm_mean_q31(
  55. q31_t * pSrc,
  56. uint32_t blockSize,
  57. q31_t * pResult)
  58. {
  59. q63_t sum = 0; /* Temporary result storage */
  60. uint32_t blkCnt; /* loop counter */
  61. #if defined (ARM_MATH_DSP)
  62. /* Run the below code for Cortex-M4 and Cortex-M3 */
  63. q31_t in1, in2, in3, in4;
  64. /*loop Unrolling */
  65. blkCnt = blockSize >> 2U;
  66. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  67. ** a second loop below computes the remaining 1 to 3 samples. */
  68. while (blkCnt > 0U)
  69. {
  70. /* C = (A[0] + A[1] + A[2] + ... + A[blockSize-1]) */
  71. in1 = *pSrc++;
  72. in2 = *pSrc++;
  73. in3 = *pSrc++;
  74. in4 = *pSrc++;
  75. sum += in1;
  76. sum += in2;
  77. sum += in3;
  78. sum += in4;
  79. /* Decrement the loop counter */
  80. blkCnt--;
  81. }
  82. /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
  83. ** No loop unrolling is used. */
  84. blkCnt = blockSize % 0x4U;
  85. #else
  86. /* Run the below code for Cortex-M0 */
  87. /* Loop over blockSize number of values */
  88. blkCnt = blockSize;
  89. #endif /* #if defined (ARM_MATH_DSP) */
  90. while (blkCnt > 0U)
  91. {
  92. /* C = (A[0] + A[1] + A[2] + ... + A[blockSize-1]) */
  93. sum += *pSrc++;
  94. /* Decrement the loop counter */
  95. blkCnt--;
  96. }
  97. /* C = (A[0] + A[1] + A[2] + ... + A[blockSize-1]) / blockSize */
  98. /* Store the result to the destination */
  99. *pResult = (q31_t) (sum / (int32_t) blockSize);
  100. }
  101. /**
  102. * @} end of mean group
  103. */