Constructing 3-level saturated and supersaturated designs using cyclic generators

- Present an algorithm for constructing 3-level saturated designs (SDs) and supersaturated designs (SSDs) using cyclic generators.
- Derive the E(s2)-lower bounds for 3-level SDs and SSDs.
- Present two scenarios where 3-level saturated designs (SDs) and supersaturated designs (SSDs) can be used.
- Provide a catalog of commonly used 3-level SDs and SSDs.

Saturated designs (SDs) and supersaturated designs (SSDs) are designs used at the primary stage of investigations when the number of factors equals or exceeds the number of runs. As many factors in science and engineering are quantitative, this paper discusses an algorithm for constructing 3-level SDs and SSDs using cyclic generators. The E(s2)-lower bound and examples illustrating the use of these designs are given.