Serial arithmetic uses less hardware than parallel arithmetic. Serial floating point (FP) is slower than parallel FP. The Logarithmic Number System (LNS) simplifies operations, but a fast serial implementation of LNS has never been proposed previously. This paper presents a fast bitserial LNS that combines a novel serial implementation of Mitchell’s method and a new error correction method that is compatible with least-significant-bit-first serial arithmetic.
Mark G. Arnold, Panagiotis D. Vouzis