Optical Computing Systems And Interconnection Networks With 2D Data Format

As an interesting and significant research domain, reversible logic is massively utilized in technologies, including optical computing, cryptography, quantum computing, nanotechnology, and so on. The realization of quantum computing is not possible without the implementation of reversible logic, and reversible designs are presented mainly to minimize the thermal loss because of the data input bits lost in the irreversible circuit. Digital converters, as the most important logic circuits, are used to connect computing systems with different binary codes. This paper first proposes a new reversible gate called Reversible Noorallahzadeh[Formula: see text]Mosleh Gate (RNMG). Then, using the proposed RNMG gate as well as existing NMG1, NMG6, and PG gates, three different designs of reversible Binary-Coded Decimal (BCD) to EX-3 code converter are proposed. Our results indicate that the proposed BCD to EX-3 code converters are superior to previous designs in terms of quantum cost. Moreover, the proposed converters are comparable or better than previous designs in terms of gate count, constant inputs, and garbage outputs.

Download Full-text

CONSTRUCTING MULTIPLE INDEPENDENT SPANNING TREES ON RECURSIVE CIRCULANT GRAPHS G(2m, 2)

International Journal of Foundations of Computer Science ◽

10.1142/s0129054110007143 ◽

2010 ◽

Vol 21 (01) ◽

pp. 73-90 ◽

Cited By ~ 14

Author(s):

JINN-SHYONG YANG ◽

JOU-MING CHANG ◽

SHYUE-MING TANG ◽

YUE-LI WANG

Keyword(s):

Interconnection Networks ◽

Spanning Trees ◽

Fault Tolerant ◽

Network Communication ◽

Circulant Graph ◽

Circulant Graphs ◽

Recursive Structure ◽

Computing Systems ◽

Independent Spanning Trees ◽

Optimal Construction

A recursive circulant graph G(N,d) has N = cdm vertices labeled from 0 to N - 1, where d ⩾ 2, m ⩾ 1, and 1 ⩽ c < d, and two vertices x,y ∈ G(N,d) are adjacent if and only if there is an integer k with 0 ⩽ k ⩽ ⌈ log d N⌉ - 1 such that x ± dk ≡ y ( mod N). With the aid of recursive structure, such class of graphs has many attractive features and was considered as a topology of interconnection networks for computing systems. The design of multiple independent spanning trees (ISTs) has many applications in network communication. For instance, it is useful for fault-tolerant broadcasting and secure message distribution. In the previous work of Yang et al. (2009), we provided a constructing scheme to build k ISTs on G(cdm,d) with d ⩾ 3, where k is the connectivity of G(cdm,d). However, the proposed constructing rules cannot be applied to the case of d = 2. For the integrity of solving the IST problem on recursive circulant graphs, this paper deals with the case of G(2m,2) using a set of different constructing rules. Especially, we show that the heights of ISTs for G(2m,2) are lower than the known optimal construction of hypercubes with the same number of vertices.

Download Full-text