DA Based Systematic Approach Using Speculative Addition for High Speed DSP Applications

 
 
 
  • Abstract
  • Keywords
  • References
  • PDF
  • Abstract


    In recent years Parallel-prefix topologies has been emerged to offer a high-speed solution for many DSP applications. Here in this paper carrier approximation is introduced to incorporate speculation in Han Carlson prefix method.  And overall latency is considerably reduced using single Brent-Kung addition as a pre and post processing unit. In order to improve the reliability error detection network is combined with the approximated adder and it is assert the error correction unit whenever speculation fails during carries propagation from LSB segment to MSB unit. The proposed speculative adder based on Han-Carlson parallel-prefix topology attains better latency reduction than variable latency Kogge-Stone topology. Finally, multiplier-accumulation unit (MAC) is designed using serial shift-based accumulation where the proposed speculative adder is used for partial product addition iteratively. The performance merits and latency reduction of proposed adder unit is proved through FPGA hardware synthesis. Obtained results show that proposed MAC unit outperforms both previously proposed speculative architectures and all other high-speed multiplication methods.

     

     

  • Keywords


    Parallel-prefix adders, Speculation, MAC, and FPGA design etc.

  • References


      [1] Koren. Computer Arithmetic Algorithms. Prentice-Hall Inc., New Jersey, 1993

      [2] Koren, Israel. Computer arithmetic algorithms. Universities Press, 2002.

      [3] Lu, Shih-Lien."Speeding up processing with approximation circuits." Computer 37.3 (2004): 67-73.

      [4] Chakraborty, Rajat Subhra, and Swarup Bhunia. "HARPOON: an obfuscation-based SoC design methodology for hardware protection." IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems 28.10 (2009): 1493-1502.

      [5] I.Koren, Computer Arithmetic Algorithms. Natick, MA, USA: A K Peters, 2002.

      [6] Brent, Richard P., and H-T_ Kung. "A regular layout for parallel adders." IEEE transactions on Computers 3 (1982): 260-264.

      [7] Kogge, Peter M., and Harold S. Stone. "A parallel algorithm for the efficient solution of a general class of recurrence equations." IEEE transactions on computers 100.8 (1973): 786-793.

      [8] Sklansky, Jack. "Conditional-sum addition logic." IRE Transactions on Electronic computers 2 (1960): 226-231.

      [9] Han, Tackdon, and David A. Carlson. "Fast area-efficient VLSI adders." Computer Arithmetic (ARITH), 1987 IEEE 8th Symposium on. IEEE, 1987.

      [10] Ladner, Richard E., and Michael J. Fischer. "Parallel prefix computation." Journal of the ACM (JACM) 27.4 (1980): 831-838.

      [11] Liu, Tong, and Shih-Lien Lu. "Performance improvement with circuit-level speculation." Microarchitecture, 2000. MICRO-33. Proceedings. 33rd Annual IEEE/ACM International Symposium on. IEEE, 2000.

      [12] T. Padmapriya and V. Saminadan, “Priority based fair resource allocation and Admission Control Technique for Multi-user Multi-class downlink Traffic in LTE-Advanced Networks”, International Journal of Advanced Research, vol.5, no.1, pp.1633-1641, January 2017.

      [13] S.V.Manikanthan and K.Srividhya "An Android based secure access control using ARM and cloud computing", Published in: Electronics and Communication Systems (ICECS), 2015 2nd International Conference on 26-27 Feb. 2015, Publisher: IEEE, DOI: 10. 1109/ECS.2015.7124833.


 

View

Download

Article ID: 12030
 
DOI: 10.14419/ijet.v7i2.24.12030




Copyright © 2012-2015 Science Publishing Corporation Inc. All rights reserved.