Efficient exhaustive search for optimal-PSL binary codes
Gregory E. Coxson - Lockheed Martin MS2, Jon C. Russo - Lockheed Martin ATL
Wed, 28 April 2004, 3:20 PM - 4:10 PM
This paper describes an exhaustive search for minimum Peak Sidelobe
Level (PSL) binary codes, combining several devices for efficiency.
These include combinatoric tree search techniques, the use of
PSL-preserving symmetries to reduce search space, data
representations and operations for fast sidelobe computation, and
a partitioning scheme for parallelism. All balanced 64-bit minimum
PSL codes are presented, and the upper limit on known consecutive
lengths to have PSL=4 codes is extended to 70.
Dr. Gregory E. Coxson - Lockheed Martin MS2
Radar Systems Engineer at Lockheed Martin MS2 since 1996, involved
in ECM, pulse compression, ship-based missile defense and other radar
modes. Engineer at Hughes Radar Systems in El Segundo, CA from 1994
to 1996, supporting the F15 and B2 radar programs. PhD EE from the
University of Wisconsin at Madison, 1993. Masters degrees in EE (1989)
and Mathematics (1987), also from UW - Madison. Analyst at the Center
for Naval Analysis in Alexandria, VA, 1980-1983.
Mr. Jon C. Russo - Lockheed Martin ATL
Jon C. Russo, was born in Geneva, NY. Jon graduated with distinction from the Cornell University School of Electrical Engineering and completed a Masters in Engineering in 1993. While there, Jon was a teaching assistant for electronic design lab and other programs. Jon went on to join the research team at Lockheed Martin Advanced Technology Labs, where he has worked in singal processing, radar, hardware design, and reconfigurable computing and compiler technologies. Research interests include cognitive architectures, radar and communications processing.