This paper introduces a new variant of the popukir 'i-dimensional hypercube network Q^. known as the K-dimensional locally twisted cube LTQ,,, which has ihe same number of nodes and ihe same number of connections per node as Q,,, Kurlhcrmoro. LTQ,, is similar lo Q,, in the sense Ihat the nodes can be one-to-one labeled with i)-\ binary sequences of length n, so ihal the lalwls of any two adjacent nodes differ in at most two successive hits. One advantage of LTQ,, is that the diameter is only about half of ihe diameter ot C?n • We develop a simple routing algorithm tor LTQ,,. which creates a shoiiest path from the source to the destination in 0[n) time. We find Ihat LTy,, consists of two disjoint copies of Q,,-j by adding a matching between their nodes. On this basis, we show that LTQn has a connectivity of n.

The locally twisted cube is a newly introduced interconnection network for parallel computing. Ring embedding is an important issue for evaluating the performance of an interconnection network. In this paper, we investigate the problem of embedding rings into a locally twisted cube. Our main contribution is to find that, for each integer l E {4, 5,..., 2n}, a ring of length I can be embedded into an n-dimensional locally twisted cube so that both the dilation and the load factor are one. As a result, a locally twisted cube is Hamiltonian. We conclude that a locally twisted cube is superior to a hypercube in terms of ring embedding capability.

No abstract

The ever increasing demand for high image quality requires fast and efficient methods for noise reduction. The best known order-statistics filter is the median filter.A method is presented to calculate the median on a set of N W-bit integers in B W time steps. Blocks containing B-bit slices are used to find B-bits of the median; using a novel quantum-like representation allowing the median to be computed in an accelerated manner compared to the best known method (W time steps). The general method allows a variety of designs to be synthesised systematically. A further novel architecture to calculate the median for a moving set of N integers is also discussed. Introduction:The median filter is the most common non-linear spatial filter known for

Hypercube is one of the most popular topologies for connecting processors in multicomputer systems. In this paper we address the maximum order of a connected component in a faulty cube. The results established include several known conclusions as special cases. We conclude that the hypercube structure is resilient as it includes a large connected component in the presence of large number of faulty vertices.