Ambiguity properties of quadratic congruential coding

Abstract
The ambiguity characteristics of multiple access frequency hop codes based on standard quadratic congruences are investigated in the light of results obtained for codes based on Costas arrays and extended quadratic congruences. While the autoambiguity properties are found to be very similar to those of Costa codes, i.e. nearly ideal, the cross-ambiguity properties of quadratic congruential codes are much better. These results are valid across the whole class of code sets considered, but they are obtained at some expense in the pulse compression characteristics of the codes. A uniform upper bound is placed on the entire cross-ambiguity function surface, and bounds are placed on the amplitude of spurious peaks in the autoambiguity function. These bounds depend on the time-bandwidth product and code length exclusively and lead naturally to a discussion of the design tradeoffs for these two parameters. Examples of typical autoambiguity and cross-ambiguity functions are given to illustrate the performance of quadratic congruential coding with respect to Costas coding.

This publication has 9 references indexed in Scilit: