Efficient architectures for 1-D and 2-D lifting-based wavelet transforms

The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple lifting steps that process the input samples in pairs. We propose four compact and efficient hardware architectures for implementing lifting-based...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on signal processing Vol. 52; no. 5; pp. 1315 - 1326
Main Authors: Hongyu Liao, Mandal, M.Kr, Cockburn, B.F.
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.05.2004
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
ISSN:1053-587X, 1941-0476
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Abstract The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple lifting steps that process the input samples in pairs. We propose four compact and efficient hardware architectures for implementing lifting-based DWTs, namely, one-dimensional (1-D) and two-dimensional (2-D) versions of what we call recursive and dual scan architectures. The 1-D recursive architecture exploits interdependencies among the wavelet coefficients by interleaving, on alternate clock cycles using the same datapath hardware, the calculation of higher order coefficients along with that of the first-stage coefficients. The resulting hardware utilization exceeds 90% in the typical case of a five-stage 1-D DWT operating on 1024 samples. The 1-D dual scan architecture achieves 100% datapath hardware utilization by processing two independent data streams together using shared functional blocks. The recursive and dual scan architectures can be readily extended to the 2-D case. The 2-D recursive architecture is roughly 25% faster than conventional implementations, and it requires a buffer that stores only a few rows of the data array instead of a fixed fraction (typically 25% or more) of the entire array. The 2-D dual scan architecture processes the column and row transforms simultaneously, and the memory buffer size is comparable to existing architectures.
AbstractList The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple lifting steps that process the input samples in pairs.
The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple lifting steps that process the input samples in pairs. We propose four compact and efficient hardware architectures for implementing lifting-based DWTs, namely, one-dimensional (1-D) and two-dimensional (2-D) versions of what we call recursive and dual scan architectures. The 1-D recursive architecture exploits interdependencies among the wavelet coefficients by interleaving, on alternate clock cycles using the same datapath hardware, the calculation of higher order coefficients along with that of the first-stage coefficients. The resulting hardware utilization exceeds 90% in the typical case of a five-stage 1-D DWT operating on 1024 samples. The 1-D dual scan architecture achieves 100% datapath hardware utilization by processing two independent data streams together using shared functional blocks. The recursive and dual scan architectures can be readily extended to the 2-D case. The 2-D recursive architecture is roughly 25% faster than conventional implementations, and it requires a buffer that stores only a few rows of the data array instead of a fixed fraction (typically 25% or more) of the entire array. The 2-D dual scan architecture processes the column and row transforms simultaneously, and the memory buffer size is comparable to existing architectures.
Author Hongyu Liao
Cockburn, B.F.
Mandal, M.Kr
Author_xml – sequence: 1
  surname: Hongyu Liao
  fullname: Hongyu Liao
  organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, Alta., Canada
– sequence: 2
  givenname: M.Kr
  surname: Mandal
  fullname: Mandal, M.Kr
  organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, Alta., Canada
– sequence: 3
  givenname: B.F.
  surname: Cockburn
  fullname: Cockburn, B.F.
  organization: Dept. of Electr. & Comput. Eng., Univ. of Alberta, Edmonton, Alta., Canada
