Low-complexity constant coefficient matrix multiplication using a minimum spanning tree approach
2004 (English)In: Proceedings of the 6th Nordic Signal Processing Symposium, 2004. NORSIG 2004, IEEE , 2004, 141-144 p.Conference paper (Refereed)
In this paper a novel approach for realizing constant coefficient matrix multiplication using few additions and subtractions is proposed. This method is applicable in, e.g., FIR filter banks, transforms, and polyphase form FIR filters for sample rate changes. Examples show that the proposed method yields good results compared to realizing the matrix multiplication by utilizing multiple coefficient multiplication techniques for the rows or columns separately.
Place, publisher, year, edition, pages
IEEE , 2004. 141-144 p.
National CategoryEngineering and Technology
IdentifiersURN: urn:nbn:se:liu:diva-23657Local ID: 3151ISBN: 951-22-7065-XOAI: oai:DiVA.org:liu-23657DiVA: diva2:243972
The 6th Nordic Signal Processing Symposium, 2004. NORSIG 2004, June 11, Espoo, Finland