Implementation considerations in the Polynomial Ring Engine

Circuit implementation for the Polynomial Ring Engine (PRE) currently under development at the University of Windsor, Canada, is discussed. The engine uses a new polynomial ring mapping strategy to convert integer calculations to direct product finite rings over very small moduli. The implementation avoids problems of providing relatively prime moduli for the entire dynamic range. Linear filter and transform algorithms are computed with the inner product form, which probably accounts for the vast majority of digital signal processing functions implemented commercially. Emphasis is placed on circuit synthesis for operations over 3-b moduli that are afforded by the PRE