Browse > Article
http://dx.doi.org/10.7471/ikeee.2015.19.3.342

Design of FIR Filters With Sparse Signed Digit Coefficients  

Kim, Seehyun (Dept. of Information and Communication Engineering, The University of Suwon)
Publication Information
Journal of IKEEE / v.19, no.3, 2015 , pp. 342-348 More about this Journal
Abstract
High speed implementation of digital filters is required in high data rate applications such as hard-wired wide band modem and high resolution video codec. Since the critical path of the digital filter is the MAC (multiplication and accumulation) circuit, the filter coefficient with sparse non-zero bits enables high speed implementation with adders of low hardware cost. Compressive sensing has been reported to be very successful in sparse representation and sparse signal recovery. In this paper a filter design method for digital FIR filters with CSD (canonic signed digit) coefficients using compressive sensing technique is proposed. The sparse non-zero signed bits are selected in the greedy fashion while pruning the mistakenly selected digits. A few design examples show that the proposed method can be utilized for designing sparse CSD coefficient digital FIR filters approximating the desired frequency response.
Keywords
FIR filter design; compressive sensing; CSD; discretization process; bit-serial implementation;
Citations & Related Records
Times Cited By KSCI : 1  (Citation Analysis)
연도 인용수 순위
1 R. Hartley, "Optimization of canonic signed digit multipliers for filter design," Proc. IEEE International Symposium on Circuits and Systems, pp. 1992-1995, Jun., 1991.
2 K. Hwang, Computer Arithmetic, Principles, Architecture, and Design, New York, Wiley, 1979.
3 E. Candes, J. Romberg, and T. Tao, " Robust uncertainty principles: Exact signal reconstruction from highly incomplete frequency information," IEEE Trans. Information Theory, vol. 52, no. 2, pp. 489-509, February, 2006.   DOI
4 D. Donoho, "Compressed sensing," IEEE Trans., Information Theory, vol. 52, no. 4, pp. 1289-1306, Apri, 2006.   DOI
5 E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Information Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.   DOI
6 J. A. Tropp, "Greed is good: algorithmic results for sparse approximation," IEEE Trans. Information Theory, vol. 50, no. 10, pp. 2231-2242, Oct. 2004.   DOI
7 D. Donoho, Y. Tsaig I. Drori, and J. Starck, "Sparse solution of underdetermined linear equations by stagewise orthogonal matching pursuit," IEEE Trans. Information Theory, vol. 58, no. 2, pp. 1094-1121, Feb. 2012.   DOI   ScienceOn
8 D. Needell and J. A. Tropp, "CoSaMP: Iterative signal recovery from incomplete and inaccurate samples," Appl. Comput. Harmon.Anal., vol 26, no. 3, pp. 301-321, May 2009   DOI
9 S. Kim, "Compressive sensing of the FIR filter coefficients for multiplierless implementation," J . Korea Institute of Information and Communication Engineering, vol. 18, no. 10, pp. 2375-2381 Oct., 2014   DOI
10 H. Samueli, "An improved search algorithm for the design of multiplierless FIR filters with powers-of-two coefficients," IEEE Trans. Circuits and Systems, vol. 36, no. 7, pp. 1044-1047, July, 1989.   DOI
11 N. Takahashi and K. Suyama, "Design of CSD coefficient FIR filters based on branch and bound method," Proc. International Symposium on Communications and Information Technologgies, Oct 2010, pp. 575-578