Finite Precision Error Modeling and Analysis

Discrete wavelet transforms (DWTs) have excellent energy compaction characteristics and are able to provide near perfect reconstruction (PR). They are ideal for signal/image analysis and encoding. Hardware implementation of DWT is fast and area efficient in fixed-point arithmetic. DWT encoding has b...

Full description

Saved in:
Bibliographic Details
Published inEfficient Algorithms for Discrete Wavelet Transform pp. 37 - 49
Main Authors Shukla, K. K., Tiwari, Arvind K.
Format Reference Book Chapter
LanguageEnglish
Published London Springer London 2013
SeriesSpringerBriefs in Computer Science
Subjects
Online AccessGet full text
ISBN1447149408
9781447149408
ISSN2191-5768
2191-5776
DOI10.1007/978-1-4471-4941-5_3

Cover

Abstract Discrete wavelet transforms (DWTs) have excellent energy compaction characteristics and are able to provide near perfect reconstruction (PR). They are ideal for signal/image analysis and encoding. Hardware implementation of DWT is fast and area efficient in fixed-point arithmetic. DWT encoding has been drawing much attention because of its ability to decompose signals into a hierarchical structure that is suitable for adaptive processing in the transform domain. In existing architectural designs for the DWT, little consideration has been given to word size and precision. Present chapter addresses this problem, showing how the word size requirements can be calculated for a specific problem (based on the range of input data and wavelet used). A simplified, statistical model is proposed. As the depth of the DWT filtering increases, the data word length requirement increases. It is important to investigate how this can affect the potential of the resulting hardware implementation of DWT. The issue has been analyzed for both pyramid structure DWT and parallel filter DWT. The organization of this chapter is as follows. Section 3.1 presents background material related to subject. Section 3.2 presents in brief the computational complexity of DWT. Section 3.3 presents finite precision modeling of two-channel PR filter bank in moderate detail, including modeling of quantized coefficient filters. Section 3.4 presents the proposed statistical modeling of DWT to study the effects of finite word length implementation. This includes construction of new DWT filters to accommodate round-off errors followed by corresponding mathematical derivation.
AbstractList Discrete wavelet transforms (DWTs) have excellent energy compaction characteristics and are able to provide near perfect reconstruction (PR). They are ideal for signal/image analysis and encoding. Hardware implementation of DWT is fast and area efficient in fixed-point arithmetic. DWT encoding has been drawing much attention because of its ability to decompose signals into a hierarchical structure that is suitable for adaptive processing in the transform domain. In existing architectural designs for the DWT, little consideration has been given to word size and precision. Present chapter addresses this problem, showing how the word size requirements can be calculated for a specific problem (based on the range of input data and wavelet used). A simplified, statistical model is proposed. As the depth of the DWT filtering increases, the data word length requirement increases. It is important to investigate how this can affect the potential of the resulting hardware implementation of DWT. The issue has been analyzed for both pyramid structure DWT and parallel filter DWT. The organization of this chapter is as follows. Section 3.1 presents background material related to subject. Section 3.2 presents in brief the computational complexity of DWT. Section 3.3 presents finite precision modeling of two-channel PR filter bank in moderate detail, including modeling of quantized coefficient filters. Section 3.4 presents the proposed statistical modeling of DWT to study the effects of finite word length implementation. This includes construction of new DWT filters to accommodate round-off errors followed by corresponding mathematical derivation.
Author Tiwari, Arvind K.
Shukla, K. K.
Author_xml – sequence: 1
  givenname: K. K.
  surname: Shukla
  fullname: Shukla, K. K.
  email: kkshukla.cse@iitbhu.ac.in
– sequence: 2
  givenname: Arvind K.
  surname: Tiwari
  fullname: Tiwari, Arvind K.
