30.10.2014 Views

o_195h4n6al16jb186b1b2qs7fgssa.pdf

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

Oppenheim and<br />

Ronald Schafer’s Discrete-Time Signal Processing, Prentice Hall, 1989. For<br />

implementation details of Least Mean Square FIR filters, please refer to T.<br />

Hsia’s Convergence<br />

Analysis of LMS and NLMS Adaptive Algorithms, Proc. ICASSP, pp. 667-670,<br />

1983, as<br />

well as Sangil Park and Garth Hillman’s On Acoustic-Echo Cancellation<br />

Implementation with Multiple Cascadable Adaptive FIR Filter Chips, Proc.<br />

ICASSP,<br />

1989.<br />

FIRStruct<br />

Structure: FIRStructdescribes the filter structure for any of the FIR filters.<br />

Include: dsp.h<br />

Declaration: typedef struct {<br />

int numCoeffs;<br />

fractional* coeffsBase;<br />

fractional* coeffsEnd;<br />

int coeffsPage;<br />

fractional* delayBase;<br />

fractional* delayEnd;<br />

fractional* delay;<br />

} FIRStruct;<br />

Parameters: numCoeffs number of coefficients in filter (also M)<br />

coeffsBase base address for filtercoefficients (also h)<br />

coeffsEnd end address for filter coefficients<br />

coeffsPage coefficients buffer page number<br />

delayBase base address for delay buffer<br />

delayEnd end address for delay buffer<br />

delay current value of delay pointer (also d)<br />

Remarks: Number of coefficients in filter is M.<br />

Coefficients, h[m], defined in 0 ≤m

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!