Complex affine projection adaptive signal processing method based on kernel function
An adaptive signal and affine projection technology, which is applied in the direction of adaptive network, impedance network, electrical components, etc., can solve the problems of algorithm instability and other problems, achieve ideal performance, good steady-state performance, and reduce the effect of offset error
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
Embodiment 1
[0075] Such as figure 1 As shown, Embodiment 1 of the present invention provides a complex affine projection adaptive signal processing method based on a kernel function, including the following steps:
[0076] S100: Initialize the number of iterations k=1; initialize the generalized linear model y(k)=w H x(k)+v H x * Standard weight vector of (k) and the conjugate weight vector are zero vectors, where m is the order of the filter, input signal vector for the current moment;
[0077] S200: Determine whether the number of iterations k is less than or equal to the projection order p, if so, enter step S300; otherwise, enter step S400;
[0078] S300: Set the input signal matrix at time k; calculate the error signal and the complex Gaussian kernel function according to the generalized linear model and the input signal matrix; set the identity matrix in the update formula to k order and update the weight vector; set k←k+1, and return to the step S200;
[0079] S400: Set ...
Embodiment 2
[0084] Embodiment 2 of the present invention provides a complex affine projection adaptive signal processing method based on a kernel function, comprising the following steps:
[0085] S110: Initialize the number of iterations k to be 1; initialize the generalized linear model y(k)=w H x(k)+v H x * Standard weight vector of (k) and the conjugate weight vector are zero vectors, where m is the order of the filter, input signal vector for the current moment;
[0086] S210: Determine whether the number of iterations k is less than or equal to the projection order p, if so, proceed to step S310; otherwise, proceed to step S410;
[0087] S310:
[0088] Construct the input signal matrix at the current time from the input signal vectors at the current time and the past time Calculate the error signal vector e(k)=d(k)- X T (k) w * And complex Gaussian kernel function vector κ(e(k))=exp(-|e(k)| 2 / 2σ 2 );
[0089] in, is the desired signal vector at discrete time k, ...
Embodiment 3
[0104] An embodiment of the present invention provides an adaptive signal processing method for complex affine projection with variable step size based on a kernel function, including the following steps:
[0105] S120: Initialize the number of iterations k=1; initialize the generalized linear model y(k)=w H x(k)+v H x * Standard weight vector of (k) and the conjugate weight vector are zero vectors, where m is the order of the filter, input signal vector for the current moment;
[0106] S220: Determine whether the number of iterations k is less than or equal to the projection order p, if so, enter step S320; otherwise, enter step S420;
[0107] S320:
[0108] Construct the input signal matrix at the current time from the input signal vectors at the current time and the past time Calculate the error signal vector e(k)=d(k)- X T (k) w * And complex Gaussian kernel function vector κ(e(k))=exp(-|e(k)| 2 / 2σ 2 );
[0109] in, is the desired signal vector at disc...
PUM
Abstract
Description
Claims
Application Information
- R&D Engineer
- R&D Manager
- IP Professional
- Industry Leading Data Capabilities
- Powerful AI technology
- Patent DNA Extraction
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com