Sierra Acai Company
Sierra Acai Company
Open 7 Days a Week
MonaVie Independent Distributor
Distributor Training
Shop Online
Enroll Now
Buy Wholesale and maintain an Active status for 2 months and we will refund your $39 Distributor Fee
Friends
Buy Wholesale and maintain an Active status for 2 months and we will refund your $39 Distributor Fee
14-September-2008 18:02:38 - Audio compression data Redirected from Audio data compression This article is about a process which reduces the data rate or file size of digital audio signals. For processes which reduce the dynamic range without changing the amount of digital data of audio signals, see dynamic range compression. For processes which reduce the amount of time it takes to listen to and understand a recording, see time-compressed speech. Audio compression is a form of data compression designed to reduce the size of audio files. Audio compression algorithms are implemented in computer software as audio codecs. Generic data compression algorithms perform poorly with audio data, seldom reducing file sizes much below 87% of the original, and are not designed for use in real time. Consequently, specific audio lossless and lossy algorithms have been created. Lossy algorithms provide far greater compression ratios and are used in mainstream consumer audio devices. As with image compression, both lossy and lossless compression algorithms are used in audio compression, lossy being the most common for everyday use. In both lossy and lossless compression, information redundancy is reduced, using methods such as coding, pattern recognition and linear prediction to reduce the amount of information used to describe the data. The trade-off of slightly reduced audio quality is clearly outweighed for most practical audio applications where users cannot perceive any difference and space requirements are substantially reduced. For example, on one CD, one can fit an hour of high fidelity music, less than 2 hours of music compressed losslessly, or 7 hours of music compressed in MP3 format at medium bit rates. Contents 1 Lossless audio compression 2 Lossy audio compression 3 History 3.1 Coding methods 3.1.1 Transform domain methods 3.1.2 Time domain methods 3.2 Applications 3.3 Usability 3.4 Speech encoding 4 Glossary 5 References 6 See also 7 External links Lossless audio compression As file storage and communications bandwidth have become less expensive and more available, the popularity of lossless formats such as Monkey's Audio, FLAC and Shorten has increased sharply, as people are choosing to maintain a permanent archive of their audio files. The primary users of lossless compression have been audio engineers, audiophiles and those consumers who want to preserve an exact copy of their audio files, in contrast to the irreversible changes from lossy compression techniques such as Vorbis and MP3. Compression ratios are similar to those for lossless data compression around 50-60% of original size. Lossless formats such as Dolby TrueHD are also being introduced along with high definition DVD formats. It is difficult to maintain all the data in an audio stream and achieve substantial compression. First, the vast majority of sound recordings are highly complex, recorded from the real world. As one of the key methods of compression is to find patterns and repetition, more chaotic data such as audio doesn't compress well. In a similar manner, photographs compress less efficiently with lossless methods than simpler computer-generated images do. But interestingly, even computer generated sounds can contain very complicated waveforms that present a challenge to many compression algorithms. This is due to the nature of audio waveforms, which are generally difficult to simplify without a necessarily lossy conversion to frequency information, as performed by the human ear. The second reason is that values of audio samples change very quickly, so generic data compression algorithms don't work well for audio, and strings of consecutive bytes don't generally appear very often. However, convolution with the filter -1 1 that is, taking the first difference tends to slightly whiten decorrelate, make flat the spectrum, thereby allowing traditional lossless compression at the encoder to do its job; integration at the decoder restores the original signal. Codecs such as FLAC, Shorten and TTA use linear prediction to estimate the spectrum of the signal. At the encoder, the estimator's inverse is used to whiten the signal by removing spectral peaks while the estimator is used to reconstruct the original signal at the decoder. Lossless audio codecs have no quality issues, so the usability can be estimated by Speed of compression and decompression Degree of compression Software and hardware support Robustness and error correction Lossy audio compression Lossy audio compression is used in an extremely wide range of applications. In addition to the direct applications mp3 players or computers, digitally compressed audio streams are used in most video DVDs; digital television; streaming media on the internet; satellite and cable radio; and increasingly in terrestrial radio broadcasts. Lossy compression typically achieves far greater compression than lossless compression data of 5 percent to 20 percent of the original stream, rather than 50 percent to 60 percent, by discarding less-critical data. The innovation of lossy audio compression was to use psychoacoustics to recognize that not all data in an audio stream can be perceived by the human auditory system. Most lossy compression reduces perceptual redundancy by first identifying sounds which are considered perceptually irrelevant, that is, sounds that are very hard to hear. Typical examples include high frequencies, or sounds that occur at the same time as louder sounds. Those sounds are coded with decreased accuracy or not coded at all. While removing or reducing these 'unhearable' sounds may account for a small percentage of bits saved in lossy compression, the real savings comes from a complementary phenomenon: noise shaping. Reducing the number of bits used to code a signal increases the amount of noise in that signal. In psychoacoustics-based lossy compression, the real key is to 'hide' the noise generated by the bit savings in areas of the audio stream that cannot be perceived. This is done by, for instance, using very small numbers of bits to code the high frequencies of most signals - not because the signal has little high frequency information though this is also often true as well, but rather because the human ear can only perceive very loud signals in this region, so that softer sounds 'hidden' there simply aren't heard. If reducing perceptual redundancy does not achieve sufficient compression for a particular application, it may require further lossy compression. Depending on the audio source, this still may not produce perceptible differences. Speech for example can be compressed far more than music. Most lossy compression schemes allow compression parameters to be adjusted to achieve a target rate of data, usually expressed as a bit rate. Again, the data reduction will be guided by some model of how important the sound is as perceived by the human ear, with the goal of efficiency and optimized quality for the target data rate. There are many different models used for this perceptual analysis, some better suited to different types of audio than others. Hence, depending on the bandwidth and storage requirements, the use of lossy compression may result in a perceived reduction of the audio quality that ranges from none to severe, but generally an obviously audible reduction in quality is unacceptable to listeners. Because data is removed during lossy compression and cannot be recovered by decompression, some people may not prefer lossy compression for archival storage. Hence, as noted, even those who use lossy compression for portable audio applications, for example may wish to keep a losslessly compressed archive for other applications. In addition, the technology of compression continues to advance, and achieving a state-of-the-art lossy compression would require one to begin again with the lossless, original audio data and compress with the new lossy codec. The nature of lossy compression for both audio and images results in increasing degradation of quality if data are decompressed, then recompressed using lossy compression. History A large variety of real, working audio coding systems were published in a collection in the IEEE Journal on Selected Areas in Communications JSAC, February 1988. While there were some papers from before that time, this compendium of papers documented an entire variety of finished, working audio coders, nearly all of them using perceptual i.e. masking techniques and some kind of frequency analysis and back-end noiseless coding.1 Several of these papers remarked on the difficulty of obtaining good, clean digital audio for research purposes. Most, if not all, of the authors in the JSAC ion were also active in the MPEG-1 Audio committee. Solidyne 922: The world first commercial audio bit compression card for PC, 1990 Solidyne 922: The world first commercial audio bit compression card for PC, 1990 The world's first commercial broadcast automation audio compression system was developed by Oscar Bonello, an Engineering professor at the University of Buenos Aires.2 In 1983, using the psychoacoustic principle of the masking of critical bands first published in 1967,3 he started developing a practical application based on the recently developed IBM PC computer, and the broadcast automation system was launched in 1987 under the name Audicom. 20 years later, almost all the radio stations in the world were using similar technology, manufactured by a number of companies. Coding methods Transform domain methods In order to determine what information in an audio signal is perceptually irrelevant, most lossy compression algorithms use transforms such as the modified discrete cosine transform MDCT to convert time domain sampled waveforms into a transform domain. Once transformed, typically into the frequency domain, component frequencies can be allocated bits according to how audible they are. Audibility of spectral components is determined by first calculating a masking threshold, below which it is estimated that sounds will be beyond the limits of human perception. The masking threshold is calculated using the absolute threshold of hearing and the principles of simultaneous masking - the phenomenon wherein a signal is masked by another signal separated by frequency - and, in some cases, temporal masking - where a signal is masked by another signal separated by time. Equal-loudness contours may also be used to weight the perceptual importance of different components. Models of the human ear-brain combination incorporating such effects are often called psychoacoustic models. Time domain methods Other types of lossy compressors, such as the linear predictive coding LPC used with speech, are source-based coders. These coders use a model of the sound's generator such as the human vocal tract with LPC to whiten the audio signal i.e., flatten its spectrum prior to quantization. LPC may also be thought of as a basic perceptual coding technique; reconstruction of an audio signal using a linear predictor shapes the coder's quantization noise into the spectrum of the target signal, partially masking it. Applications Due to the nature of lossy algorithms, audio quality suffers when a file is decompressed and recompressed generational losses. This makes lossy compression unsuitable for storing the intermediate results in professional audio engineering applications, such as sound ing and multitrack recording. However, they are very popular with end users particularly MP3, as a megabyte can store about a minute's worth of music at adequate quality. Usability Usability of lossy audio codecs is determined by: Perceived audio quality Compression factor Speed of compression and decompression Inherent latency of algorithm critical for real-time streaming applications; see below Software and hardware support Lossy formats are often used for the distribution of streaming audio, or interactive applications such as the coding of speech for digital transmission in cell phone networks. In such applications, the data must be decompressed as the data flows, rather than after the entire data stream has been transmitted. Not all audio codecs can be used for streaming applications, and for such applications a codec designed to stream data effectively will usually be chosen. Latency results from the methods used to encode and decode the data. Some codecs will analyze a longer segment of the data to optimize efficiency, and then code it in a manner that requires a larger segment of data at one time in order to decode. Often codecs create segments called a frame to create discrete data segments for encoding and decoding. The inherent latency of the coding algorithm can be critical; for example, when there is two-way transmission of data, such as with a telephone conversation, significant delays may seriously degrade the perceived quality. In contrast to the speed of compression, which is proportional to the number of operations required by the algorithm, here latency refers to the number of samples which must be analysed before a block of audio is processed. In the minimum case, latency is 0 zero samples e.g., if the coder/decoder simply reduces the number of bits used to quantize the signal. Time domain algorithms such as LPC also often have low latencies, hence their popularity in speech coding for telephony. In algorithms such as MP3, however, a large number of samples have to be analyzed in order to implement a psychoacoustic model in the frequency domain, and latency is on the order of 23 ms 46 ms for two-way communication. Speech encoding Speech encoding is an important category of audio data compression. The perceptual models used to estimate what a human ear can hear are generally somewhat different from those used for music. The range of frequencies needed to convey the sounds of a human voice are normally far narrower than that needed for music, and the sound is normally less complex. As a result, speech can be encoded at high quality using relatively low bit rates. This is accomplished, in general, by some combination of two approaches: Only encoding sounds that could be made by a single human voice. Throwing away more of the data in the signal -- keeping just enough to reconstruct an intelligible voice rather than the full frequency range of human hearing. Perhaps the earliest algorithms used in speech encoding and audio data compression in general were the A-law algorithm and the µ-law algorithm. Glossary ABR Average bitrate CBR Constant bitrate VBR Variable bitrate References ^ Journal on Selected Areas in Communications, February 1988 ^ Solidyne... 40 years of innovation ^ The Ear as a Communication Receiver. English translation of Das Ohr als Nachrichtenempfänger by Eberhard Zwicker and Richard Feldtkeller. Translated from German by Hannes Müsch, Søren Buus, and Mary Florentine. Originally published in 1967; Translation published in 1999 See also Audio file format Audio signal processing Audio storage Auditory masking Codec Comparison of Audio Codecs Container format Data compression Digital Rights Management Digital signal processing List of codecs Psychoacoustics Speech encoding Speech compression Subband encoding External links EBU subjective listening tests on low-bitrate audio codecs Interactive blind listening tests of audio codecs over the internet For comparisons of lossless audio codecs, see hydrogenaudio.org wiki comparison; Speek's comparison note the other links as well; this graph from Hans Heiden's site and Robin Whittle's 2003 comparison of several algorithms and discussion of Rice coding. Techgage: Audio Archiving Guide: Music Formats Guide for helping a user pick out the right codec v d e Data compression methods Lossless Theory Entropy · Complexity · Redundancy Entropy encoding Huffman · Adaptive Huffman · Arithmetic Shannon-Fano · Range · Golomb · Exp-Golomb · Universal Elias · Fibonacci Dictionary RLE · DEFLATE · LZ Family LZ77/78 · LZSS · LZW · LZWL · LZO · LZMA · LZX · LZJB · LZT Others CTW · BWT · PPM · DMC Audio Theory Convolution · Sampling · Nyquist-Shannon theorem Audio codec parts LPC LAR · LSP · WLPC · CELP · ACELP · A-law · μ-law · MDCT · Fourier transform · Psychoacoustic model Others Dynamic range compression · Speech compression · Sub-band coding Image Terms Color space · Pixel · Chroma subsampling · Compression artifact Methods RLE · Fractal · Wavelet · EZW · SPIHT · DCT · KLT Others Bit rate · Test images · PSNR quality measure · Quantization Video Terms Video Characteristics · Frame · Frame types · Video quality Video codec parts Motion compensation · DCT · Quantization Others Video codecs · Rate distortion theory CBR · ABR · VBR Timeline of information theory, data compression, and error-correcting codes See Compression Formats and Standards for formats and Compression Software Implementations for codecs v d e Multimedia compression formats Video compression ISO/IEC MJPEG · Motion JPEG 2000 · MPEG-1 · MPEG-2 · MPEG-4 ASP · MPEG-4/AVC ITU-T H.120 · H.261 · H.262 · H.263 · H.264 Others AMV · AVS · Bink · Dirac · Indeo · Pixlet · RealVideo · RTVideo · SheerVideo · Smacker · Snow · Theora · VC-1 · VP6 · VP7 · WMV Audio compression ISO/IEC MPEG-1 Layer III MP3 · MPEG-1 Layer II · MPEG-1 Layer I · AAC · HE-AAC ITU-T G.711 · G.719 · G.722 · G.722.1 · G.722.2 · G.723 · G.723.1 · G.726 · G.728 · G.729 · G.729.1 · G.729a Others AC3 · AMR · Apple Lossless · ATRAC · FLAC · iLBC · Monkey's Audio · μ-law · Musepack · Nellymoser · OptimFROG · RealAudio · RTAudio · SHN · Siren · Speex · Vorbis · WavPack · WMA · TAK Image compression ISO/IEC/ITU-T JPEG · JPEG 2000 · lossless JPEG · JBIG · JBIG2 · PNG · WBMP Others BMP · GIF · ICER · ILBM · PCX · PGF · TGA · TIFF · JPEG XR / HD Photo Media containers General 3GP · ASF · AVI · Bink · DMF · DPX · FLV · Matroska · MP4 · MXF · NUT · Ogg · Ogg Media · QuickTime · RealMedia · Smacker · RIFF · VOB Audio only AIFF · AU · WAV See Compression Methods for methods and Compression Software Implementations for codecs Retrieved from http://en..org/wiki/Audio_compression_data Categories: Sound technology | Data compression | Audio engineering Views Article Discussion this page History Personal tools Log in / create account Navigation Main page Contents Featured content Current events Random article Search Go Search Interaction Community portal Recent changes Contact Donate to Help Toolbox What links here Related changes Upload file Special pages Printable version Permanent link Cite this page Languages Deutsch Español Français Gaeilge Italiano עברית Magyar Nederlands 日本語 Português Suomi Svenska This page was last modified on 10 September 2008, at 05:52
39 Reasons to Drink Acai Juice Every Day
What is MonaVie - Watch the 8-minute video
Discovering MonaVie Video
The Power of You Video
Effects of MonaVie Active on Antioxidant Capacity in Humans
Log into your Wholesale MonaVie Account
So many of us do not eat a balanced diet, get enough sleep, have too much stress, or are impacted with toxins and pollutants. Drinking 2 ounces of MonaVie twice a day will help your body detoxify as well as build your immune system. Its the smartest thing you can do for yourself, so start today. Buying MonaVie through our company guarantees you support 7 days a week and, if you would like to share MonaVie with your family and friends we will guide you from start to finish.
1. Click on Enroll Now (30 - 55% off retail price)
2. Pay $39 for your Wholesale ID number.
3. NO minimum order required.
4. MonaVie is delivered to your door in 3 to 5 days.