Biquad Cascade IIR Filters Using Direct Form I Structure

void riscv_biquad_cascade_df1_f16(const riscv_biquad_casd_df1_inst_f16 *S, const float16_t *pSrc, float16_t *pDst, uint32_t blockSize)

void riscv_biquad_cascade_df1_f32(const riscv_biquad_casd_df1_inst_f32 *S, const float32_t *pSrc, float32_t *pDst, uint32_t blockSize)

void riscv_biquad_cascade_df1_fast_q15(const riscv_biquad_casd_df1_inst_q15 *S, const q15_t *pSrc, q15_t *pDst, uint32_t blockSize)

void riscv_biquad_cascade_df1_fast_q31(const riscv_biquad_casd_df1_inst_q31 *S, const q31_t *pSrc, q31_t *pDst, uint32_t blockSize)

void riscv_biquad_cascade_df1_init_f16(riscv_biquad_casd_df1_inst_f16 *S, uint8_t numStages, const float16_t *pCoeffs, float16_t *pState)

void riscv_biquad_cascade_df1_init_f32(riscv_biquad_casd_df1_inst_f32 *S, uint8_t numStages, const float32_t *pCoeffs, float32_t *pState)

void riscv_biquad_cascade_df1_init_q15(riscv_biquad_casd_df1_inst_q15 *S, uint8_t numStages, const q15_t *pCoeffs, q15_t *pState, int8_t postShift)

void riscv_biquad_cascade_df1_init_q31(riscv_biquad_casd_df1_inst_q31 *S, uint8_t numStages, const q31_t *pCoeffs, q31_t *pState, int8_t postShift)

void riscv_biquad_cascade_df1_q15(const riscv_biquad_casd_df1_inst_q15 *S, const q15_t *pSrc, q15_t *pDst, uint32_t blockSize)

void riscv_biquad_cascade_df1_q31(const riscv_biquad_casd_df1_inst_q31 *S, const q31_t *pSrc, q31_t *pDst, uint32_t blockSize)
 group BiquadCascadeDF1
This set of functions implements arbitrary order recursive (IIR) filters. The filters are implemented as a cascade of second order Biquad sections. The functions support Q15, Q31 and floatingpoint data types. Fast version of Q15 and Q31 also available.
The functions operate on blocks of input and output data and each call to the function processes
blockSize
samples through the filter.pSrc
points to the array of input data andpDst
points to the array of output data. Both arrays containblockSize
values. Algorithm
Each Biquad stage implements a second order filter using the difference equation: A Direct Form I algorithm is used with 5 coefficients and 4 state variables per stage.
Coefficients
b0, b1 and b2
multiply the input signalx[n]
and are referred to as the feedforward coefficients. Coefficientsa1
anda2
multiply the output signaly[n]
and are referred to as the feedback coefficients. Pay careful attention to the sign of the feedback coefficients. Some design tools use the difference equation In this case the feedback coefficientsa1
anda2
must be negated when used with the NMSIS DSP Library.Higher order filters are realized as a cascade of second order sections.
numStages
refers to the number of second order stages used. For example, an 8th order filter would be realized withnumStages=4
second order stages.
A 9th order filter would be realized with
numStages=5
second order stages with the coefficients for one of the stages configured as a first order filter (b2=0
anda2=0
).The
pState
points to state variables array. Each Biquad stage has 4 state variablesx[n1], x[n2], y[n1],
andy[n2]
. The state variables are arranged in thepState
array as:The 4 state variables for stage 1 are first, then the 4 state variables for stage 2, and so on. The state array has a total length of
4*numStages
values. The state variables are updated after each block of data is processed, the coefficients are untouched. Instance Structure
The coefficients and state variables for a filter are stored together in an instance data structure. A separate instance structure must be defined for each filter. Coefficient arrays may be shared among several instances while state variable arrays cannot be shared. There are separate instance structure declarations for each of the 3 supported data types.
 Init Function
