Depending on the amount of data to process, file generation may take longer.

If it takes too long to generate, you can limit the data by, for example, reducing the range of years.

Article

Download BibTeX

Title

Optimization of data access in GPGPU based implementations of Spatio-Temporal Track-Before-Detect algorithm

Authors

Year of publication

2012

Published in

Poznan University of Technology Academic Journals. Electrical Engineering

Journal year: 2012 | Journal number: Issue 71

Article type

scientific article

Publication language

english

Keywords
EN
  • Track-Before-Detect algorithm
  • TBD
  • GPGPU
  • Spatio-Temporal TBD algorithm
Abstract

EN Tracking systems need accurate and fast computations. Track-Before-Detect (TBD) algorithms are applied if the signal is weak (e.g. SNR<1). Spatio-Temporal TBS algorithm uses IIR-based architecture and there are two filtering parts related to the multidimensional processing. Computation of TBD algorithms needs for example GPGPU devices. The main limitations of GPGPU are memory bus bottleneck and limited availability of fast internal shared memory. A few memory optimization techniques are presented. The new technique based on the dual representation of the state space data in proposed. The compression technique allows application of 8-bit representation for state space and floating point state space together. Floating point values are used for areas where the object is located. The TBD system tracks objects and predicts signal data representation together.

Pages (from - to)

185 - 192

This website uses cookies to remember the authenticated session of the user. For more information, read about Cookies and Privacy Policy.