Structurally regular integer discrete cosine transform for low-bit-word-length coefficients

Taizo Suzuki, Masaaki Ikehara

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

    1 Citation (Scopus)

    Abstract

    This paper presents an IntDCT with only dyadic values such as k/2 n (k, n ∈ ℕ). Although some IntDCTs have been proposed, they are unsuitable for lossless-to-lossy image coding in low-bit-word-length (coefficients). First, the proposed M-channel lossless WHT (LWHT) can be constructed by only (log2 M)-bit-word-length and has structural regularity. Then, our 8-channel IntDCT keeps good coding performance even in low-bit-word-length because LWHT, which is main part of IntDCT, can be implemented by 3-bit-word-length. Finally, our method is validated in lossless-to-lossy image coding.

    Original languageEnglish
    Title of host publicationISCAS 2010 - 2010 IEEE International Symposium on Circuits and Systems
    Subtitle of host publicationNano-Bio Circuit Fabrics and Systems
    Pages1607-1610
    Number of pages4
    DOIs
    Publication statusPublished - 2010 Aug 31
    Event2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems, ISCAS 2010 - Paris, France
    Duration: 2010 May 302010 Jun 2

    Publication series

    NameISCAS 2010 - 2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems

    Other

    Other2010 IEEE International Symposium on Circuits and Systems: Nano-Bio Circuit Fabrics and Systems, ISCAS 2010
    CountryFrance
    CityParis
    Period10/5/3010/6/2

    Keywords

    • Dyadic values
    • IntDCT
    • LWHT
    • Lossless-to-lossy image coding
    • Low-bit-word-length

    ASJC Scopus subject areas

    • Hardware and Architecture
    • Electrical and Electronic Engineering

    Fingerprint Dive into the research topics of 'Structurally regular integer discrete cosine transform for low-bit-word-length coefficients'. Together they form a unique fingerprint.

    Cite this