| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <title>CMSIS DSP Software Library: arm_biquad_cascade_df1_q31.c Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javaScript" src="search/search.js"></script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css"/> |
| </head> |
| <body onload='searchBox.OnSelectItem(0);'> |
| <!-- Generated by Doxygen 1.7.2 --> |
| <script type="text/javascript"><!-- |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| --></script> |
| <div class="navigation" id="top"> |
| <div class="tabs"> |
| <ul class="tablist"> |
| <li><a href="index.html"><span>Main Page</span></a></li> |
| <li><a href="modules.html"><span>Modules</span></a></li> |
| <li><a href="annotated.html"><span>Data Structures</span></a></li> |
| <li class="current"><a href="files.html"><span>Files</span></a></li> |
| <li><a href="examples.html"><span>Examples</span></a></li> |
| <li id="searchli"> |
| <div id="MSearchBox" class="MSearchBoxInactive"> |
| <span class="left"> |
| <img id="MSearchSelect" src="search/mag_sel.png" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| alt=""/> |
| <input type="text" id="MSearchField" value="Search" accesskey="S" |
| onfocus="searchBox.OnSearchFieldFocus(true)" |
| onblur="searchBox.OnSearchFieldFocus(false)" |
| onkeyup="searchBox.OnSearchFieldChange(event)"/> |
| </span><span class="right"> |
| <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a> |
| </span> |
| </div> |
| </li> |
| </ul> |
| </div> |
| <div class="tabs2"> |
| <ul class="tablist"> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>Globals</span></a></li> |
| </ul> |
| </div> |
| <div class="header"> |
| <div class="headertitle"> |
| <h1>arm_biquad_cascade_df1_q31.c</h1> </div> |
| </div> |
| <div class="contents"> |
| <a href="arm__biquad__cascade__df1__q31_8c.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/* ---------------------------------------------------------------------- </span> |
| <a name="l00002"></a>00002 <span class="comment">* Copyright (C) 2010 ARM Limited. All rights reserved. </span> |
| <a name="l00003"></a>00003 <span class="comment">* </span> |
| <a name="l00004"></a>00004 <span class="comment">* $Date: 15. July 2011 </span> |
| <a name="l00005"></a>00005 <span class="comment">* $Revision: V1.0.10 </span> |
| <a name="l00006"></a>00006 <span class="comment">* </span> |
| <a name="l00007"></a>00007 <span class="comment">* Project: CMSIS DSP Library </span> |
| <a name="l00008"></a>00008 <span class="comment">* Title: arm_biquad_cascade_df1_q31.c </span> |
| <a name="l00009"></a>00009 <span class="comment">* </span> |
| <a name="l00010"></a>00010 <span class="comment">* Description: Processing function for the </span> |
| <a name="l00011"></a>00011 <span class="comment">* Q31 Biquad cascade filter </span> |
| <a name="l00012"></a>00012 <span class="comment">* </span> |
| <a name="l00013"></a>00013 <span class="comment">* Target Processor: Cortex-M4/Cortex-M3/Cortex-M0</span> |
| <a name="l00014"></a>00014 <span class="comment">* </span> |
| <a name="l00015"></a>00015 <span class="comment">* Version 1.0.10 2011/7/15 </span> |
| <a name="l00016"></a>00016 <span class="comment">* Big Endian support added and Merged M0 and M3/M4 Source code. </span> |
| <a name="l00017"></a>00017 <span class="comment">* </span> |
| <a name="l00018"></a>00018 <span class="comment">* Version 1.0.3 2010/11/29 </span> |
| <a name="l00019"></a>00019 <span class="comment">* Re-organized the CMSIS folders and updated documentation. </span> |
| <a name="l00020"></a>00020 <span class="comment">* </span> |
| <a name="l00021"></a>00021 <span class="comment">* Version 1.0.2 2010/11/11 </span> |
| <a name="l00022"></a>00022 <span class="comment">* Documentation updated. </span> |
| <a name="l00023"></a>00023 <span class="comment">* </span> |
| <a name="l00024"></a>00024 <span class="comment">* Version 1.0.1 2010/10/05 </span> |
| <a name="l00025"></a>00025 <span class="comment">* Production release and review comments incorporated. </span> |
| <a name="l00026"></a>00026 <span class="comment">* </span> |
| <a name="l00027"></a>00027 <span class="comment">* Version 1.0.0 2010/09/20 </span> |
| <a name="l00028"></a>00028 <span class="comment">* Production release and review comments incorporated. </span> |
| <a name="l00029"></a>00029 <span class="comment">* </span> |
| <a name="l00030"></a>00030 <span class="comment">* Version 0.0.5 2010/04/26 </span> |
| <a name="l00031"></a>00031 <span class="comment">* incorporated review comments and updated with latest CMSIS layer </span> |
| <a name="l00032"></a>00032 <span class="comment">* </span> |
| <a name="l00033"></a>00033 <span class="comment">* Version 0.0.3 2010/03/10 </span> |
| <a name="l00034"></a>00034 <span class="comment">* Initial version </span> |
| <a name="l00035"></a>00035 <span class="comment">* -------------------------------------------------------------------- */</span> |
| <a name="l00036"></a>00036 |
| <a name="l00037"></a>00037 <span class="preprocessor">#include "<a class="code" href="arm__math_8h.html">arm_math.h</a>"</span> |
| <a name="l00038"></a>00038 |
| <a name="l00069"></a><a class="code" href="group___biquad_cascade_d_f1.html#ga27b0c54da702713976e5202d20b4473f">00069</a> <span class="keywordtype">void</span> <a class="code" href="group___biquad_cascade_d_f1.html#ga27b0c54da702713976e5202d20b4473f" title="Processing function for the Q31 Biquad cascade filter.">arm_biquad_cascade_df1_q31</a>( |
| <a name="l00070"></a>00070 <span class="keyword">const</span> <a class="code" href="structarm__biquad__casd__df1__inst__q31.html" title="Instance structure for the Q31 Biquad cascade filter.">arm_biquad_casd_df1_inst_q31</a> * S, |
| <a name="l00071"></a>00071 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> * pSrc, |
| <a name="l00072"></a>00072 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> * pDst, |
| <a name="l00073"></a>00073 uint32_t <a class="code" href="arm__fir__example__f32_8c.html#ab6558f40a619c2502fbc24c880fd4fb0">blockSize</a>) |
| <a name="l00074"></a>00074 { |
| <a name="l00075"></a>00075 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> *pIn = pSrc; <span class="comment">/* input pointer initialization */</span> |
| <a name="l00076"></a>00076 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> *pOut = pDst; <span class="comment">/* output pointer initialization */</span> |
| <a name="l00077"></a>00077 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> *pState = S-><a class="code" href="structarm__biquad__casd__df1__inst__q31.html#a5dcf4727f58eb4e8e8b392508d8657bb">pState</a>; <span class="comment">/* pState pointer initialization */</span> |
| <a name="l00078"></a>00078 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> *pCoeffs = S-><a class="code" href="structarm__biquad__casd__df1__inst__q31.html#aa62366c632f3b5305086f841f079dbd2">pCoeffs</a>; <span class="comment">/* coeff pointer initialization */</span> |
| <a name="l00079"></a>00079 <a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a> acc; <span class="comment">/* accumulator */</span> |
| <a name="l00080"></a>00080 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> Xn1, Xn2, Yn1, Yn2; <span class="comment">/* Filter state variables */</span> |
| <a name="l00081"></a>00081 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> b0, b1, b2, a1, a2; <span class="comment">/* Filter coefficients */</span> |
| <a name="l00082"></a>00082 <a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a> Xn; <span class="comment">/* temporary input */</span> |
| <a name="l00083"></a>00083 uint32_t shift = 32u - ((uint32_t) S-><a class="code" href="structarm__biquad__casd__df1__inst__q31.html#a636c7fbe09ec4bef0bc0a4b4e2151cbe">postShift</a> + 1u); <span class="comment">/* Shift to be applied to the output */</span> |
| <a name="l00084"></a>00084 uint32_t sample, stage = S-><a class="code" href="structarm__biquad__casd__df1__inst__q31.html#a2c2b579f1df1d8273a5d9d945c27e1b2">numStages</a>; <span class="comment">/* loop counters */</span> |
| <a name="l00085"></a>00085 |
| <a name="l00086"></a>00086 |
| <a name="l00087"></a>00087 <span class="preprocessor">#ifndef ARM_MATH_CM0</span> |
| <a name="l00088"></a>00088 <span class="preprocessor"></span> |
| <a name="l00089"></a>00089 <span class="comment">/* Run the below code for Cortex-M4 and Cortex-M3 */</span> |
| <a name="l00090"></a>00090 |
| <a name="l00091"></a>00091 <span class="keywordflow">do</span> |
| <a name="l00092"></a>00092 { |
| <a name="l00093"></a>00093 <span class="comment">/* Reading the coefficients */</span> |
| <a name="l00094"></a>00094 b0 = *pCoeffs++; |
| <a name="l00095"></a>00095 b1 = *pCoeffs++; |
| <a name="l00096"></a>00096 b2 = *pCoeffs++; |
| <a name="l00097"></a>00097 a1 = *pCoeffs++; |
| <a name="l00098"></a>00098 a2 = *pCoeffs++; |
| <a name="l00099"></a>00099 |
| <a name="l00100"></a>00100 <span class="comment">/* Reading the state values */</span> |
| <a name="l00101"></a>00101 Xn1 = pState[0]; |
| <a name="l00102"></a>00102 Xn2 = pState[1]; |
| <a name="l00103"></a>00103 Yn1 = pState[2]; |
| <a name="l00104"></a>00104 Yn2 = pState[3]; |
| <a name="l00105"></a>00105 |
| <a name="l00106"></a>00106 <span class="comment">/* Apply loop unrolling and compute 4 output values simultaneously. */</span> |
| <a name="l00107"></a>00107 <span class="comment">/* The variable acc hold output values that are being computed: </span> |
| <a name="l00108"></a>00108 <span class="comment"> * </span> |
| <a name="l00109"></a>00109 <span class="comment"> * acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] </span> |
| <a name="l00110"></a>00110 <span class="comment"> */</span> |
| <a name="l00111"></a>00111 |
| <a name="l00112"></a>00112 sample = blockSize >> 2u; |
| <a name="l00113"></a>00113 |
| <a name="l00114"></a>00114 <span class="comment">/* First part of the processing with loop unrolling. Compute 4 outputs at a time. </span> |
| <a name="l00115"></a>00115 <span class="comment"> ** a second loop below computes the remaining 1 to 3 samples. */</span> |
| <a name="l00116"></a>00116 <span class="keywordflow">while</span>(sample > 0u) |
| <a name="l00117"></a>00117 { |
| <a name="l00118"></a>00118 <span class="comment">/* Read the input */</span> |
| <a name="l00119"></a>00119 Xn = *pIn++; |
| <a name="l00120"></a>00120 |
| <a name="l00121"></a>00121 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00122"></a>00122 |
| <a name="l00123"></a>00123 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00124"></a>00124 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn; |
| <a name="l00125"></a>00125 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00126"></a>00126 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn1; |
| <a name="l00127"></a>00127 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00128"></a>00128 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn2; |
| <a name="l00129"></a>00129 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00130"></a>00130 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn1; |
| <a name="l00131"></a>00131 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00132"></a>00132 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn2; |
| <a name="l00133"></a>00133 |
| <a name="l00134"></a>00134 <span class="comment">/* The result is converted to 1.31 , Yn2 variable is reused */</span> |
| <a name="l00135"></a>00135 Yn2 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) (acc >> shift); |
| <a name="l00136"></a>00136 |
| <a name="l00137"></a>00137 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00138"></a>00138 *pOut++ = Yn2; |
| <a name="l00139"></a>00139 |
| <a name="l00140"></a>00140 <span class="comment">/* Read the second input */</span> |
| <a name="l00141"></a>00141 Xn2 = *pIn++; |
| <a name="l00142"></a>00142 |
| <a name="l00143"></a>00143 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00144"></a>00144 |
| <a name="l00145"></a>00145 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00146"></a>00146 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn2; |
| <a name="l00147"></a>00147 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00148"></a>00148 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn; |
| <a name="l00149"></a>00149 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00150"></a>00150 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn1; |
| <a name="l00151"></a>00151 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00152"></a>00152 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn2; |
| <a name="l00153"></a>00153 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00154"></a>00154 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn1; |
| <a name="l00155"></a>00155 |
| <a name="l00156"></a>00156 |
| <a name="l00157"></a>00157 <span class="comment">/* The result is converted to 1.31, Yn1 variable is reused */</span> |
| <a name="l00158"></a>00158 Yn1 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) (acc >> shift); |
| <a name="l00159"></a>00159 |
| <a name="l00160"></a>00160 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00161"></a>00161 *pOut++ = Yn1; |
| <a name="l00162"></a>00162 |
| <a name="l00163"></a>00163 <span class="comment">/* Read the third input */</span> |
| <a name="l00164"></a>00164 Xn1 = *pIn++; |
| <a name="l00165"></a>00165 |
| <a name="l00166"></a>00166 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00167"></a>00167 |
| <a name="l00168"></a>00168 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00169"></a>00169 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn1; |
| <a name="l00170"></a>00170 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00171"></a>00171 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn2; |
| <a name="l00172"></a>00172 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00173"></a>00173 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn; |
| <a name="l00174"></a>00174 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00175"></a>00175 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn1; |
| <a name="l00176"></a>00176 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00177"></a>00177 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn2; |
| <a name="l00178"></a>00178 |
| <a name="l00179"></a>00179 <span class="comment">/* The result is converted to 1.31, Yn2 variable is reused */</span> |
| <a name="l00180"></a>00180 Yn2 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) (acc >> shift); |
| <a name="l00181"></a>00181 |
| <a name="l00182"></a>00182 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00183"></a>00183 *pOut++ = Yn2; |
| <a name="l00184"></a>00184 |
| <a name="l00185"></a>00185 <span class="comment">/* Read the forth input */</span> |
| <a name="l00186"></a>00186 Xn = *pIn++; |
| <a name="l00187"></a>00187 |
| <a name="l00188"></a>00188 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00189"></a>00189 |
| <a name="l00190"></a>00190 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00191"></a>00191 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn; |
| <a name="l00192"></a>00192 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00193"></a>00193 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn1; |
| <a name="l00194"></a>00194 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00195"></a>00195 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn2; |
| <a name="l00196"></a>00196 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00197"></a>00197 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn2; |
| <a name="l00198"></a>00198 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00199"></a>00199 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn1; |
| <a name="l00200"></a>00200 |
| <a name="l00201"></a>00201 <span class="comment">/* The result is converted to 1.31, Yn1 variable is reused */</span> |
| <a name="l00202"></a>00202 Yn1 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) (acc >> shift); |
| <a name="l00203"></a>00203 |
| <a name="l00204"></a>00204 <span class="comment">/* Every time after the output is computed state should be updated. */</span> |
| <a name="l00205"></a>00205 <span class="comment">/* The states should be updated as: */</span> |
| <a name="l00206"></a>00206 <span class="comment">/* Xn2 = Xn1 */</span> |
| <a name="l00207"></a>00207 <span class="comment">/* Xn1 = Xn */</span> |
| <a name="l00208"></a>00208 <span class="comment">/* Yn2 = Yn1 */</span> |
| <a name="l00209"></a>00209 <span class="comment">/* Yn1 = acc */</span> |
| <a name="l00210"></a>00210 Xn2 = Xn1; |
| <a name="l00211"></a>00211 Xn1 = Xn; |
| <a name="l00212"></a>00212 |
| <a name="l00213"></a>00213 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00214"></a>00214 *pOut++ = Yn1; |
| <a name="l00215"></a>00215 |
| <a name="l00216"></a>00216 <span class="comment">/* decrement the loop counter */</span> |
| <a name="l00217"></a>00217 sample--; |
| <a name="l00218"></a>00218 } |
| <a name="l00219"></a>00219 |
| <a name="l00220"></a>00220 <span class="comment">/* If the blockSize is not a multiple of 4, compute any remaining output samples here. </span> |
| <a name="l00221"></a>00221 <span class="comment"> ** No loop unrolling is used. */</span> |
| <a name="l00222"></a>00222 sample = (blockSize & 0x3u); |
| <a name="l00223"></a>00223 |
| <a name="l00224"></a>00224 <span class="keywordflow">while</span>(sample > 0u) |
| <a name="l00225"></a>00225 { |
| <a name="l00226"></a>00226 <span class="comment">/* Read the input */</span> |
| <a name="l00227"></a>00227 Xn = *pIn++; |
| <a name="l00228"></a>00228 |
| <a name="l00229"></a>00229 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00230"></a>00230 |
| <a name="l00231"></a>00231 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00232"></a>00232 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn; |
| <a name="l00233"></a>00233 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00234"></a>00234 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn1; |
| <a name="l00235"></a>00235 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00236"></a>00236 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn2; |
| <a name="l00237"></a>00237 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00238"></a>00238 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn1; |
| <a name="l00239"></a>00239 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00240"></a>00240 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn2; |
| <a name="l00241"></a>00241 |
| <a name="l00242"></a>00242 <span class="comment">/* The result is converted to 1.31 */</span> |
| <a name="l00243"></a>00243 acc = acc >> shift; |
| <a name="l00244"></a>00244 |
| <a name="l00245"></a>00245 <span class="comment">/* Every time after the output is computed state should be updated. */</span> |
| <a name="l00246"></a>00246 <span class="comment">/* The states should be updated as: */</span> |
| <a name="l00247"></a>00247 <span class="comment">/* Xn2 = Xn1 */</span> |
| <a name="l00248"></a>00248 <span class="comment">/* Xn1 = Xn */</span> |
| <a name="l00249"></a>00249 <span class="comment">/* Yn2 = Yn1 */</span> |
| <a name="l00250"></a>00250 <span class="comment">/* Yn1 = acc */</span> |
| <a name="l00251"></a>00251 Xn2 = Xn1; |
| <a name="l00252"></a>00252 Xn1 = Xn; |
| <a name="l00253"></a>00253 Yn2 = Yn1; |
| <a name="l00254"></a>00254 Yn1 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) acc; |
| <a name="l00255"></a>00255 |
| <a name="l00256"></a>00256 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00257"></a>00257 *pOut++ = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) acc; |
| <a name="l00258"></a>00258 |
| <a name="l00259"></a>00259 <span class="comment">/* decrement the loop counter */</span> |
| <a name="l00260"></a>00260 sample--; |
| <a name="l00261"></a>00261 } |
| <a name="l00262"></a>00262 |
| <a name="l00263"></a>00263 <span class="comment">/* The first stage goes from the input buffer to the output buffer. */</span> |
| <a name="l00264"></a>00264 <span class="comment">/* Subsequent stages occur in-place in the output buffer */</span> |
| <a name="l00265"></a>00265 pIn = pDst; |
| <a name="l00266"></a>00266 |
| <a name="l00267"></a>00267 <span class="comment">/* Reset to destination pointer */</span> |
| <a name="l00268"></a>00268 pOut = pDst; |
| <a name="l00269"></a>00269 |
| <a name="l00270"></a>00270 <span class="comment">/* Store the updated state variables back into the pState array */</span> |
| <a name="l00271"></a>00271 *pState++ = Xn1; |
| <a name="l00272"></a>00272 *pState++ = Xn2; |
| <a name="l00273"></a>00273 *pState++ = Yn1; |
| <a name="l00274"></a>00274 *pState++ = Yn2; |
| <a name="l00275"></a>00275 |
| <a name="l00276"></a>00276 } <span class="keywordflow">while</span>(--stage); |
| <a name="l00277"></a>00277 |
| <a name="l00278"></a>00278 <span class="preprocessor">#else</span> |
| <a name="l00279"></a>00279 <span class="preprocessor"></span> |
| <a name="l00280"></a>00280 <span class="comment">/* Run the below code for Cortex-M0 */</span> |
| <a name="l00281"></a>00281 |
| <a name="l00282"></a>00282 <span class="keywordflow">do</span> |
| <a name="l00283"></a>00283 { |
| <a name="l00284"></a>00284 <span class="comment">/* Reading the coefficients */</span> |
| <a name="l00285"></a>00285 b0 = *pCoeffs++; |
| <a name="l00286"></a>00286 b1 = *pCoeffs++; |
| <a name="l00287"></a>00287 b2 = *pCoeffs++; |
| <a name="l00288"></a>00288 a1 = *pCoeffs++; |
| <a name="l00289"></a>00289 a2 = *pCoeffs++; |
| <a name="l00290"></a>00290 |
| <a name="l00291"></a>00291 <span class="comment">/* Reading the state values */</span> |
| <a name="l00292"></a>00292 Xn1 = pState[0]; |
| <a name="l00293"></a>00293 Xn2 = pState[1]; |
| <a name="l00294"></a>00294 Yn1 = pState[2]; |
| <a name="l00295"></a>00295 Yn2 = pState[3]; |
| <a name="l00296"></a>00296 |
| <a name="l00297"></a>00297 <span class="comment">/* The variables acc holds the output value that is computed: </span> |
| <a name="l00298"></a>00298 <span class="comment"> * acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] </span> |
| <a name="l00299"></a>00299 <span class="comment"> */</span> |
| <a name="l00300"></a>00300 |
| <a name="l00301"></a>00301 sample = <a class="code" href="arm__fir__example__f32_8c.html#ab6558f40a619c2502fbc24c880fd4fb0">blockSize</a>; |
| <a name="l00302"></a>00302 |
| <a name="l00303"></a>00303 <span class="keywordflow">while</span>(sample > 0u) |
| <a name="l00304"></a>00304 { |
| <a name="l00305"></a>00305 <span class="comment">/* Read the input */</span> |
| <a name="l00306"></a>00306 Xn = *pIn++; |
| <a name="l00307"></a>00307 |
| <a name="l00308"></a>00308 <span class="comment">/* acc = b0 * x[n] + b1 * x[n-1] + b2 * x[n-2] + a1 * y[n-1] + a2 * y[n-2] */</span> |
| <a name="l00309"></a>00309 <span class="comment">/* acc = b0 * x[n] */</span> |
| <a name="l00310"></a>00310 acc = (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b0 *Xn; |
| <a name="l00311"></a>00311 |
| <a name="l00312"></a>00312 <span class="comment">/* acc += b1 * x[n-1] */</span> |
| <a name="l00313"></a>00313 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b1 *Xn1; |
| <a name="l00314"></a>00314 <span class="comment">/* acc += b[2] * x[n-2] */</span> |
| <a name="l00315"></a>00315 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) b2 *Xn2; |
| <a name="l00316"></a>00316 <span class="comment">/* acc += a1 * y[n-1] */</span> |
| <a name="l00317"></a>00317 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a1 *Yn1; |
| <a name="l00318"></a>00318 <span class="comment">/* acc += a2 * y[n-2] */</span> |
| <a name="l00319"></a>00319 acc += (<a class="code" href="arm__math_8h.html#a5aea1cb12fc02d9d44c8abf217eaa5c6" title="64-bit fractional data type in 1.63 format.">q63_t</a>) a2 *Yn2; |
| <a name="l00320"></a>00320 |
| <a name="l00321"></a>00321 <span class="comment">/* The result is converted to 1.31 */</span> |
| <a name="l00322"></a>00322 acc = acc >> shift; |
| <a name="l00323"></a>00323 |
| <a name="l00324"></a>00324 <span class="comment">/* Every time after the output is computed state should be updated. */</span> |
| <a name="l00325"></a>00325 <span class="comment">/* The states should be updated as: */</span> |
| <a name="l00326"></a>00326 <span class="comment">/* Xn2 = Xn1 */</span> |
| <a name="l00327"></a>00327 <span class="comment">/* Xn1 = Xn */</span> |
| <a name="l00328"></a>00328 <span class="comment">/* Yn2 = Yn1 */</span> |
| <a name="l00329"></a>00329 <span class="comment">/* Yn1 = acc */</span> |
| <a name="l00330"></a>00330 Xn2 = Xn1; |
| <a name="l00331"></a>00331 Xn1 = Xn; |
| <a name="l00332"></a>00332 Yn2 = Yn1; |
| <a name="l00333"></a>00333 Yn1 = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) acc; |
| <a name="l00334"></a>00334 |
| <a name="l00335"></a>00335 <span class="comment">/* Store the output in the destination buffer. */</span> |
| <a name="l00336"></a>00336 *pOut++ = (<a class="code" href="arm__math_8h.html#adc89a3547f5324b7b3b95adec3806bc0" title="32-bit fractional data type in 1.31 format.">q31_t</a>) acc; |
| <a name="l00337"></a>00337 |
| <a name="l00338"></a>00338 <span class="comment">/* decrement the loop counter */</span> |
| <a name="l00339"></a>00339 sample--; |
| <a name="l00340"></a>00340 } |
| <a name="l00341"></a>00341 |
| <a name="l00342"></a>00342 <span class="comment">/* The first stage goes from the input buffer to the output buffer. */</span> |
| <a name="l00343"></a>00343 <span class="comment">/* Subsequent stages occur in-place in the output buffer */</span> |
| <a name="l00344"></a>00344 pIn = pDst; |
| <a name="l00345"></a>00345 |
| <a name="l00346"></a>00346 <span class="comment">/* Reset to destination pointer */</span> |
| <a name="l00347"></a>00347 pOut = pDst; |
| <a name="l00348"></a>00348 |
| <a name="l00349"></a>00349 <span class="comment">/* Store the updated state variables back into the pState array */</span> |
| <a name="l00350"></a>00350 *pState++ = Xn1; |
| <a name="l00351"></a>00351 *pState++ = Xn2; |
| <a name="l00352"></a>00352 *pState++ = Yn1; |
| <a name="l00353"></a>00353 *pState++ = Yn2; |
| <a name="l00354"></a>00354 |
| <a name="l00355"></a>00355 } <span class="keywordflow">while</span>(--stage); |
| <a name="l00356"></a>00356 |
| <a name="l00357"></a>00357 <span class="preprocessor">#endif </span><span class="comment">/* #ifndef ARM_MATH_CM0 */</span> |
| <a name="l00358"></a>00358 } |
| <a name="l00359"></a>00359 |
| </pre></div></div> |
| </div> |
| <!--- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| <a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark"> </span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark"> </span>Data Structures</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark"> </span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark"> </span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark"> </span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark"> </span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark"> </span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark"> </span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark"> </span>Defines</a></div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <hr class="footer"/><address class="footer"><small>Generated on Fri Jul 15 2011 13:16:15 for CMSIS DSP Software Library by  |
| <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.7.2 </small></address> |
| </body> |
| </html> |
