
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
S. Lennart Johnsson, ChingTien Ho, "On the Conversion Between Binary Code and BinaryReflected Gray Code on Binary Cubes," IEEE Transactions on Computers, vol. 44, no. 1, pp. 4753, January, 1995.  
BibTex  x  
@article{ 10.1109/12.368010, author = {S. Lennart Johnsson and ChingTien Ho}, title = {On the Conversion Between Binary Code and BinaryReflected Gray Code on Binary Cubes}, journal ={IEEE Transactions on Computers}, volume = {44}, number = {1}, issn = {00189340}, year = {1995}, pages = {4753}, doi = {http://doi.ieeecomputersociety.org/10.1109/12.368010}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Computers TI  On the Conversion Between Binary Code and BinaryReflected Gray Code on Binary Cubes IS  1 SN  00189340 SP47 EP53 EPD  4753 A1  S. Lennart Johnsson, A1  ChingTien Ho, PY  1995 KW  Graytobinary conversion KW  binary code encoding KW  Gray code encoding KW  hypercubes KW  permutation KW  routing algorithm KW  communication algorithm KW  allport communication. VL  44 JA  IEEE Transactions on Computers ER   
We present a new algorithm for conversion between binary code and binaryreflected Gray code that requires approximately $\backslash scriptstyle\{2K\; \backslash over\; 3\}$ element transfers in sequence for
[1] J. C. Cooley and J. W. Tukey,“An algorithm for the machine computation of complex fourier series,”Math. Computat., vol. 19, pp. 291–301, 1965.
[2] High Performance Fortran Forum. High performance fortran; language specification, version 1.0.,Scientific Programming, vol. 2, no. 1–2, pp. 1–170, 1993.
[3] I. Havel and J. Mravek,“Bvaluations of graphs,”Czech. Math. J., vol. 22, pp. 338–351, 1972.
[4] W.D. Hillis, The Connection Machine.Cambridge, Mass.: The MIT Press, 1985.
[5] C.T. Ho and S.L. Johnsson, “Embedding Meshes in Boolean Cubes by Graph Decomposition,” J. Parallel and Distributed Computing, vol. 8, pp. 325339, 1990.
[6] S.L. Johnsson, "Communication Efficient Basic Linear Algebra Computations on Hypercube Architectures," J. Parallel and Distributed Computing, vol. 4, pp. 133172, 1987.
[7] S. Lennart Johnsson and C.T. Ho,“The complexity of reshaping arrays on Boolean cubes,”inFifth Distrib. Memory Computing Conf., IEEE Comput. Soc., Apr. 1990, pp. 370–377.
[8] E. M. Reingold, J. Nievergelt, and N. Deo,Combinatorial Algorithms. Englewood Cliffs, NJ: PrenticeHall, 1977.
[9] Thinking Machines Corp., CM200 Technical Summary, 1991.