Filter Design Toolbox    
adaptfilt.qrdrls

Create a QR-decomposition-based RLS FIR adaptive filter object

Syntax

Description

ha = adaptfilt.qrdrls(l,lambda,sqrtcov,coeffs,states) constructs an FIR QR-decomposition-based recursive-least squares (RLS) adaptive filter object ha.

Input Arguments

Entries in the following table describe the input arguments for adaptfilt.qrdrls.

Input Argument
Description
l
Adaptive filter length (the number of coefficients or taps) and it must be a positive integer.l defaults to 10.
lambda
RLS forgetting factor. This is a scalar and should lie within the range (0, 1]. lambda defaults to 1.
sqrtcov
Upper-triangular Cholesky (square root) factor of the input covariance matrix. Initialize this matrix with a positive definite upper triangular matrix.
coeffs
Vector of initial filter coefficients. It must be a length l vector. coeffs defaults to length l vector whose elements are zeros.
states
Vector of initial filter states. It must be a length l-1 vector. states defaults to a length l-1 vector of zeros.

adaptfilt.qrdrls Object Properties

Since your adaptfilt.qrdrls filter is an object, it has properties that define its behavior in operation. Note that many of the properties are also input arguments for creating adaptfilt.qrdrls objects. To show you the properties that apply, this table lists and describes each property for the filter object.

Name
Range
Description
Algorithm
None
Defines the adaptive filter algorithm the object uses during adaptation
FilterLength
Any positive integer
Reports the length of the filter, the number of coefficients or taps
Coefficients
Vector of length l
Vector containing the initial filter coefficients. It must be a length l vector where l is the number of filter coefficients. coeffs defaults to length l vector of zeros when you do not provide the argument for input.
States
Vector of elements
Vector of the adaptive filter states. states defaults to a vector of zeros which has length equal to (l + projectord - 2).
ForgettingFactor
Scalar
Forgetting factor of the adaptive filter. This is a scalar and should lie in the range (0, 1]. It defaults to 1. Setting forgetting factor = 1 denotes infinite memory while adapting to find the new filter. Note that this is the lambda input argument.
SqrtCov
Square matrix with each dimension equal to the filter length l
Upper-triangular Cholesky (square root) factor of the input covariance matrix. Initialize this matrix with a positive definite upper triangular matrix.
ResetBeforeFiltering
off or on
Determine whether the filter states get restored to their starting values for each filtering operation. The starting values are the values in place when you create the filter if you have not changed the filter since you constructed it. ResetBeforeFiltering returns to zero any state that the filter changes during processing. States that the filter does not change are not affected. Defaults to 'on'.
NumSamplesProcessed
Any integer
Returns the number of samples processed during filtering. Defaults to zero.

Examples

System Identification of a 32-coefficient FIR filter (500 iterations).

See Also

adaptfilt.rls, adaptfilt.hrls, adaptfilt.hswrls, adaptfilt.swrls


  adaptfilt.qrdlsl adaptfilt.rls 

Learn more about the latest releases of MathWorks products:

 © 1994-2009 The MathWorks, Inc.    -   Site Help   -   Patents   -   Trademarks   -   Privacy Policy   -   Preventing Piracy   -   RSS