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.
 
 
 
 
 

194 lines
6.4 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_cmplx_mult_cmplx_q15.c
  9. *
  10. * Description: Q15 complex-by-complex multiplication
  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 groupCmplxMath
  43. */
  44. /**
  45. * @addtogroup CmplxByCmplxMult
  46. * @{
  47. */
  48. /**
  49. * @brief Q15 complex-by-complex multiplication
  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] numSamples number of complex samples in each vector
  54. * @return none.
  55. *
  56. * <b>Scaling and Overflow Behavior:</b>
  57. * \par
  58. * The function implements 1.15 by 1.15 multiplications and finally output is converted into 3.13 format.
  59. */
  60. void arm_cmplx_mult_cmplx_q15(
  61. q15_t * pSrcA,
  62. q15_t * pSrcB,
  63. q15_t * pDst,
  64. uint32_t numSamples)
  65. {
  66. q15_t a, b, c, d; /* Temporary variables to store real and imaginary values */
  67. #ifndef ARM_MATH_CM0_FAMILY
  68. /* Run the below code for Cortex-M4 and Cortex-M3 */
  69. uint32_t blkCnt; /* loop counters */
  70. /* loop Unrolling */
  71. blkCnt = numSamples >> 2u;
  72. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  73. ** a second loop below computes the remaining 1 to 3 samples. */
  74. while(blkCnt > 0u)
  75. {
  76. /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
  77. /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
  78. a = *pSrcA++;
  79. b = *pSrcA++;
  80. c = *pSrcB++;
  81. d = *pSrcB++;
  82. /* store the result in 3.13 format in the destination buffer. */
  83. *pDst++ =
  84. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  85. /* store the result in 3.13 format in the destination buffer. */
  86. *pDst++ =
  87. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  88. a = *pSrcA++;
  89. b = *pSrcA++;
  90. c = *pSrcB++;
  91. d = *pSrcB++;
  92. /* store the result in 3.13 format in the destination buffer. */
  93. *pDst++ =
  94. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  95. /* store the result in 3.13 format in the destination buffer. */
  96. *pDst++ =
  97. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  98. a = *pSrcA++;
  99. b = *pSrcA++;
  100. c = *pSrcB++;
  101. d = *pSrcB++;
  102. /* store the result in 3.13 format in the destination buffer. */
  103. *pDst++ =
  104. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  105. /* store the result in 3.13 format in the destination buffer. */
  106. *pDst++ =
  107. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  108. a = *pSrcA++;
  109. b = *pSrcA++;
  110. c = *pSrcB++;
  111. d = *pSrcB++;
  112. /* store the result in 3.13 format in the destination buffer. */
  113. *pDst++ =
  114. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  115. /* store the result in 3.13 format in the destination buffer. */
  116. *pDst++ =
  117. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  118. /* Decrement the blockSize loop counter */
  119. blkCnt--;
  120. }
  121. /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
  122. ** No loop unrolling is used. */
  123. blkCnt = numSamples % 0x4u;
  124. while(blkCnt > 0u)
  125. {
  126. /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
  127. /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
  128. a = *pSrcA++;
  129. b = *pSrcA++;
  130. c = *pSrcB++;
  131. d = *pSrcB++;
  132. /* store the result in 3.13 format in the destination buffer. */
  133. *pDst++ =
  134. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  135. /* store the result in 3.13 format in the destination buffer. */
  136. *pDst++ =
  137. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  138. /* Decrement the blockSize loop counter */
  139. blkCnt--;
  140. }
  141. #else
  142. /* Run the below code for Cortex-M0 */
  143. while(numSamples > 0u)
  144. {
  145. /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
  146. /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
  147. a = *pSrcA++;
  148. b = *pSrcA++;
  149. c = *pSrcB++;
  150. d = *pSrcB++;
  151. /* store the result in 3.13 format in the destination buffer. */
  152. *pDst++ =
  153. (q15_t) (q31_t) (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17);
  154. /* store the result in 3.13 format in the destination buffer. */
  155. *pDst++ =
  156. (q15_t) (q31_t) (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17);
  157. /* Decrement the blockSize loop counter */
  158. numSamples--;
  159. }
  160. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  161. }
  162. /**
  163. * @} end of CmplxByCmplxMult group
  164. */