EQUIVALENCE OF FRACTIONAL FACTORIAL DESIGNS

Two designs for a fractional factorial experiment are equivalent if one can be obtained from the other by reordering the treatment combinations, relabeling the factors and relabeling the factor levels. Designs can be viewed as sets of points in p- dimensional space, where p is the number of factors. It is shown that, in this setting, two designs are equivalent if the Hamming distances between the points are the same in all possible dimensions. An algorithm is given, based on this representation, that can detect distinct designs for 2 p experiments without a complete search of all reorderings and relabelings in the fraction. In addition, if two designs are equivalent, the algorithm gives a set of permutations which map one design to the other.

[1]  W. Welch.  Branch-and-Bound Search for Experimental Designs Based on D Optimality and Other Criteria , 1982 .

[2]  Jiahua Chen,et al.  Some Results on $2^{n - k}$ Fractional Factorial Designs and Search for Minimum Aberration Designs , 1992 .

[3]  R. Plackett,et al.  THE DESIGN OF OPTIMUM MULTIFACTORIAL EXPERIMENTS , 1946 .

[4]  Angela M. Dean,et al.  Saturated main-effect designs for factorial experiments , 1999, Stat. Comput..

[5]  W. G. Hunter,et al.  Minimum Aberration 2k-p Designs , 1980 .

[6]  S. Lewis.  Generators for asymmetrical factorial experiments , 1982 .

[7]  J. H. E. Cohn.  On the Number of D-Optimal Designs , 1994, J. Comb. Theory, Ser. A.

[8]  R. H. Hardin,et al.  A new approach to the construction of optimal designs , 1993 .

[9]  K. Vijayan,et al.  Some Risks in the Construction and Analysis of Supersaturated Designs , 1999, Technometrics.

[10]  Nam-Ky Nguyen.  An algorithmic approach to constructing supersaturated designs , 1996 .

[11]  Toby J. Mitchell,et al.  Computer Construction of “D-Optimal” First-Order Designs , 1974 .

[12]  J. C. Wang,et al.  Nearly orthogonal arrays with mixed levels and small runs , 1992 .

[13]  W. Näther.  Optimum experimental designs , 1994 .

[14]  Norman R. Draper,et al.  Construction of the Set of 256-Run Designs of Resolution $\geqq 5$ and the Set of Even 512-Run Designs of Resolution $\geqq 6$ with Special Reference to the Unique Saturated Designs , 1968 .

[15]  R. A. Bailey.  Patterns of confounding in factorial designs , 1977 .

[16]  Dennis K. J. Lin.  Another Look at First-Order Saturated Designs: The p-efficient Designs , 1993 .

[17]  W. G. Hunter,et al.  Minimum Aberration 2 k–p Designs , 1980 .