%0 Conference Paper %1 reddy90 %A Reddy, G. R. %A Swamy, M. N. S. %B Circuits and Systems, 1990., IEEE International Symposium on %D 1990 %K all-pass dft fourier hilbert signal.processing %P 646--649 %R 10.1109/ISCAS.1990.112149 %T Digital All-Pass Filter Design through Discrete Hilbert Transform %V 1 %X A simple method for the design of a digital all-pass filter, satisfying the given group delay specification, is presented. The design is based on the discrete Hilbert transform relation, relating the log-magnitude and phase of the Fourier transform of the minimum phase signal. The transfer function of an all-pass filter is completely determined by the coefficients of the denominator polynomial. For the filter to be stable, the denominator polynomial must be minimum phase. From the given group delay specification, the phase corresponding to the pole part of the desired filter is first determined. The magnitude spectrum corresponding to the pole part of the desired filter is obtained from the above phase through the discrete Hilbert transform relation. The method needs just four fast Fourier transform operations. There is no restriction on the order of the filter, and the number of filter coefficients can be selected after the final design, depending on the accuracy desired. The procedure is illustrated through design examples

@inproceedings{reddy90, abstract = {A simple method for the design of a digital all-pass filter, satisfying the given group delay specification, is presented. The design is based on the discrete Hilbert transform relation, relating the log-magnitude and phase of the Fourier transform of the minimum phase signal. The transfer function of an all-pass filter is completely determined by the coefficients of the denominator polynomial. For the filter to be stable, the denominator polynomial must be minimum phase. From the given group delay specification, the phase corresponding to the pole part of the desired filter is first determined. The magnitude spectrum corresponding to the pole part of the desired filter is obtained from the above phase through the discrete Hilbert transform relation. The method needs just four fast Fourier transform operations. There is no restriction on the order of the filter, and the number of filter coefficients can be selected after the final design, depending on the accuracy desired. The procedure is illustrated through design examples}, added-at = {2015-12-08T13:22:45.000+0100}, author = {Reddy, G. R. and Swamy, M. N. S.}, biburl = {https://www.bibsonomy.org/bibtex/26087b56560f6785d48d4c7d7fd05f117/ytyoun}, booktitle = {Circuits and Systems, 1990., IEEE International Symposium on}, doi = {10.1109/ISCAS.1990.112149}, interhash = {77d1fbe0485437c8be6bd37077c740bd}, intrahash = {6087b56560f6785d48d4c7d7fd05f117}, keywords = {all-pass dft fourier hilbert signal.processing}, month = may, pages = {646--649}, timestamp = {2015-12-08T13:27:43.000+0100}, title = {Digital All-Pass Filter Design through Discrete {Hilbert} Transform}, volume = 1, year = 1990 }