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 language | English (US) |
---|---|
Title of host publication | ICM'08 - 20th International Conference on Microelectronics |
Pages | 395-398 |
Number of pages | 4 |
DOIs | |
State | Published - 2008 |
Externally published | Yes |
Event | 20th International Conference on Microelectronics, ICM'08 - Sharjah, United Arab Emirates Duration: Dec 14 2008 → Dec 17 2008 |
Other
Other | 20th International Conference on Microelectronics, ICM'08 |
---|---|
Country/Territory | United Arab Emirates |
City | Sharjah |
Period | 12/14/08 → 12/17/08 |
ASJC Scopus subject areas
- Electrical and Electronic Engineering