There is also an associated initialization function for each data type. The initialization function performs following operations:
Sets the values of the internal structure fields.
Zeros out the values in the state buffer. To do this manually without calling the init function, assign the follow subfields of the instance structure: numStages, pCoeffs, pState. Also set all of the values in pState to zero.
Use of the initialization function is optional. However, if the initialization function is used, then the instance structure cannot be placed into a const data section. To place an instance structure into a const data section, the instance structure must be manually initialized. Set the values in the state buffer to zeros before static initialization. The code below statically initializes each of the 3 different data type filter instance structures where
numStages
is the number of Biquad stages in the filter;pState
is the address of the state buffer;pCoeffs
is the address of the coefficient buffer;postShift
shift to be applied. FixedPoint Behavior
Care must be taken when using the Q15 and Q31 versions of the Biquad Cascade filter functions. Following issues must be considered:
Scaling of coefficients
Filter gain
Overflow and saturation
 Scaling of coefficients
Filter coefficients are represented as fractional values and coefficients are restricted to lie in the range
[1 +1)
. The fixedpoint functions have an additional scaling parameterpostShift
which allow the filter coefficients to exceed the range[+1 1)
. At the output of the filter’s accumulator is a shift register which shifts the result bypostShift
bits.
This essentially scales the filter coefficients by
2^postShift
. For example, to realize the coefficients set the pCoeffs array to: and setpostShift=1
 Filter gain
The frequency response of a Biquad filter is a function of its coefficients. It is possible for the gain through the filter to exceed 1.0 meaning that the filter increases the amplitude of certain frequencies. This means that an input signal with amplitude < 1.0 may result in an output > 1.0 and these are saturated or overflowed based on the implementation of the filter. To avoid this behavior the filter needs to be scaled down such that its peak gain < 1.0 or the input signal must be scaled down so that the combination of input and filter are never overflowed.
 Overflow and saturation
For Q15 and Q31 versions, it is described separately as part of the function specific documentation below.
Functions

void riscv_biquad_cascade_df1_f16(const riscv_biquad_casd_df1_inst_f16 *S, const float16_t *pSrc, float16_t *pDst, uint32_t blockSize)
Processing function for the floatingpoint Biquad cascade filter.
 Parameters
S – [in] points to an instance of the floatingpoint Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the block of output data
blockSize – [in] number of samples to process
 Returns
none

void riscv_biquad_cascade_df1_f32(const riscv_biquad_casd_df1_inst_f32 *S, const float32_t *pSrc, float32_t *pDst, uint32_t blockSize)
Processing function for the floatingpoint Biquad cascade filter.
 Parameters
S – [in] points to an instance of the floatingpoint Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the block of output data
blockSize – [in] number of samples to process
 Returns
none

void riscv_biquad_cascade_df1_fast_q15(const riscv_biquad_casd_df1_inst_q15 *S, const q15_t *pSrc, q15_t *pDst, uint32_t blockSize)
Processing function for the Q15 Biquad cascade filter (fast variant).
Fast but less precise processing function for the Q15 Biquad cascade filter for RISCV Core with DSP enabled.
Remark
Refer to riscv_biquad_cascade_df1_q15() for a slower implementation of this function which uses 64bit accumulation to avoid wrap around distortion. Both the slow and the fast versions use the same instance structure. Use the function riscv_biquad_cascade_df1_init_q15() to initialize the filter structure.
 Scaling and Overflow Behavior
This fast version uses a 32bit 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 two bits and lie in the range [0.25 +0.25). The 2.30 accumulator is then shifted by
postShift
bits and the result truncated to 1.15 format by discarding the low 16 bits.
 Parameters
S – [in] points to an instance of the Q15 Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the block of output data
blockSize – [in] number of samples to process per call
 Returns
none

void riscv_biquad_cascade_df1_fast_q31(const riscv_biquad_casd_df1_inst_q31 *S, const q31_t *pSrc, q31_t *pDst, uint32_t blockSize)
Processing function for the Q31 Biquad cascade filter (fast variant).
Fast but less precise processing function for the Q31 Biquad cascade filter for RISCV Core with DSP enabled.
Remark
Refer to riscv_biquad_cascade_df1_q31() for a slower implementation of this function which uses 64bit accumulation to provide higher precision. Both the slow and the fast versions use the same instance structure. Use the function riscv_biquad_cascade_df1_init_q31() to initialize the filter structure.
 Scaling and Overflow Behavior
