Share Email Print
cover

Proceedings Paper

Suboptimum binary phase code search using a genetic algorithm
Author(s): Jorge L. Mora; Benjamin C. Flores; Vladik Kreinovich
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper 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.

Paper Details

Date Published: 14 September 1994
PDF: 9 pages
Proc. SPIE 2275, Advanced Microwave and Millimeter-Wave Detectors, (14 September 1994); doi: 10.1117/12.186713
Show Author Affiliations
Jorge L. Mora, Univ. of Texas/El Paso (United States)
Benjamin C. Flores, Univ. of Texas/El Paso (United States)
Vladik Kreinovich, Univ. of Texas/El Paso (United States)


Published in SPIE Proceedings Vol. 2275:
Advanced Microwave and Millimeter-Wave Detectors
Satish S. Udpa; Hsiu C. Han, Editor(s)

© SPIE. Terms of Use
Back to Top