VLSI Implementation & Analysis of Block Based Compression Algorithms

VLSI Implementation & Analysis of Block Based Compression Algorithms

EnglishPaperback / softbackPrint on demand
Kumaran, Muthu
Scholar's Press
EAN: 9783330652040
Print on demand
Delivery on Friday, 14. of August 2026
CZK 1,214
Common price CZK 1,349
Discount 10%
pc
Do you want this product today?
Megabooks Praha Korunní
not available
Librairie Francophone Praha Štěpánská
not available
Megabooks Ostrava
not available
Megabooks Olomouc
not available
Megabooks Plzeň
not available
Megabooks Brno
not available
Megabooks Hradec Králové
not available
Megabooks České Budějovice
not available
Megabooks Liberec
not available

Detailed information

The VLSI Implementation and Analysis of Block Based Compression Algorithm is used to analyse the images within each pixel before the storage space processes and therefore the size of the memory gets reduced. Here, differential values are captured and quantized, then the differential coding scheme uses the concept of selecting the brightest pixel as the reference pixel. The difference between brightest pixel and successive pixel is calculated and quantized. Hence, their range is compressed and the spatial redundancy can be removed using BBC algorithm. Thus, the proposed scheme reduces the accumulation of error and also reduces the requirement of memory. Thus, the Peak Signal to Noise Ratio value can be improved and Bits per Pixel value can be reduced. This is created for any given input image and thus the input image may be of any form. After that the image is converted into the binary form or header file conversion and these files are implemented into Xilinx Platform Studio and analyzed.
EAN 9783330652040
ISBN 3330652047
Binding Paperback / softback
Publisher Scholar's Press
Pages 52
Language English
Dimensions 220 x 150
Authors Kumaran, Muthu
Manufacturer information
The manufacturer's contact information is currently not available online, we are working intensively on the axle. If you need information, write us on [email protected], we will be happy to provide it.