Commun. Math. Res., 32 (2016), pp. 319-324.
Published online: 2021-05
Cited by
- BibTex
- RIS
- TXT
In recent study the bank of real square integrable functions that have nonlinear phases and admit a well-behaved Hilbert transform has been constructed for adaptive representation of nonlinear signals. We first show in this paper that the available basic functions are adequate for establishing an ideal adaptive decomposition algorithm. However, we also point out that the best approximation algorithm, which is a common strategy in decomposing a function into a sum of functions in a prescribed class of basis functions, should not be considered as a candidate for the ideal algorithm.
}, issn = {2707-8523}, doi = {https://doi.org/10.13447/j.1674-5647.2016.04.03}, url = {http://global-sci.org/intro/article_detail/cmr/18903.html} }In recent study the bank of real square integrable functions that have nonlinear phases and admit a well-behaved Hilbert transform has been constructed for adaptive representation of nonlinear signals. We first show in this paper that the available basic functions are adequate for establishing an ideal adaptive decomposition algorithm. However, we also point out that the best approximation algorithm, which is a common strategy in decomposing a function into a sum of functions in a prescribed class of basis functions, should not be considered as a candidate for the ideal algorithm.