Abstract
A combination of techniques taken from graph theory and decision theory is used to solve the problem of realization of 2-D digital filters using minimum number of delay elements called minimal realization. The solution is presented in the form of an algorithm which, when executed, yields one (and hence, infinitely many) minimal realization.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
