Donald Knuth does Hacker's Delight
Dec. 12th, 2007 01:57 pm![[personal profile]](https://www.dreamwidth.org/img/silk/identity/user.png){kind=small}
fivemackI am sure there are those among my readers who can spend a happy hour with
http://www-cs-faculty.stanford.edu/~knuth/fasc1a.ps.gz
which is a write-up, in Knuth's inimitably erudite style, of most of the field of bit-twiddling. Highlights include a data structure for addressing the hyperbolic plane based on arithmetic in base minus-phi, and some very non-obvious algorithms for processors with arbitrarily wide words.
He recommends that processors should include the instruction MXOR, which views its two inputs as 8x8 matrices over GF(2) and multiplies them.
http://www-cs-faculty.stanford.edu/~knuth/fasc1a.ps.gz
which is a write-up, in Knuth's inimitably erudite style, of most of the field of bit-twiddling. Highlights include a data structure for addressing the hyperbolic plane based on arithmetic in base minus-phi, and some very non-obvious algorithms for processors with arbitrarily wide words.
He recommends that processors should include the instruction MXOR, which views its two inputs as 8x8 matrices over GF(2) and multiplies them.
