150 lines
3.5 KiB
C
150 lines
3.5 KiB
C
/* ----------------------------------------------------------------------
|
|
* Project: CMSIS DSP Library
|
|
* Title: arm_min_q7.c
|
|
* Description: Minimum value of a Q7 vector
|
|
*
|
|
* $Date: 18. March 2019
|
|
* $Revision: V1.6.0
|
|
*
|
|
* Target Processor: Cortex-M cores
|
|
* -------------------------------------------------------------------- */
|
|
/*
|
|
* Copyright (C) 2010-2019 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 "arm_math.h"
|
|
|
|
/**
|
|
@ingroup groupStats
|
|
*/
|
|
|
|
|
|
/**
|
|
@addtogroup Min
|
|
@{
|
|
*/
|
|
|
|
/**
|
|
@brief Minimum value of a Q7 vector.
|
|
@param[in] pSrc points to the input vector
|
|
@param[in] blockSize number of samples in input vector
|
|
@param[out] pResult minimum value returned here
|
|
@param[out] pIndex index of minimum value returned here
|
|
@return none
|
|
*/
|
|
|
|
void arm_min_q7(
|
|
const q7_t * pSrc,
|
|
uint32_t blockSize,
|
|
q7_t * pResult,
|
|
uint32_t * pIndex)
|
|
{
|
|
q7_t minVal, out; /* Temporary variables to store the output value. */
|
|
uint32_t blkCnt, outIndex; /* Loop counter */
|
|
|
|
#if defined (ARM_MATH_LOOPUNROLL)
|
|
uint32_t index; /* index of maximum value */
|
|
#endif
|
|
|
|
/* Initialise index value to zero. */
|
|
outIndex = 0U;
|
|
/* Load first input value that act as reference value for comparision */
|
|
out = *pSrc++;
|
|
|
|
#if defined (ARM_MATH_LOOPUNROLL)
|
|
/* Initialise index of maximum value. */
|
|
index = 0U;
|
|
|
|
/* Loop unrolling: Compute 4 outputs at a time */
|
|
blkCnt = (blockSize - 1U) >> 2U;
|
|
|
|
while (blkCnt > 0U)
|
|
{
|
|
/* Initialize minVal to next consecutive values one by one */
|
|
minVal = *pSrc++;
|
|
|
|
/* compare for the minimum value */
|
|
if (out > minVal)
|
|
{
|
|
/* Update the minimum value and it's index */
|
|
out = minVal;
|
|
outIndex = index + 1U;
|
|
}
|
|
|
|
minVal = *pSrc++;
|
|
if (out > minVal)
|
|
{
|
|
out = minVal;
|
|
outIndex = index + 2U;
|
|
}
|
|
|
|
minVal = *pSrc++;
|
|
if (out > minVal)
|
|
{
|
|
out = minVal;
|
|
outIndex = index + 3U;
|
|
}
|
|
|
|
minVal = *pSrc++;
|
|
if (out > minVal)
|
|
{
|
|
out = minVal;
|
|
outIndex = index + 4U;
|
|
}
|
|
|
|
index += 4U;
|
|
|
|
/* Decrement loop counter */
|
|
blkCnt--;
|
|
}
|
|
|
|
/* Loop unrolling: Compute remaining outputs */
|
|
blkCnt = (blockSize - 1U) % 4U;
|
|
|
|
#else
|
|
|
|
/* Initialize blkCnt with number of samples */
|
|
blkCnt = (blockSize - 1U);
|
|
|
|
#endif /* #if defined (ARM_MATH_LOOPUNROLL) */
|
|
|
|
while (blkCnt > 0U)
|
|
{
|
|
/* Initialize minVal to the next consecutive values one by one */
|
|
minVal = *pSrc++;
|
|
|
|
/* compare for the minimum value */
|
|
if (out > minVal)
|
|
{
|
|
/* Update the minimum value and it's index */
|
|
out = minVal;
|
|
outIndex = blockSize - blkCnt;
|
|
}
|
|
|
|
/* Decrement loop counter */
|
|
blkCnt--;
|
|
}
|
|
|
|
/* Store the minimum value and it's index into destination pointers */
|
|
*pResult = out;
|
|
*pIndex = outIndex;
|
|
}
|
|
|
|
/**
|
|
@} end of Min group
|
|
*/
|