Ultra low power hardware for computing squared euclidean distances
(2011) European Conference on Circuit Theory and Design (ECCTD 2011)- Abstract
- Computing Euclidean Distances is a very important operation in digital communication, especially in the case of trellis coded modulation, where it is used numerously. This paper shows that a substantial reduction in complexity can be achieved in hardware processing elements for computing Euclidean Distances. A reduction in complexity down to 34% is shown compared to traditional designs. The paper also shows that the optimized design can be done completely ripple free, which leads to a reduction of the critical path to far more than half. The reduction in complexity leads to a reduction in power consumption. The ripple free design also leads to lower power consumption for two reasons: the rippling in itself leads to unnecessary glitches,... (More)
- Computing Euclidean Distances is a very important operation in digital communication, especially in the case of trellis coded modulation, where it is used numerously. This paper shows that a substantial reduction in complexity can be achieved in hardware processing elements for computing Euclidean Distances. A reduction in complexity down to 34% is shown compared to traditional designs. The paper also shows that the optimized design can be done completely ripple free, which leads to a reduction of the critical path to far more than half. The reduction in complexity leads to a reduction in power consumption. The ripple free design also leads to lower power consumption for two reasons: the rippling in itself leads to unnecessary glitches, which costs power and the shorter critical path enables a lower supply voltage, which reduces the power consumption as well. (Less)
Please use this url to cite or link to this publication:
https://lup.lub.lu.se/record/2027683
- author
- Nilsson, Peter LU and Hertz, Erik LU
- organization
- publishing date
- 2011
- type
- Contribution to conference
- publication status
- published
- subject
- conference name
- European Conference on Circuit Theory and Design (ECCTD 2011)
- conference location
- Linköping, Sweden
- conference dates
- 2011-08-29
- external identifiers
-
- scopus:80155192288
- language
- English
- LU publication?
- yes
- id
- a863a7aa-97a4-44fb-ba96-ff26232d3a24 (old id 2027683)
- date added to LUP
- 2016-04-04 14:35:00
- date last changed
- 2022-01-30 02:17:09
@misc{a863a7aa-97a4-44fb-ba96-ff26232d3a24,
abstract = {{Computing Euclidean Distances is a very important operation in digital communication, especially in the case of trellis coded modulation, where it is used numerously. This paper shows that a substantial reduction in complexity can be achieved in hardware processing elements for computing Euclidean Distances. A reduction in complexity down to 34% is shown compared to traditional designs. The paper also shows that the optimized design can be done completely ripple free, which leads to a reduction of the critical path to far more than half. The reduction in complexity leads to a reduction in power consumption. The ripple free design also leads to lower power consumption for two reasons: the rippling in itself leads to unnecessary glitches, which costs power and the shorter critical path enables a lower supply voltage, which reduces the power consumption as well.}},
author = {{Nilsson, Peter and Hertz, Erik}},
language = {{eng}},
title = {{Ultra low power hardware for computing squared euclidean distances}},
year = {{2011}},
}