arm_mat_add_q31.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207
  1. /* ----------------------------------------------------------------------
  2. * Copyright (C) 2010-2014 ARM Limited. All rights reserved.
  3. *
  4. * $Date: 31. July 2014
  5. * $Revision: V1.4.4
  6. *
  7. * Project: CMSIS DSP Library
  8. * Title: arm_mat_add_q31.c
  9. *
  10. * Description: Q31 matrix 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 groupMatrix
  43. */
  44. /**
  45. * @addtogroup MatrixAdd
  46. * @{
  47. */
  48. /**
  49. * @brief Q31 matrix addition.
  50. * @param[in] *pSrcA points to the first input matrix structure
  51. * @param[in] *pSrcB points to the second input matrix structure
  52. * @param[out] *pDst points to output matrix structure
  53. * @return The function returns either
  54. * <code>ARM_MATH_SIZE_MISMATCH</code> or <code>ARM_MATH_SUCCESS</code> based on the outcome of size checking.
  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. arm_status arm_mat_add_q31(
  62. const arm_matrix_instance_q31 * pSrcA,
  63. const arm_matrix_instance_q31 * pSrcB,
  64. arm_matrix_instance_q31 * pDst)
  65. {
  66. q31_t *pIn1 = pSrcA->pData; /* input data matrix pointer A */
  67. q31_t *pIn2 = pSrcB->pData; /* input data matrix pointer B */
  68. q31_t *pOut = pDst->pData; /* output data matrix pointer */
  69. q31_t inA1, inB1; /* temporary variables */
  70. #ifndef ARM_MATH_CM0_FAMILY
  71. q31_t inA2, inB2; /* temporary variables */
  72. q31_t out1, out2; /* temporary variables */
  73. #endif // #ifndef ARM_MATH_CM0_FAMILY
  74. uint32_t numSamples; /* total number of elements in the matrix */
  75. uint32_t blkCnt; /* loop counters */
  76. arm_status status; /* status of matrix addition */
  77. #ifdef ARM_MATH_MATRIX_CHECK
  78. /* Check for matrix mismatch condition */
  79. if((pSrcA->numRows != pSrcB->numRows) ||
  80. (pSrcA->numCols != pSrcB->numCols) ||
  81. (pSrcA->numRows != pDst->numRows) || (pSrcA->numCols != pDst->numCols))
  82. {
  83. /* Set status as ARM_MATH_SIZE_MISMATCH */
  84. status = ARM_MATH_SIZE_MISMATCH;
  85. }
  86. else
  87. #endif
  88. {
  89. /* Total number of samples in the input matrix */
  90. numSamples = (uint32_t) pSrcA->numRows * pSrcA->numCols;
  91. #ifndef ARM_MATH_CM0_FAMILY
  92. /* Run the below code for Cortex-M4 and Cortex-M3 */
  93. /* Loop Unrolling */
  94. blkCnt = numSamples >> 2u;
  95. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  96. ** a second loop below computes the remaining 1 to 3 samples. */
  97. while(blkCnt > 0u)
  98. {
  99. /* C(m,n) = A(m,n) + B(m,n) */
  100. /* Add, saturate and then store the results in the destination buffer. */
  101. /* Read values from source A */
  102. inA1 = pIn1[0];
  103. /* Read values from source B */
  104. inB1 = pIn2[0];
  105. /* Read values from source A */
  106. inA2 = pIn1[1];
  107. /* Add and saturate */
  108. out1 = __QADD(inA1, inB1);
  109. /* Read values from source B */
  110. inB2 = pIn2[1];
  111. /* Read values from source A */
  112. inA1 = pIn1[2];
  113. /* Add and saturate */
  114. out2 = __QADD(inA2, inB2);
  115. /* Read values from source B */
  116. inB1 = pIn2[2];
  117. /* Store result in destination */
  118. pOut[0] = out1;
  119. pOut[1] = out2;
  120. /* Read values from source A */
  121. inA2 = pIn1[3];
  122. /* Read values from source B */
  123. inB2 = pIn2[3];
  124. /* Add and saturate */
  125. out1 = __QADD(inA1, inB1);
  126. out2 = __QADD(inA2, inB2);
  127. /* Store result in destination */
  128. pOut[2] = out1;
  129. pOut[3] = out2;
  130. /* update pointers to process next sampels */
  131. pIn1 += 4u;
  132. pIn2 += 4u;
  133. pOut += 4u;
  134. /* Decrement the loop counter */
  135. blkCnt--;
  136. }
  137. /* If the numSamples is not a multiple of 4, compute any remaining output samples here.
  138. ** No loop unrolling is used. */
  139. blkCnt = numSamples % 0x4u;
  140. #else
  141. /* Run the below code for Cortex-M0 */
  142. /* Initialize blkCnt with number of samples */
  143. blkCnt = numSamples;
  144. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  145. while(blkCnt > 0u)
  146. {
  147. /* C(m,n) = A(m,n) + B(m,n) */
  148. /* Add, saturate and then store the results in the destination buffer. */
  149. inA1 = *pIn1++;
  150. inB1 = *pIn2++;
  151. inA1 = __QADD(inA1, inB1);
  152. /* Decrement the loop counter */
  153. blkCnt--;
  154. *pOut++ = inA1;
  155. }
  156. /* set status as ARM_MATH_SUCCESS */
  157. status = ARM_MATH_SUCCESS;
  158. }
  159. /* Return to application */
  160. return (status);
  161. }
  162. /**
  163. * @} end of MatrixAdd group
  164. */