In order to use existing algorithms for rings and linear arrays on other architectures, the embedding of cycles has been an important issue. In this paper, we propose an optimal algorithm to embed cycles of arbitrary length into incomplete hypercubes.