You cannot select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
180 lines
11 KiB
C
180 lines
11 KiB
C
/* ----------------------------------------------------------------------
|
|
* Project: CMSIS DSP Library
|
|
* Title: arm_absmax_q7.c
|
|
* Description: Maximum value of absolute values of a Q7 vector
|
|
*
|
|
*
|
|
* Target Processor: Cortex-M cores
|
|
* -------------------------------------------------------------------- */
|
|
/*
|
|
* Copyright (C) 2010-2021 ARM Limited or its affiliates. All rights reserved.
|
|
*
|
|
* 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 "dsp/statistics_functions.h"
|
|
|
|
/**
|
|
@ingroup groupStats
|
|
*/
|
|
|
|
/**
|
|
@addtogroup AbsMax
|
|
@{
|
|
*/
|
|
|
|
/**
|
|
@brief Maximum value of absolute values of a Q7 vector.
|
|
@param[in] pSrc points to the input vector
|
|
@param[in] blockSize number of samples in input vector
|
|
@param[out] pResult maximum value returned here
|
|
@param[out] pIndex index of maximum value returned here
|
|
@return none
|
|
*/
|
|
#if defined(ARM_MATH_DSP)
|
|
void arm_absmax_q7(
|
|
const q7_t * pSrc,
|
|
uint32_t blockSize,
|
|
q7_t * pResult,
|
|
uint32_t * pIndex)
|
|
{
|
|
q7_t cur_absmax, out; /* Temporary variables to store the output value. */\
|
|
uint32_t blkCnt, outIndex; /* Loop counter */ \
|
|
uint32_t index; /* index of maximum value */ \
|
|
\
|
|
/* Initialize index value to zero. */ \
|
|
outIndex = 0U; \
|
|
/* Load first input value that act as reference value for comparision */ \
|
|
out = *pSrc++; \
|
|
out = (out > 0) ? out : (q7_t)__QSUB8(0, out); \
|
|
/* Initialize index of extrema value. */ \
|
|
index = 0U; \
|
|
\
|
|
/* Loop unrolling: Compute 4 outputs at a time */ \
|
|
blkCnt = (blockSize - 1U) >> 2U; \
|
|
\
|
|
while (blkCnt > 0U) \
|
|
{ \
|
|
/* Initialize cur_absmax to next consecutive values one by one */ \
|
|
cur_absmax = *pSrc++; \
|
|
cur_absmax = (cur_absmax > 0) ? cur_absmax : (q7_t)__QSUB8(0, cur_absmax); \
|
|
/* compare for the extrema value */ \
|
|
if (cur_absmax > out) \
|
|
{ \
|
|
/* Update the extrema value and it's index */ \
|
|
out = cur_absmax; \
|
|
outIndex = index + 1U; \
|
|
} \
|
|
\
|
|
cur_absmax = *pSrc++; \
|
|
cur_absmax = (cur_absmax > 0) ? cur_absmax : (q7_t)__QSUB8(0, cur_absmax); \
|
|
if (cur_absmax > out) \
|
|
{ \
|
|
out = cur_absmax; \
|
|
outIndex = index + 2U; \
|
|
} \
|
|
\
|
|
cur_absmax = *pSrc++; \
|
|
cur_absmax = (cur_absmax > 0) ? cur_absmax : (q7_t)__QSUB8(0, cur_absmax); \
|
|
if (cur_absmax > out) \
|
|
{ \
|
|
out = cur_absmax; \
|
|
outIndex = index + 3U; \
|
|
} \
|
|
\
|
|
cur_absmax = *pSrc++; \
|
|
cur_absmax = (cur_absmax > 0) ? cur_absmax : (q7_t)__QSUB8(0, cur_absmax); \
|
|
if (cur_absmax > out) \
|
|
{ \
|
|
out = cur_absmax; \
|
|
outIndex = index + 4U; \
|
|
} \
|
|
\
|
|
index += 4U; \
|
|
\
|
|
/* Decrement loop counter */ \
|
|
blkCnt--; \
|
|
} \
|
|
\
|
|
/* Loop unrolling: Compute remaining outputs */ \
|
|
blkCnt = (blockSize - 1U) % 4U; \
|
|
\
|
|
\
|
|
while (blkCnt > 0U) \
|
|
{ \
|
|
cur_absmax = *pSrc++; \
|
|
cur_absmax = (cur_absmax > 0) ? cur_absmax : (q7_t)__QSUB8(0, cur_absmax); \
|
|
if (cur_absmax > out) \
|
|
{ \
|
|
out = cur_absmax; \
|
|
outIndex = blockSize - blkCnt; \
|
|
} \
|
|
\
|
|
/* Decrement loop counter */ \
|
|
blkCnt--; \
|
|
} \
|
|
\
|
|
/* Store the extrema value and it's index into destination pointers */ \
|
|
*pResult = out; \
|
|
*pIndex = outIndex;
|
|
}
|
|
#else
|
|
void arm_absmax_q7(
|
|
const q7_t * pSrc,
|
|
uint32_t blockSize,
|
|
q7_t * pResult,
|
|
uint32_t * pIndex)
|
|
{
|
|
q7_t maxVal, out; /* Temporary variables to store the output value. */
|
|
uint32_t blkCnt, outIndex; /* Loop counter */
|
|
|
|
|
|
/* Initialise index value to zero. */
|
|
outIndex = 0U;
|
|
/* Load first input value that act as reference value for comparision */
|
|
out = (*pSrc > 0) ? *pSrc : ((*pSrc == (q7_t) 0x80) ? (q7_t) 0x7f : -*pSrc);
|
|
pSrc++;
|
|
|
|
/* Initialize blkCnt with number of samples */
|
|
blkCnt = (blockSize - 1U);
|
|
|
|
while (blkCnt > 0U)
|
|
{
|
|
/* Initialize maxVal to the next consecutive values one by one */
|
|
maxVal = (*pSrc > 0) ? *pSrc : ((*pSrc == (q7_t) 0x80) ? (q7_t) 0x7f : -*pSrc);
|
|
pSrc++;
|
|
|
|
/* compare for the maximum value */
|
|
if (out < maxVal)
|
|
{
|
|
/* Update the maximum value and it's index */
|
|
out = maxVal;
|
|
outIndex = blockSize - blkCnt;
|
|
}
|
|
|
|
/* Decrement loop counter */
|
|
blkCnt--;
|
|
}
|
|
|
|
/* Store the maximum value and it's index into destination pointers */
|
|
*pResult = out;
|
|
*pIndex = outIndex;
|
|
}
|
|
#endif /* defined(ARM_MATH_DSP) */
|
|
|
|
/**
|
|
@} end of AbsMax group
|
|
*/
|