/github/workspace/src/StatisticsFunctions/kernels/plp_power_q8s_xpulpv2.c

Functions

	Name
void	plp_power_q8s_xpulpv2(const int8_t restrict pSrc, uint32_t blockSize, uint32_t fracBits, int32_t restrict pRes) Sum of squares of a 8-bit fixed point vector for XPULPV2 extension.

Functions Documentation

function plp_power_q8s_xpulpv2

void plp_power_q8s_xpulpv2(
    const int8_t *__restrict__ pSrc,
    uint32_t blockSize,
    uint32_t fracBits,
    int32_t *__restrict__ pRes
)

Sum of squares of a 8-bit fixed point vector for XPULPV2 extension.

Parameters:

• pSrc points to the input vector
• blockSize number of samples in input vector
• pRes sum of squares returned here

Return: none

Source code

/* =====================================================================
 * Project:      PULP DSP Library
 * Title:        plp_power_q8s_xpulpv2.c
 * Description:  Calculates the sum of squares on XPULPV2 cores
 *
 * $Date:        30.06.2020
 *
 * Target Processor: PULP cores
 * ===================================================================== */
/*
 * Copyright (C) 2020 ETH Zurich and University of Bologna.
 *
 * Author: Moritz Scherer, ETH Zurich
 *
 * SPDX-License-Identifier: Apache-2.0
 *
 * Licensed under the Apache License, Version 2.0 (the License); you may
 * not use this file except in compliance with the License.
 * You may obtain a copy of the License at
 *
 * www.apache.org/licenses/LICENSE-2.0
 *
 * Unless required by applicable law or agreed to in writing, software
 * distributed under the License is distributed on an AS IS BASIS, WITHOUT
 * WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
 * See the License for the specific language governing permissions and
 * limitations under the License.
 */

#include "plp_math.h"

void plp_power_q8s_xpulpv2(const int8_t *__restrict__ pSrc,
                           uint32_t blockSize,
                           uint32_t fracBits,
                           int32_t *__restrict__ pRes) {

    uint32_t blkCnt = 0;
    v4s x1;
    int8_t x2;
    int32_t sum = 0;
#if defined(PLP_MATH_LOOPUNROLL)

    for (blkCnt = 0; blkCnt < (blockSize >> 2); blkCnt++) {
      x1 = *((v4s*)pSrc);
      pSrc += 4;
      sum += (__builtin_pulp_dotsp4(x1,x1) >> fracBits);
    }

    for (int i=0;i<blockSize % 4;i++) {
      x2 = *pSrc++;
      sum += ((x2 * x2) >> fracBits);
    }

#else

    for (blkCnt = 0; blkCnt < blockSize; blkCnt++) {
      x2 = *pSrc++;
      sum += ((x2 * x2) >> fracBits);
    }

#endif

    *pRes = sum;
}

---

Updated on 2023-03-01 at 16:16:33 +0000