123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177178179180181182183184185186187188189190191192193194195196197198199200201202203204205206207208209210211212213214215216217218219220221222223224225226227228229230231232233234235236237238239240241242243244245246247248249250251252253254255256257258259260261262263264265266267268269270271272273274275276277278279280281282283284285286287288289290291292293294295296297298299300301302303304305306307308309310311312313314315316317318319320321322323324325326327328329330331332333334335336337338339340341342343344345346347348349350351352353354355356357358359360361362363364365366367368369370371372373374375376377378379380381382383384385386387388389390391392393394395396397398399400401402403404405406407408409410411412413414415416417418419420421422423424425426427428429430431432433434435436437438439440441442443444445446447448449450451452453454455456457458459460461462463464465466467468469470471472473474475476477478479480481482483484485486487488489490491492493494495496497498499500501502503504505506507508509510511512513514515516517518519520521522523524525526527528529530531532533534535536537538539540541542543544545546547548549550551552553554555556557558559560561562563564565566567568569570571572573574575576577578579580581582583584585586587588589590591592593594595596597598 |
- /* ----------------------------------------------------------------------
- * Copyright (C) 2010-2013 ARM Limited. All rights reserved.
- *
- * $Date: 17. January 2013
- * $Revision: V1.4.1
- *
- * Project: CMSIS DSP Library
- * Title: arm_fir_decimate_fast_q15.c
- *
- * Description: Fast Q15 FIR Decimator.
- *
- * Target Processor: Cortex-M4/Cortex-M3
- *
- * Redistribution and use in source and binary forms, with or without
- * modification, are permitted provided that the following conditions
- * are met:
- * - Redistributions of source code must retain the above copyright
- * notice, this list of conditions and the following disclaimer.
- * - Redistributions in binary form must reproduce the above copyright
- * notice, this list of conditions and the following disclaimer in
- * the documentation and/or other materials provided with the
- * distribution.
- * - Neither the name of ARM LIMITED nor the names of its contributors
- * may be used to endorse or promote products derived from this
- * software without specific prior written permission.
- *
- * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS
- * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT
- * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS
- * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE
- * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT,
- * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING,
- * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES;
- * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER
- * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
- * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN
- * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE
- * POSSIBILITY OF SUCH DAMAGE.
- * -------------------------------------------------------------------- */
-
- #include "arm_math.h"
-
- /**
- * @ingroup groupFilters
- */
-
- /**
- * @addtogroup FIR_decimate
- * @{
- */
-
- /**
- * @brief Processing function for the Q15 FIR decimator (fast variant) for Cortex-M3 and Cortex-M4.
- * @param[in] *S points to an instance of the Q15 FIR decimator structure.
- * @param[in] *pSrc points to the block of input data.
- * @param[out] *pDst points to the block of output data
- * @param[in] blockSize number of input samples to process per call.
- * @return none
- *
- * \par Restrictions
- * If the silicon does not support unaligned memory access enable the macro UNALIGNED_SUPPORT_DISABLE
- * In this case input, output, state buffers should be aligned by 32-bit
- *
- * <b>Scaling and Overflow Behavior:</b>
- * \par
- * This fast version uses a 32-bit accumulator with 2.30 format.
- * The accumulator maintains full precision of the intermediate multiplication results but provides only a single guard bit.
- * Thus, if the accumulator result overflows it wraps around and distorts the result.
- * In order to avoid overflows completely the input signal must be scaled down by log2(numTaps) bits (log2 is read as log to the base 2).
- * The 2.30 accumulator is then truncated to 2.15 format and saturated to yield the 1.15 result.
- *
- * \par
- * Refer to the function <code>arm_fir_decimate_q15()</code> for a slower implementation of this function which uses 64-bit accumulation to avoid wrap around distortion.
- * Both the slow and the fast versions use the same instance structure.
- * Use the function <code>arm_fir_decimate_init_q15()</code> to initialize the filter structure.
- */
-
- #ifndef UNALIGNED_SUPPORT_DISABLE
-
- void arm_fir_decimate_fast_q15(
- const arm_fir_decimate_instance_q15 * S,
- q15_t * pSrc,
- q15_t * pDst,
- uint32_t blockSize)
- {
- q15_t *pState = S->pState; /* State pointer */
- q15_t *pCoeffs = S->pCoeffs; /* Coefficient pointer */
- q15_t *pStateCurnt; /* Points to the current sample of the state */
- q15_t *px; /* Temporary pointer for state buffer */
- q15_t *pb; /* Temporary pointer coefficient buffer */
- q31_t x0, x1, c0, c1; /* Temporary variables to hold state and coefficient values */
- q31_t sum0; /* Accumulators */
- q31_t acc0, acc1;
- q15_t *px0, *px1;
- uint32_t blkCntN3;
- uint32_t numTaps = S->numTaps; /* Number of taps */
- uint32_t i, blkCnt, tapCnt, outBlockSize = blockSize / S->M; /* Loop counters */
-
-
- /* S->pState buffer contains previous frame (numTaps - 1) samples */
- /* pStateCurnt points to the location where the new input data should be written */
- pStateCurnt = S->pState + (numTaps - 1u);
-
-
- /* Total number of output samples to be computed */
- blkCnt = outBlockSize / 2;
- blkCntN3 = outBlockSize - (2 * blkCnt);
-
-
- while(blkCnt > 0u)
- {
- /* Copy decimation factor number of new input samples into the state buffer */
- i = 2 * S->M;
-
- do
- {
- *pStateCurnt++ = *pSrc++;
-
- } while(--i);
-
- /* Set accumulator to zero */
- acc0 = 0;
- acc1 = 0;
-
- /* Initialize state pointer */
- px0 = pState;
-
- px1 = pState + S->M;
-
-
- /* Initialize coeff pointer */
- pb = pCoeffs;
-
- /* Loop unrolling. Process 4 taps at a time. */
- tapCnt = numTaps >> 2;
-
- /* Loop over the number of taps. Unroll by a factor of 4.
- ** Repeat until we've computed numTaps-4 coefficients. */
- while(tapCnt > 0u)
- {
- /* Read the Read b[numTaps-1] and b[numTaps-2] coefficients */
- c0 = *__SIMD32(pb)++;
-
- /* Read x[n-numTaps-1] and x[n-numTaps-2]sample */
- x0 = *__SIMD32(px0)++;
-
- x1 = *__SIMD32(px1)++;
-
- /* Perform the multiply-accumulate */
- acc0 = __SMLAD(x0, c0, acc0);
-
- acc1 = __SMLAD(x1, c0, acc1);
-
- /* Read the b[numTaps-3] and b[numTaps-4] coefficient */
- c0 = *__SIMD32(pb)++;
-
- /* Read x[n-numTaps-2] and x[n-numTaps-3] sample */
- x0 = *__SIMD32(px0)++;
-
- x1 = *__SIMD32(px1)++;
-
- /* Perform the multiply-accumulate */
- acc0 = __SMLAD(x0, c0, acc0);
-
- acc1 = __SMLAD(x1, c0, acc1);
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* If the filter length is not a multiple of 4, compute the remaining filter taps */
- tapCnt = numTaps % 0x4u;
-
- while(tapCnt > 0u)
- {
- /* Read coefficients */
- c0 = *pb++;
-
- /* Fetch 1 state variable */
- x0 = *px0++;
-
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 = __SMLAD(x0, c0, acc0);
- acc1 = __SMLAD(x1, c0, acc1);
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* Advance the state pointer by the decimation factor
- * to process the next group of decimation factor number samples */
- pState = pState + S->M * 2;
-
- /* Store filter output, smlad returns the values in 2.14 format */
- /* so downsacle by 15 to get output in 1.15 */
- *pDst++ = (q15_t) (__SSAT((acc0 >> 15), 16));
- *pDst++ = (q15_t) (__SSAT((acc1 >> 15), 16));
-
- /* Decrement the loop counter */
- blkCnt--;
- }
-
-
-
- while(blkCntN3 > 0u)
- {
- /* Copy decimation factor number of new input samples into the state buffer */
- i = S->M;
-
- do
- {
- *pStateCurnt++ = *pSrc++;
-
- } while(--i);
-
- /*Set sum to zero */
- sum0 = 0;
-
- /* Initialize state pointer */
- px = pState;
-
- /* Initialize coeff pointer */
- pb = pCoeffs;
-
- /* Loop unrolling. Process 4 taps at a time. */
- tapCnt = numTaps >> 2;
-
- /* Loop over the number of taps. Unroll by a factor of 4.
- ** Repeat until we've computed numTaps-4 coefficients. */
- while(tapCnt > 0u)
- {
- /* Read the Read b[numTaps-1] and b[numTaps-2] coefficients */
- c0 = *__SIMD32(pb)++;
-
- /* Read x[n-numTaps-1] and x[n-numTaps-2]sample */
- x0 = *__SIMD32(px)++;
-
- /* Read the b[numTaps-3] and b[numTaps-4] coefficient */
- c1 = *__SIMD32(pb)++;
-
- /* Perform the multiply-accumulate */
- sum0 = __SMLAD(x0, c0, sum0);
-
- /* Read x[n-numTaps-2] and x[n-numTaps-3] sample */
- x0 = *__SIMD32(px)++;
-
- /* Perform the multiply-accumulate */
- sum0 = __SMLAD(x0, c1, sum0);
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* If the filter length is not a multiple of 4, compute the remaining filter taps */
- tapCnt = numTaps % 0x4u;
-
- while(tapCnt > 0u)
- {
- /* Read coefficients */
- c0 = *pb++;
-
- /* Fetch 1 state variable */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 = __SMLAD(x0, c0, sum0);
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* Advance the state pointer by the decimation factor
- * to process the next group of decimation factor number samples */
- pState = pState + S->M;
-
- /* Store filter output, smlad returns the values in 2.14 format */
- /* so downsacle by 15 to get output in 1.15 */
- *pDst++ = (q15_t) (__SSAT((sum0 >> 15), 16));
-
- /* Decrement the loop counter */
- blkCntN3--;
- }
-
- /* Processing is complete.
- ** Now copy the last numTaps - 1 samples to the satrt of the state buffer.
- ** This prepares the state buffer for the next function call. */
-
- /* Points to the start of the state buffer */
- pStateCurnt = S->pState;
-
- i = (numTaps - 1u) >> 2u;
-
- /* copy data */
- while(i > 0u)
- {
- *__SIMD32(pStateCurnt)++ = *__SIMD32(pState)++;
- *__SIMD32(pStateCurnt)++ = *__SIMD32(pState)++;
-
- /* Decrement the loop counter */
- i--;
- }
-
- i = (numTaps - 1u) % 0x04u;
-
- /* copy data */
- while(i > 0u)
- {
- *pStateCurnt++ = *pState++;
-
- /* Decrement the loop counter */
- i--;
- }
- }
-
- #else
-
-
- void arm_fir_decimate_fast_q15(
- const arm_fir_decimate_instance_q15 * S,
- q15_t * pSrc,
- q15_t * pDst,
- uint32_t blockSize)
- {
- q15_t *pState = S->pState; /* State pointer */
- q15_t *pCoeffs = S->pCoeffs; /* Coefficient pointer */
- q15_t *pStateCurnt; /* Points to the current sample of the state */
- q15_t *px; /* Temporary pointer for state buffer */
- q15_t *pb; /* Temporary pointer coefficient buffer */
- q15_t x0, x1, c0; /* Temporary variables to hold state and coefficient values */
- q31_t sum0; /* Accumulators */
- q31_t acc0, acc1;
- q15_t *px0, *px1;
- uint32_t blkCntN3;
- uint32_t numTaps = S->numTaps; /* Number of taps */
- uint32_t i, blkCnt, tapCnt, outBlockSize = blockSize / S->M; /* Loop counters */
-
-
- /* S->pState buffer contains previous frame (numTaps - 1) samples */
- /* pStateCurnt points to the location where the new input data should be written */
- pStateCurnt = S->pState + (numTaps - 1u);
-
-
- /* Total number of output samples to be computed */
- blkCnt = outBlockSize / 2;
- blkCntN3 = outBlockSize - (2 * blkCnt);
-
- while(blkCnt > 0u)
- {
- /* Copy decimation factor number of new input samples into the state buffer */
- i = 2 * S->M;
-
- do
- {
- *pStateCurnt++ = *pSrc++;
-
- } while(--i);
-
- /* Set accumulator to zero */
- acc0 = 0;
- acc1 = 0;
-
- /* Initialize state pointer */
- px0 = pState;
-
- px1 = pState + S->M;
-
-
- /* Initialize coeff pointer */
- pb = pCoeffs;
-
- /* Loop unrolling. Process 4 taps at a time. */
- tapCnt = numTaps >> 2;
-
- /* Loop over the number of taps. Unroll by a factor of 4.
- ** Repeat until we've computed numTaps-4 coefficients. */
- while(tapCnt > 0u)
- {
- /* Read the Read b[numTaps-1] coefficients */
- c0 = *pb++;
-
- /* Read x[n-numTaps-1] for sample 0 and for sample 1 */
- x0 = *px0++;
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 += x0 * c0;
- acc1 += x1 * c0;
-
- /* Read the b[numTaps-2] coefficient */
- c0 = *pb++;
-
- /* Read x[n-numTaps-2] for sample 0 and sample 1 */
- x0 = *px0++;
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 += x0 * c0;
- acc1 += x1 * c0;
-
- /* Read the b[numTaps-3] coefficients */
- c0 = *pb++;
-
- /* Read x[n-numTaps-3] for sample 0 and sample 1 */
- x0 = *px0++;
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 += x0 * c0;
- acc1 += x1 * c0;
-
- /* Read the b[numTaps-4] coefficient */
- c0 = *pb++;
-
- /* Read x[n-numTaps-4] for sample 0 and sample 1 */
- x0 = *px0++;
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 += x0 * c0;
- acc1 += x1 * c0;
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* If the filter length is not a multiple of 4, compute the remaining filter taps */
- tapCnt = numTaps % 0x4u;
-
- while(tapCnt > 0u)
- {
- /* Read coefficients */
- c0 = *pb++;
-
- /* Fetch 1 state variable */
- x0 = *px0++;
- x1 = *px1++;
-
- /* Perform the multiply-accumulate */
- acc0 += x0 * c0;
- acc1 += x1 * c0;
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* Advance the state pointer by the decimation factor
- * to process the next group of decimation factor number samples */
- pState = pState + S->M * 2;
-
- /* Store filter output, smlad returns the values in 2.14 format */
- /* so downsacle by 15 to get output in 1.15 */
-
- *pDst++ = (q15_t) (__SSAT((acc0 >> 15), 16));
- *pDst++ = (q15_t) (__SSAT((acc1 >> 15), 16));
-
-
- /* Decrement the loop counter */
- blkCnt--;
- }
-
- while(blkCntN3 > 0u)
- {
- /* Copy decimation factor number of new input samples into the state buffer */
- i = S->M;
-
- do
- {
- *pStateCurnt++ = *pSrc++;
-
- } while(--i);
-
- /*Set sum to zero */
- sum0 = 0;
-
- /* Initialize state pointer */
- px = pState;
-
- /* Initialize coeff pointer */
- pb = pCoeffs;
-
- /* Loop unrolling. Process 4 taps at a time. */
- tapCnt = numTaps >> 2;
-
- /* Loop over the number of taps. Unroll by a factor of 4.
- ** Repeat until we've computed numTaps-4 coefficients. */
- while(tapCnt > 0u)
- {
- /* Read the Read b[numTaps-1] coefficients */
- c0 = *pb++;
-
- /* Read x[n-numTaps-1] and sample */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 += x0 * c0;
-
- /* Read the b[numTaps-2] coefficient */
- c0 = *pb++;
-
- /* Read x[n-numTaps-2] and sample */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 += x0 * c0;
-
- /* Read the b[numTaps-3] coefficients */
- c0 = *pb++;
-
- /* Read x[n-numTaps-3] sample */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 += x0 * c0;
-
- /* Read the b[numTaps-4] coefficient */
- c0 = *pb++;
-
- /* Read x[n-numTaps-4] sample */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 += x0 * c0;
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* If the filter length is not a multiple of 4, compute the remaining filter taps */
- tapCnt = numTaps % 0x4u;
-
- while(tapCnt > 0u)
- {
- /* Read coefficients */
- c0 = *pb++;
-
- /* Fetch 1 state variable */
- x0 = *px++;
-
- /* Perform the multiply-accumulate */
- sum0 += x0 * c0;
-
- /* Decrement the loop counter */
- tapCnt--;
- }
-
- /* Advance the state pointer by the decimation factor
- * to process the next group of decimation factor number samples */
- pState = pState + S->M;
-
- /* Store filter output, smlad returns the values in 2.14 format */
- /* so downsacle by 15 to get output in 1.15 */
- *pDst++ = (q15_t) (__SSAT((sum0 >> 15), 16));
-
- /* Decrement the loop counter */
- blkCntN3--;
- }
-
- /* Processing is complete.
- ** Now copy the last numTaps - 1 samples to the satrt of the state buffer.
- ** This prepares the state buffer for the next function call. */
-
- /* Points to the start of the state buffer */
- pStateCurnt = S->pState;
-
- i = (numTaps - 1u) >> 2u;
-
- /* copy data */
- while(i > 0u)
- {
- *pStateCurnt++ = *pState++;
- *pStateCurnt++ = *pState++;
- *pStateCurnt++ = *pState++;
- *pStateCurnt++ = *pState++;
-
- /* Decrement the loop counter */
- i--;
- }
-
- i = (numTaps - 1u) % 0x04u;
-
- /* copy data */
- while(i > 0u)
- {
- *pStateCurnt++ = *pState++;
-
- /* Decrement the loop counter */
- i--;
- }
- }
-
-
- #endif /* #ifndef UNALIGNED_SUPPORT_DISABLE */
-
- /**
- * @} end of FIR_decimate group
- */
|