Abstract
A computationally efficient mismatched filter comprised of a matched filter in cascade with a multi-stage filter based on sidelobe inversion is proposed. For this approach to work, the given code has to satisfy certain conditions as derived in this work. For the proposed filter to be of practical significance, the given autocorrelation must have a computationally efficient representation including the case of sparse and/or small integer valued sidelobes such as in Barker codes. When implemented in VLSI, significantly smaller chip area and less power are required compared to the length-optimal filters achieving comparable sidelobe suppression.
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.
