Efficient VLSI architecture for separable 2-D discrete wavelet transform

Wen-Hsiao Peng; Chen-Yi Lee

doi:10.1109/ICIP.1999.822997

Efficient VLSI architecture for separable 2-D discrete wavelet transform

Wen-Hsiao Peng^*, Chen-Yi Lee

^*Corresponding author for this work

Research output: Contribution to conference › Paper › peer-review

4 Scopus citations

Abstract

In this paper, we present a VLSI architecture for separable 2-D Discrete Wavelet Transform (DWT). Based on 1-D DWT Recursive Pyramid Algorithm (RPA), a complete 2-D DWT output scheduling scheme is derived. The I/O between memory which stores the intermediate results and DWT core is simplified by `circular coefficients arrangement'. And the concept to store the `partial accumulation sum' of convolution operation in column direction is first proposed in this paper. For the computations of N×N 2-D DWT with filter length L, our architecture spends N² clock cycles and requires 2NL words in memory size, 4L multipliers, as well as 4L-2 adders. And the number of multipliers and adders can be further reduced to 2L and 2L-1 respectively by sharing positive and negative clock edge. The architecture is suitable for VLSI implementation and various real-time video/image applications.

Original language	English
Pages	754-758
Number of pages	5
DOIs	https://doi.org/10.1109/ICIP.1999.822997
State	Published - 1 Dec 1999
Event	International Conference on Image Processing (ICIP'99) - Kobe, Jpn Duration: 24 Oct 1999 → 28 Oct 1999

Conference

Conference	International Conference on Image Processing (ICIP'99)
City	Kobe, Jpn
Period	24/10/99 → 28/10/99

Access to Document

10.1109/ICIP.1999.822997

Fingerprint Dive into the research topics of 'Efficient VLSI architecture for separable 2-D discrete wavelet transform'. Together they form a unique fingerprint.

Cite this

@conference{7c2ff61b78e542b2b065887d7f4102c0,

title = "Efficient VLSI architecture for separable 2-D discrete wavelet transform",

abstract = "In this paper, we present a VLSI architecture for separable 2-D Discrete Wavelet Transform (DWT). Based on 1-D DWT Recursive Pyramid Algorithm (RPA), a complete 2-D DWT output scheduling scheme is derived. The I/O between memory which stores the intermediate results and DWT core is simplified by `circular coefficients arrangement'. And the concept to store the `partial accumulation sum' of convolution operation in column direction is first proposed in this paper. For the computations of N×N 2-D DWT with filter length L, our architecture spends N2 clock cycles and requires 2NL words in memory size, 4L multipliers, as well as 4L-2 adders. And the number of multipliers and adders can be further reduced to 2L and 2L-1 respectively by sharing positive and negative clock edge. The architecture is suitable for VLSI implementation and various real-time video/image applications.",

author = "Wen-Hsiao Peng and Chen-Yi Lee",

year = "1999",

month = dec,

day = "1",

doi = "10.1109/ICIP.1999.822997",

language = "English",

pages = "754--758",

note = "null ; Conference date: 24-10-1999 Through 28-10-1999",

}

TY - CONF

T1 - Efficient VLSI architecture for separable 2-D discrete wavelet transform

AU - Peng, Wen-Hsiao

AU - Lee, Chen-Yi

PY - 1999/12/1

Y1 - 1999/12/1

N2 - In this paper, we present a VLSI architecture for separable 2-D Discrete Wavelet Transform (DWT). Based on 1-D DWT Recursive Pyramid Algorithm (RPA), a complete 2-D DWT output scheduling scheme is derived. The I/O between memory which stores the intermediate results and DWT core is simplified by `circular coefficients arrangement'. And the concept to store the `partial accumulation sum' of convolution operation in column direction is first proposed in this paper. For the computations of N×N 2-D DWT with filter length L, our architecture spends N2 clock cycles and requires 2NL words in memory size, 4L multipliers, as well as 4L-2 adders. And the number of multipliers and adders can be further reduced to 2L and 2L-1 respectively by sharing positive and negative clock edge. The architecture is suitable for VLSI implementation and various real-time video/image applications.

AB - In this paper, we present a VLSI architecture for separable 2-D Discrete Wavelet Transform (DWT). Based on 1-D DWT Recursive Pyramid Algorithm (RPA), a complete 2-D DWT output scheduling scheme is derived. The I/O between memory which stores the intermediate results and DWT core is simplified by `circular coefficients arrangement'. And the concept to store the `partial accumulation sum' of convolution operation in column direction is first proposed in this paper. For the computations of N×N 2-D DWT with filter length L, our architecture spends N2 clock cycles and requires 2NL words in memory size, 4L multipliers, as well as 4L-2 adders. And the number of multipliers and adders can be further reduced to 2L and 2L-1 respectively by sharing positive and negative clock edge. The architecture is suitable for VLSI implementation and various real-time video/image applications.

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

U2 - 10.1109/ICIP.1999.822997

DO - 10.1109/ICIP.1999.822997

M3 - Paper

AN - SCOPUS:0033333902

SP - 754

EP - 758

Y2 - 24 October 1999 through 28 October 1999

ER -

Efficient VLSI architecture for separable 2-D discrete wavelet transform

Abstract

Conference

Access to Document

Other files and links

Cite this