Abstract
Efficient implementation techniques for the enumeration of the best N-phase codes are proposed. These techniques allow a single program to simultaneously take advantage of all sidelobe-invariant transformations (i.e. constant and linear phase shift, reversal and conjugation). As an example of application, all Barker codes of length 16 with minimum alphabet size are determined.
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.
