Skip to main content

Efficient-Fused Architectures for FFT Processor Using Floating-Point Arithmetic

  • Conference paper
  • First Online:
Artificial Intelligence and Evolutionary Computations in Engineering Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 394))

  • 1882 Accesses

Abstract

In this chapter, the complex multiplier is designed using the fused dot product architecture. The floating-point number is used in this implementation for its wider range and its applications requiring the data space range from small to infinitely large. For the digital applications, the adder, subtractor, and multiplier are required at same instance. The discrete way of implementing the dot product yielded more space (in parallel implementation), high latency (in serial implementation), and power consumption. Hence, the research in fusing of the arithmetic units such as floating-point adder, subtractor, and multiplier gained interest. With the fused dot product unit, the output can be obtained in a single clock with low area and minimum latency. To further improve the performance of the fused dot product (FDP), the optimization in the architecture had been carried out and the result has been discussed. Further, the FDP unit is implemented in the complex multiplier. Thus, the performance of complex multiplier in FFT is improved and the error in computation is reduced. This optimized fused architecture can also be used in implementation in the processors and other such systems.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. IEEE standard for binary floating-point arithmetic, ANSI/IEEE Standard 754;1985.

    Google Scholar 

  2. Bruguera JD, Lang T. Floating-point fused multiply-add: reduced latency for floating-point addition. In: Proceedings of the 17th IEEE symposium on computer arithmetic;2005. p. 42–51.

    Google Scholar 

  3. Takahashi D. A Radix-16 FFT algorithm suitable for multiply-add instruction based on Goedecker method. In: Proceedings of international conference on multimedia and expo, vol. 2;2003. p. II-845–II-8.

    Google Scholar 

  4. Swartzlander EE Jr., Saleh HHM. FFT implementation with fused floating-point operations. IEEE Trans Comput. 2012; 61(2).

    Google Scholar 

  5. Suzuki H, Makino H, Mashiko K, Hamano H. Leading-zero anticipatory logic for high-speed floating point addition. IEEE J Solid-State Circuits. 1996;32:1157–64.

    Article  Google Scholar 

  6. Li R-C, Boldo S, Daumas M. Theorems on efficient argument reductions. In: Proceedings of the 16th IEEE symposium on computer arithmetic;2003. p.129–36.

    Google Scholar 

  7. Mehta A, Bidhul CB, Joseph S, Jayakrishnan P. Implementation of single precision floating point multiplier using Karatsuba algorithm. In: 2013 International conference on green computing, communication and conservation of energy (ICGCE).

    Google Scholar 

  8. Hokenek E, Montoye R, Cook PW. Second-generation RISC floating point with multiply-add fused. IEEE J Solid-State Circuits. 1990;25:1207–13.

    Article  Google Scholar 

  9. Saleh H, Swartzlander EE Jr. A floating-point fused add-subtract unit. In: Proceedings of IEEE Midwest symposium on circuits and systems (MWSCAS); 2008. p. 519–22.

    Google Scholar 

  10. Hoe DHK, Martinez C, Vundavalli J. Design and characterisation of parallel prefix adders using FPGAs. In: IEEE 43rd Southern symposium on system theory, March 2011.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to D. Tamil Eniyan .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer India

About this paper

Cite this paper

Tamil Eniyan, D., Harirajkumar, J. (2016). Efficient-Fused Architectures for FFT Processor Using Floating-Point Arithmetic. In: Dash, S., Bhaskar, M., Panigrahi, B., Das, S. (eds) Artificial Intelligence and Evolutionary Computations in Engineering Systems. Advances in Intelligent Systems and Computing, vol 394. Springer, New Delhi. https://doi.org/10.1007/978-81-322-2656-7_95

Download citation

  • DOI: https://doi.org/10.1007/978-81-322-2656-7_95

  • Published:

  • Publisher Name: Springer, New Delhi

  • Print ISBN: 978-81-322-2654-3

  • Online ISBN: 978-81-322-2656-7

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics