BQ_2I_D32F32C30_TRC_WRA_01.c revision 2c8e5cab3faa6d360e222b7a6c40a80083d021ac
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/************************************************************************/ 19/* */ 20/* Project:: */ 21/* $Author: beq07716 $*/ 22/* $Revision: 1000 $*/ 23/* $Date: 2010-06-28 13:08:20 +0200 (Mon, 28 Jun 2010) $*/ 24/* */ 25/************************************************************************/ 26 27#include "BIQUAD.h" 28#include "BQ_2I_D32F32Cll_TRC_WRA_01_Private.h" 29#include "LVM_Macros.h" 30 31/************************************************************************** 32 ASSUMPTIONS: 33 COEFS- 34 pBiquadState->coefs[0] is A2, pBiquadState->coefs[1] is A1 35 pBiquadState->coefs[2] is A0, pBiquadState->coefs[3] is -B2 36 pBiquadState->coefs[4] is -B1, these are in Q30 format 37 38 DELAYS- 39 pBiquadState->pDelays[0] is x(n-1)L in Q0 format 40 pBiquadState->pDelays[1] is x(n-1)R in Q0 format 41 pBiquadState->pDelays[2] is x(n-2)L in Q0 format 42 pBiquadState->pDelays[3] is x(n-2)R in Q0 format 43 pBiquadState->pDelays[4] is y(n-1)L in Q0 format 44 pBiquadState->pDelays[5] is y(n-1)R in Q0 format 45 pBiquadState->pDelays[6] is y(n-2)L in Q0 format 46 pBiquadState->pDelays[7] is y(n-2)R in Q0 format 47***************************************************************************/ 48 49void BQ_2I_D32F32C30_TRC_WRA_01 ( Biquad_Instance_t *pInstance, 50 LVM_INT32 *pDataIn, 51 LVM_INT32 *pDataOut, 52 LVM_INT16 NrSamples) 53 54 55 { 56 LVM_INT32 ynL,ynR,templ,tempd; 57 LVM_INT16 ii; 58 PFilter_State pBiquadState = (PFilter_State) pInstance; 59 60 for (ii = NrSamples; ii != 0; ii--) 61 { 62 63 64 /************************************************************************** 65 PROCESSING OF THE LEFT CHANNEL 66 ***************************************************************************/ 67 /* ynL= ( A2 (Q30) * x(n-2)L (Q0) ) >>30 in Q0*/ 68 MUL32x32INTO32(pBiquadState->coefs[0],pBiquadState->pDelays[2],ynL,30) 69 70 /* ynL+= ( A1 (Q30) * x(n-1)L (Q0) ) >> 30 in Q0*/ 71 MUL32x32INTO32(pBiquadState->coefs[1],pBiquadState->pDelays[0],templ,30) 72 ynL+=templ; 73 74 /* ynL+= ( A0 (Q30) * x(n)L (Q0) ) >> 30 in Q0*/ 75 MUL32x32INTO32(pBiquadState->coefs[2],*pDataIn,templ,30) 76 ynL+=templ; 77 78 /* ynL+= (-B2 (Q30) * y(n-2)L (Q0) ) >> 30 in Q0*/ 79 MUL32x32INTO32(pBiquadState->coefs[3],pBiquadState->pDelays[6],templ,30) 80 ynL+=templ; 81 82 /* ynL+= (-B1 (Q30) * y(n-1)L (Q0) ) >> 30 in Q0 */ 83 MUL32x32INTO32(pBiquadState->coefs[4],pBiquadState->pDelays[4],templ,30) 84 ynL+=templ; 85 86 /************************************************************************** 87 PROCESSING OF THE RIGHT CHANNEL 88 ***************************************************************************/ 89 /* ynR= ( A2 (Q30) * x(n-2)R (Q0) ) >> 30 in Q0*/ 90 MUL32x32INTO32(pBiquadState->coefs[0],pBiquadState->pDelays[3],ynR,30) 91 92 /* ynR+= ( A1 (Q30) * x(n-1)R (Q0) ) >> 30 in Q0*/ 93 MUL32x32INTO32(pBiquadState->coefs[1],pBiquadState->pDelays[1],templ,30) 94 ynR+=templ; 95 96 /* ynR+= ( A0 (Q30) * x(n)R (Q0) ) >> 30 in Q0*/ 97 tempd=*(pDataIn+1); 98 MUL32x32INTO32(pBiquadState->coefs[2],tempd,templ,30) 99 ynR+=templ; 100 101 /* ynR+= (-B2 (Q30) * y(n-2)R (Q0) ) >> 30 in Q0*/ 102 MUL32x32INTO32(pBiquadState->coefs[3],pBiquadState->pDelays[7],templ,30) 103 ynR+=templ; 104 105 /* ynR+= (-B1 (Q30) * y(n-1)R (Q0) ) >> 30 in Q0 */ 106 MUL32x32INTO32(pBiquadState->coefs[4],pBiquadState->pDelays[5],templ,30) 107 ynR+=templ; 108 109 /************************************************************************** 110 UPDATING THE DELAYS 111 ***************************************************************************/ 112 pBiquadState->pDelays[7]=pBiquadState->pDelays[5]; /* y(n-2)R=y(n-1)R*/ 113 pBiquadState->pDelays[6]=pBiquadState->pDelays[4]; /* y(n-2)L=y(n-1)L*/ 114 pBiquadState->pDelays[3]=pBiquadState->pDelays[1]; /* x(n-2)R=x(n-1)R*/ 115 pBiquadState->pDelays[2]=pBiquadState->pDelays[0]; /* x(n-2)L=x(n-1)L*/ 116 pBiquadState->pDelays[5]=(LVM_INT32)ynR; /* Update y(n-1)R in Q0*/ 117 pBiquadState->pDelays[4]=(LVM_INT32)ynL; /* Update y(n-1)L in Q0*/ 118 pBiquadState->pDelays[0]=(*pDataIn); /* Update x(n-1)L in Q0*/ 119 pDataIn++; 120 pBiquadState->pDelays[1]=(*pDataIn); /* Update x(n-1)R in Q0*/ 121 pDataIn++; 122 123 /************************************************************************** 124 WRITING THE OUTPUT 125 ***************************************************************************/ 126 *pDataOut=(LVM_INT32)ynL; /* Write Left output in Q0*/ 127 pDataOut++; 128 *pDataOut=(LVM_INT32)ynR; /* Write Right ouput in Q0*/ 129 pDataOut++; 130 131 132 } 133 134 } 135 136