Techniques and a logical diagram for the implementation of the Chinese remaider theorem are described. The author claims that his version of modular arithmetic, which involves fractional representation, will be faster than, for example, a nonbinary adder-based system. Whilst his analysis is correct, the methods used in most microprocessor chips to enable decimal addition are fast and simple. Thus, careful investigation of real microelectronic hardware would be needed before the self-evident difficulties of a modular system were accepted.