Data compression

Frae Wikipedia, the free beuk o knawledge
Jump to navigation Jump to search

In signal processin, data compression, soorce codin,[1] or bit-rate reduction involves encodin information uisin fewer bits nor the oreeginal representation.[2] Compression can be aither lossy or lossless. Lossless compression reduces bits bi identifyin an eliminatin statistical redundancy. Na information is lost in lossless compression. Lossy compression reduces bits bi remuivin unnecessary or less important information.[3] The process o reducin the size o a data file is referred tae as data compression. In the context o data transmission, it is cried soorce codin (encodin duin at the soorce o the data afore it is stored or transmittit) in opposeetion tae channel codin.[4]

References[eedit | eedit soorce]

  1. Wade, Graham (1994). Signal coding and processing (2 ed.). Cambridge University Press. p. 34. ISBN 978-0-521-42336-6. Retrieved 22 December 2011. The broad objective of source coding is to exploit or remove 'inefficient' redundancy in the PCM source and thereby achieve a reduction in the overall source rate R.
  2. Mahdi, O.A.; Mohammed, M.A.; Mohamed, A.J. (November 2012). "Implementing a Novel Approach an Convert Audio Compression to Text Coding via Hybrid Technique" (PDF). International Journal of Computer Science Issues. 9 (6, No. 3): 53–59. Retrieved 6 Mairch 2013.
  3. Pujar, J.H.; Kadlaskar, L.M. (Mey 2010). "A New Lossless Method of Image Compression and Decompression Using Huffman Coding Techniques" (PDF). Journal of Theoretical and Applied Information Technology. 15 (1): 18–23.
  4. Salomon, David (2008). A Concise Introduction to Data Compression. Berlin: Springer. ISBN 9781848000728.