arm_cmplx_mult_cmplx_q15.c 3.9 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137
  1. /* ----------------------------------------------------------------------
  2. * Project: CMSIS DSP Library
  3. * Title: arm_cmplx_mult_cmplx_q15.c
  4. * Description: Q15 complex-by-complex multiplication
  5. *
  6. * $Date: 18. March 2019
  7. * $Revision: V1.6.0
  8. *
  9. * Target Processor: Cortex-M cores
  10. * -------------------------------------------------------------------- */
  11. /*
  12. * Copyright (C) 2010-2019 ARM Limited or its affiliates. All rights reserved.
  13. *
  14. * SPDX-License-Identifier: Apache-2.0
  15. *
  16. * Licensed under the Apache License, Version 2.0 (the License); you may
  17. * not use this file except in compliance with the License.
  18. * You may obtain a copy of the License at
  19. *
  20. * www.apache.org/licenses/LICENSE-2.0
  21. *
  22. * Unless required by applicable law or agreed to in writing, software
  23. * distributed under the License is distributed on an AS IS BASIS, WITHOUT
  24. * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
  25. * See the License for the specific language governing permissions and
  26. * limitations under the License.
  27. */
  28. #include "arm_math.h"
  29. /**
  30. @ingroup groupCmplxMath
  31. */
  32. /**
  33. @addtogroup CmplxByCmplxMult
  34. @{
  35. */
  36. /**
  37. @brief Q15 complex-by-complex multiplication.
  38. @param[in] pSrcA points to first input vector
  39. @param[in] pSrcB points to second input vector
  40. @param[out] pDst points to output vector
  41. @param[in] numSamples number of samples in each vector
  42. @return none
  43. @par Scaling and Overflow Behavior
  44. The function implements 1.15 by 1.15 multiplications and finally output is converted into 3.13 format.
  45. */
  46. void arm_cmplx_mult_cmplx_q15(
  47. const q15_t * pSrcA,
  48. const q15_t * pSrcB,
  49. q15_t * pDst,
  50. uint32_t numSamples)
  51. {
  52. uint32_t blkCnt; /* Loop counter */
  53. q15_t a, b, c, d; /* Temporary variables */
  54. #if defined (ARM_MATH_LOOPUNROLL)
  55. /* Loop unrolling: Compute 4 outputs at a time */
  56. blkCnt = numSamples >> 2U;
  57. while (blkCnt > 0U)
  58. {
  59. /* C[2 * i ] = A[2 * i] * B[2 * i ] - A[2 * i + 1] * B[2 * i + 1]. */
  60. /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i ]. */
  61. a = *pSrcA++;
  62. b = *pSrcA++;
  63. c = *pSrcB++;
  64. d = *pSrcB++;
  65. /* store result in 3.13 format in destination buffer. */
  66. *pDst++ = (q15_t) ( (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17) );
  67. *pDst++ = (q15_t) ( (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17) );
  68. a = *pSrcA++;
  69. b = *pSrcA++;
  70. c = *pSrcB++;
  71. d = *pSrcB++;
  72. *pDst++ = (q15_t) ( (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17) );
  73. *pDst++ = (q15_t) ( (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17) );
  74. a = *pSrcA++;
  75. b = *pSrcA++;
  76. c = *pSrcB++;
  77. d = *pSrcB++;
  78. *pDst++ = (q15_t) ( (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17) );
  79. *pDst++ = (q15_t) ( (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17) );
  80. a = *pSrcA++;
  81. b = *pSrcA++;
  82. c = *pSrcB++;
  83. d = *pSrcB++;
  84. *pDst++ = (q15_t) ( (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17) );
  85. *pDst++ = (q15_t) ( (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17) );
  86. /* Decrement loop counter */
  87. blkCnt--;
  88. }
  89. /* Loop unrolling: Compute remaining outputs */
  90. blkCnt = numSamples % 0x4U;
  91. #else
  92. /* Initialize blkCnt with number of samples */
  93. blkCnt = numSamples;
  94. #endif /* #if defined (ARM_MATH_LOOPUNROLL) */
  95. while (blkCnt > 0U)
  96. {
  97. /* C[2 * i ] = A[2 * i] * B[2 * i ] - A[2 * i + 1] * B[2 * i + 1]. */
  98. /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i ]. */
  99. a = *pSrcA++;
  100. b = *pSrcA++;
  101. c = *pSrcB++;
  102. d = *pSrcB++;
  103. /* store result in 3.13 format in destination buffer. */
  104. *pDst++ = (q15_t) ( (((q31_t) a * c) >> 17) - (((q31_t) b * d) >> 17) );
  105. *pDst++ = (q15_t) ( (((q31_t) a * d) >> 17) + (((q31_t) b * c) >> 17) );
  106. /* Decrement loop counter */
  107. blkCnt--;
  108. }
  109. }
  110. /**
  111. @} end of CmplxByCmplxMult group
  112. */