Distributed arithmetic (DA)-based computation is well known for efficient memory-based implementation of Finite impulse response (FIR) filter where the filter outputs are computed as inner-product of input-sample vectors and filter-coefficient vector. In this paper, we show that the LUT multiplier based approach in which the memory elements store all the possible values of product of filter coefficient will be the efficient in terms of area with the same throughput in comparison of DA. We present two new approaches to LUT-based multiplication, which could be used to reduce the memory size to half of the conventional LUT-based multiplication. The proposed method in this paper have half memory required than the existing DA method .The DA and the proposed LUT method are simulated and synthesized using the Xilinx tool and the memory required by the proposed LUT is nearly 50% lesser than the DA.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
hi@scite.ai
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.