Showing papers on "Residue number system published in 1972"
TL;DR: It is shown that relatively simple combinational logic can be used to replace one level of residue addition in translation problems in residue number systems, and the efficiency of the algorithm is studied.
Abstract: This paper considers translation problems in residue number systems. The conversion from a fixed-base representation to a residue representation can be done using residue adders only; we show that relatively simple combinational logic can be used to replace one level of residue addition. In the reverse translation problem, we examine the conditions under which base extension can be used to compute the fixed-base digits from a residue code number, and we study the efficiency of the algorithm.
17 citations
TL;DR: It is shown that the modular arithmetic weight of an integer is invariant to the cyclic shifts of its radix-2 form, which leads to a reduced search for the minimum weight codeword in a cyclic AN-code as well as to a better understanding of previous work.
Abstract: This note shows that the modular arithmetic weight of an integer is invariant to the cyclic shifts of its radix-2 form. This result leads to a reduced search for the minimum weight codeword in a cyclic AN-code as well as to a better understanding of previous work.