Table of Contents
VLSI Design
Volume 2018, Article ID 9269157, 7 pages
Research Article

Efficient Nonrecursive Bit-Parallel Karatsuba Multiplier for a Special Class of Trinomials

Department of Computer Science and Technology, Xinyang Normal University, Nanhu Road 237, Xinyang, Henan, China

Correspondence should be addressed to Yin Li; moc.liamg@ilgnayiefnuy

Received 15 August 2017; Revised 1 December 2017; Accepted 10 December 2017; Published 11 January 2018

Academic Editor: Junqing Sun

Copyright © 2018 Yin Li et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Citations to this Article [2 citations]

The following is the list of published articles that have cited the current article.

  • Yin Li, Yu Zhang, Xiaoli Guo, and Chuanda Qi, “N-term Karatsuba Algorithm and its Application to Multiplier Designs for Special Trinomials,” IEEE Access, pp. 1–1, 2018. View at Publisher · View at Google Scholar
  • Sun-Mi Park, Ku-Young Chang, Dowon Hong, and Changho Seo, “Low space complexity GF(2m) multiplier for trinomials using n-term Karatsuba algorithm,” IEEE Access, pp. 1–1, 2019. View at Publisher · View at Google Scholar