Area-Efficient digital filtering based on truncated multiply-accumulate units in residue number system 2n-1, 2n, 2n+1

被引:0
|
作者
Lyakhov, P. A. [1 ,2 ]
机构
[1] North Caucasus Fed Univ, Dept Math Modeling, Stavropol, Russia
[2] North Caucasus Fed Univ, North Caucasus Ctr Math Res, Stavropol, Russia
基金
俄罗斯科学基金会;
关键词
Digital signal processing; FIR filter; Moduli of a special type; Unit-gate model; Diminished-one technique; Low-power devices; FIR; ALGORITHM; DESIGN;
D O I
10.1016/j.jksuci.2023.101574
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
High resource consumption of digital filtering devices is one of the main practical problems of digital signal processing. Parallel data processing is one of the most effective approaches to improve the quantitative characteristics of such devices. This paper proposes a method for filtering signals using Truncated Multiply-and-Accumulate units (TMAC) in the residue number system (RNS) using moduli of a special type 2n -1, 2n, 2n + 1. These moduli reduced hardware costs and power consumption compared to state-of-the-art approaches for a 32-bit RNS filter by up to 23% and up to 22.3%, respectively, with a delay increase of 131%. The proposed approach allowed to reduce the device area by up to 14% with comparable energy expended for a 48-bit RNS filter, but the device delay increased by 81%. The results obtained open up the possibility of creating area-efficient and power-efficient devices. & COPY; 2023 The Author(s). Published by Elsevier B.V. on behalf of King Saud University. This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/).
引用
收藏
页数:12
相关论文
共 50 条
  • [31] MRC-Based RNS Reverse Converters for the Four-Moduli Sets {2n+1, 2n-1, 2n, 22n+1-1} and {2n+1, 2n-1, 22n, 22n+1-1}
    Sousa, Leonel
    Antao, Samuel
    IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS II-EXPRESS BRIEFS, 2012, 59 (04) : 244 - 248
  • [32] Reverse converter for the 4-moduli superset {2n-1, 2n, 2n+1, 2n+1+1}
    Bhardwaj, M.
    Srikanthan, T.
    Clarke, C.T.
    Proceedings - Symposium on Computer Arithmetic, 1999, : 168 - 175
  • [33] A reverse converter for the 4-moduli superset {2n-1, 2n, 2n+1, 2n+1+1}
    Bhardwaj, M
    Srikanthan, T
    Clarke, CT
    14TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 1999, : 168 - 175
  • [34] Fast sign-detection algorithm for residue number system moduli set {2n-1, 2n, 2n+1-1}
    Niras, Cheeckottu Vayalil
    Kong, Yinan
    IET COMPUTERS AND DIGITAL TECHNIQUES, 2016, 10 (02): : 54 - 58
  • [35] Low-Complexity Sign Detection Algorithm for RNS {2n-1, 2n, 2n+1}
    Xu, Minghe
    Ya, Ruohe
    Luo, Fei
    IEICE TRANSACTIONS ON ELECTRONICS, 2012, E95C (09): : 1552 - 1556
  • [36] An Efficient FPGA Design of Residue-to-Binary Converter for the Moduli Set {2n+1, 2n-1}
    Gbolagade, Kazeem Alagbe
    Voicu, George Razvan
    Cotofana, Sorin Dan
    IEEE TRANSACTIONS ON VERY LARGE SCALE INTEGRATION (VLSI) SYSTEMS, 2011, 19 (08) : 1500 - 1503
  • [37] A Unified Addition Structure for Moduli Set {2n-1, 2n, 2n+1} Based on a Novel RNS Representation
    Timarchi, Somayeh
    Fazlali, Mahmood
    Cotofana, Sorin D.
    2010 IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN, 2010, : 247 - 252
  • [38] A memoryless reverse converter for the 4-moduli superset {2n-1, 2n, 2n+1, 2n+1-1}
    Vinod, AP
    Premkumar, AB
    JOURNAL OF CIRCUITS SYSTEMS AND COMPUTERS, 2000, 10 (1-2) : 85 - 99
  • [39] IMAGE ENCRYPTION AND DECRYPTION IN RNS DOMAIN BASED ON {2n, 22n+1-1, 2n+1, 2n-1} MODULI SET
    Reddy, P. Venkata Narasa
    Karumuri, Rajasekhar
    PROCEEDINGS OF THE 2016 INTERNATIONAL CONFERENCE ON COMMUNICATION AND ELECTRONICS SYSTEMS (ICCES), 2016, : 414 - 418
  • [40] Weighted-to-residue and residue-to-weighted converters with three-moduli (2n-1, 2n, 2n+1) signed-digit architectures
    Chen, Shuangching
    Wei, Shugang
    2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 3365 - +