The week's pick
Reseach Article
Enhancing Driving Direction Time based on speed fluctuation and Vehicle Type Identification
| International Conference on Innovations in Information, Embedded and Communication Systems |
| Foundation of Computer Science USA |
| ICIIECS - Number 2 |
| November 2014 |
| Authors: T Vijayakumar, C.palanisami, T Sripriya |
| c20d87ff-9141-423a-90fc-4d2f2a5ed380 |
T Vijayakumar, C.palanisami, T Sripriya . Enhancing Driving Direction Time based on speed fluctuation and Vehicle Type Identification. International Conference on Innovations in Information, Embedded and Communication Systems. ICIIECS, 2 (November 2014), 6-10.
Abstract
Efficient algorithms and architectures are existing for the design of low-complexity bit-parallel multiple constant multiplication (MCM). This operation dominates the complexity of many digital signals processing system. Alternative to this, digit-serial MCM design is available with less complexity. But it is not as much popular as the former one. In this paper, the gate –level area and power of digit-serial MCM design is tried to optimize. So initially from the basic parallel designs, like shift –adds implementation, the common sub-expression elimination and graph-based method are used. From this the efficient one is selected, that is the GB technique and is applied to digit-serial design. Then the newly designed MCM block will be placed to the multiplier block of an FIR filter. Thus comparing to bit-parallel FIR filter design, digit-serial design has 41% of power reduction and 40. 5% of area reduction and are independent of data word-length.
References
- L. Wanhammar, DSP Integrated Circuits. New York: Academic, 1999.
- C. Wallace, "A suggestion for a fast multiplier," IEEE Trans. Electron. Comput. , vol. 13, no. 1, pp. 14–17, Feb. 1964.
- W. Gallagher and E. Swartzlander, "High radix booth multipliers using reduced area adder trees," in Proc. Asilomar Conf. Signals, Syst. Comput. , vol. 1. Pacific Grove, CA, Oct. –Nov. 1994, pp. 545–549.
- J. McClellan, T. Parks, and L. Rabiner, "A computer program for designing optimum FIR linear phase digital filters," IEEE Trans. Audio Electroacoust. , vol. 21, no. 6, pp. 506–526, Dec. 1973.
- M. Ercegovac and T. Lang, Digital Arithmetic. San Mateo, CA: Morgan Kaufmann, 2003.
- R. Hartley, "Subexpression sharing in filters using canonic signed digit multipliers," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 43, no. 10, pp. 677–688, Oct. 1996.
- L. Aksoy, E. Costa, P. Flores, and J. Monteiro, "Exact and approximate algorithms for the optimization of area and delay in multiple constant multiplications," IEEE Trans. Comput. -Aided Design Integr. Circuits Syst. , vol. 27, no. 6, pp. 1013–1026, Jun. 2008.
- Dempster and M. Macleod, "Use of minimum-adder multiplier blocks in FIR digital filters," IEEE Trans. Circuits Syst. II, Exp. Briefs, vol. 42, no. 9, pp. 569–577, Sep. 1995.
- Y. Voronenko and M. Püschel, "Multiplierless multiple constant multiplication," ACM Trans. Algor. , vol. 3, no. 2, pp. 1–39, May 2007.
- I. -C. Park and H. -J. Kang, "Digital filter synthesis based on minimal signed digit representation," in Proc. DAC, 2001, pp. 468–473.
- Avizienis, "Signed-digit number representations for fast parallel arithmetic," IRE Trans. Electron. Comput. , vol. 10, no. 3, pp. 389–400, Sep. 1961.
- P. Flores, J. Monteiro, and E. Costa, "An exact algorithm for the maximal sharing of partial terms in multiple constant multiplications," in Proc. Int. Conf. Comput. -Aided Design, Nov. 2005, pp. 13–16.
- O. Gustafsson and L. Wanhammar, "ILP modelling of the common subexpression sharing problem," in Proc. ICECS, 2002, pp. 1171–1174.
- Y. -H. Ho, C. -U. Lei, H. -K. Kwan, and N. Wong, "Global optimization of common subexpressions for multiplierless synthesis of multiple constant multiplications," in Proc. ASPDAC, 2008, pp. 119–124.
- M. Potkonjak, M. Srivastava, and A. Chandrakasan, "Multiple constant multiplications: Efficient and versatile framework and algorithms for exploring common subexpression elimination," IEEE Trans. Comput-Aided Design Integr. Circuits Syst. , vol. 15, no. 2, pp. 151–165, Feb. 1996.
- L. Aksoy, E. Gunes, and P. Flores, "Search algorithms for the multiple constant multiplications problem: Exact and approximate," J. Micro-process. Microsyst. , vol. 34, no. 5, pp. 151–162, Aug. 2010.
- `Dempster and M. Macleod, "Constant integer multiplication using minimum adders," IEE Proc. -Circuits, Devices, Syst. , vol. 141, no. 5, pp. 407–413, Oct. 1994.
- L. Aksoy, C. Lazzari, E. Costa, P. Flores, J. Monteiro, "Design of Digit-Serial FIR Filters: Algorithms, Architectures, and a CAD Tool," IEEE Trans. VLSI Syst, vol. 21, no. 3, Mar 2013.
Index Terms
Keywords