V4.0.1 of the ARM CMSIS DSP libraries. Note that arm_bitreversal2.s, arm_cfft_f32.c and arm_rfft_fast_f32.c had to be removed. arm_bitreversal2.s will not assemble with the online tools. So, the fast f32 FFT functions are not yet available. All the other FFT functions are available.
Dependents: MPU9150_Example fir_f32 fir_f32 MPU9150_nucleo_noni2cdev ... more
ComplexMathFunctions/arm_cmplx_conj_f32.c@0:3d9c67d97d6f, 2014-07-28 (annotated)
- Committer:
- emh203
- Date:
- Mon Jul 28 15:03:15 2014 +0000
- Revision:
- 0:3d9c67d97d6f
1st working commit. Had to remove arm_bitreversal2.s arm_cfft_f32.c and arm_rfft_fast_f32.c. The .s will not assemble. For now I removed these functions so we could at least have a library for the other functions.
Who changed what in which revision?
User | Revision | Line number | New contents of line |
---|---|---|---|
emh203 | 0:3d9c67d97d6f | 1 | /* ---------------------------------------------------------------------- |
emh203 | 0:3d9c67d97d6f | 2 | * Copyright (C) 2010-2014 ARM Limited. All rights reserved. |
emh203 | 0:3d9c67d97d6f | 3 | * |
emh203 | 0:3d9c67d97d6f | 4 | * $Date: 12. March 2014 |
emh203 | 0:3d9c67d97d6f | 5 | * $Revision: V1.4.3 |
emh203 | 0:3d9c67d97d6f | 6 | * |
emh203 | 0:3d9c67d97d6f | 7 | * Project: CMSIS DSP Library |
emh203 | 0:3d9c67d97d6f | 8 | * Title: arm_cmplx_conj_f32.c |
emh203 | 0:3d9c67d97d6f | 9 | * |
emh203 | 0:3d9c67d97d6f | 10 | * Description: Floating-point complex conjugate. |
emh203 | 0:3d9c67d97d6f | 11 | * |
emh203 | 0:3d9c67d97d6f | 12 | * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0 |
emh203 | 0:3d9c67d97d6f | 13 | * |
emh203 | 0:3d9c67d97d6f | 14 | * Redistribution and use in source and binary forms, with or without |
emh203 | 0:3d9c67d97d6f | 15 | * modification, are permitted provided that the following conditions |
emh203 | 0:3d9c67d97d6f | 16 | * are met: |
emh203 | 0:3d9c67d97d6f | 17 | * - Redistributions of source code must retain the above copyright |
emh203 | 0:3d9c67d97d6f | 18 | * notice, this list of conditions and the following disclaimer. |
emh203 | 0:3d9c67d97d6f | 19 | * - Redistributions in binary form must reproduce the above copyright |
emh203 | 0:3d9c67d97d6f | 20 | * notice, this list of conditions and the following disclaimer in |
emh203 | 0:3d9c67d97d6f | 21 | * the documentation and/or other materials provided with the |
emh203 | 0:3d9c67d97d6f | 22 | * distribution. |
emh203 | 0:3d9c67d97d6f | 23 | * - Neither the name of ARM LIMITED nor the names of its contributors |
emh203 | 0:3d9c67d97d6f | 24 | * may be used to endorse or promote products derived from this |
emh203 | 0:3d9c67d97d6f | 25 | * software without specific prior written permission. |
emh203 | 0:3d9c67d97d6f | 26 | * |
emh203 | 0:3d9c67d97d6f | 27 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
emh203 | 0:3d9c67d97d6f | 28 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
emh203 | 0:3d9c67d97d6f | 29 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
emh203 | 0:3d9c67d97d6f | 30 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
emh203 | 0:3d9c67d97d6f | 31 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
emh203 | 0:3d9c67d97d6f | 32 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
emh203 | 0:3d9c67d97d6f | 33 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
emh203 | 0:3d9c67d97d6f | 34 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
emh203 | 0:3d9c67d97d6f | 35 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
emh203 | 0:3d9c67d97d6f | 36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
emh203 | 0:3d9c67d97d6f | 37 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
emh203 | 0:3d9c67d97d6f | 38 | * POSSIBILITY OF SUCH DAMAGE. |
emh203 | 0:3d9c67d97d6f | 39 | * ---------------------------------------------------------------------------- */ |
emh203 | 0:3d9c67d97d6f | 40 | #include "arm_math.h" |
emh203 | 0:3d9c67d97d6f | 41 | |
emh203 | 0:3d9c67d97d6f | 42 | /** |
emh203 | 0:3d9c67d97d6f | 43 | * @ingroup groupCmplxMath |
emh203 | 0:3d9c67d97d6f | 44 | */ |
emh203 | 0:3d9c67d97d6f | 45 | |
emh203 | 0:3d9c67d97d6f | 46 | /** |
emh203 | 0:3d9c67d97d6f | 47 | * @defgroup cmplx_conj Complex Conjugate |
emh203 | 0:3d9c67d97d6f | 48 | * |
emh203 | 0:3d9c67d97d6f | 49 | * Conjugates the elements of a complex data vector. |
emh203 | 0:3d9c67d97d6f | 50 | * |
emh203 | 0:3d9c67d97d6f | 51 | * The <code>pSrc</code> points to the source data and |
emh203 | 0:3d9c67d97d6f | 52 | * <code>pDst</code> points to the where the result should be written. |
emh203 | 0:3d9c67d97d6f | 53 | * <code>numSamples</code> specifies the number of complex samples |
emh203 | 0:3d9c67d97d6f | 54 | * and the data in each array is stored in an interleaved fashion |
emh203 | 0:3d9c67d97d6f | 55 | * (real, imag, real, imag, ...). |
emh203 | 0:3d9c67d97d6f | 56 | * Each array has a total of <code>2*numSamples</code> values. |
emh203 | 0:3d9c67d97d6f | 57 | * The underlying algorithm is used: |
emh203 | 0:3d9c67d97d6f | 58 | * |
emh203 | 0:3d9c67d97d6f | 59 | * <pre> |
emh203 | 0:3d9c67d97d6f | 60 | * for(n=0; n<numSamples; n++) { |
emh203 | 0:3d9c67d97d6f | 61 | * pDst[(2*n)+0)] = pSrc[(2*n)+0]; // real part |
emh203 | 0:3d9c67d97d6f | 62 | * pDst[(2*n)+1)] = -pSrc[(2*n)+1]; // imag part |
emh203 | 0:3d9c67d97d6f | 63 | * } |
emh203 | 0:3d9c67d97d6f | 64 | * </pre> |
emh203 | 0:3d9c67d97d6f | 65 | * |
emh203 | 0:3d9c67d97d6f | 66 | * There are separate functions for floating-point, Q15, and Q31 data types. |
emh203 | 0:3d9c67d97d6f | 67 | */ |
emh203 | 0:3d9c67d97d6f | 68 | |
emh203 | 0:3d9c67d97d6f | 69 | /** |
emh203 | 0:3d9c67d97d6f | 70 | * @addtogroup cmplx_conj |
emh203 | 0:3d9c67d97d6f | 71 | * @{ |
emh203 | 0:3d9c67d97d6f | 72 | */ |
emh203 | 0:3d9c67d97d6f | 73 | |
emh203 | 0:3d9c67d97d6f | 74 | /** |
emh203 | 0:3d9c67d97d6f | 75 | * @brief Floating-point complex conjugate. |
emh203 | 0:3d9c67d97d6f | 76 | * @param *pSrc points to the input vector |
emh203 | 0:3d9c67d97d6f | 77 | * @param *pDst points to the output vector |
emh203 | 0:3d9c67d97d6f | 78 | * @param numSamples number of complex samples in each vector |
emh203 | 0:3d9c67d97d6f | 79 | * @return none. |
emh203 | 0:3d9c67d97d6f | 80 | */ |
emh203 | 0:3d9c67d97d6f | 81 | |
emh203 | 0:3d9c67d97d6f | 82 | void arm_cmplx_conj_f32( |
emh203 | 0:3d9c67d97d6f | 83 | float32_t * pSrc, |
emh203 | 0:3d9c67d97d6f | 84 | float32_t * pDst, |
emh203 | 0:3d9c67d97d6f | 85 | uint32_t numSamples) |
emh203 | 0:3d9c67d97d6f | 86 | { |
emh203 | 0:3d9c67d97d6f | 87 | uint32_t blkCnt; /* loop counter */ |
emh203 | 0:3d9c67d97d6f | 88 | |
emh203 | 0:3d9c67d97d6f | 89 | #ifndef ARM_MATH_CM0_FAMILY |
emh203 | 0:3d9c67d97d6f | 90 | |
emh203 | 0:3d9c67d97d6f | 91 | /* Run the below code for Cortex-M4 and Cortex-M3 */ |
emh203 | 0:3d9c67d97d6f | 92 | float32_t inR1, inR2, inR3, inR4; |
emh203 | 0:3d9c67d97d6f | 93 | float32_t inI1, inI2, inI3, inI4; |
emh203 | 0:3d9c67d97d6f | 94 | |
emh203 | 0:3d9c67d97d6f | 95 | /*loop Unrolling */ |
emh203 | 0:3d9c67d97d6f | 96 | blkCnt = numSamples >> 2u; |
emh203 | 0:3d9c67d97d6f | 97 | |
emh203 | 0:3d9c67d97d6f | 98 | /* First part of the processing with loop unrolling. Compute 4 outputs at a time. |
emh203 | 0:3d9c67d97d6f | 99 | ** a second loop below computes the remaining 1 to 3 samples. */ |
emh203 | 0:3d9c67d97d6f | 100 | while(blkCnt > 0u) |
emh203 | 0:3d9c67d97d6f | 101 | { |
emh203 | 0:3d9c67d97d6f | 102 | /* C[0]+jC[1] = A[0]+ j (-1) A[1] */ |
emh203 | 0:3d9c67d97d6f | 103 | /* Calculate Complex Conjugate and then store the results in the destination buffer. */ |
emh203 | 0:3d9c67d97d6f | 104 | /* read real input samples */ |
emh203 | 0:3d9c67d97d6f | 105 | inR1 = pSrc[0]; |
emh203 | 0:3d9c67d97d6f | 106 | /* store real samples to destination */ |
emh203 | 0:3d9c67d97d6f | 107 | pDst[0] = inR1; |
emh203 | 0:3d9c67d97d6f | 108 | inR2 = pSrc[2]; |
emh203 | 0:3d9c67d97d6f | 109 | pDst[2] = inR2; |
emh203 | 0:3d9c67d97d6f | 110 | inR3 = pSrc[4]; |
emh203 | 0:3d9c67d97d6f | 111 | pDst[4] = inR3; |
emh203 | 0:3d9c67d97d6f | 112 | inR4 = pSrc[6]; |
emh203 | 0:3d9c67d97d6f | 113 | pDst[6] = inR4; |
emh203 | 0:3d9c67d97d6f | 114 | |
emh203 | 0:3d9c67d97d6f | 115 | /* read imaginary input samples */ |
emh203 | 0:3d9c67d97d6f | 116 | inI1 = pSrc[1]; |
emh203 | 0:3d9c67d97d6f | 117 | inI2 = pSrc[3]; |
emh203 | 0:3d9c67d97d6f | 118 | |
emh203 | 0:3d9c67d97d6f | 119 | /* conjugate input */ |
emh203 | 0:3d9c67d97d6f | 120 | inI1 = -inI1; |
emh203 | 0:3d9c67d97d6f | 121 | |
emh203 | 0:3d9c67d97d6f | 122 | /* read imaginary input samples */ |
emh203 | 0:3d9c67d97d6f | 123 | inI3 = pSrc[5]; |
emh203 | 0:3d9c67d97d6f | 124 | |
emh203 | 0:3d9c67d97d6f | 125 | /* conjugate input */ |
emh203 | 0:3d9c67d97d6f | 126 | inI2 = -inI2; |
emh203 | 0:3d9c67d97d6f | 127 | |
emh203 | 0:3d9c67d97d6f | 128 | /* read imaginary input samples */ |
emh203 | 0:3d9c67d97d6f | 129 | inI4 = pSrc[7]; |
emh203 | 0:3d9c67d97d6f | 130 | |
emh203 | 0:3d9c67d97d6f | 131 | /* conjugate input */ |
emh203 | 0:3d9c67d97d6f | 132 | inI3 = -inI3; |
emh203 | 0:3d9c67d97d6f | 133 | |
emh203 | 0:3d9c67d97d6f | 134 | /* store imaginary samples to destination */ |
emh203 | 0:3d9c67d97d6f | 135 | pDst[1] = inI1; |
emh203 | 0:3d9c67d97d6f | 136 | pDst[3] = inI2; |
emh203 | 0:3d9c67d97d6f | 137 | |
emh203 | 0:3d9c67d97d6f | 138 | /* conjugate input */ |
emh203 | 0:3d9c67d97d6f | 139 | inI4 = -inI4; |
emh203 | 0:3d9c67d97d6f | 140 | |
emh203 | 0:3d9c67d97d6f | 141 | /* store imaginary samples to destination */ |
emh203 | 0:3d9c67d97d6f | 142 | pDst[5] = inI3; |
emh203 | 0:3d9c67d97d6f | 143 | |
emh203 | 0:3d9c67d97d6f | 144 | /* increment source pointer by 8 to process next sampels */ |
emh203 | 0:3d9c67d97d6f | 145 | pSrc += 8u; |
emh203 | 0:3d9c67d97d6f | 146 | |
emh203 | 0:3d9c67d97d6f | 147 | /* store imaginary sample to destination */ |
emh203 | 0:3d9c67d97d6f | 148 | pDst[7] = inI4; |
emh203 | 0:3d9c67d97d6f | 149 | |
emh203 | 0:3d9c67d97d6f | 150 | /* increment destination pointer by 8 to store next samples */ |
emh203 | 0:3d9c67d97d6f | 151 | pDst += 8u; |
emh203 | 0:3d9c67d97d6f | 152 | |
emh203 | 0:3d9c67d97d6f | 153 | /* Decrement the loop counter */ |
emh203 | 0:3d9c67d97d6f | 154 | blkCnt--; |
emh203 | 0:3d9c67d97d6f | 155 | } |
emh203 | 0:3d9c67d97d6f | 156 | |
emh203 | 0:3d9c67d97d6f | 157 | /* If the numSamples is not a multiple of 4, compute any remaining output samples here. |
emh203 | 0:3d9c67d97d6f | 158 | ** No loop unrolling is used. */ |
emh203 | 0:3d9c67d97d6f | 159 | blkCnt = numSamples % 0x4u; |
emh203 | 0:3d9c67d97d6f | 160 | |
emh203 | 0:3d9c67d97d6f | 161 | #else |
emh203 | 0:3d9c67d97d6f | 162 | |
emh203 | 0:3d9c67d97d6f | 163 | /* Run the below code for Cortex-M0 */ |
emh203 | 0:3d9c67d97d6f | 164 | blkCnt = numSamples; |
emh203 | 0:3d9c67d97d6f | 165 | |
emh203 | 0:3d9c67d97d6f | 166 | #endif /* #ifndef ARM_MATH_CM0_FAMILY */ |
emh203 | 0:3d9c67d97d6f | 167 | |
emh203 | 0:3d9c67d97d6f | 168 | while(blkCnt > 0u) |
emh203 | 0:3d9c67d97d6f | 169 | { |
emh203 | 0:3d9c67d97d6f | 170 | /* realOut + j (imagOut) = realIn + j (-1) imagIn */ |
emh203 | 0:3d9c67d97d6f | 171 | /* Calculate Complex Conjugate and then store the results in the destination buffer. */ |
emh203 | 0:3d9c67d97d6f | 172 | *pDst++ = *pSrc++; |
emh203 | 0:3d9c67d97d6f | 173 | *pDst++ = -*pSrc++; |
emh203 | 0:3d9c67d97d6f | 174 | |
emh203 | 0:3d9c67d97d6f | 175 | /* Decrement the loop counter */ |
emh203 | 0:3d9c67d97d6f | 176 | blkCnt--; |
emh203 | 0:3d9c67d97d6f | 177 | } |
emh203 | 0:3d9c67d97d6f | 178 | } |
emh203 | 0:3d9c67d97d6f | 179 | |
emh203 | 0:3d9c67d97d6f | 180 | /** |
emh203 | 0:3d9c67d97d6f | 181 | * @} end of cmplx_conj group |
emh203 | 0:3d9c67d97d6f | 182 | */ |