arm_std_q15.c 6.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195
  1. /* ----------------------------------------------------------------------
  2. * Copyright (C) 2010-2014 ARM Limited. All rights reserved.
  3. *
  4. * $Date: 12. March 2014
  5. * $Revision: V1.4.4
  6. *
  7. * Project: CMSIS DSP Library
  8. * Title: arm_std_q15.c
  9. *
  10. * Description: Standard deviation of an array of Q15 type.
  11. *
  12. * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0
  13. *
  14. * Redistribution and use in source and binary forms, with or without
  15. * modification, are permitted provided that the following conditions
  16. * are met:
  17. * - Redistributions of source code must retain the above copyright
  18. * notice, this list of conditions and the following disclaimer.
  19. * - Redistributions in binary form must reproduce the above copyright
  20. * notice, this list of conditions and the following disclaimer in
  21. * the documentation and/or other materials provided with the
  22. * distribution.
  23. * - Neither the name of ARM LIMITED nor the names of its contributors
  24. * may be used to endorse or promote products derived from this
  25. * software without specific prior written permission.
  26. *
  27. * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
  28. * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
  29. * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
  30. * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
  31. * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
  32. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
  33. * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
  34. * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
  35. * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  36. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
  37. * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
  38. * POSSIBILITY OF SUCH DAMAGE.
  39. * -------------------------------------------------------------------- */
  40. #include "arm_math.h"
  41. /**
  42. * @ingroup groupStats
  43. */
  44. /**
  45. * @addtogroup STD
  46. * @{
  47. */
  48. /**
  49. * @brief Standard deviation of the elements of a Q15 vector.
  50. * @param[in] *pSrc points to the input vector
  51. * @param[in] blockSize length of the input vector
  52. * @param[out] *pResult standard deviation value returned here
  53. * @return none.
  54. *
  55. * @details
  56. * <b>Scaling and Overflow Behavior:</b>
  57. *
  58. * \par
  59. * The function is implemented using a 64-bit internal accumulator.
  60. * The input is represented in 1.15 format.
  61. * Intermediate multiplication yields a 2.30 format, and this
  62. * result is added without saturation to a 64-bit accumulator in 34.30 format.
  63. * With 33 guard bits in the accumulator, there is no risk of overflow, and the
  64. * full precision of the intermediate multiplication is preserved.
  65. * Finally, the 34.30 result is truncated to 34.15 format by discarding the lower
  66. * 15 bits, and then saturated to yield a result in 1.15 format.
  67. */
  68. void arm_std_q15(
  69. q15_t * pSrc,
  70. uint32_t blockSize,
  71. q15_t * pResult)
  72. {
  73. q31_t sum = 0; /* Accumulator */
  74. q31_t meanOfSquares, squareOfMean; /* square of mean and mean of square */
  75. uint32_t blkCnt; /* loop counter */
  76. q63_t sumOfSquares = 0; /* Accumulator */
  77. #ifndef ARM_MATH_CM0_FAMILY
  78. /* Run the below code for Cortex-M4 and Cortex-M3 */
  79. q31_t in; /* input value */
  80. q15_t in1; /* input value */
  81. if(blockSize == 1)
  82. {
  83. *pResult = 0;
  84. return;
  85. }
  86. /*loop Unrolling */
  87. blkCnt = blockSize >> 2u;
  88. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  89. ** a second loop below computes the remaining 1 to 3 samples. */
  90. while(blkCnt > 0u)
  91. {
  92. /* C = (A[0] * A[0] + A[1] * A[1] + ... + A[blockSize-1] * A[blockSize-1]) */
  93. /* Compute Sum of squares of the input samples
  94. * and then store the result in a temporary variable, sum. */
  95. in = *__SIMD32(pSrc)++;
  96. sum += ((in << 16) >> 16);
  97. sum += (in >> 16);
  98. sumOfSquares = __SMLALD(in, in, sumOfSquares);
  99. in = *__SIMD32(pSrc)++;
  100. sum += ((in << 16) >> 16);
  101. sum += (in >> 16);
  102. sumOfSquares = __SMLALD(in, in, sumOfSquares);
  103. /* Decrement the loop counter */
  104. blkCnt--;
  105. }
  106. /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
  107. ** No loop unrolling is used. */
  108. blkCnt = blockSize % 0x4u;
  109. while(blkCnt > 0u)
  110. {
  111. /* C = (A[0] * A[0] + A[1] * A[1] + ... + A[blockSize-1] * A[blockSize-1]) */
  112. /* Compute Sum of squares of the input samples
  113. * and then store the result in a temporary variable, sum. */
  114. in1 = *pSrc++;
  115. sumOfSquares = __SMLALD(in1, in1, sumOfSquares);
  116. sum += in1;
  117. /* Decrement the loop counter */
  118. blkCnt--;
  119. }
  120. /* Compute Mean of squares of the input samples
  121. * and then store the result in a temporary variable, meanOfSquares. */
  122. meanOfSquares = (q31_t)(sumOfSquares / (q63_t)(blockSize - 1));
  123. /* Compute square of mean */
  124. squareOfMean = (q31_t) ((q63_t)sum * sum / (q63_t)(blockSize * (blockSize - 1)));
  125. /* mean of the squares minus the square of the mean. */
  126. /* Compute standard deviation and store the result to the destination */
  127. arm_sqrt_q15(__SSAT((meanOfSquares - squareOfMean) >> 15, 16u), pResult);
  128. #else
  129. /* Run the below code for Cortex-M0 */
  130. q15_t in; /* input value */
  131. if(blockSize == 1)
  132. {
  133. *pResult = 0;
  134. return;
  135. }
  136. /* Loop over blockSize number of values */
  137. blkCnt = blockSize;
  138. while(blkCnt > 0u)
  139. {
  140. /* C = (A[0] * A[0] + A[1] * A[1] + ... + A[blockSize-1] * A[blockSize-1]) */
  141. /* Compute Sum of squares of the input samples
  142. * and then store the result in a temporary variable, sumOfSquares. */
  143. in = *pSrc++;
  144. sumOfSquares += (in * in);
  145. /* C = (A[0] + A[1] + A[2] + ... + A[blockSize-1]) */
  146. /* Compute sum of all input values and then store the result in a temporary variable, sum. */
  147. sum += in;
  148. /* Decrement the loop counter */
  149. blkCnt--;
  150. }
  151. /* Compute Mean of squares of the input samples
  152. * and then store the result in a temporary variable, meanOfSquares. */
  153. meanOfSquares = (q31_t)(sumOfSquares / (q63_t)(blockSize - 1));
  154. /* Compute square of mean */
  155. squareOfMean = (q31_t) ((q63_t)sum * sum / (q63_t)(blockSize * (blockSize - 1)));
  156. /* mean of the squares minus the square of the mean. */
  157. /* Compute standard deviation and store the result to the destination */
  158. arm_sqrt_q15(__SSAT((meanOfSquares - squareOfMean) >> 15, 16u), pResult);
  159. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  160. }
  161. /**
  162. * @} end of STD group
  163. */