1/*
2 * Copyright (C) 2004-2010 NXP Software
3 * Copyright (C) 2010 The Android Open Source Project
4 *
5 * Licensed under the Apache License, Version 2.0 (the "License");
6 * you may not use this file except in compliance with the License.
7 * You may obtain a copy of the License at
8 *
9 *      http://www.apache.org/licenses/LICENSE-2.0
10 *
11 * Unless required by applicable law or agreed to in writing, software
12 * distributed under the License is distributed on an "AS IS" BASIS,
13 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
14 * See the License for the specific language governing permissions and
15 * limitations under the License.
16 */
17
18#include "BIQUAD.h"
19#include "PK_2I_D32F32CssGss_TRC_WRA_01_Private.h"
20#include "LVM_Macros.h"
21
22/**************************************************************************
23 ASSUMPTIONS:
24 COEFS-
25 pBiquadState->coefs[0] is A0,
26 pBiquadState->coefs[1] is -B2,
27 pBiquadState->coefs[2] is -B1, these are in Q14 format
28 pBiquadState->coefs[3] is Gain, in Q11 format
29
30
31 DELAYS-
32 pBiquadState->pDelays[0] is x(n-1)L in Q0 format
33 pBiquadState->pDelays[1] is x(n-1)R in Q0 format
34 pBiquadState->pDelays[2] is x(n-2)L in Q0 format
35 pBiquadState->pDelays[3] is x(n-2)R in Q0 format
36 pBiquadState->pDelays[4] is y(n-1)L in Q0 format
37 pBiquadState->pDelays[5] is y(n-1)R in Q0 format
38 pBiquadState->pDelays[6] is y(n-2)L in Q0 format
39 pBiquadState->pDelays[7] is y(n-2)R in Q0 format
40***************************************************************************/
41void PK_2I_D32F32C14G11_TRC_WRA_01 ( Biquad_Instance_t       *pInstance,
42                                     LVM_INT32               *pDataIn,
43                                     LVM_INT32               *pDataOut,
44                                     LVM_INT16               NrSamples)
45    {
46        LVM_INT32 ynL,ynR,ynLO,ynRO,templ;
47        LVM_INT16 ii;
48        PFilter_State pBiquadState = (PFilter_State) pInstance;
49
50         for (ii = NrSamples; ii != 0; ii--)
51         {
52
53
54            /**************************************************************************
55                            PROCESSING OF THE LEFT CHANNEL
56            ***************************************************************************/
57            /* ynL= (A0 (Q14) * (x(n)L (Q0) - x(n-2)L (Q0) ) >>14)  in Q0*/
58            templ=(*pDataIn)-pBiquadState->pDelays[2];
59            MUL32x16INTO32(templ,pBiquadState->coefs[0],ynL,14)
60
61            /* ynL+= ((-B2 (Q14) * y(n-2)L (Q0) ) >>14) in Q0*/
62            MUL32x16INTO32(pBiquadState->pDelays[6],pBiquadState->coefs[1],templ,14)
63            ynL+=templ;
64
65            /* ynL+= ((-B1 (Q14) * y(n-1)L (Q0) ) >>14) in Q0 */
66            MUL32x16INTO32(pBiquadState->pDelays[4],pBiquadState->coefs[2],templ,14)
67            ynL+=templ;
68
69            /* ynLO= ((Gain (Q11) * ynL (Q0))>>11) in Q0*/
70            MUL32x16INTO32(ynL,pBiquadState->coefs[3],ynLO,11)
71
72            /* ynLO=( ynLO(Q0) + x(n)L (Q0) ) in Q0*/
73            ynLO+= (*pDataIn);
74
75            /**************************************************************************
76                            PROCESSING OF THE RIGHT CHANNEL
77            ***************************************************************************/
78            /* ynR= (A0 (Q14) * (x(n)R (Q0) - x(n-2)R (Q0) ) >>14)   in Q0*/
79            templ=(*(pDataIn+1))-pBiquadState->pDelays[3];
80            MUL32x16INTO32(templ,pBiquadState->coefs[0],ynR,14)
81
82            /* ynR+= ((-B2 (Q14) * y(n-2)R (Q0) ) >>14)  in Q0*/
83            MUL32x16INTO32(pBiquadState->pDelays[7],pBiquadState->coefs[1],templ,14)
84            ynR+=templ;
85
86            /* ynR+= ((-B1 (Q14) * y(n-1)R (Q0) ) >>14)  in Q0 */
87            MUL32x16INTO32(pBiquadState->pDelays[5],pBiquadState->coefs[2],templ,14)
88            ynR+=templ;
89
90            /* ynRO= ((Gain (Q11) * ynR (Q0))>>11) in Q0*/
91            MUL32x16INTO32(ynR,pBiquadState->coefs[3],ynRO,11)
92
93            /* ynRO=( ynRO(Q0) + x(n)R (Q0) ) in Q0*/
94            ynRO+= (*(pDataIn+1));
95
96            /**************************************************************************
97                            UPDATING THE DELAYS
98            ***************************************************************************/
99            pBiquadState->pDelays[7]=pBiquadState->pDelays[5]; /* y(n-2)R=y(n-1)R*/
100            pBiquadState->pDelays[6]=pBiquadState->pDelays[4]; /* y(n-2)L=y(n-1)L*/
101            pBiquadState->pDelays[3]=pBiquadState->pDelays[1]; /* x(n-2)R=x(n-1)R*/
102            pBiquadState->pDelays[2]=pBiquadState->pDelays[0]; /* x(n-2)L=x(n-1)L*/
103            pBiquadState->pDelays[5]=ynR; /* Update y(n-1)R in Q0*/
104            pBiquadState->pDelays[4]=ynL; /* Update y(n-1)L in Q0*/
105            pBiquadState->pDelays[0]=(*pDataIn); /* Update x(n-1)L in Q0*/
106            pDataIn++;
107            pBiquadState->pDelays[1]=(*pDataIn); /* Update x(n-1)R in Q0*/
108            pDataIn++;
109
110            /**************************************************************************
111                            WRITING THE OUTPUT
112            ***************************************************************************/
113            *pDataOut=ynLO; /* Write Left output in Q0*/
114            pDataOut++;
115            *pDataOut=ynRO; /* Write Right ouput in Q0*/
116            pDataOut++;
117
118        }
119
120    }
121
122