Data compression

In signal processing, computing, data compression, source coding, or bit-rate reduction involves encoding signals of information (for sound or images) using fewer bits than the original representation.

Compression can be either lossy or lossless.

 Lossless compression reduces bits by identifying and eliminating statistical redundancy (removing repeated information and storing how much was removed then later returned). No information is lost in lossless compression. 

Lossy compression reduces bits by removing unnecessary or less important information. 

The process of reducing the size of a data file is also often referred to as data compression. 

In the context of data transmission, it is called source coding; encoding done at the source of the data before it is stored or transmitted. Source coding should not be confused with channel coding, for error detection and correction or line coding, the means for mapping data onto a signal.

Compression is useful because it reduces resources required to store and transmit data. Computational resources are consumed in the compression process and, usually, in the reversal of the process (decompression). Data compression is subject to a space–time complexity trade-off. 

For instance, a compression scheme for video may require expensive hardware for the video to be decompressed fast enough to be viewed as it is being decompressed, and the option to decompress the video in full before watching it may be inconvenient or require additional storage. 

The design of data compression schemes involves trade-offs among various factors, including the degree of compression, the amount of distortion introduced (when using lossy data compression), and the computational resources required to compress and decompress the data.

source adapted from: Data compression. (2018, February 14). In Wikipedia, The Free Encyclopedia. Retrieved 04:35, February 17, 2018, from