Constructing Tables of Minimum Aberration P^n–m Designs

Abstract

Fries and Hunter (1980) presented a practical algorithm for selecting standard 2 ^n–m fractional factorial designs based on a criterion they called “minimum aberration.” In this article some simple results are presented that enable the Fries–Hunter algorithm to be used for a wider range of n and m and for designs with factors at p levels where p ≥ 2 is prime. Examples of minimum aberration 2 ^n–m designs with resolution R ≥ 4 are given for m, n – m < 9. A matrix is given for generating 3 ^n–m designs with m, n – m ≤ 6, which have, or nearly have, minimum aberration.

KEY WORDS:

• Confounding
• Factorial experiments
• Fractional replication
• Minimum aberration
• Moments
• Tables