The search functionality is under construction.

The search functionality is under construction.

This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as *k*/2^{n} (*k*, *n*∈ in **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 (log_{2}*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-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E93-A No.4 pp.734-741

- Publication Date
- 2010/04/01

- Publicized

- Online ISSN
- 1745-1337

- DOI
- 10.1587/transfun.E93.A.734

- Type of Manuscript
- PAPER

- Category
- Digital Signal Processing

The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.

Copy

Taizo SUZUKI, Masaaki IKEHARA, "Integer Discrete Cosine Transform via Lossless Walsh-Hadamard Transform with Structural Regularity for Low-Bit-Word-Length" in IEICE TRANSACTIONS on Fundamentals,
vol. E93-A, no. 4, pp. 734-741, April 2010, doi: 10.1587/transfun.E93.A.734.

Abstract: This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as *k*/2^{n} (*k*, *n*∈ in **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 (log_{2}*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-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

URL: https://global.ieice.org/en_transactions/fundamentals/10.1587/transfun.E93.A.734/_p

Copy

@ARTICLE{e93-a_4_734,

author={Taizo SUZUKI, Masaaki IKEHARA, },

journal={IEICE TRANSACTIONS on Fundamentals},

title={Integer Discrete Cosine Transform via Lossless Walsh-Hadamard Transform with Structural Regularity for Low-Bit-Word-Length},

year={2010},

volume={E93-A},

number={4},

pages={734-741},

abstract={This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as *k*/2^{n} (*k*, *n*∈ in **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 (log_{2}*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-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.},

keywords={},

doi={10.1587/transfun.E93.A.734},

ISSN={1745-1337},

month={April},}

Copy

TY - JOUR

TI - Integer Discrete Cosine Transform via Lossless Walsh-Hadamard Transform with Structural Regularity for Low-Bit-Word-Length

T2 - IEICE TRANSACTIONS on Fundamentals

SP - 734

EP - 741

AU - Taizo SUZUKI

AU - Masaaki IKEHARA

PY - 2010

DO - 10.1587/transfun.E93.A.734

JO - IEICE TRANSACTIONS on Fundamentals

SN - 1745-1337

VL - E93-A

IS - 4

JA - IEICE TRANSACTIONS on Fundamentals

Y1 - April 2010

AB - This paper presents an integer discrete cosine transform (IntDCT) with only dyadic values such as *k*/2^{n} (*k*, *n*∈ in **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 (log_{2}*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-word-length. Finally, the validity of our method is proved by showing the results of lossless-to-lossy image coding in low-bit-word-length.

ER -