Synthesis of folded pipelined architectures for multirate DSP algorithms

Tracy C. Denk, Keshab K Parhi

Research output: Contribution to journalArticle

23 Citations (Scopus)

Abstract

In this paper we formalize a novel multirate folding transformation which is a tool used to systematically synthesize control circuits for pipelined VLSI architectures which implement multirate algorithms. Although multirate algorithms contain decimators and expanders which change the effective sample rate of a discrete-time signal, multirate folding time-multiplexes the multirate algorithm to hardware in such a manner that the resulting synchronous architecture requires only a single-clock signal. Multirate folding equations are derived and these equations are used to address two related issues. The first issue is memory requirements in folded architectures. We derive expressions for the minimum number of registers required by a folded architecture which implements a multirate algorithm. The second issue is retiming. Based on the noble identities of multirate signal processing, we derive retiming for folding constraints which indicate how a multirate data-flow graph must be retimed for a given schedule to be feasible. The techniques introduced in this paper can be used to synthesize architectures for a wide variety of digital signal processing applications which are based on multirate algorithms, such as signal analysis and coding based on subband decompositions and wavelet transforms.

Original languageEnglish (US)
Pages (from-to)595-607
Number of pages13
JournalIEEE Transactions on Very Large Scale Integration (VLSI) Systems
Volume6
Issue number4
DOIs
StatePublished - Dec 1 1998

Fingerprint

Data flow graphs
Signal analysis
Digital signal processing
Wavelet transforms
Clocks
Signal processing
Decomposition
Hardware
Data storage equipment
Networks (circuits)

Keywords

  • Data flow graphs
  • High-level synthesis
  • Parallel architectures
  • Retiming
  • Signal processing
  • Very large scale integration

Cite this

Synthesis of folded pipelined architectures for multirate DSP algorithms. / Denk, Tracy C.; Parhi, Keshab K.

In: IEEE Transactions on Very Large Scale Integration (VLSI) Systems, Vol. 6, No. 4, 01.12.1998, p. 595-607.

Research output: Contribution to journalArticle

@article{1dc13f25e48d4ab6b74bd9de795205f0,
title = "Synthesis of folded pipelined architectures for multirate DSP algorithms",
abstract = "In this paper we formalize a novel multirate folding transformation which is a tool used to systematically synthesize control circuits for pipelined VLSI architectures which implement multirate algorithms. Although multirate algorithms contain decimators and expanders which change the effective sample rate of a discrete-time signal, multirate folding time-multiplexes the multirate algorithm to hardware in such a manner that the resulting synchronous architecture requires only a single-clock signal. Multirate folding equations are derived and these equations are used to address two related issues. The first issue is memory requirements in folded architectures. We derive expressions for the minimum number of registers required by a folded architecture which implements a multirate algorithm. The second issue is retiming. Based on the noble identities of multirate signal processing, we derive retiming for folding constraints which indicate how a multirate data-flow graph must be retimed for a given schedule to be feasible. The techniques introduced in this paper can be used to synthesize architectures for a wide variety of digital signal processing applications which are based on multirate algorithms, such as signal analysis and coding based on subband decompositions and wavelet transforms.",
keywords = "Data flow graphs, High-level synthesis, Parallel architectures, Retiming, Signal processing, Very large scale integration",
author = "Denk, {Tracy C.} and Parhi, {Keshab K}",
year = "1998",
month = "12",
day = "1",
doi = "10.1109/92.736133",
language = "English (US)",
volume = "6",
pages = "595--607",
journal = "IEEE Transactions on Very Large Scale Integration (VLSI) Systems",
issn = "1063-8210",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "4",

}

TY - JOUR

T1 - Synthesis of folded pipelined architectures for multirate DSP algorithms

AU - Denk, Tracy C.

AU - Parhi, Keshab K

PY - 1998/12/1

Y1 - 1998/12/1

N2 - In this paper we formalize a novel multirate folding transformation which is a tool used to systematically synthesize control circuits for pipelined VLSI architectures which implement multirate algorithms. Although multirate algorithms contain decimators and expanders which change the effective sample rate of a discrete-time signal, multirate folding time-multiplexes the multirate algorithm to hardware in such a manner that the resulting synchronous architecture requires only a single-clock signal. Multirate folding equations are derived and these equations are used to address two related issues. The first issue is memory requirements in folded architectures. We derive expressions for the minimum number of registers required by a folded architecture which implements a multirate algorithm. The second issue is retiming. Based on the noble identities of multirate signal processing, we derive retiming for folding constraints which indicate how a multirate data-flow graph must be retimed for a given schedule to be feasible. The techniques introduced in this paper can be used to synthesize architectures for a wide variety of digital signal processing applications which are based on multirate algorithms, such as signal analysis and coding based on subband decompositions and wavelet transforms.

AB - In this paper we formalize a novel multirate folding transformation which is a tool used to systematically synthesize control circuits for pipelined VLSI architectures which implement multirate algorithms. Although multirate algorithms contain decimators and expanders which change the effective sample rate of a discrete-time signal, multirate folding time-multiplexes the multirate algorithm to hardware in such a manner that the resulting synchronous architecture requires only a single-clock signal. Multirate folding equations are derived and these equations are used to address two related issues. The first issue is memory requirements in folded architectures. We derive expressions for the minimum number of registers required by a folded architecture which implements a multirate algorithm. The second issue is retiming. Based on the noble identities of multirate signal processing, we derive retiming for folding constraints which indicate how a multirate data-flow graph must be retimed for a given schedule to be feasible. The techniques introduced in this paper can be used to synthesize architectures for a wide variety of digital signal processing applications which are based on multirate algorithms, such as signal analysis and coding based on subband decompositions and wavelet transforms.

KW - Data flow graphs

KW - High-level synthesis

KW - Parallel architectures

KW - Retiming

KW - Signal processing

KW - Very large scale integration

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

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

U2 - 10.1109/92.736133

DO - 10.1109/92.736133

M3 - Article

VL - 6

SP - 595

EP - 607

JO - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

JF - IEEE Transactions on Very Large Scale Integration (VLSI) Systems

SN - 1063-8210

IS - 4

ER -