Lower bounds on power-dissipation for DSP algorithms

Research output: Contribution to conferencePaper

Abstract

Presented in this paper is a fundamental mathematical basis for determining the lower bounds on power dissipation in digital signal processing (DSP) algorithms. This basis is derived from information-theoretic arguments. In particular, a digital signal processing algorithm is viewed as a process of information transfer with an inherent information transfer rate requirement of R bits/sec. Different architectures implementing a given algorithm are equivalent to different communication networks each with a certain capacity C (also in bits/sec). The absolute lower bound on the power dissipation for any given architecture is then obtained by minimizing the signal power such that its channel capacity C is equal to the desired information transfer rate R. The proposed framework is employed to determine the lower-bounds for simple digital filters. Furthermore, lower bounds on the power dissipation achievable via adiabatic logic is also presented thus demonstrating the versatility of the proposed approach.

Original languageEnglish (US)
Pages43-48
Number of pages6
StatePublished - Dec 1 1996
EventProceedings of the 1996 International Symposium on Low Power Electronics and Design - Monterey, CA, USA
Duration: Aug 12 1996Aug 14 1996

Other

OtherProceedings of the 1996 International Symposium on Low Power Electronics and Design
CityMonterey, CA, USA
Period8/12/968/14/96

Fingerprint

Digital signal processing
Energy dissipation
Channel capacity
Digital filters
Telecommunication networks

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Electronic, Optical and Magnetic Materials

Cite this

Shanbhag, N. R. (1996). Lower bounds on power-dissipation for DSP algorithms. 43-48. Paper presented at Proceedings of the 1996 International Symposium on Low Power Electronics and Design, Monterey, CA, USA, .

Lower bounds on power-dissipation for DSP algorithms. / Shanbhag, Naresh R.

1996. 43-48 Paper presented at Proceedings of the 1996 International Symposium on Low Power Electronics and Design, Monterey, CA, USA, .

Research output: Contribution to conferencePaper

Shanbhag, NR 1996, 'Lower bounds on power-dissipation for DSP algorithms' Paper presented at Proceedings of the 1996 International Symposium on Low Power Electronics and Design, Monterey, CA, USA, 8/12/96 - 8/14/96, pp. 43-48.
Shanbhag NR. Lower bounds on power-dissipation for DSP algorithms. 1996. Paper presented at Proceedings of the 1996 International Symposium on Low Power Electronics and Design, Monterey, CA, USA, .
Shanbhag, Naresh R. / Lower bounds on power-dissipation for DSP algorithms. Paper presented at Proceedings of the 1996 International Symposium on Low Power Electronics and Design, Monterey, CA, USA, .6 p.
@conference{b03938f3e0474f06ab177b3db4112955,
title = "Lower bounds on power-dissipation for DSP algorithms",
abstract = "Presented in this paper is a fundamental mathematical basis for determining the lower bounds on power dissipation in digital signal processing (DSP) algorithms. This basis is derived from information-theoretic arguments. In particular, a digital signal processing algorithm is viewed as a process of information transfer with an inherent information transfer rate requirement of R bits/sec. Different architectures implementing a given algorithm are equivalent to different communication networks each with a certain capacity C (also in bits/sec). The absolute lower bound on the power dissipation for any given architecture is then obtained by minimizing the signal power such that its channel capacity C is equal to the desired information transfer rate R. The proposed framework is employed to determine the lower-bounds for simple digital filters. Furthermore, lower bounds on the power dissipation achievable via adiabatic logic is also presented thus demonstrating the versatility of the proposed approach.",
author = "Shanbhag, {Naresh R}",
year = "1996",
month = "12",
day = "1",
language = "English (US)",
pages = "43--48",
note = "Proceedings of the 1996 International Symposium on Low Power Electronics and Design ; Conference date: 12-08-1996 Through 14-08-1996",

}

TY - CONF

T1 - Lower bounds on power-dissipation for DSP algorithms

AU - Shanbhag, Naresh R

PY - 1996/12/1

Y1 - 1996/12/1

N2 - Presented in this paper is a fundamental mathematical basis for determining the lower bounds on power dissipation in digital signal processing (DSP) algorithms. This basis is derived from information-theoretic arguments. In particular, a digital signal processing algorithm is viewed as a process of information transfer with an inherent information transfer rate requirement of R bits/sec. Different architectures implementing a given algorithm are equivalent to different communication networks each with a certain capacity C (also in bits/sec). The absolute lower bound on the power dissipation for any given architecture is then obtained by minimizing the signal power such that its channel capacity C is equal to the desired information transfer rate R. The proposed framework is employed to determine the lower-bounds for simple digital filters. Furthermore, lower bounds on the power dissipation achievable via adiabatic logic is also presented thus demonstrating the versatility of the proposed approach.

AB - Presented in this paper is a fundamental mathematical basis for determining the lower bounds on power dissipation in digital signal processing (DSP) algorithms. This basis is derived from information-theoretic arguments. In particular, a digital signal processing algorithm is viewed as a process of information transfer with an inherent information transfer rate requirement of R bits/sec. Different architectures implementing a given algorithm are equivalent to different communication networks each with a certain capacity C (also in bits/sec). The absolute lower bound on the power dissipation for any given architecture is then obtained by minimizing the signal power such that its channel capacity C is equal to the desired information transfer rate R. The proposed framework is employed to determine the lower-bounds for simple digital filters. Furthermore, lower bounds on the power dissipation achievable via adiabatic logic is also presented thus demonstrating the versatility of the proposed approach.

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

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

M3 - Paper

AN - SCOPUS:0030383439

SP - 43

EP - 48

ER -