CMSIS DSP Software Library: arm_mat_mult_fast_q31.c Source File
Main Page
Modules
Data Structures
Files
Examples
File List
Globals
arm_mat_mult_fast_q31.c
Go to the documentation of this file.00001 /* ----------------------------------------------------------------------
00002 * Copyright (C) 2010 ARM Limited. All rights reserved.
00003 *
00004 * $Date: 29. November 2010
00005 * $Revision: V1.0.3
00006 *
00007 * Project: CMSIS DSP Library
00008 * Title: arm_mat_mult_fast_q31.c
00009 *
00010 * Description: Q31 matrix multiplication (fast variant).
00011 *
00012 * Target Processor: Cortex-M4/Cortex-M3
00013 *
00014 * Version 1.0.3 2010/11/29
00015 * Re-organized the CMSIS folders and updated documentation.
00016 *
00017 * Version 1.0.2 2010/11/11
00018 * Documentation updated.
00019 *
00020 * Version 1.0.1 2010/10/05
00021 * Production release and review comments incorporated.
00022 *
00023 * Version 1.0.0 2010/09/20
00024 * Production release and review comments incorporated.
00025 * -------------------------------------------------------------------- */
00026
00027 #include "arm_math.h"
00028
00069 arm_status arm_mat_mult_fast_q31(
00070 const arm_matrix_instance_q31 * pSrcA,
00071 const arm_matrix_instance_q31 * pSrcB,
00072 arm_matrix_instance_q31 * pDst)
00073 {
00074 q31_t *pIn1 = pSrcA->pData; /* input data matrix pointer A */
00075 q31_t *pIn2 = pSrcB->pData; /* input data matrix pointer B */
00076 q31_t *pInA = pSrcA->pData; /* input data matrix pointer A */
00077 // q31_t *pSrcB = pSrcB->pData; /* input data matrix pointer B */
00078 q31_t *pOut = pDst->pData; /* output data matrix pointer */
00079 q31_t *px; /* Temporary output data matrix pointer */
00080 q31_t sum; /* Accumulator */
00081 uint16_t numRowsA = pSrcA->numRows; /* number of rows of input matrix A */
00082 uint16_t numColsB = pSrcB->numCols; /* number of columns of input matrix B */
00083 uint16_t numColsA = pSrcA->numCols; /* number of columns of input matrix A */
00084 uint16_t col, i = 0u, j, row = numRowsA, colCnt; /* loop counters */
00085 arm_status status; /* status of matrix multiplication */
00086
00087
00088 #ifdef ARM_MATH_MATRIX_CHECK
00089 /* Check for matrix mismatch condition */
00090 if((pSrcA->numCols != pSrcB->numRows) ||
00091 (pSrcA->numRows != pDst->numRows) || (pSrcB->numCols != pDst->numCols))
00092 {
00093 /* Set status as ARM_MATH_SIZE_MISMATCH */
00094 status = ARM_MATH_SIZE_MISMATCH;
00095 }
00096 else
00097 #endif
00098 {
00099 /* The following loop performs the dot-product of each row in pSrcA with each column in pSrcB */
00100 /* row loop */
00101 do
00102 {
00103 /* Output pointer is set to starting address of the row being processed */
00104 px = pOut + i;
00105
00106 /* For every row wise process, the column loop counter is to be initiated */
00107 col = numColsB;
00108
00109 /* For every row wise process, the pIn2 pointer is set
00110 ** to the starting address of the pSrcB data */
00111 pIn2 = pSrcB->pData;
00112
00113 j = 0u;
00114
00115 /* column loop */
00116 do
00117 {
00118 /* Set the variable sum, that acts as accumulator, to zero */
00119 sum = 0;
00120
00121 /* Initiate the pointer pIn1 to point to the starting address of pInA */
00122 pIn1 = pInA;
00123
00124 /* Apply loop unrolling and compute 4 MACs simultaneously. */
00125 colCnt = numColsA >> 2;
00126
00127
00128 /* matrix multiplication */
00129 while(colCnt > 0u)
00130 {
00131 /* c(m,n) = a(1,1)*b(1,1) + a(1,2) * b(2,1) + .... + a(m,p)*b(p,n) */
00132 /* Perform the multiply-accumulates */
00133 sum = (q31_t) ((((q63_t) sum << 32) +
00134 ((q63_t) * pIn1++ * (*pIn2))) >> 32);
00135 pIn2 += numColsB;
00136 sum = (q31_t) ((((q63_t) sum << 32) +
00137 ((q63_t) * pIn1++ * (*pIn2))) >> 32);
00138 pIn2 += numColsB;
00139 sum = (q31_t) ((((q63_t) sum << 32) +
00140 ((q63_t) * pIn1++ * (*pIn2))) >> 32);
00141 pIn2 += numColsB;
00142 sum = (q31_t) ((((q63_t) sum << 32) +
00143 ((q63_t) * pIn1++ * (*pIn2))) >> 32);
00144 pIn2 += numColsB;
00145
00146 /* Decrement the loop counter */
00147 colCnt--;
00148 }
00149
00150 /* If the columns of pSrcA is not a multiple of 4, compute any remaining output samples here.
00151 ** No loop unrolling is used. */
00152 colCnt = numColsA % 0x4u;
00153
00154 while(colCnt > 0u)
00155 {
00156 /* c(m,n) = a(1,1)*b(1,1) + a(1,2) * b(2,1) + .... + a(m,p)*b(p,n) */
00157 /* Perform the multiply-accumulates */
00158 sum = (q31_t) ((((q63_t) sum << 32) +
00159 ((q63_t) * pIn1++ * (*pIn2))) >> 32);
00160 pIn2 += numColsB;
00161
00162 /* Decrement the loop counter */
00163 colCnt--;
00164 }
00165
00166 /* Convert the result from 2.30 to 1.31 format and store in destination buffer */
00167 *px++ = sum << 1;
00168
00169 /* Update the pointer pIn2 to point to the starting address of the next column */
00170 j++;
00171 pIn2 = pSrcB->pData + j;
00172
00173 /* Decrement the column loop counter */
00174 col--;
00175
00176 } while(col > 0u);
00177
00178 /* Update the pointer pInA to point to the starting address of the next row */
00179 i = i + numColsB;
00180 pInA = pInA + numColsA;
00181
00182 /* Decrement the row loop counter */
00183 row--;
00184
00185 } while(row > 0u);
00186
00187 /* set status as ARM_MATH_SUCCESS */
00188 status = ARM_MATH_SUCCESS;
00189 }
00190 /* Return to application */
00191 return (status);
00192 }
00193
All Data Structures Files Functions Variables Typedefs Enumerations Enumerator Defines
Generated on Mon Nov 29 2010 17:19:57 for CMSIS DSP Software Library by
1.7.2
Wyszukiwarka
Podobne podstrony:
arm mat mult ?st q15? sourcearm mat mult ?st q31?arm mat mult ?st q15?arm cmplx mult real q31? sourcearm cmplx mult cmplx q31? sourcearm fir ?cimate ?st q31? sourcearm conv partial ?st q31? sourcearm mat mult q31? sourcearm biquad ?scade ?1 ?st q31? sourcearm mat mult q15? sourcearm mat mult q31?arm correlate ?st q31? sourcearm mat mult ?2? sourcearm conv ?st q31? sourcearm fir ?st q31? sourcearm fir lattice init q31? sourcearm fir ?cimate ?st q15? sourcearm cmplx mult cmplx q31?arm cmplx dot prod q31? sourcewięcej podobnych podstron