Rev 2 | Details | Compare with Previous | Last modification | View Log | RSS feed
| Rev | Author | Line No. | Line |
|---|---|---|---|
| 2 | mjames | 1 | /* ---------------------------------------------------------------------------- |
| 2 | * Copyright (C) 2010-2014 ARM Limited. All rights reserved. |
||
| 3 | * |
||
| 4 | * $Date: 19. March 2015 |
||
| 5 | * $Revision: V.1.4.5 |
||
| 6 | * |
||
| 7 | * Project: CMSIS DSP Library |
||
| 8 | * Title: arm_q31_to_q15.c |
||
| 9 | * |
||
| 10 | * Description: Converts the elements of the Q31 vector to Q15 vector. |
||
| 11 | * |
||
| 12 | * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0 |
||
| 13 | * |
||
| 14 | * Redistribution and use in source and binary forms, with or without |
||
| 15 | * modification, are permitted provided that the following conditions |
||
| 16 | * are met: |
||
| 17 | * - Redistributions of source code must retain the above copyright |
||
| 18 | * notice, this list of conditions and the following disclaimer. |
||
| 19 | * - Redistributions in binary form must reproduce the above copyright |
||
| 20 | * notice, this list of conditions and the following disclaimer in |
||
| 21 | * the documentation and/or other materials provided with the |
||
| 22 | * distribution. |
||
| 23 | * - Neither the name of ARM LIMITED nor the names of its contributors |
||
| 24 | * may be used to endorse or promote products derived from this |
||
| 25 | * software without specific prior written permission. |
||
| 26 | * |
||
| 27 | * THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS |
||
| 28 | * "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT |
||
| 29 | * LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS |
||
| 30 | * FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE |
||
| 31 | * COPYRIGHT OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, |
||
| 32 | * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, |
||
| 33 | * BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; |
||
| 34 | * LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER |
||
| 35 | * CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT |
||
| 36 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN |
||
| 37 | * ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE |
||
| 38 | * POSSIBILITY OF SUCH DAMAGE. |
||
| 39 | * ---------------------------------------------------------------------------- */ |
||
| 40 | |||
| 41 | #include "arm_math.h" |
||
| 42 | |||
| 43 | /** |
||
| 44 | * @ingroup groupSupport |
||
| 45 | */ |
||
| 46 | |||
| 47 | /** |
||
| 48 | * @addtogroup q31_to_x |
||
| 49 | * @{ |
||
| 50 | */ |
||
| 51 | |||
| 52 | /** |
||
| 53 | * @brief Converts the elements of the Q31 vector to Q15 vector. |
||
| 54 | * @param[in] *pSrc points to the Q31 input vector |
||
| 55 | * @param[out] *pDst points to the Q15 output vector |
||
| 56 | * @param[in] blockSize length of the input vector |
||
| 57 | * @return none. |
||
| 58 | * |
||
| 59 | * \par Description: |
||
| 60 | * |
||
| 61 | * The equation used for the conversion process is: |
||
| 62 | * |
||
| 63 | * <pre> |
||
| 64 | * pDst[n] = (q15_t) pSrc[n] >> 16; 0 <= n < blockSize. |
||
| 65 | * </pre> |
||
| 66 | * |
||
| 67 | */ |
||
| 68 | |||
| 69 | |||
| 70 | void arm_q31_to_q15( |
||
| 71 | q31_t * pSrc, |
||
| 72 | q15_t * pDst, |
||
| 73 | uint32_t blockSize) |
||
| 74 | { |
||
| 75 | q31_t *pIn = pSrc; /* Src pointer */ |
||
| 76 | uint32_t blkCnt; /* loop counter */ |
||
| 77 | |||
| 78 | #ifndef ARM_MATH_CM0_FAMILY |
||
| 79 | |||
| 80 | /* Run the below code for Cortex-M4 and Cortex-M3 */ |
||
| 81 | q31_t in1, in2, in3, in4; |
||
| 82 | q31_t out1, out2; |
||
| 83 | |||
| 84 | /*loop Unrolling */ |
||
| 85 | blkCnt = blockSize >> 2u; |
||
| 86 | |||
| 87 | /* First part of the processing with loop unrolling. Compute 4 outputs at a time. |
||
| 88 | ** a second loop below computes the remaining 1 to 3 samples. */ |
||
| 89 | while(blkCnt > 0u) |
||
| 90 | { |
||
| 91 | /* C = (q15_t) A >> 16 */ |
||
| 92 | /* convert from q31 to q15 and then store the results in the destination buffer */ |
||
| 93 | in1 = *pIn++; |
||
| 94 | in2 = *pIn++; |
||
| 95 | in3 = *pIn++; |
||
| 96 | in4 = *pIn++; |
||
| 97 | |||
| 98 | /* pack two higher 16-bit values from two 32-bit values */ |
||
| 99 | #ifndef ARM_MATH_BIG_ENDIAN |
||
| 100 | |||
| 101 | out1 = __PKHTB(in2, in1, 16); |
||
| 102 | out2 = __PKHTB(in4, in3, 16); |
||
| 103 | |||
| 104 | #else |
||
| 105 | |||
| 106 | out1 = __PKHTB(in1, in2, 16); |
||
| 107 | out2 = __PKHTB(in3, in4, 16); |
||
| 108 | |||
| 109 | #endif // #ifdef ARM_MATH_BIG_ENDIAN |
||
| 110 | |||
| 111 | *__SIMD32(pDst)++ = out1; |
||
| 112 | *__SIMD32(pDst)++ = out2; |
||
| 113 | |||
| 114 | /* Decrement the loop counter */ |
||
| 115 | blkCnt--; |
||
| 116 | } |
||
| 117 | |||
| 118 | /* If the blockSize is not a multiple of 4, compute any remaining output samples here. |
||
| 119 | ** No loop unrolling is used. */ |
||
| 120 | blkCnt = blockSize % 0x4u; |
||
| 121 | |||
| 122 | #else |
||
| 123 | |||
| 124 | /* Run the below code for Cortex-M0 */ |
||
| 125 | |||
| 126 | /* Loop over blockSize number of values */ |
||
| 127 | blkCnt = blockSize; |
||
| 128 | |||
| 129 | #endif /* #ifndef ARM_MATH_CM0_FAMILY */ |
||
| 130 | |||
| 131 | while(blkCnt > 0u) |
||
| 132 | { |
||
| 133 | /* C = (q15_t) A >> 16 */ |
||
| 134 | /* convert from q31 to q15 and then store the results in the destination buffer */ |
||
| 135 | *pDst++ = (q15_t) (*pIn++ >> 16); |
||
| 136 | |||
| 137 | /* Decrement the loop counter */ |
||
| 138 | blkCnt--; |
||
| 139 | } |
||
| 140 | |||
| 141 | } |
||
| 142 | |||
| 143 | /** |
||
| 144 | * @} end of q31_to_x group |
||
| 145 | */ |