BackLink http://pascal-francis.inist.fr/vibad/index.php?action=getRecordDetail&idt=15657174$$DView record in Pascal Francis
BookMark eNp9kUlLBDEUhIMouJ49eGkExUuP2ZM-ijsICip4C5nMi0Z60ppkFP-90REFQU_1Dl8V1KtVtBiHCAhtEjwiBHf7N9dXI4oxH2kqiRILaIV0nLSYK7lYbyxYK7S6W0arOT9iTDjv5Ao6O_Y-uACxNDa5h1DAlVmC3PghNaQ9amycNLRqH3wJ8b4d2wyT5tW-QA-lKcnGXNFpXkdL3vYZNr50Dd2eHN8cnrUXl6fnhwcXreNclnYMypMJ8xMnrZOeUuisE1RpLcbejR0I6EA7T5WXAoAD84p6q0UnlRRYsTW0O899SsPzDHIx05Ad9L2NMMyyoZpyRhiu4N6_IJGKUM35Z-b2L_RxmKVYaxitmSRaMVahnS_IZmd7X5u7kM1TClOb3gwRUiiieOXEnHNpyDmBNy4UW8IQ67NCbwg2H3uZupf52MvM96q-_V--7-g_HVtzRwCAH7qW0rRj7xEsoNo
CODEN ITPRED
CitedBy_id crossref_primary_10_1007_s00034_017_0555_0
crossref_primary_10_1109_TCE_2009_5174400
crossref_primary_10_1016_j_eswa_2008_09_057
crossref_primary_10_1109_TCSI_2007_897726
crossref_primary_10_1109_TSP_2007_900754
crossref_primary_10_1109_TIM_2009_2016370
crossref_primary_10_1109_TCSVT_2009_2020259
crossref_primary_10_1109_ACCESS_2024_3524084
crossref_primary_10_1016_j_ijleo_2021_167167
crossref_primary_10_1109_TCSII_2013_2277964
crossref_primary_10_1002_cta_2794
crossref_primary_10_1109_TCSII_2016_2584091
crossref_primary_10_3169_itej_63_1853
crossref_primary_10_1109_TSP_2011_2109953
crossref_primary_10_1049_iet_cds_2012_0398
crossref_primary_10_1109_TSP_2013_2274640
crossref_primary_10_1145_1167867_1167107
crossref_primary_10_1007_s00034_018_0775_y
crossref_primary_10_1007_s11554_017_0711_6
crossref_primary_10_1080_02533839_2011_577601
crossref_primary_10_1109_TVLSI_2025_3529690
crossref_primary_10_1016_j_sigpro_2006_10_001
crossref_primary_10_1007_s00034_022_02148_7
crossref_primary_10_1088_1757_899X_454_1_012051
crossref_primary_10_1007_s00034_016_0477_2
crossref_primary_10_1587_transele_E99_C_415
crossref_primary_10_1007_s11554_016_0656_1
crossref_primary_10_1007_s11265_019_01464_7
crossref_primary_10_1016_j_ijleo_2022_169398
crossref_primary_10_1007_s11265_009_0437_1
crossref_primary_10_1007_s11227_012_0790_x
crossref_primary_10_1016_j_asoc_2009_07_007
crossref_primary_10_1186_1687_5281_2014_47
crossref_primary_10_1007_s11042_020_10258_0
crossref_primary_10_1109_TCSII_2013_2268335
crossref_primary_10_1109_TCSVT_2012_2203745
crossref_primary_10_1186_1687_6180_2014_77
crossref_primary_10_3390_s24134243
crossref_primary_10_1007_s11265_009_0375_y
crossref_primary_10_1109_TITS_2020_2964410
crossref_primary_10_1109_TCSI_2011_2180432
crossref_primary_10_1109_TVLSI_2021_3079989
crossref_primary_10_1007_s11042_009_0371_z
crossref_primary_10_1109_TCSII_2012_2184369
crossref_primary_10_1002_cta_2736
crossref_primary_10_1016_j_jvcir_2016_03_014
crossref_primary_10_1109_TCSII_2007_892410
crossref_primary_10_1117_1_3558741
crossref_primary_10_1109_TCSII_2009_2015393
crossref_primary_10_1016_j_micpro_2021_104176
crossref_primary_10_1109_TIP_2007_891069
crossref_primary_10_1007_s11265_007_0155_5
crossref_primary_10_1007_s11554_023_01396_3
crossref_primary_10_1109_TCSII_2014_2319975
crossref_primary_10_1109_JSSC_2006_889368
crossref_primary_10_1109_TCSVT_2005_858610
crossref_primary_10_1049_iet_cdt_2013_0167
crossref_primary_10_1109_TC_2010_178
crossref_primary_10_1109_TCSII_2009_2035257
crossref_primary_10_1007_s11220_020_00317_z
crossref_primary_10_1109_TBCAS_2007_907557
crossref_primary_10_26634_jip_5_2_14606
crossref_primary_10_1109_TCSI_2014_2298283
crossref_primary_10_1049_iet_ipr_2012_0661
crossref_primary_10_1109_TCSVT_2005_860121
crossref_primary_10_1109_TCSVT_2007_903555
crossref_primary_10_1109_TSP_2006_872582
crossref_primary_10_1007_s00034_008_9068_1
crossref_primary_10_1049_iet_cds_2010_0259
crossref_primary_10_1109_TCSI_2012_2221171
Cites_doi 10.1109/92.238416
10.1007/BF02476026
10.1109/78.370630
10.1117/12.365890
10.1109/18.57199
10.1109/76.915359
10.1006/acha.1996.0012
10.1109/ccece.2002.1013084
10.1201/9781482290066-5
10.1175/1520-0477(1998)079<0061:APGTWA>2.0.CO;2
10.1109/92.544407
10.1109/78.992147
10.1109/ISCAS.2001.921103
10.1049/el:20020707
10.1006/acha.1996.0026
10.1109/34.192463
10.1006/acha.2000.0318
10.1049/el:19910110
ContentType Journal Article
Copyright 2004 INIST-CNRS
Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004
Copyright_xml – notice: 2004 INIST-CNRS
– notice: Copyright The Institute of Electrical and Electronics Engineers, Inc. (IEEE) 2004
DBID RIA
RIE
AAYXX
CITATION
IQODW
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
DOI 10.1109/TSP.2004.826175
DatabaseName IEEE All-Society Periodicals Package (ASPP) 1998–Present
IEEE Electronic Library (IEL)
CrossRef
Pascal-Francis
Computer and Information Systems Abstracts
Electronics & Communications Abstracts
Technology Research Database
ProQuest Computer Science Collection
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts – Academic
Computer and Information Systems Abstracts Professional
ANTE: Abstracts in New Technology & Engineering
Engineering Research Database
DatabaseTitle CrossRef
Technology Research Database
Computer and Information Systems Abstracts – Academic
Electronics & Communications Abstracts
ProQuest Computer Science Collection
Computer and Information Systems Abstracts
Advanced Technologies Database with Aerospace
Computer and Information Systems Abstracts Professional
Engineering Research Database
ANTE: Abstracts in New Technology & Engineering
DatabaseTitleList Technology Research Database

