FAST TEMPLATE MATCHING FOR UMTS CODE KEYS WITH GRAPHICS HARDWARE

Mario Vigliar, Giancarlo Raiconi, Alan David Sanders

2011

Abstract

Template matching is a milestone application in Digital Signal Processing, and sets its roots in fundamental numeric filtering theory, as well as in time and frequency domain analysis. Radio signals, with mass spreading of high bandwidth cellular networks, have become in recent years much more critical to handle in terms of QoS (Quality of Service), QoE (Quality of Experience) and SLA (Service Level Agreement), putting mobile carriers in the need to monitor their network status in a more detailed and efficient way than in past. Here an efficient use case of GPU computing applied to fast signal processing will be illustrated, with particular interest in study and development of a SIMD Linear and FFT-based cross correlation of multiple code keys in air-captured streams for UMTS networks. Developed techniques have been used with success in a commercial available 3G geotagged scanning equipment.

References

  1. Bornkessel, C. and Wuschek, M. (2006). Exposure measurements of modern digital broadband radio services. Technical report, IMST GmbH, Test Centre EMC, Kamp-Lintfort, Germany University of Applied Sciences Deggendorf, Edlmairst, Deggendorf, Germany.
  2. Frigo, M., Leiserson, C. E., Prokop, H., and Ramachandran, S. (1999). Cache-oblivious algorithms. In In Proc. 40th Annual Symposium on Foundations of Computer Science, pages 285-397. IEEE Computer Society Press.
  3. Stasinski, R. and Potrymajo, J. (2004). Mixed-radix fft for improving cache performance. EUSIPCO 2004, Proceedings of.
  4. Tian, J., Xu, Y., Jiang, H., Luo, H., and Song, W. (2004). Efficient algorithms of fft butterfly for ofdm systems. In Emerging Technologies: Frontiers of Mobile and Wireless Communication, 2004. Proceedings of the IEEE 6th Circuits and Systems Symposium on, volume 2, pages 461-464 Vol.2.
  5. Volkov, V. and Kazian, B. (2008). Fitting fft onto g80 architecture. Technical Report CS 252, University of California, Berkeley.
Download


Paper Citation


in Harvard Style

Vigliar M., Raiconi G. and David Sanders A. (2011). FAST TEMPLATE MATCHING FOR UMTS CODE KEYS WITH GRAPHICS HARDWARE . In Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS, ISBN 978-989-8425-48-5, pages 265-272. DOI: 10.5220/0003362902650272


in Bibtex Style

@conference{peccs11,
author={Mario Vigliar and Giancarlo Raiconi and Alan David Sanders},
title={FAST TEMPLATE MATCHING FOR UMTS CODE KEYS WITH GRAPHICS HARDWARE},
booktitle={Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS,},
year={2011},
pages={265-272},
publisher={SciTePress},
organization={INSTICC},
doi={10.5220/0003362902650272},
isbn={978-989-8425-48-5},
}


in EndNote Style

TY - CONF
JO - Proceedings of the 1st International Conference on Pervasive and Embedded Computing and Communication Systems - Volume 1: PECCS,
TI - FAST TEMPLATE MATCHING FOR UMTS CODE KEYS WITH GRAPHICS HARDWARE
SN - 978-989-8425-48-5
AU - Vigliar M.
AU - Raiconi G.
AU - David Sanders A.
PY - 2011
SP - 265
EP - 272
DO - 10.5220/0003362902650272