Shuffle Gray Chord Enumeration
30 different orders of the algorithm: count in binary, take the gray code of the current code and shuffle the bits, repeat n times, move to next code.
"Shuffling" is here defined as a bitwise reversal of the position of every "on" bit, leading to a better separation between everything.
There is a lot of detail in the original:
2,237
views
12
faves
0
comments
Uploaded on March 25, 2010
Shuffle Gray Chord Enumeration
30 different orders of the algorithm: count in binary, take the gray code of the current code and shuffle the bits, repeat n times, move to next code.
"Shuffling" is here defined as a bitwise reversal of the position of every "on" bit, leading to a better separation between everything.
There is a lot of detail in the original:
2,237
views
12
faves
0
comments
Uploaded on March 25, 2010