Paper
14 September 1994 Suboptimum binary phase code search using a genetic algorithm
Author Affiliations +
Abstract
Optimum binary phase codes of length L are characterized by an autocorrelation function R((tau) ) with uniform sidelobes of level 1/L with respect to the main lobe. These optimum binary codes are called Barker codes. Binary phase codes that exhibit minimum peak sidelobes above 1/L are called suboptimum. A genetic algorithm is implemented to conduct the search for optimum and suboptimum binary codes of a given length L. In this approach, several different fitness functions are considered. These fitness functions are based on sidelobe level (SLL) and generalized entropy measures. To verify that these are reasonable fitness functions, they are first applied to sequence lengths for which optimum codes are known to exist. It is shown that if L is such that a Barker code exists, and S is a generalized entropy measure, then the Barker codes are the only ones that give the minimum value for S. It is also shown that the proposed binary phase code search is efficient for large values of L.
© (1994) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Jorge L. Mora, Benjamin C. Flores, and Vladik Kreinovich "Suboptimum binary phase code search using a genetic algorithm", Proc. SPIE 2275, Advanced Microwave and Millimeter-Wave Detectors, (14 September 1994); https://doi.org/10.1117/12.186713
Lens.org Logo
CITATIONS
Cited by 5 scholarly publications.
Advertisement
Advertisement
RIGHTS & PERMISSIONS
Get copyright permission  Get copyright permission on Copyright Marketplace
KEYWORDS
Binary data

Genetic algorithms

Algorithm development

Electroluminescence

Optimization (mathematics)

Computer engineering

Computer science

Back to Top