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 autocorrelation of the given code has to satisfy certain conditions that are derived in this work. If in addition, the sidelobes are sparse and of small integer values, such as in Barker codes and Huffman sequences, then the proposed filters are shown to be computationally very efficient. When implemented in VLSI, they require significantly smaller chip area and consume less power 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.
