The Efficient Adaptive Pre-Encoded Multipliers Based on (NR4SD) Encoding for Digital Signal Processing Applications

Guggilla.Satya Sudha, Chintha.Sri Pothu Raju

Abstract


Multimedia and Digital Signal Processing (DSP) applications (e.g., Fast Fourier Transform (FFT), audio/video CoDecs) complete countless with coefficients that don't change amid the execution of the application. Since the multiplier is an essential part to implement computationally concentrated applications, its engineering truly influences their execution. A committed encoding circuit is required and the fractional items age is more mind boggling. A strategy practically identical is proposed for sketching out compelling MB multipliers for social occasions of pre-chosen coefficients with a comparable imperative. Encode the coefficients disengaged in perspective of the MB encoding and store the MB encoded coefficients (i.e., 3 bits for each digit) into a ROM. New layouts of pre-encoded multipliers are researched by detached encoding the standard coefficients and securing them in system memory. We propose encoding these coefficients in the Non-Redundant radix-4 Signed-Digit (NR4SD) outline. The proposed pre-encoded NR4SD multiplier designs are a more area and power compelling stood out from the conventional and pre-encoded MB diagrams


References


G. W. Reitwiesner, “Binary arithmetic,” Advances in Computers,vol. 1, pp. 231–308, 1960.

K. K. Parhi, VLSI Digital Signal Processing Systems: Design andImplementation. John Wiley & Sons, 2007.

K. Yong-Eun, C. Kyung-Ju, J.-G. Chung, and X. Huang, “Csdbased programmable multiplier design for predetermined coefficient groups,” IEICE Trans. Fundam. Electron. Commun.Comput. Sci., vol. 93, no. 1, pp. 324–326, 2010.

O. Macsorley, “High-speed arithmetic in binary computers,” Proc. IRE, vol. 49, no. 1, pp. 67–91, Jan. 1961.

W.-C. Yeh and C.-W. Jen, “High-speed booth encoded parallel multiplier design,” IEEE Trans. Comput., vol. 49, no. 7, pp. 692–701, Jul. 2000.

Z. Huang, “High-level optimization techniques for low-power multiplier design,” Ph.D. dissertation, Department of Computer Science, University of California, Los Angeles, CA, 2003.

Z. Huang and M. Ercegovac, “High-performance low-power left-to-right array multiplier design,” IEEE Trans. Comput., vol. 54, no. 3, pp. 272–283, Mar. 2005.

Y.-E. Kim, K.-J. Cho, and J.-G. Chung, “Low power small area modified booth multiplier design for predetermined coefficients,” IEICE Trans. Fundam. Electron. Commun. Comput. Sci., vol. E90-A, no. 3, pp. 694–697, Mar. 2007.

C. Wang, W.-S. Gan, C. C. Jong, and J. Luo, “A low-cost 256-point fft processor for portable speech and audio applications,” in Int. Symp. on Integrated Circuits (ISIC 2007), Sep.2007, pp. 81–84.

A. Jacobson, D. Truong, and B. Baas, “The design of a reconfigurable continuous-flow mixed-radix fft processor,” in IEEEInt. Symp. on Circuits and Syst. (ISCAS 2009), May 2009, pp.1133–1136.


Full Text: PDF [Full Text]

Refbacks

  • There are currently no refbacks.


Copyright © 2013, All rights reserved.| ijseat.com

Creative Commons License
International Journal of Science Engineering and Advance Technology is licensed under a Creative Commons Attribution 3.0 Unported License.Based on a work at IJSEat , Permissions beyond the scope of this license may be available at http://creativecommons.org/licenses/by/3.0/deed.en_GB.