Sequence triple: a finite solution space for repeated placement

Repeated placement treated in this paper is the problem to place multiple copies of a set of modules so that copies of each module appear repeatedly with a common interval L. To identify the solution space of this repeated placement problem, and to construct efficient algorithms for treating those placements, a coding system for those repeated placements of modules is proposed in this paper. It is inspired from the sequence pair proposed for one-time placement, and our scheme uses three permutations of modules (i.e., sequence triple). In compensation for one additional permutation to a sequence pair, not only intra-cycle spatial relation between modules but also inter-cycle spatial relation between modules can be represented and specified