Abstract
Many signal processing problems in wireless sensor networks can be solved by graph filtering techniques. Finite impulse response (FIR) graph filters (GFs) have received more attention in the literature because they enable distributed computation by the sensors. However, FIR GFs are limited in their ability to represent the global information of the network. This letter proposes a family of GFs with infinite impulse response (IIR) and provides algorithms for their distributed realization in wireless sensor networks. IIR GFs bring more flexibility to GF designers, as they can be designed and realized even when the graph spectrum is unknown. Numerical results show that IIR GFs are more accurate in approximating ideal GFs and more robust against network variation than FIR GFs.
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.