Technology Research Database
Computer and Information Systems Abstracts
Database_xml – sequence: 1
  dbid: RIE
  name: IEEE Electronic Library (IEL)
  url: https://ieeexplore.ieee.org/
  sourceTypes: Publisher
DeliveryMethod fulltext_linktorsrc
Discipline Engineering
Applied Sciences
Architecture
EISSN 1941-0476
EndPage 1326
ExternalDocumentID 2426538751
15657174
10_1109_TSP_2004_826175
1284829
Genre orig-research
GroupedDBID -~X
.DC
0R~
29I
3EH
4.4
53G
5GY
5VS
6IK
85S
97E
AAJGR
AARMG
AASAJ
AAWTH
ABAZT
ABFSI
ABQJQ
ABVLG
ACGFO
ACIWK
ACKIV
ACNCT
AENEX
AETIX
AGQYO
AGSQL
AHBIQ
AI.
AIBXA
AJQPL
AKJIK
AKQYR
ALLEH
ALMA_UNASSIGNED_HOLDINGS
ASUFR
ATWAV
BEFXN
BFFAM
BGNUA
BKEBE
BPEOZ
CS3
E.L
EBS
EJD
F5P
HZ~
H~9
ICLAB
IFIPE
IFJZH
IPLJI
JAVBF
LAI
MS~
O9-
OCL
P2P
RIA
RIE
RNS
TAE
TN5
VH1
AAYXX
CITATION
IQODW
RIG
7SC
7SP
8FD
JQ2
L7M
L~C
L~D
F28
FR3
ID FETCH-LOGICAL-c446t-be7f1d3fdc6ac6f22e9ac527885bfcbce5e9e8cf27f65ee4e3f72fa8596765073
IEDL.DBID RIE
ISICitedReferencesCount 127
ISICitedReferencesURI http://www.webofscience.com/api/gateway?GWVersion=2&SrcApp=Summon&SrcAuth=ProQuest&DestLinkType=CitingArticles&DestApp=WOS_CPL&KeyUT=000220808600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
ISSN 1053-587X
IngestDate Sun Sep 28 11:41:44 EDT 2025
Sun Sep 28 02:40:20 EDT 2025
Fri Jul 25 18:52:27 EDT 2025
Mon Jul 21 09:16:22 EDT 2025
Tue Nov 18 22:24:38 EST 2025
Sat Nov 29 08:03:51 EST 2025
Tue Aug 26 16:39:50 EDT 2025
IsPeerReviewed true
IsScholarly true
Issue 5
Keywords Discrete wavelet transform
recursive architecture
Data processing
Two dimensional model
Buffer memory
Buffer system
Discrete wavelet transforms
Clock
Computational complexity
Implementation
lifting scheme
Wavelets
Wavelet transformation
Recursive method
Signal processing
dual scan architecture
Signal analysis
Language English
License https://ieeexplore.ieee.org/Xplorehelp/downloads/license-information/IEEE.html
CC BY 4.0
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c446t-be7f1d3fdc6ac6f22e9ac527885bfcbce5e9e8cf27f65ee4e3f72fa8596765073
Notes ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-1
ObjectType-Feature-2
content type line 23
PQID 883618733
PQPubID 23500
PageCount 12
ParticipantIDs crossref_citationtrail_10_1109_TSP_2004_826175
proquest_miscellaneous_1671284407
ieee_primary_1284829
pascalfrancis_primary_15657174
proquest_journals_883618733
crossref_primary_10_1109_TSP_2004_826175
proquest_miscellaneous_28243130
PublicationCentury 2000
PublicationDate 2004-05-01
PublicationDateYYYYMMDD 2004-05-01
PublicationDate_xml – month: 05
  year: 2004
  text: 2004-05-01
  day: 01
