Then, these predicted values are compared with the actual value and the difference (error) is what gets sent to the next stage for encoding.
PX and PY are the predicted X and Y X -1is the previous X value X -2 is the X value two backĪs an example, if X = (2, 8, 24, ?) PX = (2 * X -1) - X -2 = (2 * 24) - 8 = 40. Here is a sample using simple linear algebra: There are virtually countless ways to do this. This stage is what separates one compression scheme from another. Next, the X and Y data is passed through a predictor to attempt to remove any redundancy.īasically, the goal of this stage is to make the X and Y arrays contain the smallest possible values while still remaining decompressible. The mid (X) is the midpoint between the L and R channels and the side (Y) is the difference in the channels. In this case, a mid (X) and a side (Y) value are encoded instead of a L and a R value. There is often a great deal of correlation between the L and R channels, and this can be exploited several ways, with one popular way being through the use of mid / side encoding. The first step in lossless compression is to more efficiently model the channels L and R as some X and Y values. That way, you'll never have to recopy your CD collection to switch formats, and you'll always be able to perfectly recreate the original music CD.Lossless compression can be broken down into a few basic steps. 
The other great thing is that you can always decompress your Monkey's Audio files back to the exact, original files. Even though the sound is perfect, it still saves a lot of space (think of it as a beefed-up Winzip™ your music). That means it always sounds perfect – exactly the same as the original.
Unlike traditional methods such as mp3, ogg, or wma that permanently discard quality to save space, Monkey’s Audio only makes perfect, bit-for-bit copies of your music. Monkey’s Audio is a fast and easy way to compress digital music. Monkey's Audio for Windows 10 - Full description
0 kommentar(er)
