Muutke küpsiste eelistusi

E-raamat: Vlsi Design Of Wavelet Transform: Analysis, Architecture, And Design Examples

(Nat'l Taiwan Univ, Taiwan), (Nat'l Taiwan Univ, Taiwan), (Nat'l Taiwan Univ, Taiwan), (Nat'l Taiwan Univ, Taiwan)
  • Formaat: 300 pages
  • Ilmumisaeg: 09-Dec-2006
  • Kirjastus: Imperial College Press
  • Keel: eng
  • ISBN-13: 9781911299264
Teised raamatud teemal:
  • Formaat - PDF+DRM
  • Hind: 37,44 €*
  • * hind on lõplik, st. muud allahindlused enam ei rakendu
  • Lisa ostukorvi
  • Lisa soovinimekirja
  • See e-raamat on mõeldud ainult isiklikuks kasutamiseks. E-raamatuid ei saa tagastada.
Vlsi Design Of Wavelet Transform: Analysis, Architecture, And Design ExamplesSuurem pilt
  • Formaat: 300 pages
  • Ilmumisaeg: 09-Dec-2006
  • Kirjastus: Imperial College Press
  • Keel: eng
  • ISBN-13: 9781911299264
Teised raamatud teemal:

DRM piirangud

  • Kopeerimine (copy/paste):

    ei ole lubatud

  • Printimine:

    ei ole lubatud

  • Kasutamine:

    Digitaalõiguste kaitse (DRM)
    Kirjastus on väljastanud selle e-raamatu krüpteeritud kujul, mis tähendab, et selle lugemiseks peate installeerima spetsiaalse tarkvara. Samuti peate looma endale  Adobe ID Rohkem infot siin. E-raamatut saab lugeda 1 kasutaja ning alla laadida kuni 6'de seadmesse (kõik autoriseeritud sama Adobe ID-ga).

    Vajalik tarkvara
    Mobiilsetes seadmetes (telefon või tahvelarvuti) lugemiseks peate installeerima selle tasuta rakenduse: PocketBook Reader (iOS / Android)

    PC või Mac seadmes lugemiseks peate installima Adobe Digital Editionsi (Seeon tasuta rakendus spetsiaalselt e-raamatute lugemiseks. Seda ei tohi segamini ajada Adober Reader'iga, mis tõenäoliselt on juba teie arvutisse installeeritud )

    Seda e-raamatut ei saa lugeda Amazon Kindle's. 

Discrete wavelet transforms (DWTs) have led the revolutions in image and video coding systems over the past decade. In this book, the DWT is presented from the VLSI design perspective, and the related theories, algorithms, and architectures are discussed for 1D, 2D, and 3D DWT.The book provides a comprehensive analysis and discussion of DWTs and their applications including important materials and the newest developments in wavelet processing. For example, the architecture designs of 2D DWT in JPEG 2000 and the development of motion-compensated temporal filtering (MCTF) are explored.
Preface vii
1. Introduction 1
1.1 Trends in Image Coding Algorithm
1
1.1.1 DCT-based block coding
1
1.1.2 DWT-based bit-plane coding
2
1.2 Trends in Video Coding Algorithm
4
1.2.1 Close-loop motion-compensated prediction
4
1.2.2 Open-loop motion-compensated temporal filtering
5
1.3 VLSI Design Consideration of Multimedia Systems
7
1.3.1 System design consideration
7
1.3.1.1 Computation analysis
7
1.3.1.2 Data access analysis
8
1.3.2 Module design consideration
10
1.4 Book Outline
10
2. Algorithm Views of Discrete Wavelet Transform 13
2.1 Basic Theoretical View of Discrete Wavelet Transform
13
2.1.1 Properties of a multi-resolution transform
13
2.1.2 The pyramid structure of discrete multi-resolution representation
15
2.1.3 The wavelet decomposition
17
2.1.4 The pyramid structure of computing wavelet transform
20
2.1.5 Inverse wavelet transform
22
2.1.6 2-D wavelet transform
25
2.2 Polyphase decomposition
27
2.3 Lifting Scheme
31
2.3.1 Lifting steps for wavelet transform
32
2.3.2 The Euclidean algorithm
34
2.3.3 The lifting factorization algorithm
36
2.4 B-spline formulation
42
2.5 Classification of 1-D DWT Algorithms
44
2.6 Algorithms of 2-D DWT
45
2.7 Image Coding Using 2-D DWT
48
3. Architectures of One-Dimensional DWT 53
3.1 Convolution-Based Architectures
53
3.2 Lifting-Based Architectures
54
3.2.1 Direct implementation of lifting scheme
55
3.2.2 Flipping structure
59
3.2.3 Design example of JPEG 2000 default (9,7) filter
61
3.2.4 Design example of integer (9,7) filter
64
3.2.5 Design example of linear (6,10) filter
66
3.3 B-Spline-Based Architectures
67
3.3.1 B-spline factorized architectures for DWT and IDWT
67
3.3.2 Implementation methods of B-spline part
71
3.3.2.1 Direct implementation of B-spline part
71
3.3.2.2 Pascal implementation of B-spline part
72
3.3.3 Design example of JPEG 2000 default (9,7) DWT filter
72
3.3.4 DWT with linear (6,10) filter
75
3.3.4.1 Comparison
75
3.3.4.2 Detailed gate count comparison
78
3.3.5 Design example of linear (10,18) DWT filter
79
3.3.6 Design example of linear (10,18) IDWT filter
81
3.4 General Performance Analysis
82
3.4.1 Multipliers and adders
85
3.4.2 Critical path and registers
86
3.4.3 Summary
87
3.5 Wordlength Analysis in Single-Level 1-D DWT
87
3.5.1 Dynamic range analysis for single-level 1-D DWT
89
3.5.1.1 Dynamic range analysis for the output of cascaded FIR, filters
90
3.5.1.2 Dynamic range analysis for single level 1-D DWT
90
3.5.2 Round-off noise analysis basics for single level 1-D DWT
91
4 Architectures of Two-Dimensional DWT 95
4.1 Introduction
95
4.2 Frame Memory Scan Methods
96
4.2.1 Direct scan
96
4.2.2 Row-column-column-row scan
97
4.2.3 Line-based scan
98
4.2.3.1 Data flow for data buffer of size 1.5N
101
4.2.4 Complete data flow for data buffer of size (1 + (1/2)k)N
103
4.2.4.1 1-level line-based architecture
103
4.2.4.2 Multi-level line-based architecture
106
4.2.5 Non-overlapped and overlapped block-based scans
107
4.2.6 Non-overlapped and overlapped stripe-based scans
109
4.2.7 Comparison of scan methods for 1-level 2-D DWT architectures
109
4.2.8 Summary
110
4.3 Line-Based Architecture
112
4.3.1 Systolic-parallel and parallel-parallel architectures
112
4.3.2 Wu's architecture
113
4.3.3 Generic 1-level line-based architecture
113
4.3.4 Generic multi-level line-based architecture
115
4.3.4.1 Adopting two 1-D DWT modules (2DWTM)
116
4.3.4.2 Adopting three 1-D DWT modules (3DWTM)
117
4.3.5 Comparison
119
4.3.5.1 General case
119
4.3.5.2 JPEG 2000 default (9,7) filter
120
4.4 Line Buffer Wordlength Analysis for Line-Based 2-D DWT
120
4.4.1 Background to wordlength analysis in line-based DWT
122
4.4.2 The dynamic range analysis methodology
124
4.4.2.1 Dynamic range analysis of FIR filters
124
4.4.2.2 LL-band dynamic range analysis
124
4.4.2.3 Single level dynamic range analysis
126
4.4.2.4 The combined dynamic range analysis methodology
126
4.4.3 The round-off error analysis methodology
128
4.4.3.1 Model of round-off operations
128
4.4.3.2 Noise power model of single-level 1-D DWT
128
4.4.3.3 Noise power model of multi-level 2-D DWT
129
4.4.3.4 Noise power analysis in reconstructed image
129
4.4.3.5 Summary of round-off-error analysis
130
4.4.4 Experimental results
130
4.4.5 Summary of wordlength analysis
132
4.5 On-Chip Memory Implementation Issues
132
4.5.1 Overview
133
4.5.2 Schemes to reduce memory bandwidth
133
4.5.2.1 Reducing average memory bandwidth using parallel processing
134
4.5.2.2 Two-lifting scheme
135
4.5.2.3 N-lifting scheme
136
4.5.3 The M-scan for multiple-lifting scheme
138
4.5.3.1 M-scan for two-lifting scheme
138
4.5.3.2 M-scan for N-lifting scheme
139
4.5.4 Experimental results
141
4.5.5 Summary
142
5. Practical Design Examples of 2-D DWT: JPEG 2000 Encoder Systems 143
5.1 Introduction to JPEG 2000 Algorithm
143
5.1.1 Coding system overview
144
5.1.2 Discrete wavelet transform
145
5.1.2.1 5-3 reversible filter
146
5.1.2.2 9-7 irreversible filter
146
5.1.3 Embedded block coding
147
5.1.4 Rate-distortion optimization
149
5.1.5 Coding efficiency of JPEG 2000
151
5.2 Design Issues of JPEG 2000 Encoding Systems
155
5.2.1 Discrete wavelet transform
156
5.2.2 Embedded block coding
157
5.2.3 Rate-distortion optimization
157
5.3 Tile Pipelined Scheme and the Corresponding DWT Architecture
158
5.3.1 Preliminary
158
5.3.2 System architecture
159
5.3.3 Discrete wavelet transform
160
5.3.4 Embedded block coding
161
5.3.5 Scheduling
162
5.3.6 Experimental results
164
5.3.6.1 Performance and chip feature
164
5.3.6.2 Comparisons
166
5.3.7 Summary
166
5.4 Stripe Pipelined Scheme and the Corresponding DWT Architecture
167
5.4.1 Preliminary
168
5.4.2 System architecture
169
5.4.2.1 Stripe pipeline scheme
170
5.4.2.2 Level switch DWT
171
5.4.2.3 Memory requirement for LS-DWT
174
5.4.2.4 Code-block switch EBC
175
5.4.3 Experimental results
176
5.4.3.1 Memory reduction
176
5.4.3.2 Comparison
177
5.4.4 Summary
178
5.5 Summary
178
6. Introduction to MCTF 181
6.1 Convolution-Based MCTF
181
6.2 Lifting-Based MCTF
183
6.3 5/3 MCTF and 1/3 MCTF
185
6.3.1 Prediction stage
185
6.3.2 Update stage
187
6.3.3 Multi-level MCTF
188
6.4 Different MCTF Schemes with DWT for Video Coding
188
6.4.1 Multi-level MCTF scheme
189
6.4.2 In-band MCTF scheme
192
6.4.3 Hybrid MCTF scheme
193
6.5 Pyramid MCTF with DCT for Video Coding
194
6.6 Scalable Video Coding
197
7. Introduction to Motion Estimation 201
7.1 The Concept of Motion Estimation and Compensation
201
7.2 Block Matching Algorithm
202
7.2.1 Full search algorithm
204
7.2.2 Fast full search algorithm
205
7.2.2.1 Partial distortion elimination
205
7.2.2.2 Successive elimination algorithm
206
7.2.3 Fast search algorithm
207
7.2.3.1 Simplification of matching criterion
207
7.2.3.2 Reduction on search candidates
208
7.2.3.3 Predictive search
211
7.2.3.4 Hierarchical search
212
7.2.4 Summary
213
7.3 Architecture of Motion Estimation
214
7.3.1 Architecture for full search algorithm
215
7.3.1.1 Inter-level architecture
215
7.3.1.2 Intra-level architecture
218
7.3.1.3 Summary
220
7.3.2 Architecture for fast full search and fast search algorithms
220
7.3.2.1 Tree-based architecture
221
7.3.2.2 Architecture for diamond search
224
7.3.2.3 Architecture for three step search
224
7.3.2.4 Summary
225
7.3.3 Block-level data re-use scheme
225
7.3.3.1 Redundancy access factor
226
7.3.3.2 Level A scheme
227
7.3.3.3 Level B scheme
227
7.3.3.4 Level C scheme
228
7.3.3.5 Level D scheme
229
7.3.3.6 Level C+ scheme
229
7.3.3.7 Comparison
232
7.4 Summary
232
8. Analysis and Architecture of MCTF 235
8.1 Memory Access in MCTF
235
8.1.1 Redundancy access factor for ME
236
8.1.2 Redundancy access factor for MC
237
8.2 One-Level Motion Compensated Temporal Filtering
239
8.2.1 The architecture for MCTF
239
8.2.2 Memory analysis for prediction stage
240
8.2.2.1 Direct implementation
240
8.2.2.2 Double Reference Frames (DRF)
241
8.2.2.3 Double Current Frames (DCF)
242
8.2.2.4 Modified Double Current Frames (m-DCF)
243
8.2.2.5 Comparison
244
8.2.2.6 Extension
246
8.2.3 Memory analysis for update stage
249
8.2.4 Memory analysis of one-level MCTF
250
8.3 Multi-Level Motion-Compensated Temporal Filtering
252
8.3.1 The preconditions of multi-level MCTF
252
8.3.1.1 Decomposition level
252
8.3.1.2 Inter-coding for L-frames
254
8.3.1.3 Update stage
254
8.3.2 Analysis of multi-level MCTF
256
8.3.2.1 Computational complexity
256
8.3.2.2 External memory access
257
8.3.2.3 External memory size
257
8.3.2.4 Coding delay
258
8.4 Case Study
261
8.5 Rate-Distortion-Computation Scalability
262
8.6 Analysis of Pyramid MCTF
264
8.6.1 Computation complexity
265
8.6.2 Memory bandwidth
266
8.6.3 External memory storage
266
8.6.4 Summary
267
8.7 Conclusion
267
Bibliography 269
Index 281


Lisainfo e-raamatute kohta Lisainfo e-raamatute kohta
Püsilink: https://www.kriso.ee/db/97819112992642e.html