### Abstract

Discrete wavelet transform (DWT) is an efficient tool for multi-resolution decomposition of images. It has been shown to be very promising due to its high compression ratio and self-similar data structure. Conventionally a 2-D DWT is accomplished by performing two 1-D operations: one along the rows and the other along the columns of an image. Without executing ordered 1-D transforms, we develop a new algorithm to compute a 2-D Haar DWT, the simplest DWT. Two merits of this algorithm are compactness and quickness. The algorithm is implemented with a compact, regular VLSI architecture whose system throughput can be conveniently improved by appropriate parallel/pipeline methods.

Original language | English |
---|---|

Pages (from-to) | 1273-1282 |

Number of pages | 10 |

Journal | Journal of Information Science and Engineering |

Volume | 24 |

Issue number | 4 |

Publication status | Published - 2008 Jul 1 |

### Fingerprint

### All Science Journal Classification (ASJC) codes

- Software
- Human-Computer Interaction
- Hardware and Architecture
- Library and Information Sciences
- Computational Theory and Mathematics

### Cite this

*Journal of Information Science and Engineering*,

*24*(4), 1273-1282.

}

*Journal of Information Science and Engineering*, vol. 24, no. 4, pp. 1273-1282.

**The segmented-matrix algorithm for Haar discrete wavelet transform.** / Chen, Po Yueh; Liao, En Chi; Liang, Chung Wei.

Research output: Contribution to journal › Article

TY - JOUR

T1 - The segmented-matrix algorithm for Haar discrete wavelet transform

AU - Chen, Po Yueh

AU - Liao, En Chi

AU - Liang, Chung Wei

PY - 2008/7/1

Y1 - 2008/7/1

N2 - Discrete wavelet transform (DWT) is an efficient tool for multi-resolution decomposition of images. It has been shown to be very promising due to its high compression ratio and self-similar data structure. Conventionally a 2-D DWT is accomplished by performing two 1-D operations: one along the rows and the other along the columns of an image. Without executing ordered 1-D transforms, we develop a new algorithm to compute a 2-D Haar DWT, the simplest DWT. Two merits of this algorithm are compactness and quickness. The algorithm is implemented with a compact, regular VLSI architecture whose system throughput can be conveniently improved by appropriate parallel/pipeline methods.

AB - Discrete wavelet transform (DWT) is an efficient tool for multi-resolution decomposition of images. It has been shown to be very promising due to its high compression ratio and self-similar data structure. Conventionally a 2-D DWT is accomplished by performing two 1-D operations: one along the rows and the other along the columns of an image. Without executing ordered 1-D transforms, we develop a new algorithm to compute a 2-D Haar DWT, the simplest DWT. Two merits of this algorithm are compactness and quickness. The algorithm is implemented with a compact, regular VLSI architecture whose system throughput can be conveniently improved by appropriate parallel/pipeline methods.

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

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

M3 - Article

AN - SCOPUS:48849097597

VL - 24

SP - 1273

EP - 1282

JO - Journal of Information Science and Engineering

JF - Journal of Information Science and Engineering

SN - 1016-2364

IS - 4

ER -