Abstract
The problem of finding a binary pulse-compression code with arbitrary side-lobe levels is cast as a quadratically constrained integer program. Witzgall's algorithm is then applied, after a suitable manipulation, to put the constraints into a convex form.
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.
