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_mat_trans_f32.c
emh203 0:3d9c67d97d6f 9 *
emh203 0:3d9c67d97d6f 10 * Description: Floating-point matrix transpose.
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 /**
emh203 0:3d9c67d97d6f 42 * @defgroup MatrixTrans Matrix Transpose
emh203 0:3d9c67d97d6f 43 *
emh203 0:3d9c67d97d6f 44 * Tranposes a matrix.
emh203 0:3d9c67d97d6f 45 * Transposing an <code>M x N</code> matrix flips it around the center diagonal and results in an <code>N x M</code> matrix.
emh203 0:3d9c67d97d6f 46 * \image html MatrixTranspose.gif "Transpose of a 3 x 3 matrix"
emh203 0:3d9c67d97d6f 47 */
emh203 0:3d9c67d97d6f 48
emh203 0:3d9c67d97d6f 49 #include "arm_math.h"
emh203 0:3d9c67d97d6f 50
emh203 0:3d9c67d97d6f 51 /**
emh203 0:3d9c67d97d6f 52 * @ingroup groupMatrix
emh203 0:3d9c67d97d6f 53 */
emh203 0:3d9c67d97d6f 54
emh203 0:3d9c67d97d6f 55 /**
emh203 0:3d9c67d97d6f 56 * @addtogroup MatrixTrans
emh203 0:3d9c67d97d6f 57 * @{
emh203 0:3d9c67d97d6f 58 */
emh203 0:3d9c67d97d6f 59
emh203 0:3d9c67d97d6f 60 /**
emh203 0:3d9c67d97d6f 61 * @brief Floating-point matrix transpose.
emh203 0:3d9c67d97d6f 62 * @param[in] *pSrc points to the input matrix
emh203 0:3d9c67d97d6f 63 * @param[out] *pDst points to the output matrix
emh203 0:3d9c67d97d6f 64 * @return The function returns either <code>ARM_MATH_SIZE_MISMATCH</code>
emh203 0:3d9c67d97d6f 65 * or <code>ARM_MATH_SUCCESS</code> based on the outcome of size checking.
emh203 0:3d9c67d97d6f 66 */
emh203 0:3d9c67d97d6f 67
emh203 0:3d9c67d97d6f 68
emh203 0:3d9c67d97d6f 69 arm_status arm_mat_trans_f32(
emh203 0:3d9c67d97d6f 70 const arm_matrix_instance_f32 * pSrc,
emh203 0:3d9c67d97d6f 71 arm_matrix_instance_f32 * pDst)
emh203 0:3d9c67d97d6f 72 {
emh203 0:3d9c67d97d6f 73 float32_t *pIn = pSrc->pData; /* input data matrix pointer */
emh203 0:3d9c67d97d6f 74 float32_t *pOut = pDst->pData; /* output data matrix pointer */
emh203 0:3d9c67d97d6f 75 float32_t *px; /* Temporary output data matrix pointer */
emh203 0:3d9c67d97d6f 76 uint16_t nRows = pSrc->numRows; /* number of rows */
emh203 0:3d9c67d97d6f 77 uint16_t nColumns = pSrc->numCols; /* number of columns */
emh203 0:3d9c67d97d6f 78
emh203 0:3d9c67d97d6f 79 #ifndef ARM_MATH_CM0_FAMILY
emh203 0:3d9c67d97d6f 80
emh203 0:3d9c67d97d6f 81 /* Run the below code for Cortex-M4 and Cortex-M3 */
emh203 0:3d9c67d97d6f 82
emh203 0:3d9c67d97d6f 83 uint16_t blkCnt, i = 0u, row = nRows; /* loop counters */
emh203 0:3d9c67d97d6f 84 arm_status status; /* status of matrix transpose */
emh203 0:3d9c67d97d6f 85
emh203 0:3d9c67d97d6f 86
emh203 0:3d9c67d97d6f 87 #ifdef ARM_MATH_MATRIX_CHECK
emh203 0:3d9c67d97d6f 88
emh203 0:3d9c67d97d6f 89
emh203 0:3d9c67d97d6f 90 /* Check for matrix mismatch condition */
emh203 0:3d9c67d97d6f 91 if((pSrc->numRows != pDst->numCols) || (pSrc->numCols != pDst->numRows))
emh203 0:3d9c67d97d6f 92 {
emh203 0:3d9c67d97d6f 93 /* Set status as ARM_MATH_SIZE_MISMATCH */
emh203 0:3d9c67d97d6f 94 status = ARM_MATH_SIZE_MISMATCH;
emh203 0:3d9c67d97d6f 95 }
emh203 0:3d9c67d97d6f 96 else
emh203 0:3d9c67d97d6f 97 #endif /* #ifdef ARM_MATH_MATRIX_CHECK */
emh203 0:3d9c67d97d6f 98
emh203 0:3d9c67d97d6f 99 {
emh203 0:3d9c67d97d6f 100 /* Matrix transpose by exchanging the rows with columns */
emh203 0:3d9c67d97d6f 101 /* row loop */
emh203 0:3d9c67d97d6f 102 do
emh203 0:3d9c67d97d6f 103 {
emh203 0:3d9c67d97d6f 104 /* Loop Unrolling */
emh203 0:3d9c67d97d6f 105 blkCnt = nColumns >> 2;
emh203 0:3d9c67d97d6f 106
emh203 0:3d9c67d97d6f 107 /* The pointer px is set to starting address of the column being processed */
emh203 0:3d9c67d97d6f 108 px = pOut + i;
emh203 0:3d9c67d97d6f 109
emh203 0:3d9c67d97d6f 110 /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
emh203 0:3d9c67d97d6f 111 ** a second loop below computes the remaining 1 to 3 samples. */
emh203 0:3d9c67d97d6f 112 while(blkCnt > 0u) /* column loop */
emh203 0:3d9c67d97d6f 113 {
emh203 0:3d9c67d97d6f 114 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 115 *px = *pIn++;
emh203 0:3d9c67d97d6f 116
emh203 0:3d9c67d97d6f 117 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 118 px += nRows;
emh203 0:3d9c67d97d6f 119
emh203 0:3d9c67d97d6f 120 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 121 *px = *pIn++;
emh203 0:3d9c67d97d6f 122
emh203 0:3d9c67d97d6f 123 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 124 px += nRows;
emh203 0:3d9c67d97d6f 125
emh203 0:3d9c67d97d6f 126 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 127 *px = *pIn++;
emh203 0:3d9c67d97d6f 128
emh203 0:3d9c67d97d6f 129 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 130 px += nRows;
emh203 0:3d9c67d97d6f 131
emh203 0:3d9c67d97d6f 132 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 133 *px = *pIn++;
emh203 0:3d9c67d97d6f 134
emh203 0:3d9c67d97d6f 135 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 136 px += nRows;
emh203 0:3d9c67d97d6f 137
emh203 0:3d9c67d97d6f 138 /* Decrement the column loop counter */
emh203 0:3d9c67d97d6f 139 blkCnt--;
emh203 0:3d9c67d97d6f 140 }
emh203 0:3d9c67d97d6f 141
emh203 0:3d9c67d97d6f 142 /* Perform matrix transpose for last 3 samples here. */
emh203 0:3d9c67d97d6f 143 blkCnt = nColumns % 0x4u;
emh203 0:3d9c67d97d6f 144
emh203 0:3d9c67d97d6f 145 while(blkCnt > 0u)
emh203 0:3d9c67d97d6f 146 {
emh203 0:3d9c67d97d6f 147 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 148 *px = *pIn++;
emh203 0:3d9c67d97d6f 149
emh203 0:3d9c67d97d6f 150 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 151 px += nRows;
emh203 0:3d9c67d97d6f 152
emh203 0:3d9c67d97d6f 153 /* Decrement the column loop counter */
emh203 0:3d9c67d97d6f 154 blkCnt--;
emh203 0:3d9c67d97d6f 155 }
emh203 0:3d9c67d97d6f 156
emh203 0:3d9c67d97d6f 157 #else
emh203 0:3d9c67d97d6f 158
emh203 0:3d9c67d97d6f 159 /* Run the below code for Cortex-M0 */
emh203 0:3d9c67d97d6f 160
emh203 0:3d9c67d97d6f 161 uint16_t col, i = 0u, row = nRows; /* loop counters */
emh203 0:3d9c67d97d6f 162 arm_status status; /* status of matrix transpose */
emh203 0:3d9c67d97d6f 163
emh203 0:3d9c67d97d6f 164
emh203 0:3d9c67d97d6f 165 #ifdef ARM_MATH_MATRIX_CHECK
emh203 0:3d9c67d97d6f 166
emh203 0:3d9c67d97d6f 167 /* Check for matrix mismatch condition */
emh203 0:3d9c67d97d6f 168 if((pSrc->numRows != pDst->numCols) || (pSrc->numCols != pDst->numRows))
emh203 0:3d9c67d97d6f 169 {
emh203 0:3d9c67d97d6f 170 /* Set status as ARM_MATH_SIZE_MISMATCH */
emh203 0:3d9c67d97d6f 171 status = ARM_MATH_SIZE_MISMATCH;
emh203 0:3d9c67d97d6f 172 }
emh203 0:3d9c67d97d6f 173 else
emh203 0:3d9c67d97d6f 174 #endif /* #ifdef ARM_MATH_MATRIX_CHECK */
emh203 0:3d9c67d97d6f 175
emh203 0:3d9c67d97d6f 176 {
emh203 0:3d9c67d97d6f 177 /* Matrix transpose by exchanging the rows with columns */
emh203 0:3d9c67d97d6f 178 /* row loop */
emh203 0:3d9c67d97d6f 179 do
emh203 0:3d9c67d97d6f 180 {
emh203 0:3d9c67d97d6f 181 /* The pointer px is set to starting address of the column being processed */
emh203 0:3d9c67d97d6f 182 px = pOut + i;
emh203 0:3d9c67d97d6f 183
emh203 0:3d9c67d97d6f 184 /* Initialize column loop counter */
emh203 0:3d9c67d97d6f 185 col = nColumns;
emh203 0:3d9c67d97d6f 186
emh203 0:3d9c67d97d6f 187 while(col > 0u)
emh203 0:3d9c67d97d6f 188 {
emh203 0:3d9c67d97d6f 189 /* Read and store the input element in the destination */
emh203 0:3d9c67d97d6f 190 *px = *pIn++;
emh203 0:3d9c67d97d6f 191
emh203 0:3d9c67d97d6f 192 /* Update the pointer px to point to the next row of the transposed matrix */
emh203 0:3d9c67d97d6f 193 px += nRows;
emh203 0:3d9c67d97d6f 194
emh203 0:3d9c67d97d6f 195 /* Decrement the column loop counter */
emh203 0:3d9c67d97d6f 196 col--;
emh203 0:3d9c67d97d6f 197 }
emh203 0:3d9c67d97d6f 198
emh203 0:3d9c67d97d6f 199 #endif /* #ifndef ARM_MATH_CM0_FAMILY */
emh203 0:3d9c67d97d6f 200
emh203 0:3d9c67d97d6f 201 i++;
emh203 0:3d9c67d97d6f 202
emh203 0:3d9c67d97d6f 203 /* Decrement the row loop counter */
emh203 0:3d9c67d97d6f 204 row--;
emh203 0:3d9c67d97d6f 205
emh203 0:3d9c67d97d6f 206 } while(row > 0u); /* row loop end */
emh203 0:3d9c67d97d6f 207
emh203 0:3d9c67d97d6f 208 /* Set status as ARM_MATH_SUCCESS */
emh203 0:3d9c67d97d6f 209 status = ARM_MATH_SUCCESS;
emh203 0:3d9c67d97d6f 210 }
emh203 0:3d9c67d97d6f 211
emh203 0:3d9c67d97d6f 212 /* Return to application */
emh203 0:3d9c67d97d6f 213 return (status);
emh203 0:3d9c67d97d6f 214 }
emh203 0:3d9c67d97d6f 215
emh203 0:3d9c67d97d6f 216 /**
emh203 0:3d9c67d97d6f 217 * @} end of MatrixTrans group
emh203 0:3d9c67d97d6f 218 */