This function is optimized for speed at the expense of fixedpoint precision and overflow protection. The result of each 1.31 x 1.31 multiplication is truncated to 2.30 format. These intermediate results are added to a 2.30 accumulator. Finally, the accumulator is saturated and converted to a 1.31 result. The fast version has the same overflow behavior as the standard version and provides less precision since it discards the low 32 bits of each multiplication result. In order to avoid overflows completely the input signal must be scaled down by two bits and lie in the range [0.25 +0.25). Use the intialization function riscv_biquad_cascade_df1_init_q31() to initialize filter structure.
 Parameters
S – [in] points to an instance of the Q31 Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the block of output data
blockSize – [in] number of samples to process per call
 Returns
none

void riscv_biquad_cascade_df1_init_f16(riscv_biquad_casd_df1_inst_f16 *S, uint8_t numStages, const float16_t *pCoeffs, float16_t *pState)
Initialization function for the floatingpoint Biquad cascade filter.
The initialization function which must be used is riscv_biquad_cascade_df1_mve_init_f16.
 Coefficient and State Ordering
The coefficients are stored in the array
pCoeffs
in the following order:where
b1x
anda1x
are the coefficients for the first stage,b2x
anda2x
are the coefficients for the second stage, and so on. ThepCoeffs
array contains a total of5*numStages
values.The
pState
is a pointer to state array. Each Biquad stage has 4 state variablesx[n1], x[n2], y[n1],
andy[n2]
. The state variables are arranged in thepState
array as: The 4 state variables for stage 1 are first, then the 4 state variables for stage 2, and so on. The state array has a total length of4*numStages
values. The state variables are updated after each block of data is processed; the coefficients are untouched. For MVE code, an additional buffer of modified coefficients is required.
Its size is numStages and each element of this buffer has type riscv_biquad_mod_coef_f16. So, its total size is 96*numStages float16_t elements.
 Parameters
S – [inout] points to an instance of the floatingpoint Biquad cascade structure.
numStages – [in] number of 2nd order stages in the filter.
pCoeffs – [in] points to the filter coefficients.
pState – [in] points to the state buffer.
 Returns
none

void riscv_biquad_cascade_df1_init_f32(riscv_biquad_casd_df1_inst_f32 *S, uint8_t numStages, const float32_t *pCoeffs, float32_t *pState)
Initialization function for the floatingpoint Biquad cascade filter.
The initialization function which must be used is riscv_biquad_cascade_df1_mve_init_f32.
 Coefficient and State Ordering
The coefficients are stored in the array
pCoeffs
in the following order:where
b1x
anda1x
are the coefficients for the first stage,b2x
anda2x
are the coefficients for the second stage, and so on. ThepCoeffs
array contains a total of5*numStages
values.The
pState
is a pointer to state array. Each Biquad stage has 4 state variablesx[n1], x[n2], y[n1],
andy[n2]
. The state variables are arranged in thepState
array as: The 4 state variables for stage 1 are first, then the 4 state variables for stage 2, and so on. The state array has a total length of4*numStages
values. The state variables are updated after each block of data is processed; the coefficients are untouched. For MVE code, an additional buffer of modified coefficients is required.
Its size is numStages and each element of this buffer has type riscv_biquad_mod_coef_f32. So, its total size is 32*numStages float32_t elements.
 Parameters
S – [inout] points to an instance of the floatingpoint Biquad cascade structure.
numStages – [in] number of 2nd order stages in the filter.
pCoeffs – [in] points to the filter coefficients.
pState – [in] points to the state buffer.
 Returns
none

void riscv_biquad_cascade_df1_init_q15(riscv_biquad_casd_df1_inst_q15 *S, uint8_t numStages, const q15_t *pCoeffs, q15_t *pState, int8_t postShift)
Initialization function for the Q15 Biquad cascade filter.
 Coefficient and State Ordering
