Efficient retiming and unfolding

Liang Fang Chao; Edwin Hsing Mean Sha

Efficient retiming and unfolding

Liang Fang Chao^*
, Edwin Hsing Mean Sha

^*Corresponding author for this work

Princeton University

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

2 Scopus citations

Abstract

Data-flow graphs (DFG) can be used to represent a signal-flow graph, a synchronous system or a digital circuitry. Retiming and unfolding are two useful techniques which have been effectively applied to optimize the realization of DFGs. Retiming technique reorganizes an iteration; unfolding technique schedules several iterations together. These two techniques can be combined to schedule DFGs optimally. We show a very efficient algorithm to combine these two techniques. We also present simple methods for examining an unfolded graph by simulating it on the original DFG.

Original language	English
Title of host publication	Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks
Publisher	Publ by IEEE
Pages	I-421-I-424
ISBN (Print)	0780309464
State	Published - 1993
Externally published	Yes
Event	1993 IEEE International Conference on Acoustics, Speech and Signal Processing - Minneapolis, MN, USA Duration: 27 Apr 1993 → 30 Apr 1993

Publication series

Name	Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing
Volume	1
ISSN (Print)	0736-7791

Conference

Conference	1993 IEEE International Conference on Acoustics, Speech and Signal Processing
City	Minneapolis, MN, USA
Period	27/04/93 → 30/04/93

Cite this

@inproceedings{fa54e6e469e241d888dd3536b33b85d9,

title = "Efficient retiming and unfolding",

abstract = "Data-flow graphs (DFG) can be used to represent a signal-flow graph, a synchronous system or a digital circuitry. Retiming and unfolding are two useful techniques which have been effectively applied to optimize the realization of DFGs. Retiming technique reorganizes an iteration; unfolding technique schedules several iterations together. These two techniques can be combined to schedule DFGs optimally. We show a very efficient algorithm to combine these two techniques. We also present simple methods for examining an unfolded graph by simulating it on the original DFG.",

author = "Chao, \{Liang Fang\} and Sha, \{Edwin Hsing Mean\}",

year = "1993",

language = "英语",

isbn = "0780309464",

series = "Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing",

publisher = "Publ by IEEE",

pages = "I--421--I--424",

booktitle = "Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks",

note = "1993 IEEE International Conference on Acoustics, Speech and Signal Processing ; Conference date: 27-04-1993 Through 30-04-1993",

}

Chao, LF & Sha, EHM 1993, Efficient retiming and unfolding. in Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks. Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing, vol. 1, Publ by IEEE, pp. I-421-I-424, 1993 IEEE International Conference on Acoustics, Speech and Signal Processing, Minneapolis, MN, USA, 27/04/93.

Efficient retiming and unfolding. / Chao, Liang Fang; Sha, Edwin Hsing Mean.
Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks. Publ by IEEE, 1993. p. I-421-I-424 (Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing; Vol. 1).

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › peer-review

TY - GEN

T1 - Efficient retiming and unfolding

AU - Chao, Liang Fang

AU - Sha, Edwin Hsing Mean

PY - 1993

Y1 - 1993

N2 - Data-flow graphs (DFG) can be used to represent a signal-flow graph, a synchronous system or a digital circuitry. Retiming and unfolding are two useful techniques which have been effectively applied to optimize the realization of DFGs. Retiming technique reorganizes an iteration; unfolding technique schedules several iterations together. These two techniques can be combined to schedule DFGs optimally. We show a very efficient algorithm to combine these two techniques. We also present simple methods for examining an unfolded graph by simulating it on the original DFG.

AB - Data-flow graphs (DFG) can be used to represent a signal-flow graph, a synchronous system or a digital circuitry. Retiming and unfolding are two useful techniques which have been effectively applied to optimize the realization of DFGs. Retiming technique reorganizes an iteration; unfolding technique schedules several iterations together. These two techniques can be combined to schedule DFGs optimally. We show a very efficient algorithm to combine these two techniques. We also present simple methods for examining an unfolded graph by simulating it on the original DFG.

UR - https://www.scopus.com/pages/publications/11744273833

M3 - 会议稿件

AN - SCOPUS:11744273833

SN - 0780309464

T3 - Proceedings - ICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing

SP - I-421-I-424

BT - Plenary, Special, Audio, Underwater Acoustics, VLSI, Neural Networks

PB - Publ by IEEE

T2 - 1993 IEEE International Conference on Acoustics, Speech and Signal Processing

Y2 - 27 April 1993 through 30 April 1993

ER -

Efficient retiming and unfolding

Abstract

Publication series

Conference

Other files and links

Fingerprint

Cite this