PublicationDecade 2000
PublicationPlace New York, NY
PublicationPlace_xml – name: New York, NY
– name: New York
PublicationTitle IEEE transactions on signal processing
PublicationTitleAbbrev TSP
PublicationYear 2004
Publisher IEEE
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher_xml – name: IEEE
– name: Institute of Electrical and Electronics Engineers
– name: The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
References ref13
ref12
ref15
ref14
ref20
ref11
ref2
ref1
(ref3) 2000
ref17
ref16
ref19
ref18
ref8
ref7
ref9
ref4
ref6
ref5
Sweldens (ref10) 1998; 4
References_xml – ident: ref6
  doi: 10.1109/92.238416
– ident: ref12
  doi: 10.1007/BF02476026
– ident: ref7
  doi: 10.1109/78.370630
– ident: ref14
  doi: 10.1117/12.365890
– ident: ref1
  doi: 10.1109/18.57199
– ident: ref9
  doi: 10.1109/76.915359
– ident: ref11
  doi: 10.1006/acha.1996.0012
– ident: ref18
  doi: 10.1109/ccece.2002.1013084
– ident: ref19
  doi: 10.1201/9781482290066-5
– ident: ref2
  doi: 10.1175/1520-0477(1998)079<0061:APGTWA>2.0.CO;2
– volume-title: JPEG2000 Part II Final Committee Draft
  year: 2000
  ident: ref3
– ident: ref8
  doi: 10.1109/92.544407
– ident: ref13
  doi: 10.1109/78.992147
– ident: ref15
  doi: 10.1109/ISCAS.2001.921103
– ident: ref17
  doi: 10.1049/el:20020707
– volume: 4
  start-page: 247
  year: 1998
  ident: ref10
  article-title: The lifting scheme: A new philosophy in biorthogonal wavelet construction
  publication-title: J. Fourier Anal. Appl.
– ident: ref16
  doi: 10.1006/acha.1996.0026
– ident: ref4
  doi: 10.1109/34.192463
– ident: ref20
  doi: 10.1006/acha.2000.0318
– ident: ref5
  doi: 10.1049/el:19910110
SSID ssj0014496
Score 2.2178655
Snippet The lifting scheme reduces the computational complexity of the discrete wavelet transform (DWT) by factoring the wavelet filters into cascades of simple...
SourceID proquest
pascalfrancis
crossref
ieee
SourceType Aggregation Database
Index Database
Enrichment Source
Publisher
StartPage 1315
SubjectTerms Applied sciences
Architecture
Arrays
Buffers
Clocks
Computational complexity
Computer architecture
Discrete wavelet transforms
Exact sciences and technology
Filters
Hardware
Hoisting
Information, signal and communications theory
Interleaved codes
Recursive
Signal and communications theory
Signal representation. Spectral analysis
Signal, noise
Studies
Telecommunications and information theory
Two dimensional displays
Utilization
Wavelet
Wavelet coefficients
Wavelet transforms
Title Efficient architectures for 1-D and 2-D lifting-based wavelet transforms
URI https://ieeexplore.ieee.org/document/1284829
https://www.proquest.com/docview/883618733
https://www.proquest.com/docview/1671284407
https://www.proquest.com/docview/28243130
Volume 52
WOSCitedRecordID wos000220808600017&url=https%3A%2F%2Fcvtisr.summon.serialssolutions.com%2F%23%21%2Fsearch%3Fho%3Df%26include.ft.matches%3Dt%26l%3Dnull%26q%3D
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
journalDatabaseRights – providerCode: PRVIEE
  databaseName: IEEE Electronic Library (IEL)
  customDbUrl:
  eissn: 1941-0476
  dateEnd: 99991231
  omitProxy: false
  ssIdentifier: ssj0014496
  issn: 1053-587X
  databaseCode: RIE
  dateStart: 19910101
  isFulltext: true
  titleUrlDefault: https://ieeexplore.ieee.org/
  providerName: IEEE
