mbed official / mbed-dsp

CMSIS DSP library

Dependents:   performance_timer Surfboard_ gps2rtty Capstone ... more

Legacy Warning

This is an mbed 2 library. To learn more about mbed OS 5, visit the docs.

cmsis_dsp/FilteringFunctions/arm_correlate_opt_q15.c@5:3762170b6d4d, 2015-11-20 (annotated)

Committer:
mbed_official
Date:
Fri Nov 20 08:45:18 2015 +0000
Revision:
5:3762170b6d4d
Parent:
3:7a284390b0ce 
Synchronized with git revision 2eb940b9a73af188d3004a2575fdfbb05febe62b



Full URL: https://github.com/mbedmicro/mbed/commit/2eb940b9a73af188d3004a2575fdfbb05febe62b/



Added option to build rpc library. closes #1426

Who changed what in which revision?

UserRevisionLine numberNew contents of line
emilmont 1:fdd22bb7aa52 1 /* ----------------------------------------------------------------------
mbed_official 5:3762170b6d4d 2 * Copyright (C) 2010-2014 ARM Limited. All rights reserved.
emilmont 1:fdd22bb7aa52 3 *
mbed_official 5:3762170b6d4d 4 * $Date: 19. March 2015
mbed_official 5:3762170b6d4d 5 * $Revision: V.1.4.5
emilmont 1:fdd22bb7aa52 6 *
emilmont 2:da51fb522205 7 * Project: CMSIS DSP Library
emilmont 2:da51fb522205 8 * Title: arm_correlate_opt_q15.c
emilmont 1:fdd22bb7aa52 9 *
emilmont 2:da51fb522205 10 * Description: Correlation of Q15 sequences.
emilmont 1:fdd22bb7aa52 11 *
emilmont 1:fdd22bb7aa52 12 * Target Processor: Cortex-M4/Cortex-M3
emilmont 1:fdd22bb7aa52 13 *
mbed_official 3:7a284390b0ce 14 * Redistribution and use in source and binary forms, with or without
mbed_official 3:7a284390b0ce 15 * modification, are permitted provided that the following conditions
mbed_official 3:7a284390b0ce 16 * are met:
mbed_official 3:7a284390b0ce 17 * - Redistributions of source code must retain the above copyright
mbed_official 3:7a284390b0ce 18 * notice, this list of conditions and the following disclaimer.
mbed_official 3:7a284390b0ce 19 * - Redistributions in binary form must reproduce the above copyright
mbed_official 3:7a284390b0ce 20 * notice, this list of conditions and the following disclaimer in
mbed_official 3:7a284390b0ce 21 * the documentation and/or other materials provided with the
mbed_official 3:7a284390b0ce 22 * distribution.
mbed_official 3:7a284390b0ce 23 * - Neither the name of ARM LIMITED nor the names of its contributors
mbed_official 3:7a284390b0ce 24 * may be used to endorse or promote products derived from this
mbed_official 3:7a284390b0ce 25 * software without specific prior written permission.
mbed_official 3:7a284390b0ce 26 *
mbed_official 3:7a284390b0ce 27 * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
mbed_official 3:7a284390b0ce 28 * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
mbed_official 3:7a284390b0ce 29 * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
mbed_official 3:7a284390b0ce 30 * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
mbed_official 3:7a284390b0ce 31 * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
mbed_official 3:7a284390b0ce 32 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
mbed_official 3:7a284390b0ce 33 * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
mbed_official 3:7a284390b0ce 34 * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
mbed_official 3:7a284390b0ce 35 * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
mbed_official 3:7a284390b0ce 36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
mbed_official 3:7a284390b0ce 37 * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
mbed_official 3:7a284390b0ce 38 * POSSIBILITY OF SUCH DAMAGE.
emilmont 1:fdd22bb7aa52 39 * -------------------------------------------------------------------- */
emilmont 1:fdd22bb7aa52 40
emilmont 1:fdd22bb7aa52 41 #include "arm_math.h"
emilmont 1:fdd22bb7aa52 42
emilmont 1:fdd22bb7aa52 43 /**
emilmont 1:fdd22bb7aa52 44 * @ingroup groupFilters
emilmont 1:fdd22bb7aa52 45 */
emilmont 1:fdd22bb7aa52 46
emilmont 1:fdd22bb7aa52 47 /**
emilmont 1:fdd22bb7aa52 48 * @addtogroup Corr
emilmont 1:fdd22bb7aa52 49 * @{
emilmont 1:fdd22bb7aa52 50 */
emilmont 1:fdd22bb7aa52 51
emilmont 1:fdd22bb7aa52 52 /**
emilmont 1:fdd22bb7aa52 53 * @brief Correlation of Q15 sequences.
emilmont 1:fdd22bb7aa52 54 * @param[in] *pSrcA points to the first input sequence.
emilmont 1:fdd22bb7aa52 55 * @param[in] srcALen length of the first input sequence.
emilmont 1:fdd22bb7aa52 56 * @param[in] *pSrcB points to the second input sequence.
emilmont 1:fdd22bb7aa52 57 * @param[in] srcBLen length of the second input sequence.
emilmont 1:fdd22bb7aa52 58 * @param[out] *pDst points to the location where the output result is written. Length 2 * max(srcALen, srcBLen) - 1.
emilmont 1:fdd22bb7aa52 59 * @param[in] *pScratch points to scratch buffer of size max(srcALen, srcBLen) + 2*min(srcALen, srcBLen) - 2.
emilmont 1:fdd22bb7aa52 60 * @return none.
emilmont 1:fdd22bb7aa52 61 *
emilmont 1:fdd22bb7aa52 62 * \par Restrictions
emilmont 1:fdd22bb7aa52 63 * If the silicon does not support unaligned memory access enable the macro UNALIGNED_SUPPORT_DISABLE
emilmont 2:da51fb522205 64 * In this case input, output, scratch buffers should be aligned by 32-bit
emilmont 1:fdd22bb7aa52 65 *
emilmont 1:fdd22bb7aa52 66 * @details
emilmont 1:fdd22bb7aa52 67 * <b>Scaling and Overflow Behavior:</b>
emilmont 1:fdd22bb7aa52 68 *
emilmont 1:fdd22bb7aa52 69 * \par
emilmont 1:fdd22bb7aa52 70 * The function is implemented using a 64-bit internal accumulator.
emilmont 1:fdd22bb7aa52 71 * Both inputs are in 1.15 format and multiplications yield a 2.30 result.
emilmont 1:fdd22bb7aa52 72 * The 2.30 intermediate results are accumulated in a 64-bit accumulator in 34.30 format.
emilmont 1:fdd22bb7aa52 73 * This approach provides 33 guard bits and there is no risk of overflow.
emilmont 1:fdd22bb7aa52 74 * The 34.30 result is then truncated to 34.15 format by discarding the low 15 bits and then saturated to 1.15 format.
emilmont 1:fdd22bb7aa52 75 *
emilmont 1:fdd22bb7aa52 76 * \par
emilmont 1:fdd22bb7aa52 77 * Refer to <code>arm_correlate_fast_q15()</code> for a faster but less precise version of this function for Cortex-M3 and Cortex-M4.
emilmont 1:fdd22bb7aa52 78 *
emilmont 1:fdd22bb7aa52 79 *
emilmont 1:fdd22bb7aa52 80 */
emilmont 1:fdd22bb7aa52 81
emilmont 1:fdd22bb7aa52 82
emilmont 1:fdd22bb7aa52 83 void arm_correlate_opt_q15(
emilmont 1:fdd22bb7aa52 84 q15_t * pSrcA,
emilmont 1:fdd22bb7aa52 85 uint32_t srcALen,
emilmont 1:fdd22bb7aa52 86 q15_t * pSrcB,
emilmont 1:fdd22bb7aa52 87 uint32_t srcBLen,
emilmont 1:fdd22bb7aa52 88 q15_t * pDst,
emilmont 1:fdd22bb7aa52 89 q15_t * pScratch)
emilmont 1:fdd22bb7aa52 90 {
emilmont 1:fdd22bb7aa52 91 q15_t *pIn1; /* inputA pointer */
emilmont 1:fdd22bb7aa52 92 q15_t *pIn2; /* inputB pointer */
emilmont 1:fdd22bb7aa52 93 q63_t acc0, acc1, acc2, acc3; /* Accumulators */
emilmont 1:fdd22bb7aa52 94 q15_t *py; /* Intermediate inputB pointer */
emilmont 1:fdd22bb7aa52 95 q31_t x1, x2, x3; /* temporary variables for holding input1 and input2 values */
emilmont 1:fdd22bb7aa52 96 uint32_t j, blkCnt, outBlockSize; /* loop counter */
emilmont 1:fdd22bb7aa52 97 int32_t inc = 1; /* output pointer increment */
emilmont 1:fdd22bb7aa52 98 uint32_t tapCnt;
emilmont 1:fdd22bb7aa52 99 q31_t y1, y2;
emilmont 1:fdd22bb7aa52 100 q15_t *pScr; /* Intermediate pointers */
emilmont 1:fdd22bb7aa52 101 q15_t *pOut = pDst; /* output pointer */
emilmont 1:fdd22bb7aa52 102 #ifdef UNALIGNED_SUPPORT_DISABLE
emilmont 1:fdd22bb7aa52 103
emilmont 1:fdd22bb7aa52 104 q15_t a, b;
emilmont 1:fdd22bb7aa52 105
emilmont 2:da51fb522205 106 #endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
emilmont 1:fdd22bb7aa52 107
emilmont 1:fdd22bb7aa52 108 /* The algorithm implementation is based on the lengths of the inputs. */
emilmont 1:fdd22bb7aa52 109 /* srcB is always made to slide across srcA. */
emilmont 1:fdd22bb7aa52 110 /* So srcBLen is always considered as shorter or equal to srcALen */
emilmont 1:fdd22bb7aa52 111 /* But CORR(x, y) is reverse of CORR(y, x) */
emilmont 1:fdd22bb7aa52 112 /* So, when srcBLen > srcALen, output pointer is made to point to the end of the output buffer */
emilmont 1:fdd22bb7aa52 113 /* and the destination pointer modifier, inc is set to -1 */
emilmont 1:fdd22bb7aa52 114 /* If srcALen > srcBLen, zero pad has to be done to srcB to make the two inputs of same length */
emilmont 1:fdd22bb7aa52 115 /* But to improve the performance,
emilmont 1:fdd22bb7aa52 116 * we include zeroes in the output instead of zero padding either of the the inputs*/
emilmont 1:fdd22bb7aa52 117 /* If srcALen > srcBLen,
emilmont 1:fdd22bb7aa52 118 * (srcALen - srcBLen) zeroes has to included in the starting of the output buffer */
emilmont 1:fdd22bb7aa52 119 /* If srcALen < srcBLen,
emilmont 1:fdd22bb7aa52 120 * (srcALen - srcBLen) zeroes has to included in the ending of the output buffer */
emilmont 1:fdd22bb7aa52 121 if(srcALen >= srcBLen)
emilmont 1:fdd22bb7aa52 122 {
emilmont 1:fdd22bb7aa52 123 /* Initialization of inputA pointer */
emilmont 1:fdd22bb7aa52 124 pIn1 = (pSrcA);
emilmont 1:fdd22bb7aa52 125
emilmont 1:fdd22bb7aa52 126 /* Initialization of inputB pointer */
emilmont 1:fdd22bb7aa52 127 pIn2 = (pSrcB);
emilmont 1:fdd22bb7aa52 128
emilmont 1:fdd22bb7aa52 129 /* Number of output samples is calculated */
emilmont 1:fdd22bb7aa52 130 outBlockSize = (2u * srcALen) - 1u;
emilmont 1:fdd22bb7aa52 131
emilmont 1:fdd22bb7aa52 132 /* When srcALen > srcBLen, zero padding is done to srcB
emilmont 1:fdd22bb7aa52 133 * to make their lengths equal.
emilmont 1:fdd22bb7aa52 134 * Instead, (outBlockSize - (srcALen + srcBLen - 1))
emilmont 1:fdd22bb7aa52 135 * number of output samples are made zero */
emilmont 1:fdd22bb7aa52 136 j = outBlockSize - (srcALen + (srcBLen - 1u));
emilmont 1:fdd22bb7aa52 137
emilmont 1:fdd22bb7aa52 138 /* Updating the pointer position to non zero value */
emilmont 1:fdd22bb7aa52 139 pOut += j;
emilmont 1:fdd22bb7aa52 140
emilmont 1:fdd22bb7aa52 141 }
emilmont 1:fdd22bb7aa52 142 else
emilmont 1:fdd22bb7aa52 143 {
emilmont 1:fdd22bb7aa52 144 /* Initialization of inputA pointer */
emilmont 1:fdd22bb7aa52 145 pIn1 = (pSrcB);
emilmont 1:fdd22bb7aa52 146
emilmont 1:fdd22bb7aa52 147 /* Initialization of inputB pointer */
emilmont 1:fdd22bb7aa52 148 pIn2 = (pSrcA);
emilmont 1:fdd22bb7aa52 149
emilmont 1:fdd22bb7aa52 150 /* srcBLen is always considered as shorter or equal to srcALen */
emilmont 1:fdd22bb7aa52 151 j = srcBLen;
emilmont 1:fdd22bb7aa52 152 srcBLen = srcALen;
emilmont 1:fdd22bb7aa52 153 srcALen = j;
emilmont 1:fdd22bb7aa52 154
emilmont 1:fdd22bb7aa52 155 /* CORR(x, y) = Reverse order(CORR(y, x)) */
emilmont 1:fdd22bb7aa52 156 /* Hence set the destination pointer to point to the last output sample */
emilmont 1:fdd22bb7aa52 157 pOut = pDst + ((srcALen + srcBLen) - 2u);
emilmont 1:fdd22bb7aa52 158
emilmont 1:fdd22bb7aa52 159 /* Destination address modifier is set to -1 */
emilmont 1:fdd22bb7aa52 160 inc = -1;
emilmont 1:fdd22bb7aa52 161
emilmont 1:fdd22bb7aa52 162 }
emilmont 1:fdd22bb7aa52 163
emilmont 1:fdd22bb7aa52 164 pScr = pScratch;
emilmont 1:fdd22bb7aa52 165
emilmont 1:fdd22bb7aa52 166 /* Fill (srcBLen - 1u) zeros in scratch buffer */
emilmont 1:fdd22bb7aa52 167 arm_fill_q15(0, pScr, (srcBLen - 1u));
emilmont 1:fdd22bb7aa52 168
emilmont 1:fdd22bb7aa52 169 /* Update temporary scratch pointer */
emilmont 1:fdd22bb7aa52 170 pScr += (srcBLen - 1u);
emilmont 1:fdd22bb7aa52 171
emilmont 1:fdd22bb7aa52 172 #ifndef UNALIGNED_SUPPORT_DISABLE
emilmont 1:fdd22bb7aa52 173
emilmont 1:fdd22bb7aa52 174 /* Copy (srcALen) samples in scratch buffer */
emilmont 1:fdd22bb7aa52 175 arm_copy_q15(pIn1, pScr, srcALen);
emilmont 1:fdd22bb7aa52 176
emilmont 1:fdd22bb7aa52 177 /* Update pointers */
emilmont 1:fdd22bb7aa52 178 //pIn1 += srcALen;
emilmont 1:fdd22bb7aa52 179 pScr += srcALen;
emilmont 1:fdd22bb7aa52 180
emilmont 1:fdd22bb7aa52 181 #else
emilmont 1:fdd22bb7aa52 182
emilmont 1:fdd22bb7aa52 183 /* Apply loop unrolling and do 4 Copies simultaneously. */
emilmont 1:fdd22bb7aa52 184 j = srcALen >> 2u;
emilmont 1:fdd22bb7aa52 185
emilmont 1:fdd22bb7aa52 186 /* First part of the processing with loop unrolling copies 4 data points at a time.
emilmont 1:fdd22bb7aa52 187 ** a second loop below copies for the remaining 1 to 3 samples. */
emilmont 1:fdd22bb7aa52 188 while(j > 0u)
emilmont 1:fdd22bb7aa52 189 {
emilmont 1:fdd22bb7aa52 190 /* copy second buffer in reversal manner */
emilmont 1:fdd22bb7aa52 191 *pScr++ = *pIn1++;
emilmont 1:fdd22bb7aa52 192 *pScr++ = *pIn1++;
emilmont 1:fdd22bb7aa52 193 *pScr++ = *pIn1++;
emilmont 1:fdd22bb7aa52 194 *pScr++ = *pIn1++;
emilmont 1:fdd22bb7aa52 195
emilmont 1:fdd22bb7aa52 196 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 197 j--;
emilmont 1:fdd22bb7aa52 198 }
emilmont 1:fdd22bb7aa52 199
emilmont 1:fdd22bb7aa52 200 /* If the count is not a multiple of 4, copy remaining samples here.
emilmont 1:fdd22bb7aa52 201 ** No loop unrolling is used. */
emilmont 1:fdd22bb7aa52 202 j = srcALen % 0x4u;
emilmont 1:fdd22bb7aa52 203
emilmont 1:fdd22bb7aa52 204 while(j > 0u)
emilmont 1:fdd22bb7aa52 205 {
emilmont 1:fdd22bb7aa52 206 /* copy second buffer in reversal manner for remaining samples */
emilmont 1:fdd22bb7aa52 207 *pScr++ = *pIn1++;
emilmont 1:fdd22bb7aa52 208
emilmont 1:fdd22bb7aa52 209 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 210 j--;
emilmont 1:fdd22bb7aa52 211 }
emilmont 1:fdd22bb7aa52 212
emilmont 2:da51fb522205 213 #endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
emilmont 1:fdd22bb7aa52 214
emilmont 1:fdd22bb7aa52 215 #ifndef UNALIGNED_SUPPORT_DISABLE
emilmont 1:fdd22bb7aa52 216
emilmont 1:fdd22bb7aa52 217 /* Fill (srcBLen - 1u) zeros at end of scratch buffer */
emilmont 1:fdd22bb7aa52 218 arm_fill_q15(0, pScr, (srcBLen - 1u));
emilmont 1:fdd22bb7aa52 219
emilmont 1:fdd22bb7aa52 220 /* Update pointer */
emilmont 1:fdd22bb7aa52 221 pScr += (srcBLen - 1u);
emilmont 1:fdd22bb7aa52 222
emilmont 1:fdd22bb7aa52 223 #else
emilmont 1:fdd22bb7aa52 224
emilmont 1:fdd22bb7aa52 225 /* Apply loop unrolling and do 4 Copies simultaneously. */
emilmont 1:fdd22bb7aa52 226 j = (srcBLen - 1u) >> 2u;
emilmont 1:fdd22bb7aa52 227
emilmont 1:fdd22bb7aa52 228 /* First part of the processing with loop unrolling copies 4 data points at a time.
emilmont 1:fdd22bb7aa52 229 ** a second loop below copies for the remaining 1 to 3 samples. */
emilmont 1:fdd22bb7aa52 230 while(j > 0u)
emilmont 1:fdd22bb7aa52 231 {
emilmont 1:fdd22bb7aa52 232 /* copy second buffer in reversal manner */
emilmont 1:fdd22bb7aa52 233 *pScr++ = 0;
emilmont 1:fdd22bb7aa52 234 *pScr++ = 0;
emilmont 1:fdd22bb7aa52 235 *pScr++ = 0;
emilmont 1:fdd22bb7aa52 236 *pScr++ = 0;
emilmont 1:fdd22bb7aa52 237
emilmont 1:fdd22bb7aa52 238 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 239 j--;
emilmont 1:fdd22bb7aa52 240 }
emilmont 1:fdd22bb7aa52 241
emilmont 1:fdd22bb7aa52 242 /* If the count is not a multiple of 4, copy remaining samples here.
emilmont 1:fdd22bb7aa52 243 ** No loop unrolling is used. */
emilmont 1:fdd22bb7aa52 244 j = (srcBLen - 1u) % 0x4u;
emilmont 1:fdd22bb7aa52 245
emilmont 1:fdd22bb7aa52 246 while(j > 0u)
emilmont 1:fdd22bb7aa52 247 {
emilmont 1:fdd22bb7aa52 248 /* copy second buffer in reversal manner for remaining samples */
emilmont 1:fdd22bb7aa52 249 *pScr++ = 0;
emilmont 1:fdd22bb7aa52 250
emilmont 1:fdd22bb7aa52 251 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 252 j--;
emilmont 1:fdd22bb7aa52 253 }
emilmont 1:fdd22bb7aa52 254
emilmont 2:da51fb522205 255 #endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
emilmont 1:fdd22bb7aa52 256
emilmont 1:fdd22bb7aa52 257 /* Temporary pointer for scratch2 */
emilmont 1:fdd22bb7aa52 258 py = pIn2;
emilmont 1:fdd22bb7aa52 259
emilmont 1:fdd22bb7aa52 260
emilmont 1:fdd22bb7aa52 261 /* Actual correlation process starts here */
emilmont 1:fdd22bb7aa52 262 blkCnt = (srcALen + srcBLen - 1u) >> 2;
emilmont 1:fdd22bb7aa52 263
emilmont 1:fdd22bb7aa52 264 while(blkCnt > 0)
emilmont 1:fdd22bb7aa52 265 {
emilmont 1:fdd22bb7aa52 266 /* Initialze temporary scratch pointer as scratch1 */
emilmont 1:fdd22bb7aa52 267 pScr = pScratch;
emilmont 1:fdd22bb7aa52 268
emilmont 1:fdd22bb7aa52 269 /* Clear Accumlators */
emilmont 1:fdd22bb7aa52 270 acc0 = 0;
emilmont 1:fdd22bb7aa52 271 acc1 = 0;
emilmont 1:fdd22bb7aa52 272 acc2 = 0;
emilmont 1:fdd22bb7aa52 273 acc3 = 0;
emilmont 1:fdd22bb7aa52 274
emilmont 1:fdd22bb7aa52 275 /* Read four samples from scratch1 buffer */
emilmont 1:fdd22bb7aa52 276 x1 = *__SIMD32(pScr)++;
emilmont 1:fdd22bb7aa52 277
emilmont 1:fdd22bb7aa52 278 /* Read next four samples from scratch1 buffer */
emilmont 1:fdd22bb7aa52 279 x2 = *__SIMD32(pScr)++;
emilmont 1:fdd22bb7aa52 280
emilmont 1:fdd22bb7aa52 281 tapCnt = (srcBLen) >> 2u;
emilmont 1:fdd22bb7aa52 282
emilmont 1:fdd22bb7aa52 283 while(tapCnt > 0u)
emilmont 1:fdd22bb7aa52 284 {
emilmont 1:fdd22bb7aa52 285
emilmont 1:fdd22bb7aa52 286 #ifndef UNALIGNED_SUPPORT_DISABLE
emilmont 1:fdd22bb7aa52 287
emilmont 1:fdd22bb7aa52 288 /* Read four samples from smaller buffer */
emilmont 1:fdd22bb7aa52 289 y1 = _SIMD32_OFFSET(pIn2);
emilmont 1:fdd22bb7aa52 290 y2 = _SIMD32_OFFSET(pIn2 + 2u);
emilmont 1:fdd22bb7aa52 291
emilmont 1:fdd22bb7aa52 292 acc0 = __SMLALD(x1, y1, acc0);
emilmont 1:fdd22bb7aa52 293
emilmont 1:fdd22bb7aa52 294 acc2 = __SMLALD(x2, y1, acc2);
emilmont 1:fdd22bb7aa52 295
emilmont 1:fdd22bb7aa52 296 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 297 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 298 #else
emilmont 1:fdd22bb7aa52 299 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 300 #endif
emilmont 1:fdd22bb7aa52 301
emilmont 1:fdd22bb7aa52 302 acc1 = __SMLALDX(x3, y1, acc1);
emilmont 1:fdd22bb7aa52 303
emilmont 1:fdd22bb7aa52 304 x1 = _SIMD32_OFFSET(pScr);
emilmont 1:fdd22bb7aa52 305
emilmont 1:fdd22bb7aa52 306 acc0 = __SMLALD(x2, y2, acc0);
emilmont 1:fdd22bb7aa52 307
emilmont 1:fdd22bb7aa52 308 acc2 = __SMLALD(x1, y2, acc2);
emilmont 1:fdd22bb7aa52 309
emilmont 1:fdd22bb7aa52 310 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 311 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 312 #else
emilmont 1:fdd22bb7aa52 313 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 314 #endif
emilmont 1:fdd22bb7aa52 315
emilmont 1:fdd22bb7aa52 316 acc3 = __SMLALDX(x3, y1, acc3);
emilmont 1:fdd22bb7aa52 317
emilmont 1:fdd22bb7aa52 318 acc1 = __SMLALDX(x3, y2, acc1);
emilmont 1:fdd22bb7aa52 319
emilmont 1:fdd22bb7aa52 320 x2 = _SIMD32_OFFSET(pScr + 2u);
emilmont 1:fdd22bb7aa52 321
emilmont 1:fdd22bb7aa52 322 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 323 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 324 #else
emilmont 1:fdd22bb7aa52 325 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 326 #endif
emilmont 1:fdd22bb7aa52 327
emilmont 1:fdd22bb7aa52 328 acc3 = __SMLALDX(x3, y2, acc3);
emilmont 1:fdd22bb7aa52 329
emilmont 2:da51fb522205 330 #else
emilmont 1:fdd22bb7aa52 331
emilmont 1:fdd22bb7aa52 332 /* Read four samples from smaller buffer */
emilmont 2:da51fb522205 333 a = *pIn2;
emilmont 2:da51fb522205 334 b = *(pIn2 + 1);
emilmont 1:fdd22bb7aa52 335
emilmont 1:fdd22bb7aa52 336 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 337 y1 = __PKHBT(a, b, 16);
emilmont 1:fdd22bb7aa52 338 #else
emilmont 1:fdd22bb7aa52 339 y1 = __PKHBT(b, a, 16);
emilmont 1:fdd22bb7aa52 340 #endif
emilmont 2:da51fb522205 341
emilmont 2:da51fb522205 342 a = *(pIn2 + 2);
emilmont 2:da51fb522205 343 b = *(pIn2 + 3);
emilmont 1:fdd22bb7aa52 344 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 345 y2 = __PKHBT(a, b, 16);
emilmont 1:fdd22bb7aa52 346 #else
emilmont 1:fdd22bb7aa52 347 y2 = __PKHBT(b, a, 16);
emilmont 2:da51fb522205 348 #endif
emilmont 1:fdd22bb7aa52 349
emilmont 1:fdd22bb7aa52 350 acc0 = __SMLALD(x1, y1, acc0);
emilmont 1:fdd22bb7aa52 351
emilmont 1:fdd22bb7aa52 352 acc2 = __SMLALD(x2, y1, acc2);
emilmont 1:fdd22bb7aa52 353
emilmont 1:fdd22bb7aa52 354 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 355 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 356 #else
emilmont 1:fdd22bb7aa52 357 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 358 #endif
emilmont 1:fdd22bb7aa52 359
emilmont 1:fdd22bb7aa52 360 acc1 = __SMLALDX(x3, y1, acc1);
emilmont 1:fdd22bb7aa52 361
emilmont 2:da51fb522205 362 a = *pScr;
emilmont 2:da51fb522205 363 b = *(pScr + 1);
emilmont 1:fdd22bb7aa52 364
emilmont 1:fdd22bb7aa52 365 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 366 x1 = __PKHBT(a, b, 16);
emilmont 1:fdd22bb7aa52 367 #else
emilmont 1:fdd22bb7aa52 368 x1 = __PKHBT(b, a, 16);
emilmont 1:fdd22bb7aa52 369 #endif
emilmont 1:fdd22bb7aa52 370
emilmont 1:fdd22bb7aa52 371 acc0 = __SMLALD(x2, y2, acc0);
emilmont 1:fdd22bb7aa52 372
emilmont 1:fdd22bb7aa52 373 acc2 = __SMLALD(x1, y2, acc2);
emilmont 1:fdd22bb7aa52 374
emilmont 1:fdd22bb7aa52 375 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 376 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 377 #else
emilmont 1:fdd22bb7aa52 378 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 379 #endif
emilmont 1:fdd22bb7aa52 380
emilmont 1:fdd22bb7aa52 381 acc3 = __SMLALDX(x3, y1, acc3);
emilmont 1:fdd22bb7aa52 382
emilmont 1:fdd22bb7aa52 383 acc1 = __SMLALDX(x3, y2, acc1);
emilmont 1:fdd22bb7aa52 384
emilmont 2:da51fb522205 385 a = *(pScr + 2);
emilmont 2:da51fb522205 386 b = *(pScr + 3);
emilmont 1:fdd22bb7aa52 387
emilmont 1:fdd22bb7aa52 388 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 389 x2 = __PKHBT(a, b, 16);
emilmont 1:fdd22bb7aa52 390 #else
emilmont 1:fdd22bb7aa52 391 x2 = __PKHBT(b, a, 16);
emilmont 1:fdd22bb7aa52 392 #endif
emilmont 1:fdd22bb7aa52 393
emilmont 1:fdd22bb7aa52 394 #ifndef ARM_MATH_BIG_ENDIAN
emilmont 1:fdd22bb7aa52 395 x3 = __PKHBT(x2, x1, 0);
emilmont 1:fdd22bb7aa52 396 #else
emilmont 1:fdd22bb7aa52 397 x3 = __PKHBT(x1, x2, 0);
emilmont 1:fdd22bb7aa52 398 #endif
emilmont 1:fdd22bb7aa52 399
emilmont 1:fdd22bb7aa52 400 acc3 = __SMLALDX(x3, y2, acc3);
emilmont 1:fdd22bb7aa52 401
emilmont 2:da51fb522205 402 #endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
emilmont 1:fdd22bb7aa52 403
emilmont 1:fdd22bb7aa52 404 pIn2 += 4u;
emilmont 1:fdd22bb7aa52 405
emilmont 1:fdd22bb7aa52 406 pScr += 4u;
emilmont 1:fdd22bb7aa52 407
emilmont 1:fdd22bb7aa52 408
emilmont 1:fdd22bb7aa52 409 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 410 tapCnt--;
emilmont 1:fdd22bb7aa52 411 }
emilmont 1:fdd22bb7aa52 412
emilmont 1:fdd22bb7aa52 413
emilmont 1:fdd22bb7aa52 414
emilmont 1:fdd22bb7aa52 415 /* Update scratch pointer for remaining samples of smaller length sequence */
emilmont 1:fdd22bb7aa52 416 pScr -= 4u;
emilmont 1:fdd22bb7aa52 417
emilmont 1:fdd22bb7aa52 418
emilmont 1:fdd22bb7aa52 419 /* apply same above for remaining samples of smaller length sequence */
emilmont 1:fdd22bb7aa52 420 tapCnt = (srcBLen) & 3u;
emilmont 1:fdd22bb7aa52 421
emilmont 1:fdd22bb7aa52 422 while(tapCnt > 0u)
emilmont 1:fdd22bb7aa52 423 {
emilmont 1:fdd22bb7aa52 424
emilmont 1:fdd22bb7aa52 425 /* accumlate the results */
emilmont 1:fdd22bb7aa52 426 acc0 += (*pScr++ * *pIn2);
emilmont 1:fdd22bb7aa52 427 acc1 += (*pScr++ * *pIn2);
emilmont 1:fdd22bb7aa52 428 acc2 += (*pScr++ * *pIn2);
emilmont 1:fdd22bb7aa52 429 acc3 += (*pScr++ * *pIn2++);
emilmont 1:fdd22bb7aa52 430
emilmont 1:fdd22bb7aa52 431 pScr -= 3u;
emilmont 1:fdd22bb7aa52 432
emilmont 1:fdd22bb7aa52 433 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 434 tapCnt--;
emilmont 1:fdd22bb7aa52 435 }
emilmont 1:fdd22bb7aa52 436
emilmont 1:fdd22bb7aa52 437 blkCnt--;
emilmont 1:fdd22bb7aa52 438
emilmont 1:fdd22bb7aa52 439
emilmont 1:fdd22bb7aa52 440 /* Store the results in the accumulators in the destination buffer. */
emilmont 1:fdd22bb7aa52 441 *pOut = (__SSAT(acc0 >> 15u, 16));
emilmont 1:fdd22bb7aa52 442 pOut += inc;
emilmont 1:fdd22bb7aa52 443 *pOut = (__SSAT(acc1 >> 15u, 16));
emilmont 1:fdd22bb7aa52 444 pOut += inc;
emilmont 1:fdd22bb7aa52 445 *pOut = (__SSAT(acc2 >> 15u, 16));
emilmont 1:fdd22bb7aa52 446 pOut += inc;
emilmont 1:fdd22bb7aa52 447 *pOut = (__SSAT(acc3 >> 15u, 16));
emilmont 1:fdd22bb7aa52 448 pOut += inc;
emilmont 1:fdd22bb7aa52 449
emilmont 1:fdd22bb7aa52 450 /* Initialization of inputB pointer */
emilmont 1:fdd22bb7aa52 451 pIn2 = py;
emilmont 1:fdd22bb7aa52 452
emilmont 1:fdd22bb7aa52 453 pScratch += 4u;
emilmont 1:fdd22bb7aa52 454
emilmont 1:fdd22bb7aa52 455 }
emilmont 1:fdd22bb7aa52 456
emilmont 1:fdd22bb7aa52 457
emilmont 1:fdd22bb7aa52 458 blkCnt = (srcALen + srcBLen - 1u) & 0x3;
emilmont 1:fdd22bb7aa52 459
emilmont 1:fdd22bb7aa52 460 /* Calculate correlation for remaining samples of Bigger length sequence */
emilmont 1:fdd22bb7aa52 461 while(blkCnt > 0)
emilmont 1:fdd22bb7aa52 462 {
emilmont 1:fdd22bb7aa52 463 /* Initialze temporary scratch pointer as scratch1 */
emilmont 1:fdd22bb7aa52 464 pScr = pScratch;
emilmont 1:fdd22bb7aa52 465
emilmont 1:fdd22bb7aa52 466 /* Clear Accumlators */
emilmont 1:fdd22bb7aa52 467 acc0 = 0;
emilmont 1:fdd22bb7aa52 468
emilmont 1:fdd22bb7aa52 469 tapCnt = (srcBLen) >> 1u;
emilmont 1:fdd22bb7aa52 470
emilmont 1:fdd22bb7aa52 471 while(tapCnt > 0u)
emilmont 1:fdd22bb7aa52 472 {
emilmont 1:fdd22bb7aa52 473
emilmont 1:fdd22bb7aa52 474 acc0 += (*pScr++ * *pIn2++);
emilmont 1:fdd22bb7aa52 475 acc0 += (*pScr++ * *pIn2++);
emilmont 1:fdd22bb7aa52 476
emilmont 1:fdd22bb7aa52 477 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 478 tapCnt--;
emilmont 1:fdd22bb7aa52 479 }
emilmont 1:fdd22bb7aa52 480
emilmont 1:fdd22bb7aa52 481 tapCnt = (srcBLen) & 1u;
emilmont 1:fdd22bb7aa52 482
emilmont 1:fdd22bb7aa52 483 /* apply same above for remaining samples of smaller length sequence */
emilmont 1:fdd22bb7aa52 484 while(tapCnt > 0u)
emilmont 1:fdd22bb7aa52 485 {
emilmont 1:fdd22bb7aa52 486
emilmont 1:fdd22bb7aa52 487 /* accumlate the results */
emilmont 1:fdd22bb7aa52 488 acc0 += (*pScr++ * *pIn2++);
emilmont 1:fdd22bb7aa52 489
emilmont 1:fdd22bb7aa52 490 /* Decrement the loop counter */
emilmont 1:fdd22bb7aa52 491 tapCnt--;
emilmont 1:fdd22bb7aa52 492 }
emilmont 1:fdd22bb7aa52 493
emilmont 1:fdd22bb7aa52 494 blkCnt--;
emilmont 1:fdd22bb7aa52 495
emilmont 1:fdd22bb7aa52 496 /* Store the result in the accumulator in the destination buffer. */
emilmont 1:fdd22bb7aa52 497 *pOut = (q15_t) (__SSAT((acc0 >> 15), 16));
emilmont 1:fdd22bb7aa52 498
emilmont 1:fdd22bb7aa52 499 pOut += inc;
emilmont 1:fdd22bb7aa52 500
emilmont 1:fdd22bb7aa52 501 /* Initialization of inputB pointer */
emilmont 1:fdd22bb7aa52 502 pIn2 = py;
emilmont 1:fdd22bb7aa52 503
emilmont 1:fdd22bb7aa52 504 pScratch += 1u;
emilmont 1:fdd22bb7aa52 505
emilmont 1:fdd22bb7aa52 506 }
emilmont 1:fdd22bb7aa52 507
emilmont 1:fdd22bb7aa52 508
emilmont 1:fdd22bb7aa52 509 }
emilmont 1:fdd22bb7aa52 510
emilmont 1:fdd22bb7aa52 511 /**
emilmont 1:fdd22bb7aa52 512 * @} end of Corr group
emilmont 1:fdd22bb7aa52 513 */