This work presents a novel technique for data compression based on multi-residue number systems. The basic theorem is that an under-determined system of congruences could be solved to accomplish data compression for a signal satisfying continuity of its information content and bounded in peak-to -peak amplitude by the product of relatively prime moduli,. This thesis investigates this property and presents quantitative results along with MATLAB codes. Chapter 1 is introductory in nature and Chapter 2 deals in more detail with the basic theorem. Chapter 3 explicitly mentions the assumptions made and chapter 4 shows alternative solutions to the Chinese remainder theorem. Chapter 5 explains the experiments in detail whose results are mentioned in chapter 6. Chapter 7 concludes with a summary and suggestions for future work.
| Identifer | oai:union.ndltd.org:unt.edu/info:ark/67531/metadc149639 |
| Date | 08 1900 |
| Creators | Melaedavattil Jaganathan, Jyothy |
| Contributors | Garcia, Oscar N., Fu, Shengli, Li, Xinrong |
| Publisher | University of North Texas |
| Source Sets | University of North Texas |
| Language | English |
| Detected Language | English |
| Type | Thesis or Dissertation |
| Format | Text |
| Rights | Public, Melaedavattil Jaganathan, Jyothy, Copyright, Copyright is held by the author, unless otherwise noted. All rights Reserved. |
Page generated in 0.0022 seconds