BookMark eNpFUEFOwzAQNFAk2tIPwCUPIOCNHWdzrKoWkIrgAGfLie3IEDnIRkj8HlutYA-72hnNamcWZOYnbwi5BnoLlDZ3bYMllJw3qbUcylqyE7KADORdnJJ5BW3Cm0ac_RMUZ3-EwAuyivGdpsIGkVZzcrNz3n2Z4iWY3kU3-WIbwhSKp0mb0fmhUF4Xa6_Gn-jiJTm3aoxmdZxL8rbbvm4eyv3z_eNmvS8HYMBK5KarlO54bXtmdK8EtcYg1JSBBVtpVXPOQVsrdI2c15z2qAUKitgLq9iSwOFu_AzpBxNkN00fUQKVOQuZspAgs0OZvcuURdJcHTSDGo38DqMUAiFbBcp-AVyjVbU
ContentType Reference
Book Chapter
Copyright K. K. Shukla 2013
Copyright_xml – notice: K. K. Shukla 2013
DOI 10.1007/978-1-4471-4941-5_3
DatabaseTitleList
DeliveryMethod fulltext_linktorsrc
Discipline Applied Sciences
Engineering
Computer Science
EISBN 1447149416
9781447149415
EISSN 2191-5776
EndPage 49
ExternalDocumentID CX6681000010
GroupedDBID -EI
-JY
-K2
089
0D6
0DA
38.
A4J
AABBV
AALIM
AARVG
AAUBL
AAWHR
ABFTD
ABMLC
ABMNI
ACBPT
AEJLV
AEKFX
AETDV
AEZAY
AFJMS
ALMA_UNASSIGNED_HOLDINGS
ARZOH
AZZ
BBABE
CZZ
EFU
I4C
IEZ
MA.
MYL
SBO
TPJZQ
UZ6
WZT
Z5O
Z7R
Z7S
Z7U
Z7W
Z7X
Z7Y
Z7Z
Z81
Z82
Z83
Z84
Z85
Z87
Z88
ID FETCH-LOGICAL-g1313-84eb2adb45fc3edca60fee815031f1f2da54441dff6d5844540c8d686088c6fa3
ISBN 1447149408
9781447149408
ISSN 2191-5768
IngestDate Tue Jul 29 20:33:17 EDT 2025
Thu Aug 14 15:57:59 EDT 2025
IsPeerReviewed false
IsScholarly false
Language English
LinkModel OpenURL
MergedId FETCHMERGED-LOGICAL-g1313-84eb2adb45fc3edca60fee815031f1f2da54441dff6d5844540c8d686088c6fa3
PageCount 13
ParticipantIDs springer_books_10_1007_978_1_4471_4941_5_3
gale_vrl_6681000010
PublicationCentury 2000
PublicationDate 20130000
20130125
PublicationDateYYYYMMDD 2013-01-01
2013-01-25
PublicationDate_xml – year: 2013
  text: 20130000
PublicationDecade 2010
PublicationPlace London
PublicationPlace_xml – name: London
PublicationSeriesTitle SpringerBriefs in Computer Science
PublicationSeriesTitleAlternate SpringerBriefs Computer Sci.
PublicationSubtitle With Applications to Denoising and Fuzzy Inference Systems
PublicationTitle Efficient Algorithms for Discrete Wavelet Transform
PublicationYear 2013
Publisher Springer London
Publisher_xml – name: Springer London
SSID ssj0000878802
ssj0000602596
Score 1.4087752
Snippet Discrete wavelet transforms (DWTs) have excellent energy compaction characteristics and are able to provide near perfect reconstruction (PR). They are ideal...
SourceID springer
gale
SourceType Publisher
StartPage 37
SubjectTerms DWT
Error modeling
Round-off noise
Title Finite Precision Error Modeling and Analysis
URI http://link.springer.com/10.1007/978-1-4471-4941-5_3
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV1NT9tAEF214dByKU2poBTkAyeoke1dr51jRIkQajnxkdtqP2mkKJESB4n8emZsr21KLnCxLB_G8pvVzJv1zhtCjgdKQVLhOhwwqUKWJXCX6izUqeGJ41Rpjo3Cf6_55S27Gqfjdrxl2V1SqDO93thX8h6vwjPwK3bJvsGzjVF4APfgX7iCh-H6H_l9uc06qXWHJ2U34-lw-jCHGv9fpa2AgppABQt7ei9xqkRRCZgjOS3r_3vceR12_lsj_fxtZ_PJ0jcsjlbr9ROEDq9B25U1r5fXaIJkFU9wVDN6IKAu4N04Wm3qzXjBk-7OAk55aHYWfIEJ5VYGNRSL006Qq1Ra6nRZCY6-CsTt2QsoUcFGiEbCVNA27zSnAc_HHFXRkG5GH8kWMK406pGt4cXVn7tmvyzKoVjHw1gHvvtxg_E2r778q12ShZsd8qlR7_1KPthZn3ypuX5QR9Jln2x3hCC_kV8VnEEDZ1DCGXg4A4Az8HDuktvRxc35ZVjPsQgfYgqw5syqRBrFUqepNVryyFmbw1fS2MUuMTJlwEqNc9wAH0RNRJ0bnnPIAJo7Sb-T3mw-s3skoM7oyDGdMEmZyTKZaeuoiiOjB5I7tU_6CIB4XExFC-o-OfF4CFyvS-HFqgFDEQvEUCCGAjD8sdHEAfncLpGfpFcsVvYQ6FihjmpPPQP6rzHh
linkProvider Library Specific Holdings
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%3Abook&rft.genre=bookitem&rft.title=Efficient+Algorithms+for+Discrete+Wavelet+Transform+%3A+With+Applications+to+Denoising+and+Fuzzy+Inference+Systems&rft.atitle=Finite+Precision+Error+Modeling+and+Analysis&rft.date=2013-01-01&rft.isbn=9781447149415&rft.spage=37&rft.epage=49&rft_id=info:doi/10.1007%2F978-1-4471-4941-5_3&rft.externalDocID=CX6681000010
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=2191-5768&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=2191-5768&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=2191-5768&client=summon