Computing of bistatic cross-ambiguity function on GPU

The real-time computation of cross ambiguity function (CAF) using brute force and block processing methods is a challenging task for parallel programming techniques. CAF is a key function for successful location tracking by passive radar systems. In this paper, the comparison of CAF methods computation and using a Graphics Processing Unit (GPU) are presented. The main goal of the research is to compare the computation efficiency and speed of the CAF methods on the GPU hardware with a single or multi-Core PC workstation. The results show the highest speed-up factor using GPU for all CAF methods.

[1]  Z. Nemec,et al.  Speed-up the computing of bistatic cross-ambiguity function , 2012, 2012 13th International Radar Symposium.

[2]  J. Cooley,et al.  A limited range discrete Fourier transform algorithm , 1980, ICASSP.

[3]  R. Dolecek,et al.  Speed-up the computing of bistatic cross-ambiguity function on different hardware configuration , 2012, 2012 13th Biennial Baltic Electronics Conference.

[4]  S. Stein.  Algorithms for ambiguity function processing , 1981 .

[5]  M. Cherniakov,et al.  Bistatic radar : emerging technology , 2008 .

[6]  Richard Tolimieri,et al.  Computing decimated finite cross-ambiguity functions , 1988, IEEE Trans. Acoust. Speech Signal Process..