A bundled STM32F10x Std Periph and CMSIS library
Vous ne pouvez pas sélectionner plus de 25 sujets Les noms de sujets doivent commencer par une lettre ou un nombre, peuvent contenir des tirets ('-') et peuvent comporter jusqu'à 35 caractères.
 
 
 
 
 

166 lignes
4.8 KiB

  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_abs_f32.c
  9. *
  10. * Description: Vector absolute value.
  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. #include <math.h>
  42. /**
  43. * @ingroup groupMath
  44. */
  45. /**
  46. * @defgroup BasicAbs Vector Absolute Value
  47. *
  48. * Computes the absolute value of a vector on an element-by-element basis.
  49. *
  50. * <pre>
  51. * pDst[n] = abs(pSrc[n]), 0 <= n < blockSize.
  52. * </pre>
  53. *
  54. * The functions support in-place computation allowing the source and
  55. * destination pointers to reference the same memory buffer.
  56. * There are separate functions for floating-point, Q7, Q15, and Q31 data types.
  57. */
  58. /**
  59. * @addtogroup BasicAbs
  60. * @{
  61. */
  62. /**
  63. * @brief Floating-point vector absolute value.
  64. * @param[in] *pSrc points to the input buffer
  65. * @param[out] *pDst points to the output buffer
  66. * @param[in] blockSize number of samples in each vector
  67. * @return none.
  68. */
  69. void arm_abs_f32(
  70. float32_t * pSrc,
  71. float32_t * pDst,
  72. uint32_t blockSize)
  73. {
  74. uint32_t blkCnt; /* loop counter */
  75. #ifndef ARM_MATH_CM0_FAMILY
  76. /* Run the below code for Cortex-M4 and Cortex-M3 */
  77. float32_t in1, in2, in3, in4; /* temporary variables */
  78. /*loop Unrolling */
  79. blkCnt = blockSize >> 2u;
  80. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  81. ** a second loop below computes the remaining 1 to 3 samples. */
  82. while(blkCnt > 0u)
  83. {
  84. /* C = |A| */
  85. /* Calculate absolute and then store the results in the destination buffer. */
  86. /* read sample from source */
  87. in1 = *pSrc;
  88. in2 = *(pSrc + 1);
  89. in3 = *(pSrc + 2);
  90. /* find absolute value */
  91. in1 = fabsf(in1);
  92. /* read sample from source */
  93. in4 = *(pSrc + 3);
  94. /* find absolute value */
  95. in2 = fabsf(in2);
  96. /* read sample from source */
  97. *pDst = in1;
  98. /* find absolute value */
  99. in3 = fabsf(in3);
  100. /* find absolute value */
  101. in4 = fabsf(in4);
  102. /* store result to destination */
  103. *(pDst + 1) = in2;
  104. /* store result to destination */
  105. *(pDst + 2) = in3;
  106. /* store result to destination */
  107. *(pDst + 3) = in4;
  108. /* Update source pointer to process next sampels */
  109. pSrc += 4u;
  110. /* Update destination pointer to process next sampels */
  111. pDst += 4u;
  112. /* Decrement the loop counter */
  113. blkCnt--;
  114. }
  115. /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
  116. ** No loop unrolling is used. */
  117. blkCnt = blockSize % 0x4u;
  118. #else
  119. /* Run the below code for Cortex-M0 */
  120. /* Initialize blkCnt with number of samples */
  121. blkCnt = blockSize;
  122. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  123. while(blkCnt > 0u)
  124. {
  125. /* C = |A| */
  126. /* Calculate absolute and then store the results in the destination buffer. */
  127. *pDst++ = fabsf(*pSrc++);
  128. /* Decrement the loop counter */
  129. blkCnt--;
  130. }
  131. }
  132. /**
  133. * @} end of BasicAbs group
  134. */