Two-dimensional retiming with low memory requirements

Tracy C. Denk, Mayukh Majumdar, Keshab K. Parhi

Research output: Contribution to journalConference articlepeer-review

5 Scopus citations


This paper considers throughput and memory requirements in architectures which operate on two-dimensional (2D) digital signals. We present a novel technique for retiming a 2D data-flow graph to meet a given throughput constraint while keeping the memory required by the architecture low. This technique, which we call orthogonal two-dimensional retiming, is posed as two linear programming problems which can be solved in polynomial time. Our results show that, for a given throughput constraint, the orthogonal two-dimensional retiming formulation leads to architectures which require less memory than architectures designed using previously known techniques.

Original languageEnglish (US)
Pages (from-to)3330-3333
Number of pages4
JournalICASSP, IEEE International Conference on Acoustics, Speech and Signal Processing - Proceedings
StatePublished - Jan 1 1996
EventProceedings of the 1996 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP. Part 1 (of 6) - Atlanta, GA, USA
Duration: May 7 1996May 10 1996


Dive into the research topics of 'Two-dimensional retiming with low memory requirements'. Together they form a unique fingerprint.

Cite this