Efficient enumeration of 2D Euclidean distances

Sudip Mondal*, Khaled N. Salama

*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

The computation of the Euclidean distance is an important aspect in many signal processing applications, especially those related to pattern classification systems and communication systems. Most communication systems compute the Euclidean distance between a given set of candidates (called objects) and a given vector (called a query). In this paper we present an algorithm for the computation of the Euclidean distance in a two dimensional space, which is suitable for VLSI implementation. The algorithm only computes the necessary distances, in contrast to current approaches, which rely on the availability of the distances of all candidates to the center. The advantages of the proposed algorithm over conventional ones are presented.

Original languageEnglish (US)
Title of host publicationICM'08 - 20th International Conference on Microelectronics
Pages395-398
Number of pages4
DOIs
StatePublished - 2008
Externally publishedYes
Event20th International Conference on Microelectronics, ICM'08 - Sharjah, United Arab Emirates
Duration: Dec 14 2008Dec 17 2008

Other

Other20th International Conference on Microelectronics, ICM'08
CountryUnited Arab Emirates
CitySharjah
Period12/14/0812/17/08

ASJC Scopus subject areas

  • Electrical and Electronic Engineering

Fingerprint Dive into the research topics of 'Efficient enumeration of 2D Euclidean distances'. Together they form a unique fingerprint.

Cite this