Abstract

This paper concerns sectioning approaches for the implementation of two-dimensional recursive filters with symmetric half-plane support. Two new algorithms are presented and compared to the direct implementation as regards computational requirements. Procedures for choosing optimal sectioning parameters for both infinite and finite size rows are provided. This method has been implemented on a scientific minicomputer (Prime 750) and examples are given to illustrate the computational requirements. The method is also suitable for microprocessor implementation with an associated signal processing chip to perform the section FFT's.

Full Text
Paper version not known

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.