数字滤波器的HDL实现使用浮点韦达乘法器

Prashant S. Howal, Kishor P. Upla, Mehul C. Patel
{"title":"数字滤波器的HDL实现使用浮点韦达乘法器","authors":"Prashant S. Howal, Kishor P. Upla, Mehul C. Patel","doi":"10.1109/ICCS1.2017.8326004","DOIUrl":null,"url":null,"abstract":"Multiplication is one of the important operations in many signal processing applications such as digital filters design, fast Fourier transform (FFT), discrete Fourier transform (DFT), discrete cosine transform (DCT), etc. The performance of multiplier has direct effect on the final output of those applications. Due to this, there is always a need to design a multiplier which has high accuracy with high speed and low power consumption. Moreover, it is also desirable to have multiplier with less area and complexity. In this paper, we address the problem of hardware description language (HDL) implementation of digital filters using vedic multiplier with Urdhva-Triyakbhyam sutra. Vedic multiplication is used in finite impulse response (FIR) and infinite impulse response (IIR) filters as a basic building block with single precision floating point format which increases the accuracy and range of multiplication coefficients. The potential of the proposed algorithm is evaluated by comparing its performance with other existing multipliers such as shift & add, array, and Wallace multipliers. The experimental results show an improvement in terms of area and complexity using the proposed algorithm when compared to the other existing multiplication methods.","PeriodicalId":367360,"journal":{"name":"2017 IEEE International Conference on Circuits and Systems (ICCS)","volume":"303 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"HDL implementation of digital filters using floating point vedic multiplier\",\"authors\":\"Prashant S. Howal, Kishor P. Upla, Mehul C. Patel\",\"doi\":\"10.1109/ICCS1.2017.8326004\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multiplication is one of the important operations in many signal processing applications such as digital filters design, fast Fourier transform (FFT), discrete Fourier transform (DFT), discrete cosine transform (DCT), etc. The performance of multiplier has direct effect on the final output of those applications. Due to this, there is always a need to design a multiplier which has high accuracy with high speed and low power consumption. Moreover, it is also desirable to have multiplier with less area and complexity. In this paper, we address the problem of hardware description language (HDL) implementation of digital filters using vedic multiplier with Urdhva-Triyakbhyam sutra. Vedic multiplication is used in finite impulse response (FIR) and infinite impulse response (IIR) filters as a basic building block with single precision floating point format which increases the accuracy and range of multiplication coefficients. The potential of the proposed algorithm is evaluated by comparing its performance with other existing multipliers such as shift & add, array, and Wallace multipliers. The experimental results show an improvement in terms of area and complexity using the proposed algorithm when compared to the other existing multiplication methods.\",\"PeriodicalId\":367360,\"journal\":{\"name\":\"2017 IEEE International Conference on Circuits and Systems (ICCS)\",\"volume\":\"303 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 IEEE International Conference on Circuits and Systems (ICCS)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCS1.2017.8326004\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 IEEE International Conference on Circuits and Systems (ICCS)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCS1.2017.8326004","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

乘法运算是数字滤波器设计、快速傅立叶变换(FFT)、离散傅立叶变换(DFT)、离散余弦变换(DCT)等许多信号处理应用中的重要运算之一。乘法器的性能直接影响到这些应用程序的最终输出。因此,总是需要设计一种高精度、高速度和低功耗的乘法器。此外,还希望拥有面积更小、复杂度更小的乘法器。在本文中,我们解决了硬件描述语言(HDL)实现的问题,使用吠陀乘法器与Urdhva-Triyakbhyam经。吠陀乘法被用于有限脉冲响应(FIR)和无限脉冲响应(IIR)滤波器中,作为单精度浮点格式的基本构建块,增加了乘法系数的精度和范围。通过将该算法的性能与其他现有的乘法器(如移位和加法、数组和华莱士乘法器)进行比较,评估了该算法的潜力。实验结果表明,与现有的乘法方法相比,该算法在面积和复杂度方面都有很大的提高。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
HDL implementation of digital filters using floating point vedic multiplier
Multiplication is one of the important operations in many signal processing applications such as digital filters design, fast Fourier transform (FFT), discrete Fourier transform (DFT), discrete cosine transform (DCT), etc. The performance of multiplier has direct effect on the final output of those applications. Due to this, there is always a need to design a multiplier which has high accuracy with high speed and low power consumption. Moreover, it is also desirable to have multiplier with less area and complexity. In this paper, we address the problem of hardware description language (HDL) implementation of digital filters using vedic multiplier with Urdhva-Triyakbhyam sutra. Vedic multiplication is used in finite impulse response (FIR) and infinite impulse response (IIR) filters as a basic building block with single precision floating point format which increases the accuracy and range of multiplication coefficients. The potential of the proposed algorithm is evaluated by comparing its performance with other existing multipliers such as shift & add, array, and Wallace multipliers. The experimental results show an improvement in terms of area and complexity using the proposed algorithm when compared to the other existing multiplication methods.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信