Methodology for the design of signed-digit DSP processors

V. Paliouras, D. Soudris, T. Stouraitis

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

3 Scopus citations

Abstract

A generalized systematic graph-based methodology for designing novel architectures based on Signed-Digit representation, is introduced. The proposed methodology starts from the algorithmic level and ends up with the implementation at the digit level. Taking into account the target architecture, the dependence graph of the algorithm is described by a set of Uniform Recurrent Equations. Depending on the target architecture, regular or tree array architectures are derived, which demonstrate low latency and high throughput rates. Several designs are presented, that exhibit regularity, modularity, and local interconnections, being amenable for VLSI implementation. The introduced methodology is demonstrated by the design of an array multiplier.

Original languageBritish English
Title of host publicationProceedings - IEEE International Symposium on Circuits and Systems
Pages1833-1836
Number of pages4
StatePublished - 1993
EventProceedings of the 1993 IEEE International Symposium on Circuits and Systems - Chicago, IL, USA
Duration: 3 May 19936 May 1993

Publication series

NameProceedings - IEEE International Symposium on Circuits and Systems
Volume3
ISSN (Print)0271-4310

Conference

ConferenceProceedings of the 1993 IEEE International Symposium on Circuits and Systems
CityChicago, IL, USA
Period3/05/936/05/93

Fingerprint

Dive into the research topics of 'Methodology for the design of signed-digit DSP processors'. Together they form a unique fingerprint.

Cite this