On the complex residue arithmetic system (CRNS)

Recently, a number of papers has been published on the subject of performing complex arithmetic in the residue number system. Methods have been proposed which reduce the arithmetic complexity of a complex multiply by more than 50 percent. In this correspondence it is shown that these methods achieve Winograd´s lower bound, and how these efficient mappings can be derived in terms of polynomial rings.