Abstract

Hardware realization of FIR filters that are based on residue number systems leads to increased speed and reduced power, where besides the popular Mersenne numbers, several moduli of the form ${2}^{n} \pm \delta (\delta \ge 3)$ are commonly used. However, additional weighted ${2}^{i}(i>1)$ end-around carries (EACs) slow down and complicate the required modular adders in comparison to modulo-( ${2}^{n}-1$ ) adders. For example, for $\delta =3$ , the modular sum is obtained via $A+B\mp 3{c}_{\mathrm {out}}$ , where ${A}$ and ${B}$ are modulo-( ${2}^{n}\pm 3$ ) operands and ${c}_{\mathrm {out}}$ is the carryout of binary addition $A+B$ . In this paper, a new multioperand modular adder is proposed, where the key improvement is that all the required EAC additions (e.g., $+ 3c_{\mathrm {out}}$ ) are postponed until after the last filter tap, whereby tens of addition operations take place without the EAC secondary addition; hence considerable savings of time, area consumption, and power dissipation. The proposed deferred EAC addition scheme has been applied to three previous relevant works. The corresponding synthesis results showed over 11%–32%, 27%–29%, and 21%–37%, reductions in delay, area, and power measures, respectively. This is achieved despite area and power overhead of the few appended stages into the pipelined architecture of the filter, which are nevertheless shown to become less significant as the number of filter taps grows.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call