Synthesis of Control Circuits in Folded Pipelined DSP Architectures

Keshab K Parhi, Ching Yi Wang, Andrew P. Brown

Research output: Contribution to journalArticle

109 Citations (Scopus)

Abstract

This paper presents a systematic folding transformation technique to fold any arbitrary signal processing algorithm data-flow graph to a hardware data-flow architecture, for a specified folding set and specified technology constraints. The folding set specifies the processor in which and the time partition at which the task is executed. The folding set is typically obtained by performing scheduling and resource allocation for the algorithm data-flow graph and the specified iteration period. The technology constraints imposed on the hardware architecture (i.e., the level of pipelining and the implementation style of each processor) are also assumed to be known. The folding technique is used to derive the control circuitry of the hardware architecture (including registers, switches, and interconnections). We derive conditions for the validity of a specified folding set, and present approaches to generate the dedicated architecture using systematic folding of tasks to operators. We propose automatic retiming and pipelining of algorithms described by data-flow graphs for folding. The folding algorithm is applied after preprocessing the data-flow graph (DFG) for automated pipelining and retiming. Our folding algorithm can accommodate single or multiple implementation styles and single or multiple computation clocks, and applies to folding of regular and irregular data-flow graphs.

Original languageEnglish (US)
Pages (from-to)29-43
Number of pages15
JournalIEEE Journal of Solid-State Circuits
Volume27
Issue number1
DOIs
StatePublished - Jan 1 1992

Fingerprint

Data flow graphs
Networks (circuits)
Hardware
Resource allocation
Clocks
Signal processing
Scheduling
Switches

Cite this

Synthesis of Control Circuits in Folded Pipelined DSP Architectures. / Parhi, Keshab K; Wang, Ching Yi; Brown, Andrew P.

In: IEEE Journal of Solid-State Circuits, Vol. 27, No. 1, 01.01.1992, p. 29-43.

Research output: Contribution to journalArticle

Parhi, Keshab K ; Wang, Ching Yi ; Brown, Andrew P. / Synthesis of Control Circuits in Folded Pipelined DSP Architectures. In: IEEE Journal of Solid-State Circuits. 1992 ; Vol. 27, No. 1. pp. 29-43.
@article{98913785fcb449bd88c50a4d1ee66b38,
title = "Synthesis of Control Circuits in Folded Pipelined DSP Architectures",
abstract = "This paper presents a systematic folding transformation technique to fold any arbitrary signal processing algorithm data-flow graph to a hardware data-flow architecture, for a specified folding set and specified technology constraints. The folding set specifies the processor in which and the time partition at which the task is executed. The folding set is typically obtained by performing scheduling and resource allocation for the algorithm data-flow graph and the specified iteration period. The technology constraints imposed on the hardware architecture (i.e., the level of pipelining and the implementation style of each processor) are also assumed to be known. The folding technique is used to derive the control circuitry of the hardware architecture (including registers, switches, and interconnections). We derive conditions for the validity of a specified folding set, and present approaches to generate the dedicated architecture using systematic folding of tasks to operators. We propose automatic retiming and pipelining of algorithms described by data-flow graphs for folding. The folding algorithm is applied after preprocessing the data-flow graph (DFG) for automated pipelining and retiming. Our folding algorithm can accommodate single or multiple implementation styles and single or multiple computation clocks, and applies to folding of regular and irregular data-flow graphs.",
author = "Parhi, {Keshab K} and Wang, {Ching Yi} and Brown, {Andrew P.}",
year = "1992",
month = "1",
day = "1",
doi = "10.1109/4.109555",
language = "English (US)",
volume = "27",
pages = "29--43",
journal = "IEEE Journal of Solid-State Circuits",
issn = "0018-9200",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
number = "1",

}

TY - JOUR

T1 - Synthesis of Control Circuits in Folded Pipelined DSP Architectures

AU - Parhi, Keshab K

AU - Wang, Ching Yi

AU - Brown, Andrew P.

PY - 1992/1/1

Y1 - 1992/1/1

N2 - This paper presents a systematic folding transformation technique to fold any arbitrary signal processing algorithm data-flow graph to a hardware data-flow architecture, for a specified folding set and specified technology constraints. The folding set specifies the processor in which and the time partition at which the task is executed. The folding set is typically obtained by performing scheduling and resource allocation for the algorithm data-flow graph and the specified iteration period. The technology constraints imposed on the hardware architecture (i.e., the level of pipelining and the implementation style of each processor) are also assumed to be known. The folding technique is used to derive the control circuitry of the hardware architecture (including registers, switches, and interconnections). We derive conditions for the validity of a specified folding set, and present approaches to generate the dedicated architecture using systematic folding of tasks to operators. We propose automatic retiming and pipelining of algorithms described by data-flow graphs for folding. The folding algorithm is applied after preprocessing the data-flow graph (DFG) for automated pipelining and retiming. Our folding algorithm can accommodate single or multiple implementation styles and single or multiple computation clocks, and applies to folding of regular and irregular data-flow graphs.

AB - This paper presents a systematic folding transformation technique to fold any arbitrary signal processing algorithm data-flow graph to a hardware data-flow architecture, for a specified folding set and specified technology constraints. The folding set specifies the processor in which and the time partition at which the task is executed. The folding set is typically obtained by performing scheduling and resource allocation for the algorithm data-flow graph and the specified iteration period. The technology constraints imposed on the hardware architecture (i.e., the level of pipelining and the implementation style of each processor) are also assumed to be known. The folding technique is used to derive the control circuitry of the hardware architecture (including registers, switches, and interconnections). We derive conditions for the validity of a specified folding set, and present approaches to generate the dedicated architecture using systematic folding of tasks to operators. We propose automatic retiming and pipelining of algorithms described by data-flow graphs for folding. The folding algorithm is applied after preprocessing the data-flow graph (DFG) for automated pipelining and retiming. Our folding algorithm can accommodate single or multiple implementation styles and single or multiple computation clocks, and applies to folding of regular and irregular data-flow graphs.

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

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

U2 - 10.1109/4.109555

DO - 10.1109/4.109555

M3 - Article

VL - 27

SP - 29

EP - 43

JO - IEEE Journal of Solid-State Circuits

JF - IEEE Journal of Solid-State Circuits

SN - 0018-9200

IS - 1

ER -