N-Dimensional Approximation of Euclidean Distance

Gian Carlo Cardarilli, Luca Di Nunzio, Rocco Fazzolari, Alberto Nannarelli, Marco Re, Sergio Spano

Research output: Contribution to journalJournal articleResearchpeer-review

855 Downloads (Pure)


Several applications in different engineering areas require the computation of the Euclidean distance, a quite complex operation based on squaring and square root. In some applications, the Euclidean distance can be replaced by the Manhattan distance. However, the approximation error introduced by the Manhattan distance may be rather large, especially in a multi-dimensional space, and may compromise the overall performance. In this paper, we propose an extension of the method to approximate the Euclidean distance to a multi-dimensional space. Such a method results in a much smaller approximation error with respect to the Manhattan approximation at expenses of a reasonable increase in hardware cost. Moreover, with respect to the Euclidean distance, the method provides a significant reduction in the hardware if the application can tolerate some errors.

Original languageEnglish
JournalIEEE Transactions on Circuits and Systems II: Express Briefs
Issue number3
Pages (from-to)565 - 569
Publication statusPublished - 1 Jan 2020


  • Adders
  • Approximation error
  • Delays
  • Euclidean distance
  • Euclidean distance approximation.
  • Hardware
  • Two dimensional displays


Dive into the research topics of 'N-Dimensional Approximation of Euclidean Distance'. Together they form a unique fingerprint.

Cite this