A bundled STM32F10x Std Periph and CMSIS library
You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 

149 lines
4.3 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_add_q31.c
  9. *
  10. * Description: Q31 vector addition.
  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 groupMath
  43. */
  44. /**
  45. * @addtogroup BasicAdd
  46. * @{
  47. */
  48. /**
  49. * @brief Q31 vector addition.
  50. * @param[in] *pSrcA points to the first input vector
  51. * @param[in] *pSrcB points to the second input vector
  52. * @param[out] *pDst points to the output vector
  53. * @param[in] blockSize number of samples in each vector
  54. * @return none.
  55. *
  56. * <b>Scaling and Overflow Behavior:</b>
  57. * \par
  58. * The function uses saturating arithmetic.
  59. * Results outside of the allowable Q31 range[0x80000000 0x7FFFFFFF] will be saturated.
  60. */
  61. void arm_add_q31(
  62. q31_t * pSrcA,
  63. q31_t * pSrcB,
  64. q31_t * pDst,
  65. uint32_t blockSize)
  66. {
  67. uint32_t blkCnt; /* loop counter */
  68. #ifndef ARM_MATH_CM0_FAMILY
  69. /* Run the below code for Cortex-M4 and Cortex-M3 */
  70. q31_t inA1, inA2, inA3, inA4;
  71. q31_t inB1, inB2, inB3, inB4;
  72. /*loop Unrolling */
  73. blkCnt = blockSize >> 2u;
  74. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  75. ** a second loop below computes the remaining 1 to 3 samples. */
  76. while(blkCnt > 0u)
  77. {
  78. /* C = A + B */
  79. /* Add and then store the results in the destination buffer. */
  80. inA1 = *pSrcA++;
  81. inA2 = *pSrcA++;
  82. inB1 = *pSrcB++;
  83. inB2 = *pSrcB++;
  84. inA3 = *pSrcA++;
  85. inA4 = *pSrcA++;
  86. inB3 = *pSrcB++;
  87. inB4 = *pSrcB++;
  88. *pDst++ = __QADD(inA1, inB1);
  89. *pDst++ = __QADD(inA2, inB2);
  90. *pDst++ = __QADD(inA3, inB3);
  91. *pDst++ = __QADD(inA4, inB4);
  92. /* Decrement the loop counter */
  93. blkCnt--;
  94. }
  95. /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
  96. ** No loop unrolling is used. */
  97. blkCnt = blockSize % 0x4u;
  98. while(blkCnt > 0u)
  99. {
  100. /* C = A + B */
  101. /* Add and then store the results in the destination buffer. */
  102. *pDst++ = __QADD(*pSrcA++, *pSrcB++);
  103. /* Decrement the loop counter */
  104. blkCnt--;
  105. }
  106. #else
  107. /* Run the below code for Cortex-M0 */
  108. /* Initialize blkCnt with number of samples */
  109. blkCnt = blockSize;
  110. while(blkCnt > 0u)
  111. {
  112. /* C = A + B */
  113. /* Add and then store the results in the destination buffer. */
  114. *pDst++ = (q31_t) clip_q63_to_q31((q63_t) * pSrcA++ + *pSrcB++);
  115. /* Decrement the loop counter */
  116. blkCnt--;
  117. }
  118. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  119. }
  120. /**
  121. * @} end of BasicAdd group
  122. */