Abstract
The design of multirate bandpass filters requires a search for the optimum multistage structure. The size of the search space grows exponentially as the filter bandwidth decreases, and excessive computer time is required to search it exhaustively. A fast branch-and-bound algorithm for searching this space is presented. In our tests, this algorithm decreases search time by an average factor which increases from 7.7 to 23.0 as the filter passband width decreases from 8 × 10-4to 3.2 × 10-6. It is also shown that when coefficient storage is the cost criterion, the actual filter structure resembles an unrealizable optimum filter structure for small bandwidth filters.
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.
