Aart J.C. Bik and Harry A.G. Wijshoff On strategies for generating sparse codes, Technical Report In Progress, Dept. Of Computer Science, Leiden University, 1994.

 Home/Search   Document Not in Database   Summary   Related Articles  

This paper is cited in the following contexts:
The Cache Visualisation Tool - van der Deijl, Kanbier   (Correct)

....not as easily found as described in the paper. A system of inequalities is obtained by substituting U Gamma1 (K 1 ; K 2 ) T for (L 1 ; L 2 ) T . The actual loop bounds are found by applying Fourier Hotzkin elimination [14] to this system, for implementation details, look at [13]. Also note, that the transformation is valid if and only if for each distance vector (D 1 ,D 2 ) 0 in (L 1 ,L 2 ) we have U (D 1 ; D 2 ) T 0. There are some special cases of loop transformations : ffl Outer loop reversal, when the transformation is derived from the special reversal matrix ....

Aart J.C. Bik and Harry A.G. Wijshoff On strategies for generating sparse codes, Technical Report In Progress, Dept. Of Computer Science, Leiden University, 1994.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC