MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.

S. C. Bass, B. J. Leon, William Kenneth Jenkins

    Research output: Contribution to conferencePaper

    Abstract

    Since multipliers are the slowest and most expensive components in digital filters, schemes for increasing speed and reducing cost are of interest. For a device that does multiplication by successive shift and add operations, different architectures can be used to speed the process and allow for hardware sharing. Several architectures are discussed in this paper. For filters that carry a small digital word length, nonconventional multiply schemes may well be appropriate. Two such schemes, table look up and residue algebra, are discussed.

    Original languageEnglish (US)
    Pages116-121
    Number of pages6
    StatePublished - Jan 1 1974
    EventIEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974 - Phoenix, AZ, USA
    Duration: Nov 20 1974Nov 22 1974

    Other

    OtherIEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974
    CityPhoenix, AZ, USA
    Period11/20/7411/22/74

    Fingerprint

    Digital filters
    Algebra
    Hardware
    Costs

    All Science Journal Classification (ASJC) codes

    • Engineering(all)

    Cite this

    Bass, S. C., Leon, B. J., & Jenkins, W. K. (1974). MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.. 116-121. Paper presented at IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974, Phoenix, AZ, USA, .
    Bass, S. C. ; Leon, B. J. ; Jenkins, William Kenneth. / MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS. Paper presented at IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974, Phoenix, AZ, USA, .6 p.
    @conference{edba6072543948f8b501d04146a98778,
    title = "MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.",
    abstract = "Since multipliers are the slowest and most expensive components in digital filters, schemes for increasing speed and reducing cost are of interest. For a device that does multiplication by successive shift and add operations, different architectures can be used to speed the process and allow for hardware sharing. Several architectures are discussed in this paper. For filters that carry a small digital word length, nonconventional multiply schemes may well be appropriate. Two such schemes, table look up and residue algebra, are discussed.",
    author = "Bass, {S. C.} and Leon, {B. J.} and Jenkins, {William Kenneth}",
    year = "1974",
    month = "1",
    day = "1",
    language = "English (US)",
    pages = "116--121",
    note = "IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974 ; Conference date: 20-11-1974 Through 22-11-1974",

    }

    Bass, SC, Leon, BJ & Jenkins, WK 1974, 'MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.', Paper presented at IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974, Phoenix, AZ, USA, 11/20/74 - 11/22/74 pp. 116-121.

    MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS. / Bass, S. C.; Leon, B. J.; Jenkins, William Kenneth.

    1974. 116-121 Paper presented at IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974, Phoenix, AZ, USA, .

    Research output: Contribution to conferencePaper

    TY - CONF

    T1 - MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.

    AU - Bass, S. C.

    AU - Leon, B. J.

    AU - Jenkins, William Kenneth

    PY - 1974/1/1

    Y1 - 1974/1/1

    N2 - Since multipliers are the slowest and most expensive components in digital filters, schemes for increasing speed and reducing cost are of interest. For a device that does multiplication by successive shift and add operations, different architectures can be used to speed the process and allow for hardware sharing. Several architectures are discussed in this paper. For filters that carry a small digital word length, nonconventional multiply schemes may well be appropriate. Two such schemes, table look up and residue algebra, are discussed.

    AB - Since multipliers are the slowest and most expensive components in digital filters, schemes for increasing speed and reducing cost are of interest. For a device that does multiplication by successive shift and add operations, different architectures can be used to speed the process and allow for hardware sharing. Several architectures are discussed in this paper. For filters that carry a small digital word length, nonconventional multiply schemes may well be appropriate. Two such schemes, table look up and residue algebra, are discussed.

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

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

    M3 - Paper

    AN - SCOPUS:0016376882

    SP - 116

    EP - 121

    ER -

    Bass SC, Leon BJ, Jenkins WK. MULTIPLIER ARCHITECTURE FOR DIGITAL FILTERS.. 1974. Paper presented at IEEE Conf on Decis and Control, 1974, incl Symp on Adapt Processes, 13th, Proc, Nov 20-22 1974, Phoenix, AZ, USA, .