On the Conversion between Binary Code and Binary Reflected Gray Code
1995 (English)In: I.E.E.E. transactions on computers (Print), ISSN 0018-9340, E-ISSN 1557-9956, Vol. 44, no 1, 47-53 p.Article in journal (Refereed) Published
We present a new algorithm for conversion between binary code and binary-reflected Gray code that requires ap proximately 2K/3 element transfers in sequence for K elements per node, compared to K element transfers for previously known algorithms. For a binary cube of n = 2 dimensions the new algorithm degenerates to yield a complexity of K/2 + 1 element transfers, which is optimal. The new algorithm is optimal to within a multiplicative factor of 4/3 with respect to the best known lower bound for any routing strategy. We show that the minimum number of element transfers for minimum path length routing is K with concurrent communication on all channels of every node of a binary cube.
Place, publisher, year, edition, pages
1995. Vol. 44, no 1, 47-53 p.
GRAY-TO-BINARY CONVERSION; BINARY CODE ENCODING; GRAY CODE ENCODING HYPERCUBES; PERMUTATION; ROUTING ALGORITHM; COMMUNICATION ALGORITHM; ALL-PORT COMMUNICATION
Computer and Information Science
IdentifiersURN: urn:nbn:se:kth:diva-90983OAI: oai:DiVA.org:kth-90983DiVA: diva2:507633
NR 201408052012-03-052012-03-05Bibliographically approved