Eli Hughes / CMSIS_DSP_401

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

TransformFunctions/arm_bitreversal.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?

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_bitreversal.c
emh203 0:3d9c67d97d6f 9 *
emh203 0:3d9c67d97d6f 10 * Description: This file has common tables like Bitreverse, reciprocal etc which are used across different functions
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
emh203 0:3d9c67d97d6f 41 #include "arm_math.h"
emh203 0:3d9c67d97d6f 42 #include "arm_common_tables.h"
emh203 0:3d9c67d97d6f 43
emh203 0:3d9c67d97d6f 44 /*
emh203 0:3d9c67d97d6f 45 * @brief In-place bit reversal function.
emh203 0:3d9c67d97d6f 46 * @param[in, out] *pSrc points to the in-place buffer of floating-point data type.
emh203 0:3d9c67d97d6f 47 * @param[in] fftSize length of the FFT.
emh203 0:3d9c67d97d6f 48 * @param[in] bitRevFactor bit reversal modifier that supports different size FFTs with the same bit reversal table.
emh203 0:3d9c67d97d6f 49 * @param[in] *pBitRevTab points to the bit reversal table.
emh203 0:3d9c67d97d6f 50 * @return none.
emh203 0:3d9c67d97d6f 51 */
emh203 0:3d9c67d97d6f 52
emh203 0:3d9c67d97d6f 53 void arm_bitreversal_f32(
emh203 0:3d9c67d97d6f 54 float32_t * pSrc,
emh203 0:3d9c67d97d6f 55 uint16_t fftSize,
emh203 0:3d9c67d97d6f 56 uint16_t bitRevFactor,
emh203 0:3d9c67d97d6f 57 uint16_t * pBitRevTab)
emh203 0:3d9c67d97d6f 58 {
emh203 0:3d9c67d97d6f 59 uint16_t fftLenBy2, fftLenBy2p1;
emh203 0:3d9c67d97d6f 60 uint16_t i, j;
emh203 0:3d9c67d97d6f 61 float32_t in;
emh203 0:3d9c67d97d6f 62
emh203 0:3d9c67d97d6f 63 /* Initializations */
emh203 0:3d9c67d97d6f 64 j = 0u;
emh203 0:3d9c67d97d6f 65 fftLenBy2 = fftSize >> 1u;
emh203 0:3d9c67d97d6f 66 fftLenBy2p1 = (fftSize >> 1u) + 1u;
emh203 0:3d9c67d97d6f 67
emh203 0:3d9c67d97d6f 68 /* Bit Reversal Implementation */
emh203 0:3d9c67d97d6f 69 for (i = 0u; i <= (fftLenBy2 - 2u); i += 2u)
emh203 0:3d9c67d97d6f 70 {
emh203 0:3d9c67d97d6f 71 if(i < j)
emh203 0:3d9c67d97d6f 72 {
emh203 0:3d9c67d97d6f 73 /* pSrc[i] <-> pSrc[j]; */
emh203 0:3d9c67d97d6f 74 in = pSrc[2u * i];
emh203 0:3d9c67d97d6f 75 pSrc[2u * i] = pSrc[2u * j];
emh203 0:3d9c67d97d6f 76 pSrc[2u * j] = in;
emh203 0:3d9c67d97d6f 77
emh203 0:3d9c67d97d6f 78 /* pSrc[i+1u] <-> pSrc[j+1u] */
emh203 0:3d9c67d97d6f 79 in = pSrc[(2u * i) + 1u];
emh203 0:3d9c67d97d6f 80 pSrc[(2u * i) + 1u] = pSrc[(2u * j) + 1u];
emh203 0:3d9c67d97d6f 81 pSrc[(2u * j) + 1u] = in;
emh203 0:3d9c67d97d6f 82
emh203 0:3d9c67d97d6f 83 /* pSrc[i+fftLenBy2p1] <-> pSrc[j+fftLenBy2p1] */
emh203 0:3d9c67d97d6f 84 in = pSrc[2u * (i + fftLenBy2p1)];
emh203 0:3d9c67d97d6f 85 pSrc[2u * (i + fftLenBy2p1)] = pSrc[2u * (j + fftLenBy2p1)];
emh203 0:3d9c67d97d6f 86 pSrc[2u * (j + fftLenBy2p1)] = in;
emh203 0:3d9c67d97d6f 87
emh203 0:3d9c67d97d6f 88 /* pSrc[i+fftLenBy2p1+1u] <-> pSrc[j+fftLenBy2p1+1u] */
emh203 0:3d9c67d97d6f 89 in = pSrc[(2u * (i + fftLenBy2p1)) + 1u];
emh203 0:3d9c67d97d6f 90 pSrc[(2u * (i + fftLenBy2p1)) + 1u] =
emh203 0:3d9c67d97d6f 91 pSrc[(2u * (j + fftLenBy2p1)) + 1u];
emh203 0:3d9c67d97d6f 92 pSrc[(2u * (j + fftLenBy2p1)) + 1u] = in;
emh203 0:3d9c67d97d6f 93
emh203 0:3d9c67d97d6f 94 }
emh203 0:3d9c67d97d6f 95
emh203 0:3d9c67d97d6f 96 /* pSrc[i+1u] <-> pSrc[j+1u] */
emh203 0:3d9c67d97d6f 97 in = pSrc[2u * (i + 1u)];
emh203 0:3d9c67d97d6f 98 pSrc[2u * (i + 1u)] = pSrc[2u * (j + fftLenBy2)];
emh203 0:3d9c67d97d6f 99 pSrc[2u * (j + fftLenBy2)] = in;
emh203 0:3d9c67d97d6f 100
emh203 0:3d9c67d97d6f 101 /* pSrc[i+2u] <-> pSrc[j+2u] */
emh203 0:3d9c67d97d6f 102 in = pSrc[(2u * (i + 1u)) + 1u];
emh203 0:3d9c67d97d6f 103 pSrc[(2u * (i + 1u)) + 1u] = pSrc[(2u * (j + fftLenBy2)) + 1u];
emh203 0:3d9c67d97d6f 104 pSrc[(2u * (j + fftLenBy2)) + 1u] = in;
emh203 0:3d9c67d97d6f 105
emh203 0:3d9c67d97d6f 106 /* Reading the index for the bit reversal */
emh203 0:3d9c67d97d6f 107 j = *pBitRevTab;
emh203 0:3d9c67d97d6f 108
emh203 0:3d9c67d97d6f 109 /* Updating the bit reversal index depending on the fft length */
emh203 0:3d9c67d97d6f 110 pBitRevTab += bitRevFactor;
emh203 0:3d9c67d97d6f 111 }
emh203 0:3d9c67d97d6f 112 }
emh203 0:3d9c67d97d6f 113
emh203 0:3d9c67d97d6f 114
emh203 0:3d9c67d97d6f 115
emh203 0:3d9c67d97d6f 116 /*
emh203 0:3d9c67d97d6f 117 * @brief In-place bit reversal function.
emh203 0:3d9c67d97d6f 118 * @param[in, out] *pSrc points to the in-place buffer of Q31 data type.
emh203 0:3d9c67d97d6f 119 * @param[in] fftLen length of the FFT.
emh203 0:3d9c67d97d6f 120 * @param[in] bitRevFactor bit reversal modifier that supports different size FFTs with the same bit reversal table
emh203 0:3d9c67d97d6f 121 * @param[in] *pBitRevTab points to bit reversal table.
emh203 0:3d9c67d97d6f 122 * @return none.
emh203 0:3d9c67d97d6f 123 */
emh203 0:3d9c67d97d6f 124
emh203 0:3d9c67d97d6f 125 void arm_bitreversal_q31(
emh203 0:3d9c67d97d6f 126 q31_t * pSrc,
emh203 0:3d9c67d97d6f 127 uint32_t fftLen,
emh203 0:3d9c67d97d6f 128 uint16_t bitRevFactor,
emh203 0:3d9c67d97d6f 129 uint16_t * pBitRevTable)
emh203 0:3d9c67d97d6f 130 {
emh203 0:3d9c67d97d6f 131 uint32_t fftLenBy2, fftLenBy2p1, i, j;
emh203 0:3d9c67d97d6f 132 q31_t in;
emh203 0:3d9c67d97d6f 133
emh203 0:3d9c67d97d6f 134 /* Initializations */
emh203 0:3d9c67d97d6f 135 j = 0u;
emh203 0:3d9c67d97d6f 136 fftLenBy2 = fftLen / 2u;
emh203 0:3d9c67d97d6f 137 fftLenBy2p1 = (fftLen / 2u) + 1u;
emh203 0:3d9c67d97d6f 138
emh203 0:3d9c67d97d6f 139 /* Bit Reversal Implementation */
emh203 0:3d9c67d97d6f 140 for (i = 0u; i <= (fftLenBy2 - 2u); i += 2u)
emh203 0:3d9c67d97d6f 141 {
emh203 0:3d9c67d97d6f 142 if(i < j)
emh203 0:3d9c67d97d6f 143 {
emh203 0:3d9c67d97d6f 144 /* pSrc[i] <-> pSrc[j]; */
emh203 0:3d9c67d97d6f 145 in = pSrc[2u * i];
emh203 0:3d9c67d97d6f 146 pSrc[2u * i] = pSrc[2u * j];
emh203 0:3d9c67d97d6f 147 pSrc[2u * j] = in;
emh203 0:3d9c67d97d6f 148
emh203 0:3d9c67d97d6f 149 /* pSrc[i+1u] <-> pSrc[j+1u] */
emh203 0:3d9c67d97d6f 150 in = pSrc[(2u * i) + 1u];
emh203 0:3d9c67d97d6f 151 pSrc[(2u * i) + 1u] = pSrc[(2u * j) + 1u];
emh203 0:3d9c67d97d6f 152 pSrc[(2u * j) + 1u] = in;
emh203 0:3d9c67d97d6f 153
emh203 0:3d9c67d97d6f 154 /* pSrc[i+fftLenBy2p1] <-> pSrc[j+fftLenBy2p1] */
emh203 0:3d9c67d97d6f 155 in = pSrc[2u * (i + fftLenBy2p1)];
emh203 0:3d9c67d97d6f 156 pSrc[2u * (i + fftLenBy2p1)] = pSrc[2u * (j + fftLenBy2p1)];
emh203 0:3d9c67d97d6f 157 pSrc[2u * (j + fftLenBy2p1)] = in;
emh203 0:3d9c67d97d6f 158
emh203 0:3d9c67d97d6f 159 /* pSrc[i+fftLenBy2p1+1u] <-> pSrc[j+fftLenBy2p1+1u] */
emh203 0:3d9c67d97d6f 160 in = pSrc[(2u * (i + fftLenBy2p1)) + 1u];
emh203 0:3d9c67d97d6f 161 pSrc[(2u * (i + fftLenBy2p1)) + 1u] =
emh203 0:3d9c67d97d6f 162 pSrc[(2u * (j + fftLenBy2p1)) + 1u];
emh203 0:3d9c67d97d6f 163 pSrc[(2u * (j + fftLenBy2p1)) + 1u] = in;
emh203 0:3d9c67d97d6f 164
emh203 0:3d9c67d97d6f 165 }
emh203 0:3d9c67d97d6f 166
emh203 0:3d9c67d97d6f 167 /* pSrc[i+1u] <-> pSrc[j+1u] */
emh203 0:3d9c67d97d6f 168 in = pSrc[2u * (i + 1u)];
emh203 0:3d9c67d97d6f 169 pSrc[2u * (i + 1u)] = pSrc[2u * (j + fftLenBy2)];
emh203 0:3d9c67d97d6f 170 pSrc[2u * (j + fftLenBy2)] = in;
emh203 0:3d9c67d97d6f 171
emh203 0:3d9c67d97d6f 172 /* pSrc[i+2u] <-> pSrc[j+2u] */
emh203 0:3d9c67d97d6f 173 in = pSrc[(2u * (i + 1u)) + 1u];
emh203 0:3d9c67d97d6f 174 pSrc[(2u * (i + 1u)) + 1u] = pSrc[(2u * (j + fftLenBy2)) + 1u];
emh203 0:3d9c67d97d6f 175 pSrc[(2u * (j + fftLenBy2)) + 1u] = in;
emh203 0:3d9c67d97d6f 176
emh203 0:3d9c67d97d6f 177 /* Reading the index for the bit reversal */
emh203 0:3d9c67d97d6f 178 j = *pBitRevTable;
emh203 0:3d9c67d97d6f 179
emh203 0:3d9c67d97d6f 180 /* Updating the bit reversal index depending on the fft length */
emh203 0:3d9c67d97d6f 181 pBitRevTable += bitRevFactor;
emh203 0:3d9c67d97d6f 182 }
emh203 0:3d9c67d97d6f 183 }
emh203 0:3d9c67d97d6f 184
emh203 0:3d9c67d97d6f 185
emh203 0:3d9c67d97d6f 186
emh203 0:3d9c67d97d6f 187 /*
emh203 0:3d9c67d97d6f 188 * @brief In-place bit reversal function.
emh203 0:3d9c67d97d6f 189 * @param[in, out] *pSrc points to the in-place buffer of Q15 data type.
emh203 0:3d9c67d97d6f 190 * @param[in] fftLen length of the FFT.
emh203 0:3d9c67d97d6f 191 * @param[in] bitRevFactor bit reversal modifier that supports different size FFTs with the same bit reversal table
emh203 0:3d9c67d97d6f 192 * @param[in] *pBitRevTab points to bit reversal table.
emh203 0:3d9c67d97d6f 193 * @return none.
emh203 0:3d9c67d97d6f 194 */
emh203 0:3d9c67d97d6f 195
emh203 0:3d9c67d97d6f 196 void arm_bitreversal_q15(
emh203 0:3d9c67d97d6f 197 q15_t * pSrc16,
emh203 0:3d9c67d97d6f 198 uint32_t fftLen,
emh203 0:3d9c67d97d6f 199 uint16_t bitRevFactor,
emh203 0:3d9c67d97d6f 200 uint16_t * pBitRevTab)
emh203 0:3d9c67d97d6f 201 {
emh203 0:3d9c67d97d6f 202 q31_t *pSrc = (q31_t *) pSrc16;
emh203 0:3d9c67d97d6f 203 q31_t in;
emh203 0:3d9c67d97d6f 204 uint32_t fftLenBy2, fftLenBy2p1;
emh203 0:3d9c67d97d6f 205 uint32_t i, j;
emh203 0:3d9c67d97d6f 206
emh203 0:3d9c67d97d6f 207 /* Initializations */
emh203 0:3d9c67d97d6f 208 j = 0u;
emh203 0:3d9c67d97d6f 209 fftLenBy2 = fftLen / 2u;
emh203 0:3d9c67d97d6f 210 fftLenBy2p1 = (fftLen / 2u) + 1u;
emh203 0:3d9c67d97d6f 211
emh203 0:3d9c67d97d6f 212 /* Bit Reversal Implementation */
emh203 0:3d9c67d97d6f 213 for (i = 0u; i <= (fftLenBy2 - 2u); i += 2u)
emh203 0:3d9c67d97d6f 214 {
emh203 0:3d9c67d97d6f 215 if(i < j)
emh203 0:3d9c67d97d6f 216 {
emh203 0:3d9c67d97d6f 217 /* pSrc[i] <-> pSrc[j]; */
emh203 0:3d9c67d97d6f 218 /* pSrc[i+1u] <-> pSrc[j+1u] */
emh203 0:3d9c67d97d6f 219 in = pSrc[i];
emh203 0:3d9c67d97d6f 220 pSrc[i] = pSrc[j];
emh203 0:3d9c67d97d6f 221 pSrc[j] = in;
emh203 0:3d9c67d97d6f 222
emh203 0:3d9c67d97d6f 223 /* pSrc[i + fftLenBy2p1] <-> pSrc[j + fftLenBy2p1]; */
emh203 0:3d9c67d97d6f 224 /* pSrc[i + fftLenBy2p1+1u] <-> pSrc[j + fftLenBy2p1+1u] */
emh203 0:3d9c67d97d6f 225 in = pSrc[i + fftLenBy2p1];
emh203 0:3d9c67d97d6f 226 pSrc[i + fftLenBy2p1] = pSrc[j + fftLenBy2p1];
emh203 0:3d9c67d97d6f 227 pSrc[j + fftLenBy2p1] = in;
emh203 0:3d9c67d97d6f 228 }
emh203 0:3d9c67d97d6f 229
emh203 0:3d9c67d97d6f 230 /* pSrc[i+1u] <-> pSrc[j+fftLenBy2]; */
emh203 0:3d9c67d97d6f 231 /* pSrc[i+2] <-> pSrc[j+fftLenBy2+1u] */
emh203 0:3d9c67d97d6f 232 in = pSrc[i + 1u];
emh203 0:3d9c67d97d6f 233 pSrc[i + 1u] = pSrc[j + fftLenBy2];
emh203 0:3d9c67d97d6f 234 pSrc[j + fftLenBy2] = in;
emh203 0:3d9c67d97d6f 235
emh203 0:3d9c67d97d6f 236 /* Reading the index for the bit reversal */
emh203 0:3d9c67d97d6f 237 j = *pBitRevTab;
emh203 0:3d9c67d97d6f 238
emh203 0:3d9c67d97d6f 239 /* Updating the bit reversal index depending on the fft length */
emh203 0:3d9c67d97d6f 240 pBitRevTab += bitRevFactor;
emh203 0:3d9c67d97d6f 241 }
emh203 0:3d9c67d97d6f 242 }