On the Complexity of Error Detection Functions for Redundant Residue Number Systems

This paper considers a single-digit error detection in a redundant residue number system (RRNS). Let f be the function that denotes the set of legitimate codes of an RRNS. To analyze the complexity of the error detection circuit, C-measure, the maximum value of the column multiplicity for f is considered. We show that the C-measure is much smaller than the dynamic range of the RRNS. In this way, we show that f can be implemented by a small Look-up table (LUT) cascade.