Integer discrete cosine transform via lossless Walsh-Hadamard transform with structural regularity for low-bit-word-length

Taizo Suzuki, Masaaki Ikehara

    Research output: Contribution to journalArticle

    5 Citations (Scopus)

    Abstract

    This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as k/2n (k, n ∈ ℕ). Although some conventional IntDCTs have been proposed, they are not suitable for lossless-to-lossy image coding in low-bit-word-length (coefficients) due to the degradation of the frequency decomposition performance in the system. First, the proposed M-channel lossless Walsh-Hadamard transform (LWHT) can be constructed by only (log2 M)-bit-word-length and has structural regularity. Then, our 8-channel IntDCT via LWHT keeps good coding performance even if low-bit-word-length is used because LWHT, which is main part of IntDCT, can be implemented by only 3-bit-wordlength. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

    Original languageEnglish
    Pages (from-to)734-741
    Number of pages8
    JournalIEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
    VolumeE93-A
    Issue number4
    DOIs
    Publication statusPublished - 2010 Apr

    Keywords

    • Dyadic values
    • Integer discrete cosine transform (IntDCT)
    • Lossless Walsh-Hadamard transform (LWHT)
    • Lossless-tolossy image coding
    • Lowbit-word-length

    ASJC Scopus subject areas

    • Signal Processing
    • Computer Graphics and Computer-Aided Design
    • Electrical and Electronic Engineering
    • Applied Mathematics

    Fingerprint Dive into the research topics of 'Integer discrete cosine transform via lossless Walsh-Hadamard transform with structural regularity for low-bit-word-length'. Together they form a unique fingerprint.

  • Cite this