Discrete Hilbert transform filtering.
|Title:||Discrete Hilbert transform filtering.|
|Authors:||Sabri, M. Shaker.|
|Abstract:||A discrete filtering technique based on the discrete Hilbert transform (DHT) is presented. The filtering method and its implementation are shown to compare favorably with the discrete Fourier transform (DFT) or the Fast Fourier transform (FFT) filtering. The comparison is presented in terms of speed, error accumulation and complexity of hardware implementation. The DHT and the derived discrete filter transforms are each presented in matrix form and may be implemented with the same hardware in either series or parallel form. In this manner a large variety of filtering characteristics may be implemented by changes of the stored coefficients only. While the filtering process, in matrix form, is a circular convolution process, direct convolution filters are obtainable also by using one row of the matrix only and are realizable in the form of a non-recursive finite impulse response (FIR) digital filters. An interesting application of the filtering matrix method for bandlimited signal extrapolation is presented. The total extrapolation process is achieved by a single matrix operation. All known bandlimited signal extrapolation techniques require large computations, can be implemented only on a general purpose computer and cannot be applied in real time. The proposed technique and its implementation has the advantages that it requires much less computation, gives more accurate results, and can be applied in real time.|
|Collection||Thèses, 1910 - 2010 // Theses, 1910 - 2010|