Efficient enumeration of 2D Euclidean distances

Sudip Mondal; Khaled N. Salama

doi:10.1109/ICM.2008.5393537

Efficient enumeration of 2D Euclidean distances

Sudip Mondal^*, Khaled N. Salama

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-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 language	English (US)
Title of host publication	ICM'08 - 20th International Conference on Microelectronics
Pages	395-398
Number of pages	4
DOIs	https://doi.org/10.1109/ICM.2008.5393537
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

Access to Document

10.1109/ICM.2008.5393537

Cite this

@inproceedings{e1c19537c0c94f5cbfedb9316e121a62,

title = "Efficient enumeration of 2D Euclidean distances",

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.",

author = "Sudip Mondal and Salama, {Khaled N.}",

year = "2008",

doi = "10.1109/ICM.2008.5393537",

language = "English (US)",

isbn = "9781424423705",

pages = "395--398",

booktitle = "ICM'08 - 20th International Conference on Microelectronics",

note = "20th International Conference on Microelectronics, ICM'08 ; Conference date: 14-12-2008 Through 17-12-2008",

}

TY - GEN

T1 - Efficient enumeration of 2D Euclidean distances

AU - Mondal, Sudip

AU - Salama, Khaled N.

PY - 2008

Y1 - 2008

N2 - 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.

AB - 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.

UR - http://www.scopus.com/inward/record.url?scp=77951119876&partnerID=8YFLogxK

U2 - 10.1109/ICM.2008.5393537

DO - 10.1109/ICM.2008.5393537

M3 - Conference contribution

AN - SCOPUS:77951119876

SN - 9781424423705

SP - 395

EP - 398

BT - ICM'08 - 20th International Conference on Microelectronics

T2 - 20th International Conference on Microelectronics, ICM'08

Y2 - 14 December 2008 through 17 December 2008

ER -

Efficient enumeration of 2D Euclidean distances

Abstract

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this