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.
 
 
 
 
 

183 lines
5.5 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_conj_f32.c
  9. *
  10. * Description: Floating-point complex conjugate.
  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. * @defgroup cmplx_conj Complex Conjugate
  46. *
  47. * Conjugates the elements of a complex data vector.
  48. *
  49. * The <code>pSrc</code> points to the source data and
  50. * <code>pDst</code> points to the where the result should be written.
  51. * <code>numSamples</code> specifies the number of complex samples
  52. * and the data in each array is stored in an interleaved fashion
  53. * (real, imag, real, imag, ...).
  54. * Each array has a total of <code>2*numSamples</code> values.
  55. * The underlying algorithm is used:
  56. *
  57. * <pre>
  58. * for(n=0; n<numSamples; n++) {
  59. * pDst[(2*n)+0)] = pSrc[(2*n)+0]; // real part
  60. * pDst[(2*n)+1)] = -pSrc[(2*n)+1]; // imag part
  61. * }
  62. * </pre>
  63. *
  64. * There are separate functions for floating-point, Q15, and Q31 data types.
  65. */
  66. /**
  67. * @addtogroup cmplx_conj
  68. * @{
  69. */
  70. /**
  71. * @brief Floating-point complex conjugate.
  72. * @param *pSrc points to the input vector
  73. * @param *pDst points to the output vector
  74. * @param numSamples number of complex samples in each vector
  75. * @return none.
  76. */
  77. void arm_cmplx_conj_f32(
  78. float32_t * pSrc,
  79. float32_t * pDst,
  80. uint32_t numSamples)
  81. {
  82. uint32_t blkCnt; /* loop counter */
  83. #ifndef ARM_MATH_CM0_FAMILY
  84. /* Run the below code for Cortex-M4 and Cortex-M3 */
  85. float32_t inR1, inR2, inR3, inR4;
  86. float32_t inI1, inI2, inI3, inI4;
  87. /*loop Unrolling */
  88. blkCnt = numSamples >> 2u;
  89. /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
  90. ** a second loop below computes the remaining 1 to 3 samples. */
  91. while(blkCnt > 0u)
  92. {
  93. /* C[0]+jC[1] = A[0]+ j (-1) A[1] */
  94. /* Calculate Complex Conjugate and then store the results in the destination buffer. */
  95. /* read real input samples */
  96. inR1 = pSrc[0];
  97. /* store real samples to destination */
  98. pDst[0] = inR1;
  99. inR2 = pSrc[2];
  100. pDst[2] = inR2;
  101. inR3 = pSrc[4];
  102. pDst[4] = inR3;
  103. inR4 = pSrc[6];
  104. pDst[6] = inR4;
  105. /* read imaginary input samples */
  106. inI1 = pSrc[1];
  107. inI2 = pSrc[3];
  108. /* conjugate input */
  109. inI1 = -inI1;
  110. /* read imaginary input samples */
  111. inI3 = pSrc[5];
  112. /* conjugate input */
  113. inI2 = -inI2;
  114. /* read imaginary input samples */
  115. inI4 = pSrc[7];
  116. /* conjugate input */
  117. inI3 = -inI3;
  118. /* store imaginary samples to destination */
  119. pDst[1] = inI1;
  120. pDst[3] = inI2;
  121. /* conjugate input */
  122. inI4 = -inI4;
  123. /* store imaginary samples to destination */
  124. pDst[5] = inI3;
  125. /* increment source pointer by 8 to process next sampels */
  126. pSrc += 8u;
  127. /* store imaginary sample to destination */
  128. pDst[7] = inI4;
  129. /* increment destination pointer by 8 to store next samples */
  130. pDst += 8u;
  131. /* Decrement the loop counter */
  132. blkCnt--;
  133. }
  134. /* If the numSamples is not a multiple of 4, compute any remaining output samples here.
  135. ** No loop unrolling is used. */
  136. blkCnt = numSamples % 0x4u;
  137. #else
  138. /* Run the below code for Cortex-M0 */
  139. blkCnt = numSamples;
  140. #endif /* #ifndef ARM_MATH_CM0_FAMILY */
  141. while(blkCnt > 0u)
  142. {
  143. /* realOut + j (imagOut) = realIn + j (-1) imagIn */
  144. /* Calculate Complex Conjugate and then store the results in the destination buffer. */
  145. *pDst++ = *pSrc++;
  146. *pDst++ = -*pSrc++;
  147. /* Decrement the loop counter */
  148. blkCnt--;
  149. }
  150. }
  151. /**
  152. * @} end of cmplx_conj group
  153. */