]>
git.gir.st - tmk_keyboard.git/blob - tmk_core/tool/mbed/mbed-sdk/libraries/dsp/cmsis_dsp/ComplexMathFunctions/arm_cmplx_mult_cmplx_q31.c
1 /* ----------------------------------------------------------------------
2 * Copyright (C) 2010-2013 ARM Limited. All rights reserved.
4 * $Date: 17. January 2013
7 * Project: CMSIS DSP Library
8 * Title: arm_cmplx_mult_cmplx_q31.c
10 * Description: Q31 complex-by-complex multiplication
12 * Target Processor: Cortex-M4/Cortex-M3/Cortex-M0
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
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
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.
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 * -------------------------------------------------------------------- */
44 * @ingroup groupCmplxMath
48 * @addtogroup CmplxByCmplxMult
54 * @brief Q31 complex-by-complex multiplication
55 * @param[in] *pSrcA points to the first input vector
56 * @param[in] *pSrcB points to the second input vector
57 * @param[out] *pDst points to the output vector
58 * @param[in] numSamples number of complex samples in each vector
61 * <b>Scaling and Overflow Behavior:</b>
63 * The function implements 1.31 by 1.31 multiplications and finally output is converted into 3.29 format.
64 * Input down scaling is not required.
67 void arm_cmplx_mult_cmplx_q31(
73 q31_t a
, b
, c
, d
; /* Temporary variables to store real and imaginary values */
74 uint32_t blkCnt
; /* loop counters */
75 q31_t mul1
, mul2
, mul3
, mul4
;
78 #ifndef ARM_MATH_CM0_FAMILY
80 /* Run the below code for Cortex-M4 and Cortex-M3 */
83 blkCnt
= numSamples
>> 2u;
85 /* First part of the processing with loop unrolling. Compute 4 outputs at a time.
86 ** a second loop below computes the remaining 1 to 3 samples. */
89 /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
90 /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
96 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
97 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
98 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
99 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
109 /* store the real result in 3.29 format in the destination buffer. */
111 /* store the imag result in 3.29 format in the destination buffer. */
119 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
120 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
121 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
122 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
132 /* store the real result in 3.29 format in the destination buffer. */
134 /* store the imag result in 3.29 format in the destination buffer. */
142 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
143 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
144 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
145 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
155 /* store the real result in 3.29 format in the destination buffer. */
157 /* store the imag result in 3.29 format in the destination buffer. */
165 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
166 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
167 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
168 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
178 /* store the real result in 3.29 format in the destination buffer. */
180 /* store the imag result in 3.29 format in the destination buffer. */
183 /* Decrement the blockSize loop counter */
187 /* If the blockSize is not a multiple of 4, compute any remaining output samples here.
188 ** No loop unrolling is used. */
189 blkCnt
= numSamples
% 0x4u
;
193 /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
194 /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
200 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
201 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
202 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
203 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
213 /* store the real result in 3.29 format in the destination buffer. */
215 /* store the imag result in 3.29 format in the destination buffer. */
218 /* Decrement the blockSize loop counter */
224 /* Run the below code for Cortex-M0 */
227 blkCnt
= numSamples
>> 1u;
229 /* First part of the processing with loop unrolling. Compute 2 outputs at a time.
230 ** a second loop below computes the remaining 1 sample. */
233 /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
234 /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
240 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
241 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
242 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
243 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
253 /* store the real result in 3.29 format in the destination buffer. */
255 /* store the imag result in 3.29 format in the destination buffer. */
263 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
264 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
265 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
266 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
276 /* store the real result in 3.29 format in the destination buffer. */
278 /* store the imag result in 3.29 format in the destination buffer. */
281 /* Decrement the blockSize loop counter */
285 /* If the blockSize is not a multiple of 2, compute any remaining output samples here.
286 ** No loop unrolling is used. */
287 blkCnt
= numSamples
% 0x2u
;
291 /* C[2 * i] = A[2 * i] * B[2 * i] - A[2 * i + 1] * B[2 * i + 1]. */
292 /* C[2 * i + 1] = A[2 * i] * B[2 * i + 1] + A[2 * i + 1] * B[2 * i]. */
298 mul1
= (q31_t
) (((q63_t
) a
* c
) >> 32);
299 mul2
= (q31_t
) (((q63_t
) b
* d
) >> 32);
300 mul3
= (q31_t
) (((q63_t
) a
* d
) >> 32);
301 mul4
= (q31_t
) (((q63_t
) b
* c
) >> 32);
311 /* store the real result in 3.29 format in the destination buffer. */
313 /* store the imag result in 3.29 format in the destination buffer. */
316 /* Decrement the blockSize loop counter */
320 #endif /* #ifndef ARM_MATH_CM0_FAMILY */
325 * @} end of CmplxByCmplxMult group