Browse > Article
http://dx.doi.org/10.6109/jkiice.2014.18.10.2375

Compressive Sensing of the FIR Filter Coefficients for Multiplierless Implementation  

Kim, Seehyun (Department of Information and Communications Engineering, The University of Suwon)
Publication Information
Journal of the Korea Institute of Information and Communication Engineering / v.18, no.10, 2014 , pp. 2375-2381 More about this Journal
Abstract
In case the coefficient set of an FIR filter is represented in the canonic signed digit (CSD) format with a few nonzero digits, it is possible to implement high data rate digital filters with low hardware cost. Designing an FIR filter with CSD format coefficients, whose number of nonzero signed digits is minimal, is equivalent to finding sparse nonzero signed digits in the coefficient set of the filter which satisfies the target frequency response with minimal maximum error. In this paper, a compressive sensing based CSD coefficient FIR filter design algorithm is proposed for multiplierless and high speed implementation. Design examples show that multiplierless FIR filters can be designed using less than two additions per tap on average with approximate frequency response to the target, which are suitable for high speed filtering applications.
Keywords
FIR filter design; canonic signed digit; compressive sensing; greedy algorithm;
Citations & Related Records
연도 인용수 순위
  • Reference
1 D. Donoho, "Compressed sensing," IEEE Trans., Information Theory, vol. 52, no. 4, pp. 1289-1306, Apri, 2006.   DOI   ScienceOn
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   ScienceOn
4 E. Candes and T. Tao, "Decoding by linear programming," IEEE Trans. Information Theory, vol. 51, no. 12, pp. 4203-4215, Dec. 2005.   DOI   ScienceOn
5 S. Mallat and Z. Zhang, "Matching pursuit with timefrequency dictionalries," IEEE Trans. Signal Processing, vol. 41, no. 12, pp. 3397-3415, December, 1993.   DOI   ScienceOn
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   ScienceOn
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   ScienceOn
9 D. Wei, "Non-convex optimization for the design of sparse FIR filters," Proc. IEEE Signal Processing Workshop, Aug., 2009, pp. 117-120.
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   ScienceOn
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.
12 R. Hewlitt and E. Swartzlantler, "Canonical signed digit representation for FIR digital filters," Proc. IEEE Workshop on Signal Processing Systems, pp. 416-426, Oct., 2000.