Please use this identifier to cite or link to this item:
|Title:||A HIGH PERFORMANCE DATA COMPRESSION SCHEME|
|Keywords:||DATA MANAGEMENT;G3 CODEING;COMPRESSION;ELECTRONICS AND COMPUTER ENGINEERING|
|Abstract:||Advent of new definitions of signals and data like graphics, multimedia etc. have considerably augmented the pressure on data handling. Since a large data always exerts the pressure on transmission and storage both, there remains a severe need of efficient data compression technique. Viewing on to the growing need, various schemes of data compression have been suggested and implemented. A large class of these schemes rely on variable block coding which works well but on the down side gives negative compression for the data- having no string redundancy, while some other schemes rely on variable code which, behaves inefficiently with string redundant data. A locally adaptive data compression scheme is proposed here to overcome the above mentioned shortcomings. This scheme resembles the variable code scheme but pleasingly eliminates the string redundancy. Scheme is analyzed here elaborately and validation is tested through number of experiments. For prefix coding, methods, given by Jarnvall are employed. The result acknowledges G3 coding as the best among all others.|
|Research Supervisor/ Guide:||Joshi, R. S.|
|Appears in Collections:||MASTERS' DISSERTATIONS (E & C)|
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.