Efficient realization of frequently used bijections on cube-connected cycles

CCC has lower hardware complexity than hypercube and is suited for current VLSI technology LC-permutations are a large set of important permutations frequently used in various parallel computations. Existing routing algorithms for CCC cannot realize LC-permutations without network conflict. Wepresent an algorithm to realize LC-permutations on CCC. The algorithm consists of two periods of inter-cycle transmissions and one period of inner-cycletransmissions. In the inter-cycle transmissions the dimensional links of CCCare used in a "pipeline" manner and in the innercycle transmissions the datapackets are sorted by a part of its destination address. The algorithm is fast(O(log2 N)) and no conflict will occur.