The NEw Distributed Arithmetic (NEDA) completes multiply/accumulate by an adder only and achieves excellent performance in terms of area and power by pairwise matching to reduce the computational redundancy in the coefficient matrix. In this paper, an optimal algorithm for grouping in NEDA is introduced, which is effective in eliminating the redundancy in the coefficient matrix. By finding the matched ports, the proposed algorithm makes an effective hierarchy table with the times of the ports usage. The experimental data shows that the algorithm exploits the NEDA coefficient redundancy of DCT and FFT quickly and effectively, which makes it useful for the hardware design of DSP, insofar it improves the correlative hardware design efficiency.
References in zbMATH (referenced in 2 articles , 1 standard article )
Showing results 1 to 2 of 2.
- Jia, Lei; Xie, Tinggui; Liu, Zhenyu: An optimal algorithm for grouping in NEDA (2007)
- Shams, A.M.; Chidanandan, A.; Pan, W.; Bayoumi, M.A.: NEDA: a low-power high-performance DCT architecture (2006)