link http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1LT9wwEB4B6qE9FAqtGl51JQ491Etix7F9RBTEoUJIBbS3yLHHEhLKIpKFv4_tZBdQy6GnRPJYsWb8mC8z_gbgwPFGCCsNRW0sLSvuqVa5o8xhXhhbKp3Inq9_y_NzNZ3qixX4ubwLg4gp-Qwn8TXF8t3MzuOvssO4lyqmV2FVymq4q7WMGJRlqsUV3AVOhZLTkcanyPXh5Z-LBAQnKtKPi1cnUCqpEhMiTRd04odiFn_ty-mwOV3_v2FuwMfRqSRHwyz4BCvYbsKHF1SDW3B2krgiQkfyMnbQkeC0koL-IqZ1hIXn7Y2PmdA0Hm-OPJpYmKIn_cK_7T7D1enJ5fEZHasoUBugXk8blL5w3DtbGVt5xqJVBAvQVzTeNhYFalTWM-krgVgi95J5o4SuZHDfJP8Ca-2sxa9AMGeWWRWDp7wUKLXPBbMBYbHcGseaDCYLzdZ2pBiPlS5u6wQ1cl0HU8TCl2U9mCKDH8sOdwO7xtuiW1HTz2KDkjPYf2W65_YYzw1wK4OdhS3rcXl2tVK8KpTkPIPvy9awrmKwxLQ4m3d1Ucn4iYB3M_j2hkyAq8H_4vn2v8e2A--HPJ-YHrkLa_39HPfgnX3ob7r7_TR9nwD0se2q
linkProvider IEEE
linkToHtml http://cvtisr.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwlV1Lb9QwEB6VggQceLWIUGiNxIED3iZ2HNtHBK0WsawqsaC9RY49lipVWdRk4e9jO9ltK-iBUyJ5rFgzfsyXGX8D8NbxRggrDUVtLC0r7qlWuaPMYV4YWyqdyJ5_zOR8rpZLfbYD77d3YRAxJZ_hJL6mWL5b2XX8VXYc91LF9B24K8qS5cNtrW3MoCxTNa7gMHAqlFyORD5Fro8X384SFJyoSEAubpxBqahKTIk0XdCKH8pZ_LUzp-Pm9PH_DfQJPBrdSvJhmAdPYQfbZ_DwGtngHkxPEltE6EiuRw86EtxWUtBPxLSOsPC8OPcxF5rGA86R3yaWpuhJv_Fwu334fnqy-DilYx0FagPY62mD0heOe2crYyvPWLSLYAH8isbbxqJAjcp6Jn0lEEvkXjJvlNCVDA6c5M9ht121-AII5swyq2L4lJcCpfa5YDZgLJZb41iTwWSj2dqOJOOx1sVFncBGrutgilj6sqwHU2Twbtvh58CvcbvoXtT0ldig5AwOb5juqj1GdAPgyuBgY8t6XKBdrRSvCiU5z-DNtjWsrBguMS2u1l1dVDJ-IiDeDI5ukQmANXhgPH_577Edwf3p4uusnn2efzmAB0PWT0yWfAW7_eUaX8M9-6s_7y4P01T-A3OR8PE
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Efficient+architectures+for+1-D+and+2-D+lifting-based+wavelet+transforms&rft.jtitle=IEEE+transactions+on+signal+processing&rft.au=Liao%2C+Hongyu&rft.au=Mandal%2C+MKr&rft.au=Cockburn%2C+B+F&rft.date=2004-05-01&rft.issn=1053-587X&rft.volume=52&rft.issue=5&rft_id=info:doi/10.1109%2FTSP.2004.826175&rft.externalDBID=NO_FULL_TEXT
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=1053-587X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=1053-587X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=1053-587X&client=summon