The long length DHT design with a new hardware efficient distributed arithmetic approach and cyclic preserving partitioning
檔案
本條目沒有附加檔案。
日期
2005-05-01
類型
系所
期刊名稱
IEICE TRANSACTIONS ON ELECTRONICS
卷期與頁次
第 E88C 卷第 5 期,頁 1061–1069
ISSN
0916-8524
語言
英文
摘要
This paper presents a long length discrete Hartley transform (DHT) design with a new hardware efficient distributed arithmetic (DA) approach. The new DA design approach not only explores the constant property of coefficients as the conventional DA, but also exploits its cyclic property. To efficiently apply this approach to long length DHT, we first decompose the long length DHT algorithm to short ones using the prime factor algorithm (PFA), and further reformulate it by using Agarwal-Cooley algorithm such that all the partitioned short DHT still consists of the cyclic property. Besides, we also exploit the scheme of computation sharing on the content of ROM to reduce the hardware cost with the tradeoff in slowing down the computing speeds. Comparing with the existing designs shows that the proposed design can reduce the area-delay product from 52% to 91% according to a 0.35 mu m CMOS cell library.
關鍵詞
discrete Hartley transformdistributed arithmeticcyclic preserving partitioningcomputation sharing所屬典藏
期刊論文引用此條目
Chen, H., Chang, T., Guo, J., & Jen, C. (2005). The long length DHT design with a new hardware efficient distributed arithmetic approach and cyclic preserving partitioning. IEICE TRANSACTIONS ON ELECTRONICS, E88C(5), 1061–1069. https://doi.org/10.1093/ietele/e88-c.5.1061
引用文字依 APA 第 7 版格式自動產生,使用前請再核對。
分享
永久網址:https://ir.lib.nycu.edu.tw/handle/11536/13779