The coefficients are stored in the array
pCoeffs
in the following order:where
b1x
anda1x
are the coefficients for the first stage,b2x
anda2x
are the coefficients for the second stage, and so on. ThepCoeffs
array contains a total of6*numStages
values. The zero coefficient betweenb1
andb2
facilities use of 16bit SIMD instructions on the RISCV Core with DSP.The state variables are stored in the array
pState
. Each Biquad stage has 4 state variablesx[n1], x[n2], y[n1],
andy[n2]
. The state variables are arranged in thepState
array as: The 4 state variables for stage 1 are first, then the 4 state variables for stage 2, and so on. The state array has a total length of4*numStages
values. The state variables are updated after each block of data is processed; the coefficients are untouched.
 Parameters
S – [inout] points to an instance of the Q15 Biquad cascade structure.
numStages – [in] number of 2nd order stages in the filter.
pCoeffs – [in] points to the filter coefficients.
pState – [in] points to the state buffer.
postShift – [in] Shift to be applied to the accumulator result. Varies according to the coefficients format
 Returns
none

void riscv_biquad_cascade_df1_init_q31(riscv_biquad_casd_df1_inst_q31 *S, uint8_t numStages, const q31_t *pCoeffs, q31_t *pState, int8_t postShift)
Initialization function for the Q31 Biquad cascade filter.
 Coefficient and State Ordering
The coefficients are stored in the array
pCoeffs
in the following order:where
b1x
anda1x
are the coefficients for the first stage,b2x
anda2x
are the coefficients for the second stage, and so on. ThepCoeffs
array contains a total of5*numStages
values.The
pState
points to state variables array. Each Biquad stage has 4 state variablesx[n1], x[n2], y[n1],
andy[n2]
. The state variables are arranged in thepState
array as: The 4 state variables for stage 1 are first, then the 4 state variables for stage 2, and so on. The state array has a total length of4*numStages
values. The state variables are updated after each block of data is processed; the coefficients are untouched.
 Parameters
S – [inout] points to an instance of the Q31 Biquad cascade structure.
numStages – [in] number of 2nd order stages in the filter.
pCoeffs – [in] points to the filter coefficients.
pState – [in] points to the state buffer.
postShift – [in] Shift to be applied after the accumulator. Varies according to the coefficients format
 Returns
none

void riscv_biquad_cascade_df1_q15(const riscv_biquad_casd_df1_inst_q15 *S, const q15_t *pSrc, q15_t *pDst, uint32_t blockSize)
Processing function for the Q15 Biquad cascade filter.
Remark
Refer to riscv_biquad_cascade_df1_fast_q15() for a faster but less precise implementation of this filter.
 Scaling and Overflow Behavior
The function is implemented using a 64bit internal accumulator. Both coefficients and state variables are represented in 1.15 format and multiplications yield a 2.30 result. The 2.30 intermediate results are accumulated in a 64bit accumulator in 34.30 format. There is no risk of internal overflow with this approach and the full precision of intermediate multiplications is preserved. The accumulator is then shifted by
postShift
bits to truncate the result to 1.15 format by discarding the low 16 bits. Finally, the result is saturated to 1.15 format.
 Parameters
S – [in] points to an instance of the Q15 Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the location where the output result is written
blockSize – [in] number of samples to process
 Returns
none

void riscv_biquad_cascade_df1_q31(const riscv_biquad_casd_df1_inst_q31 *S, const q31_t *pSrc, q31_t *pDst, uint32_t blockSize)
Processing function for the Q31 Biquad cascade filter.
Remark
Refer to riscv_biquad_cascade_df1_fast_q31() for a faster but less precise implementation of this filter.
 Scaling and Overflow Behavior
The function is implemented using an internal 64bit accumulator. The accumulator has a 2.62 format and maintains full precision of the intermediate multiplication results but provides only a single guard bit. Thus, if the accumulator result overflows it wraps around rather than clip. In order to avoid overflows completely the input signal must be scaled down by 2 bits and lie in the range [0.25 +0.25). After all 5 multiplyaccumulates are performed, the 2.62 accumulator is shifted by
postShift
bits and the result truncated to 1.31 format by discarding the low 32 bits.
 Parameters
S – [in] points to an instance of the Q31 Biquad cascade structure
pSrc – [in] points to the block of input data
pDst – [out] points to the block of output data
blockSize – [in] number of samples to process
 Returns
none