#### Filter Results:

- Full text PDF available (10)

#### Publication Year

1991

2007

- This year (0)
- Last 5 years (0)
- Last 10 years (1)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Liang-Fang Chao, Andrea S. LaPaugh, Edwin Hsing-Mean Sha
- 30th ACM/IEEE Design Automation Conference
- 1993

We consider the resource-constrained scheduling of loops with inter-iteration dependencies. A loop is modeled as a data flow graph (DFG), where edges are labeled with the number of iterations between dependencies. We design a novel and flexible technique, called rotation scheduling, for scheduling cyclic DFGs using loop pipelining. The rotation technique… (More)

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- VLSI Signal Processing
- 1995

Given a behavioral description of a DSP algorithm represented by a data-flow graph, we show how to obtain a rate-optimal static schedule with the minimum unfolding factor under two models, integral grid model and fractional grid model, and two kinds of implementations for each model, pipelined implementation and nonpipelined implementation. We present a… (More)

- Jayesh Siddhiwala, Liang-Fang Chao
- Great Lakes Symposium on VLSI
- 1995

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- IEEE Trans. Parallel Distrib. Syst.
- 1997

Loop scheduling is an important problem in parallel processing. The retiming technique reorganizes an iteration; the unfolding technique schedules several iterations together. We combine these two techniques to obtain a static schedule with a reduced average computation time per iteration. We first prove that the order of retiming and unfolding is… (More)

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- Great Lakes Symposium on VLSI
- 1993

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- ICPP
- 1992

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- IPPS
- 1993

Eficient scheduling of nested loops is an important problem in highly parallel systems. Most of previous research has been on the transformations of iteration space instead of the loop body. We introduce a methodology to transform a loop body into a new one with a better schedule. We model nested loops as niulti-dimensional data-flow graphs, and give a… (More)

This paper presents a novel optimization technique for the design of application specific integrated circuits dedicated to perform iterative or recursive time-critical sections of multi-dimensional problems, such as image processing applications. These sections are modeled as cyclic multi-dimensional data flow graphs (MDFGs). This new technique, called… (More)

- Prasoon Surti, Liang-Fang Chao, Akhilesh Tyagi
- ED&TC
- 1997

This paper presents a novel approach to synthesize low power FSMs using non-uniform code length. Switching activity is reduced by decreasing the expected number of state bits switched less than [log |S|] The state set S of the FSM is decomposed into two sets based on the limit state probabilities. The state set with very high probability is encoded with… (More)

- Liang-Fang Chao, Edwin Hsing-Mean Sha
- 1993 International Conference on Parallel…
- 1993

Given a behavioral description of an algorithm represented by a data-flow graph, we show how to obtain a rote-optimal static schedule with the minimum unfolding factor under two timing models, integral grid model and fractional grid model, and two design styles for each model, pipelined design and non-piplined design. We present a simple and unified… (More)