arm_mat_scale_q15.c 6.3 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183
  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_scale_q15.c
  9. *
  10. * Description: Multiplies a Q15 matrix by a scalar.
  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 MatrixScale
  46. * @{
  47. */
  48. /**
  49. * @brief Q15 matrix scaling.
  50. * @param[in] *pSrc points to input matrix
  51. * @param[in] scaleFract fractional portion of the scale factor
  52. * @param[in] shift number of bits to shift the result by
  53. * @param[out] *pDst points to output matrix structure
  54. * @return The function returns either
  55. * <code>ARM_MATH_SIZE_MISMATCH</code> or <code>ARM_MATH_SUCCESS</code> based on the outcome of size checking.
  56. *
  57. * @details
  58. * <b>Scaling and Overflow Behavior:</b>
  59. * \par
  60. * The input data <code>*pSrc</code> and <code>scaleFract</code> are in 1.15 format.
  61. * These are multiplied to yield a 2.30 intermediate result and this is shifted with saturation to 1.15 format.
  62. */
  63. arm_status arm_mat_scale_q15(
  64. const arm_matrix_instance_q15 * pSrc,
  65. q15_t scaleFract,
  66. int32_t shift,
  67. arm_matrix_instance_q15 * pDst)
  68. {
  69. q15_t *pIn = pSrc->pData; /* input data matrix pointer */
  70. q15_t *pOut = pDst->pData; /* output data matrix pointer */
  71. uint32_t numSamples; /* total number of elements in the matrix */
  72. int32_t totShift = 15 - shift; /* total shift to apply after scaling */
  73. uint32_t blkCnt; /* loop counters */
  74. arm_status status; /* status of matrix scaling */
  75. #ifndef ARM_MATH_CM0_FAMILY
  76. q15_t in1, in2, in3, in4;
  77. q31_t out1, out2, out3, out4;
  78. q31_t inA1, inA2;
  79. #endif // #ifndef ARM_MATH_CM0_FAMILY
  80. #ifdef ARM_MATH_MATRIX_CHECK
  81. /* Check for matrix mismatch */
  82. if((pSrc->numRows != pDst->numRows) || (pSrc->numCols != pDst->numCols))
  83. {
  84. /* Set status as ARM_MATH_SIZE_MISMATCH */
  85. status = ARM_MATH_SIZE_MISMATCH;
  86. }
  87. else
  88. #endif // #ifdef ARM_MATH_MATRIX_CHECK
  89. {
  90. /* Total number of samples in the input matrix */
  91. numSamples = (uint32_t) pSrc->numRows * pSrc->numCols;
  92. #ifndef ARM_MATH_CM0_FAMILY
  93. /* Run the below code for Cortex-M4 and Cortex-M3 */
  94. /* Loop Unrolling */
  95. blkCnt = numSamples >> 2;
  96. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  97. ** a second loop below computes the remaining 1 to 3 samples. */
  98. while(blkCnt > 0u)
  99. {
  100. /* C(m,n) = A(m,n) * k */
  101. /* Scale, saturate and then store the results in the destination buffer. */
  102. /* Reading 2 inputs from memory */
  103. inA1 = _SIMD32_OFFSET(pIn);
  104. inA2 = _SIMD32_OFFSET(pIn + 2);
  105. /* C = A * scale */
  106. /* Scale the inputs and then store the 2 results in the destination buffer
  107. * in single cycle by packing the outputs */
  108. out1 = (q31_t) ((q15_t) (inA1 >> 16) * scaleFract);
  109. out2 = (q31_t) ((q15_t) inA1 * scaleFract);
  110. out3 = (q31_t) ((q15_t) (inA2 >> 16) * scaleFract);
  111. out4 = (q31_t) ((q15_t) inA2 * scaleFract);
  112. out1 = out1 >> totShift;
  113. inA1 = _SIMD32_OFFSET(pIn + 4);
  114. out2 = out2 >> totShift;
  115. inA2 = _SIMD32_OFFSET(pIn + 6);
  116. out3 = out3 >> totShift;
  117. out4 = out4 >> totShift;
  118. in1 = (q15_t) (__SSAT(out1, 16));
  119. in2 = (q15_t) (__SSAT(out2, 16));
  120. in3 = (q15_t) (__SSAT(out3, 16));
  121. in4 = (q15_t) (__SSAT(out4, 16));
  122. _SIMD32_OFFSET(pOut) = __PKHBT(in2, in1, 16);
  123. _SIMD32_OFFSET(pOut + 2) = __PKHBT(in4, in3, 16);
  124. /* update pointers to process next sampels */
  125. pIn += 4u;
  126. pOut += 4u;
  127. /* Decrement the numSamples loop counter */
  128. blkCnt--;
  129. }
  130. /* If the numSamples is not a multiple of 4, compute any remaining output samples here.
  131. ** No loop unrolling is used. */
  132. blkCnt = numSamples % 0x4u;
  133. #else
  134. /* Run the below code for Cortex-M0 */
  135. /* Initialize blkCnt with number of samples */
  136. blkCnt = numSamples;
  137. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  138. while(blkCnt > 0u)
  139. {
  140. /* C(m,n) = A(m,n) * k */
  141. /* Scale, saturate and then store the results in the destination buffer. */
  142. *pOut++ =
  143. (q15_t) (__SSAT(((q31_t) (*pIn++) * scaleFract) >> totShift, 16));
  144. /* Decrement the numSamples loop counter */
  145. blkCnt--;
  146. }
  147. /* Set status as ARM_MATH_SUCCESS */
  148. status = ARM_MATH_SUCCESS;
  149. }
  150. /* Return to application */
  151. return (status);
  152. }
  153. /**
  154. * @} end of MatrixScale group
  155. */