Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures

A Amira, A Bouridane, P Milligan, A Belatreche

    Research output: Contribution to journalArticle

    11 Citations (Scopus)

    Abstract

    Discrete orthogonal transforms (DOTs) are important in many applications, including image and signal processing. Novel 1D and 2D bit-level systolic architectures are presented for the efficient implementation of DOTs for image and signal processing. The authors describe the design methodology of the techniques based on the Baugh-Wooley algorithm, and the associated design including a case study of an FPGA implementation. They also discuss the efficiency of implementations which have O(N-2) and O(2nN) as the area and time complexities for 2D structures, respectively, and O(N) and O(2nN) as the area and time complexities for 1D structures, respectively (where N is the transform length and n is the word length). Furthermore, it is shown that the architectures are parameterisable and that the area required by the designs can be predicted for different values of N and n. A comparison with existing and similar structures has shown that the proposed architectures perform better.
    LanguageEnglish
    Pages17-24
    JournalIEE Proceedings - Computers and Digital Techniques
    Volume149
    Issue number1
    DOIs
    Publication statusPublished - Jan 2002

    Fingerprint

    Signal processing
    Image processing
    Field programmable gate arrays (FPGA)

    Cite this

    @article{90e92bd87c414e3cb2ce1e8c59f475bf,
    title = "Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures",
    abstract = "Discrete orthogonal transforms (DOTs) are important in many applications, including image and signal processing. Novel 1D and 2D bit-level systolic architectures are presented for the efficient implementation of DOTs for image and signal processing. The authors describe the design methodology of the techniques based on the Baugh-Wooley algorithm, and the associated design including a case study of an FPGA implementation. They also discuss the efficiency of implementations which have O(N-2) and O(2nN) as the area and time complexities for 2D structures, respectively, and O(N) and O(2nN) as the area and time complexities for 1D structures, respectively (where N is the transform length and n is the word length). Furthermore, it is shown that the architectures are parameterisable and that the area required by the designs can be predicted for different values of N and n. A comparison with existing and similar structures has shown that the proposed architectures perform better.",
    author = "A Amira and A Bouridane and P Milligan and A Belatreche",
    year = "2002",
    month = "1",
    doi = "10.1049/ip-cdt:20020159",
    language = "English",
    volume = "149",
    pages = "17--24",
    journal = "IEE Proceedings - Computers and Digital Techniques",
    issn = "1350-2387",
    number = "1",

    }

    Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures. / Amira, A; Bouridane, A; Milligan, P; Belatreche, A.

    In: IEE Proceedings - Computers and Digital Techniques, Vol. 149, No. 1, 01.2002, p. 17-24.

    Research output: Contribution to journalArticle

    TY - JOUR

    T1 - Design of efficient architectures for discrete orthogonal transforms using bit level systolic structures

    AU - Amira, A

    AU - Bouridane, A

    AU - Milligan, P

    AU - Belatreche, A

    PY - 2002/1

    Y1 - 2002/1

    N2 - Discrete orthogonal transforms (DOTs) are important in many applications, including image and signal processing. Novel 1D and 2D bit-level systolic architectures are presented for the efficient implementation of DOTs for image and signal processing. The authors describe the design methodology of the techniques based on the Baugh-Wooley algorithm, and the associated design including a case study of an FPGA implementation. They also discuss the efficiency of implementations which have O(N-2) and O(2nN) as the area and time complexities for 2D structures, respectively, and O(N) and O(2nN) as the area and time complexities for 1D structures, respectively (where N is the transform length and n is the word length). Furthermore, it is shown that the architectures are parameterisable and that the area required by the designs can be predicted for different values of N and n. A comparison with existing and similar structures has shown that the proposed architectures perform better.

    AB - Discrete orthogonal transforms (DOTs) are important in many applications, including image and signal processing. Novel 1D and 2D bit-level systolic architectures are presented for the efficient implementation of DOTs for image and signal processing. The authors describe the design methodology of the techniques based on the Baugh-Wooley algorithm, and the associated design including a case study of an FPGA implementation. They also discuss the efficiency of implementations which have O(N-2) and O(2nN) as the area and time complexities for 2D structures, respectively, and O(N) and O(2nN) as the area and time complexities for 1D structures, respectively (where N is the transform length and n is the word length). Furthermore, it is shown that the architectures are parameterisable and that the area required by the designs can be predicted for different values of N and n. A comparison with existing and similar structures has shown that the proposed architectures perform better.

    U2 - 10.1049/ip-cdt:20020159

    DO - 10.1049/ip-cdt:20020159

    M3 - Article

    VL - 149

    SP - 17

    EP - 24

    JO - IEE Proceedings - Computers and Digital Techniques

    T2 - IEE Proceedings - Computers and Digital Techniques

    JF - IEE Proceedings - Computers and Digital Techniques

    SN - 1350-2387

    IS - 1

    ER -