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

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?

UserRevisionLine numberNew 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_q31.c
emh203 0:3d9c67d97d6f 9 *
emh203 0:3d9c67d97d6f 10 * Description: Q31 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 * @addtogroup cmplx_conj
emh203 0:3d9c67d97d6f 48 * @{
emh203 0:3d9c67d97d6f 49 */
emh203 0:3d9c67d97d6f 50
emh203 0:3d9c67d97d6f 51 /**
emh203 0:3d9c67d97d6f 52 * @brief Q31 complex conjugate.
emh203 0:3d9c67d97d6f 53 * @param *pSrc points to the input vector
emh203 0:3d9c67d97d6f 54 * @param *pDst points to the output vector
emh203 0:3d9c67d97d6f 55 * @param numSamples number of complex samples in each vector
emh203 0:3d9c67d97d6f 56 * @return none.
emh203 0:3d9c67d97d6f 57 *
emh203 0:3d9c67d97d6f 58 * <b>Scaling and Overflow Behavior:</b>
emh203 0:3d9c67d97d6f 59 * \par
emh203 0:3d9c67d97d6f 60 * The function uses saturating arithmetic.
emh203 0:3d9c67d97d6f 61 * The Q31 value -1 (0x80000000) will be saturated to the maximum allowable positive value 0x7FFFFFFF.
emh203 0:3d9c67d97d6f 62 */
emh203 0:3d9c67d97d6f 63
emh203 0:3d9c67d97d6f 64 void arm_cmplx_conj_q31(
emh203 0:3d9c67d97d6f 65 q31_t * pSrc,
emh203 0:3d9c67d97d6f 66 q31_t * pDst,
emh203 0:3d9c67d97d6f 67 uint32_t numSamples)
emh203 0:3d9c67d97d6f 68 {
emh203 0:3d9c67d97d6f 69 uint32_t blkCnt; /* loop counter */
emh203 0:3d9c67d97d6f 70 q31_t in; /* Input value */
emh203 0:3d9c67d97d6f 71
emh203 0:3d9c67d97d6f 72 #ifndef ARM_MATH_CM0_FAMILY
emh203 0:3d9c67d97d6f 73
emh203 0:3d9c67d97d6f 74 /* Run the below code for Cortex-M4 and Cortex-M3 */
emh203 0:3d9c67d97d6f 75 q31_t inR1, inR2, inR3, inR4; /* Temporary real variables */
emh203 0:3d9c67d97d6f 76 q31_t inI1, inI2, inI3, inI4; /* Temporary imaginary variables */
emh203 0:3d9c67d97d6f 77
emh203 0:3d9c67d97d6f 78 /*loop Unrolling */
emh203 0:3d9c67d97d6f 79 blkCnt = numSamples >> 2u;
emh203 0:3d9c67d97d6f 80
emh203 0:3d9c67d97d6f 81 /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
emh203 0:3d9c67d97d6f 82 ** a second loop below computes the remaining 1 to 3 samples. */
emh203 0:3d9c67d97d6f 83 while(blkCnt > 0u)
emh203 0:3d9c67d97d6f 84 {
emh203 0:3d9c67d97d6f 85 /* C[0]+jC[1] = A[0]+ j (-1) A[1] */
emh203 0:3d9c67d97d6f 86 /* Calculate Complex Conjugate and then store the results in the destination buffer. */
emh203 0:3d9c67d97d6f 87 /* Saturated to 0x7fffffff if the input is -1(0x80000000) */
emh203 0:3d9c67d97d6f 88 /* read real input sample */
emh203 0:3d9c67d97d6f 89 inR1 = pSrc[0];
emh203 0:3d9c67d97d6f 90 /* store real input sample */
emh203 0:3d9c67d97d6f 91 pDst[0] = inR1;
emh203 0:3d9c67d97d6f 92
emh203 0:3d9c67d97d6f 93 /* read imaginary input sample */
emh203 0:3d9c67d97d6f 94 inI1 = pSrc[1];
emh203 0:3d9c67d97d6f 95
emh203 0:3d9c67d97d6f 96 /* read real input sample */
emh203 0:3d9c67d97d6f 97 inR2 = pSrc[2];
emh203 0:3d9c67d97d6f 98 /* store real input sample */
emh203 0:3d9c67d97d6f 99 pDst[2] = inR2;
emh203 0:3d9c67d97d6f 100
emh203 0:3d9c67d97d6f 101 /* read imaginary input sample */
emh203 0:3d9c67d97d6f 102 inI2 = pSrc[3];
emh203 0:3d9c67d97d6f 103
emh203 0:3d9c67d97d6f 104 /* negate imaginary input sample */
emh203 0:3d9c67d97d6f 105 inI1 = __QSUB(0, inI1);
emh203 0:3d9c67d97d6f 106
emh203 0:3d9c67d97d6f 107 /* read real input sample */
emh203 0:3d9c67d97d6f 108 inR3 = pSrc[4];
emh203 0:3d9c67d97d6f 109 /* store real input sample */
emh203 0:3d9c67d97d6f 110 pDst[4] = inR3;
emh203 0:3d9c67d97d6f 111
emh203 0:3d9c67d97d6f 112 /* read imaginary input sample */
emh203 0:3d9c67d97d6f 113 inI3 = pSrc[5];
emh203 0:3d9c67d97d6f 114
emh203 0:3d9c67d97d6f 115 /* negate imaginary input sample */
emh203 0:3d9c67d97d6f 116 inI2 = __QSUB(0, inI2);
emh203 0:3d9c67d97d6f 117
emh203 0:3d9c67d97d6f 118 /* read real input sample */
emh203 0:3d9c67d97d6f 119 inR4 = pSrc[6];
emh203 0:3d9c67d97d6f 120 /* store real input sample */
emh203 0:3d9c67d97d6f 121 pDst[6] = inR4;
emh203 0:3d9c67d97d6f 122
emh203 0:3d9c67d97d6f 123 /* negate imaginary input sample */
emh203 0:3d9c67d97d6f 124 inI3 = __QSUB(0, inI3);
emh203 0:3d9c67d97d6f 125
emh203 0:3d9c67d97d6f 126 /* store imaginary input sample */
emh203 0:3d9c67d97d6f 127 inI4 = pSrc[7];
emh203 0:3d9c67d97d6f 128
emh203 0:3d9c67d97d6f 129 /* store imaginary input samples */
emh203 0:3d9c67d97d6f 130 pDst[1] = inI1;
emh203 0:3d9c67d97d6f 131
emh203 0:3d9c67d97d6f 132 /* negate imaginary input sample */
emh203 0:3d9c67d97d6f 133 inI4 = __QSUB(0, inI4);
emh203 0:3d9c67d97d6f 134
emh203 0:3d9c67d97d6f 135 /* store imaginary input samples */
emh203 0:3d9c67d97d6f 136 pDst[3] = inI2;
emh203 0:3d9c67d97d6f 137
emh203 0:3d9c67d97d6f 138 /* increment source pointer by 8 to proecess next samples */
emh203 0:3d9c67d97d6f 139 pSrc += 8u;
emh203 0:3d9c67d97d6f 140
emh203 0:3d9c67d97d6f 141 /* store imaginary input samples */
emh203 0:3d9c67d97d6f 142 pDst[5] = inI3;
emh203 0:3d9c67d97d6f 143 pDst[7] = inI4;
emh203 0:3d9c67d97d6f 144
emh203 0:3d9c67d97d6f 145 /* increment destination pointer by 8 to process next samples */
emh203 0:3d9c67d97d6f 146 pDst += 8u;
emh203 0:3d9c67d97d6f 147
emh203 0:3d9c67d97d6f 148 /* Decrement the loop counter */
emh203 0:3d9c67d97d6f 149 blkCnt--;
emh203 0:3d9c67d97d6f 150 }
emh203 0:3d9c67d97d6f 151
emh203 0:3d9c67d97d6f 152 /* If the numSamples is not a multiple of 4, compute any remaining output samples here.
emh203 0:3d9c67d97d6f 153 ** No loop unrolling is used. */
emh203 0:3d9c67d97d6f 154 blkCnt = numSamples % 0x4u;
emh203 0:3d9c67d97d6f 155
emh203 0:3d9c67d97d6f 156 #else
emh203 0:3d9c67d97d6f 157
emh203 0:3d9c67d97d6f 158 /* Run the below code for Cortex-M0 */
emh203 0:3d9c67d97d6f 159 blkCnt = numSamples;
emh203 0:3d9c67d97d6f 160
emh203 0:3d9c67d97d6f 161
emh203 0:3d9c67d97d6f 162 #endif /* #ifndef ARM_MATH_CM0_FAMILY */
emh203 0:3d9c67d97d6f 163
emh203 0:3d9c67d97d6f 164 while(blkCnt > 0u)
emh203 0:3d9c67d97d6f 165 {
emh203 0:3d9c67d97d6f 166 /* C[0]+jC[1] = A[0]+ j (-1) A[1] */
emh203 0:3d9c67d97d6f 167 /* Calculate Complex Conjugate and then store the results in the destination buffer. */
emh203 0:3d9c67d97d6f 168 /* Saturated to 0x7fffffff if the input is -1(0x80000000) */
emh203 0:3d9c67d97d6f 169 *pDst++ = *pSrc++;
emh203 0:3d9c67d97d6f 170 in = *pSrc++;
emh203 0:3d9c67d97d6f 171 *pDst++ = (in == INT32_MIN) ? INT32_MAX : -in;
emh203 0:3d9c67d97d6f 172
emh203 0:3d9c67d97d6f 173 /* Decrement the loop counter */
emh203 0:3d9c67d97d6f 174 blkCnt--;
emh203 0:3d9c67d97d6f 175 }
emh203 0:3d9c67d97d6f 176 }
emh203 0:3d9c67d97d6f 177
emh203 0:3d9c67d97d6f 178 /**
emh203 0:3d9c67d97d6f 179 * @} end of cmplx_conj group
emh203 0:3d9c67d97d6f 180 */