A Globally Optimal Bilinear Programming Approach to the Design of Approximate Hilbert Pairs of Orthonormal Wavelet Bases

It is understood that the Hilbert transform pairs of orthonormal wavelet bases can only be realized approximately by the scaling filters of conjugate quadrature filter (CQF) banks. In this paper, the approximate FIR realization of the Hilbert transform pairs is formulated as an optimization problem...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	IEEE transactions on signal processing Jg. 58; H. 1; S. 233 - 241
Hauptverfasser:	Wang, Jiang, Zhang, Jian Qiu
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	New York, NY IEEE 01.01.2010 Institute of Electrical and Electronics Engineers
Schlagworte:	Applied sciences Bilinear programming conjugate quadrature filter (CQF) Constraint optimization Delay Detection, estimation, filtering, equalization, prediction Discrete transforms Discrete wavelet transforms dual-tree complex wavelet transform (DTWT) Exact sciences and technology Filter bank Finite impulse response filter Frequency Hilbert transform Information, signal and communications theory Miscellaneous orthonormal wavelet bases Quadratic programming Signal and communications theory Signal processing Signal, noise Telecommunications and information theory Wavelet transforms dual-tree complex wavelet transform (DTWT) conjugate quadrature filter (CQF) Branch and bound method L1 approximation Programming Bilinear programming Orthogonality Hilbert transformation Constrained optimization Hilbert transform Wavelet transformation Optimal solution Wavelet base Signal processing Filter bank orthonormal wavelet bases
ISSN:	1053-587X, 1941-0476
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!