Area-time efficient realization of multiple constant multiplication

Multiple constant multiplication is a widely used technique in the implementation of digital signal processing algorithms. In this work, a novel RA-operation is proposed to generate potential additional fundamentals for the MCM problem. Based on the RA-operation, an algorithm is developed to optimize both critical path delay and hardware complexity of the MCM block. Simulation results show that critical path delay, area-delay product and power-delay product can be reduced significantly by using the proposed algorithm.