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.

Full Text
Paper version not known

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 call