On-line DA-LUT architecture for high-speed high-order digital FIR filters

Mohamed Al Mahdi Eshtawie, Masuri Othman

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    10 Citations (Scopus)

    Abstract

    This paper presents a new architecture for distributed arithmetic look-up table ((DALUT). The technique proposed here shows a dramatic improvement in the memory size of the architecture used for implementing a high-speed high-order digital finite impulse response filter. The architecture proposed in this paper provides DA technique the cure for its major disadvantage i.e. the exponential growth of the LUT as the filter order increase. Therefore, with this architecture, the LUT size is independent of the number of input variables. This is because the LUT contents are not precalculated before implementing the design, instead the only needed location contents are calculated while processing the input data. As a result of applying this architecture, the usual drawback of the FIR filters, i.e. high order needs when compared with their corresponding IIR filters is also vanished. Therefore, with this architecture we can easily design and implement FIR filters to meet the desired specifications even if the required filter order is high.

    Original languageEnglish
    Title of host publication2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006
    DOIs
    Publication statusPublished - 2006
    Event10th IEEE Singapore International Conference on Communications Systems, ICCS 2006 - Singapore
    Duration: 30 Oct 20061 Nov 2006

    Other

    Other10th IEEE Singapore International Conference on Communications Systems, ICCS 2006
    CitySingapore
    Period30/10/061/11/06

    Fingerprint

    FIR filters
    Digital filters
    IIR filters
    Specifications
    Data storage equipment
    Processing

    Keywords

    • CLA
    • Component
    • Distributed arithmetic
    • Filter coefficients
    • Finite impulse response filter
    • Lookup table
    • Proposed architecture

    ASJC Scopus subject areas

    • Computer Networks and Communications
    • Communication
    • Electrical and Electronic Engineering

    Cite this

    Eshtawie, M. A. M., & Othman, M. (2006). On-line DA-LUT architecture for high-speed high-order digital FIR filters. In 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006 [4085749] https://doi.org/10.1109/ICCS.2006.301454

    On-line DA-LUT architecture for high-speed high-order digital FIR filters. / Eshtawie, Mohamed Al Mahdi; Othman, Masuri.

    2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006. 4085749.

    Research output: Chapter in Book/Report/Conference proceedingConference contribution

    Eshtawie, MAM & Othman, M 2006, On-line DA-LUT architecture for high-speed high-order digital FIR filters. in 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006., 4085749, 10th IEEE Singapore International Conference on Communications Systems, ICCS 2006, Singapore, 30/10/06. https://doi.org/10.1109/ICCS.2006.301454
    Eshtawie MAM, Othman M. On-line DA-LUT architecture for high-speed high-order digital FIR filters. In 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006. 4085749 https://doi.org/10.1109/ICCS.2006.301454
    Eshtawie, Mohamed Al Mahdi ; Othman, Masuri. / On-line DA-LUT architecture for high-speed high-order digital FIR filters. 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006. 2006.
    @inproceedings{e9c36bdd5c264950b0ea5b1767df0e3d,
    title = "On-line DA-LUT architecture for high-speed high-order digital FIR filters",
    abstract = "This paper presents a new architecture for distributed arithmetic look-up table ((DALUT). The technique proposed here shows a dramatic improvement in the memory size of the architecture used for implementing a high-speed high-order digital finite impulse response filter. The architecture proposed in this paper provides DA technique the cure for its major disadvantage i.e. the exponential growth of the LUT as the filter order increase. Therefore, with this architecture, the LUT size is independent of the number of input variables. This is because the LUT contents are not precalculated before implementing the design, instead the only needed location contents are calculated while processing the input data. As a result of applying this architecture, the usual drawback of the FIR filters, i.e. high order needs when compared with their corresponding IIR filters is also vanished. Therefore, with this architecture we can easily design and implement FIR filters to meet the desired specifications even if the required filter order is high.",
    keywords = "CLA, Component, Distributed arithmetic, Filter coefficients, Finite impulse response filter, Lookup table, Proposed architecture",
    author = "Eshtawie, {Mohamed Al Mahdi} and Masuri Othman",
    year = "2006",
    doi = "10.1109/ICCS.2006.301454",
    language = "English",
    isbn = "1424404118",
    booktitle = "2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006",

    }

    TY - GEN

    T1 - On-line DA-LUT architecture for high-speed high-order digital FIR filters

    AU - Eshtawie, Mohamed Al Mahdi

    AU - Othman, Masuri

    PY - 2006

    Y1 - 2006

    N2 - This paper presents a new architecture for distributed arithmetic look-up table ((DALUT). The technique proposed here shows a dramatic improvement in the memory size of the architecture used for implementing a high-speed high-order digital finite impulse response filter. The architecture proposed in this paper provides DA technique the cure for its major disadvantage i.e. the exponential growth of the LUT as the filter order increase. Therefore, with this architecture, the LUT size is independent of the number of input variables. This is because the LUT contents are not precalculated before implementing the design, instead the only needed location contents are calculated while processing the input data. As a result of applying this architecture, the usual drawback of the FIR filters, i.e. high order needs when compared with their corresponding IIR filters is also vanished. Therefore, with this architecture we can easily design and implement FIR filters to meet the desired specifications even if the required filter order is high.

    AB - This paper presents a new architecture for distributed arithmetic look-up table ((DALUT). The technique proposed here shows a dramatic improvement in the memory size of the architecture used for implementing a high-speed high-order digital finite impulse response filter. The architecture proposed in this paper provides DA technique the cure for its major disadvantage i.e. the exponential growth of the LUT as the filter order increase. Therefore, with this architecture, the LUT size is independent of the number of input variables. This is because the LUT contents are not precalculated before implementing the design, instead the only needed location contents are calculated while processing the input data. As a result of applying this architecture, the usual drawback of the FIR filters, i.e. high order needs when compared with their corresponding IIR filters is also vanished. Therefore, with this architecture we can easily design and implement FIR filters to meet the desired specifications even if the required filter order is high.

    KW - CLA

    KW - Component

    KW - Distributed arithmetic

    KW - Filter coefficients

    KW - Finite impulse response filter

    KW - Lookup table

    KW - Proposed architecture

    UR - http://www.scopus.com/inward/record.url?scp=46949095608&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=46949095608&partnerID=8YFLogxK

    U2 - 10.1109/ICCS.2006.301454

    DO - 10.1109/ICCS.2006.301454

    M3 - Conference contribution

    AN - SCOPUS:46949095608

    SN - 1424404118

    SN - 9781424404117

    BT - 2006 IEEE Singapore International Conference on Communication Systems, ICCS 2006

    ER -