Power comparison of flow-graph and distributed arithmetic based DCT architectures

Martin Kuhlmann, Keshab K Parhi

Research output: Contribution to journalArticle

13 Citations (Scopus)

Abstract

The Discrete Cosine Transform (DCT) is widely used in image and video compression systems. Two popular approaches to implementation of DCT algorithms include use of distributed arithmetic and flow-graphs based on fast algorithms. The Distributed arithmetic architectures (DAA) have been widely used in many system implementations, due to their low latency and area requirements. However, no systematic study of power, area and latency tradeoffs of the DAA and the FGA have been studied. This paper presents a systematic study of area, latency and power consumption of these two alternate architectures. It is concluded that the flow-graph architecture consumes about 39% less power compared to the distributed arithmetic architecture, at the expenses of 28% more area and a 3.75 times increase in latency. Alternatively, by reducing the level of pipelining in the flowgraph architecture the implementation consumes 13% less power, at the expenses of 20% more area and a tow times increase in latency. These results have been obtained by estimating the power consumption on actual layouts with effects of parasitic capacitance included as opposed to estimation of power consumption on schematics.

Original languageEnglish (US)
Pages (from-to)1214-1219
Number of pages6
JournalConference Record of the Asilomar Conference on Signals, Systems and Computers
Volume2
StatePublished - Dec 1 1998

Fingerprint

Flow graphs
Discrete cosine transforms
Electric power utilization
Image compression
Schematic diagrams
Capacitance

Cite this

@article{17e2620f960f48928ded189618011f01,
title = "Power comparison of flow-graph and distributed arithmetic based DCT architectures",
abstract = "The Discrete Cosine Transform (DCT) is widely used in image and video compression systems. Two popular approaches to implementation of DCT algorithms include use of distributed arithmetic and flow-graphs based on fast algorithms. The Distributed arithmetic architectures (DAA) have been widely used in many system implementations, due to their low latency and area requirements. However, no systematic study of power, area and latency tradeoffs of the DAA and the FGA have been studied. This paper presents a systematic study of area, latency and power consumption of these two alternate architectures. It is concluded that the flow-graph architecture consumes about 39{\%} less power compared to the distributed arithmetic architecture, at the expenses of 28{\%} more area and a 3.75 times increase in latency. Alternatively, by reducing the level of pipelining in the flowgraph architecture the implementation consumes 13{\%} less power, at the expenses of 20{\%} more area and a tow times increase in latency. These results have been obtained by estimating the power consumption on actual layouts with effects of parasitic capacitance included as opposed to estimation of power consumption on schematics.",
author = "Martin Kuhlmann and Parhi, {Keshab K}",
year = "1998",
month = "12",
day = "1",
language = "English (US)",
volume = "2",
pages = "1214--1219",
journal = "Conference Record of the Asilomar Conference on Signals, Systems and Computers",
issn = "1058-6393",
publisher = "IEEE Computer Society",

}

TY - JOUR

T1 - Power comparison of flow-graph and distributed arithmetic based DCT architectures

AU - Kuhlmann, Martin

AU - Parhi, Keshab K

PY - 1998/12/1

Y1 - 1998/12/1

N2 - The Discrete Cosine Transform (DCT) is widely used in image and video compression systems. Two popular approaches to implementation of DCT algorithms include use of distributed arithmetic and flow-graphs based on fast algorithms. The Distributed arithmetic architectures (DAA) have been widely used in many system implementations, due to their low latency and area requirements. However, no systematic study of power, area and latency tradeoffs of the DAA and the FGA have been studied. This paper presents a systematic study of area, latency and power consumption of these two alternate architectures. It is concluded that the flow-graph architecture consumes about 39% less power compared to the distributed arithmetic architecture, at the expenses of 28% more area and a 3.75 times increase in latency. Alternatively, by reducing the level of pipelining in the flowgraph architecture the implementation consumes 13% less power, at the expenses of 20% more area and a tow times increase in latency. These results have been obtained by estimating the power consumption on actual layouts with effects of parasitic capacitance included as opposed to estimation of power consumption on schematics.

AB - The Discrete Cosine Transform (DCT) is widely used in image and video compression systems. Two popular approaches to implementation of DCT algorithms include use of distributed arithmetic and flow-graphs based on fast algorithms. The Distributed arithmetic architectures (DAA) have been widely used in many system implementations, due to their low latency and area requirements. However, no systematic study of power, area and latency tradeoffs of the DAA and the FGA have been studied. This paper presents a systematic study of area, latency and power consumption of these two alternate architectures. It is concluded that the flow-graph architecture consumes about 39% less power compared to the distributed arithmetic architecture, at the expenses of 28% more area and a 3.75 times increase in latency. Alternatively, by reducing the level of pipelining in the flowgraph architecture the implementation consumes 13% less power, at the expenses of 20% more area and a tow times increase in latency. These results have been obtained by estimating the power consumption on actual layouts with effects of parasitic capacitance included as opposed to estimation of power consumption on schematics.

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

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

M3 - Article

VL - 2

SP - 1214

EP - 1219

JO - Conference Record of the Asilomar Conference on Signals, Systems and Computers

JF - Conference Record of the Asilomar Conference on Signals, Systems and Computers

SN - 1058-6393

ER -