DOCSLIB.ORG

Speech Coding Techniques (I)

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Speech Coding Techniques (I) Speech Coding Techniques (I) Introduction to Quantization Scalar quantization Uniform quantization Nonuniform quantization Waveform-based coding Pulse Coded Modulation (PCM) Differential PCM (DPCM) Adaptive DPCM (ADPCM) Model-based coding Channel vocoder Analysis-by-Synthesis techniques Harmonic vocoder Origin of Speech Coding ªWatson, if I can get a mechanism which will make a current of electricity vary its intensity as the air varies in density when sound is passing through it, I can telegraph any sound, even the sound of speech.º -A. G. Bell'1875 analog communication N Entropy formula H X =−∑ pi log2 pi (bits/sample) i=1 or bps of a discrete source digital communication -C. E. Shannon'1948 Digitization of Speech Signals x(n)=xc(nT) x(n) xc(t) Sampler Quantizer continuous-time discrete sequence speech signal speech samples Sampling Sampling Theorem when sampling a signal (e.g., converting from an analog signal to digital), the sampling frequency must be greater than twice the bandwidth of the input signal in order to be able to reconstruct the original perfectly from the sampled version. Sampling frequency: >8K samples/second (human speech is roughly bandlimited at 4KHz) Quantization In Physics To limit the possible values of a magnitude or quantity to a discrete set of values by quantum mechanical rules In speech coding To limit the possible values of a speech sample or prediction residue to a discrete set of values by information theoretic rules (tradeoff between Rate and Distortion) Quantization Examples Examples Continuous to discrete a quarter of milk, two gallons of gas, normal temperature is 98.6F, my height is 5 foot 9 inches Discrete to discrete Round your tax return to integers The mileage of my car is about 60K. Play with bits Precision is finite: the more precise, the more bits you need (to resolve the uncertainty) Keep a card in secret and ask your partner to guess. He/she can only ask Yes/No questions: is it bigger than 7? Is it less than 4? ... However, not every bit has the same impact How much did you pay for your car? (two thousands vs. $2016.78) Scalar vs. Vector Quantization Scalar: for a given sequence of speech samples, we will process (quantize) each sample independently Input: N samples → output: N codewords Vector: we will process (quantize) a block of speech samples each time Input: N samples → output: N/d codewords (block size is d) SQ is a special case of VQ (d=1) Scalar Quantization In SQ, quantizing N samples is not fundamentally different from Quantizing one sample (since they are processed independently) original quantization quantized value index value ^ x f s∈S f -1 x Quantizer ^ x Q x A quantizer is defined by codebook (collection of codewords) and mapping function (straightforward in the case of SQ) Rate-Distortion Tradeoff Rate: How many Distortion codewords (bits) are used? Example: 16-bit audio vs. 8-bit PCM speech Distortion: How much distortion is introduced? SQ Example: mean absolute VQ difference(L1), mean square error (L2) Rate (bps) Question: which quantizer is better? Uniform Quantization Uniform Quantization A scalar quantization is called uniform quantization (UQ) if all its codewords are uniformly distributed (equally-distanced) Example (quantization stepsize ∆=16) ∆ ∆ ∆ ∆ 8 24 40 ... 248 Uniform Distribution denoted by U[-A,A] f(x) 1 1/2A x∈[−A , A ] f x= 2A x { 0 else -A A 6dB/Bit Rule f(e) 1/ ∆ e - ∆/2 ∆/2 Note: Quantization noise of UQ on uniform distribution is also uniformly distributed For a uniform source, adding one bit/sample can reduce MSE or increase SNR by 6dB (The derivation of this 6dB/bit rule will be given in the class) Nonuniform Quantization Motivation Speech signals have the characteristic that small-amplitude samples occur more frequently than large-amplitude ones Human auditory system exhibits a logarithmic sensitivity More sensitive at small-amplitude range (e.g., 0 might sound different from 0.1) Less sensitive at large-amplitude range (e.g., 0.7 might not sound different much from 0.8) histogram of typical speech signals From Uniform to Non-uniform F: nonlinear compressing function F-1: nonlinear expanding function F and F-1: nonlinear compander y ^ y -1 ^ x F Q F x Example F: y=log(x) F-1: x=exp(x) We will study nonuniform quantization by PCM example next Speech Coding Techniques (I) Introduction to Quantization Scalar quantization Uniform quantization Nonuniform quantization Waveform-based coding Pulse Coded Modulation (PCM) Differential PCM (DPCM) Adaptive DPCM (ADPCM) Model-based coding Channel vocoder Analysis-by-Synthesis techniques Harmonic vocoder Pulse Code Modulation Basic idea: assign smaller quantization stepsize for small-amplitude regions and larger quantization stepsize for large-amplitude regions Two types of nonlinear compressing functions Mu-law adopted by North American telecommunications systems A-law adopted by European telecommunications systems Mu-Law (µ-law) Mu-Law Examples y x A-Law A-Law Examples y x Comparison y x PCM Speech Mu-law(A-law) compresses the signal to 8 bits/sample or 64Kbits/second (without compandor, we would need 12bits/sample) A Look Inside WAV Format MATLAB function [x,fs]=wavread(filename) Change the Gear Strictly speaking, PCM is merely digitization of speech signals ± no coding (compression) at all By speech coding, we refer to representing speech signals at the bit rate of <64Kbps To understand how speech coding techniques work, I will cover some basics of data compression Data Compression Basics Discrete source Information=uncertainty Quantification of uncertainty Source entropy Variable length codes Motivation Prefix condition Huffman coding algorithm Data compression = source modeling Shannon's Picture on Communication (1948) channel channel source channel destination encoder decoder source source encoder decoder The goal of communication is to move information from here to there and from now to then Examples of source: Human speeches, photos, text messages, computer programs ¼ Examples of channel: storage media, telephone lines, wireless network ¼ Information What do we mean by information? ªA numerical measure of the uncertainty of an experimental outcomeº ± Webster Dictionary How to quantitatively measure and represent information? Shannon proposes a probabilistic approach How to achieve the goal of compression? Represent different events by codewords with varying code-lengths Information = Uncertainty Zero information WVU lost to FSU in Gator Bowl 2005 (past news, no uncertainty) Yao Ming plays for Houston Rocket (celebrity fact, no uncertainty) Little information It is very cold in Chicago in winter time (not much uncertainty since it is known to most people) Dozens of hurricanes form in Atlantic ocean every year (not much uncertainty since it is pretty much predictable) Large information Hurricane xxx is going to hit Houston (since Katrina, we all know how difficult it is to predict the trajectory of hurricanes) There will be an earthquake in LA around X'mas (are you sure? an unlikely event) Quantifying Uncertainty of an Event Self-information Ip=−log2 p p - probability of the event x (e.g., x can be X=H or X=T) p Ip notes 1 0 must happen (no uncertainty) 0 ∞ unlikely to happen (infinite amount of uncertainty) Intuitively, I(p) measures the amount of uncertainty with event x Discrete Source A discrete source is characterized by a discrete random variable X Examples Coin flipping: P(X=H)=P(X=T)=1/2 Dice tossing: P(X=k)=1/6, k=1-6 Playing-card drawing: P(X=S)=P(X=H)=P(X=D)=P(X=C)=1/4 How to quantify the uncertainty of a discrete source? Weighted Self-information p Ip Iw p=p⋅Ip ∞ 0 0 1/2 1 1/2 1 0 0 As p evolves from 0 to 1, weighted self-information Iw p=−p⋅log2 p first increases and then decreases Question: Which value of p maximizes Iw(p)? Maximum of Weighted Self-information p=1/e 1 I p= w e ln2 Uncertainty of a Discrete Source • A discrete source (random variable) is a collection (set) of individual events whose probabilities sum to 1 X is a discrete random variable x∈{1,2,...,N} N p =probx=i ,i=1,2,...,N i ∑ pi=1 i=1 • To quantify the uncertainty of a discrete source, we simply take the summation of weighted self- information over the whole set Shannon's Source Entropy Formula N H X =∑ Iw pi i=1 N (bits/sample) H X =−∑ pi log2 pi i=1 or bps Source Entropy Examples • Example 1: (binary Bernoulli source) Flipping a coin with probability of head being p (0<p<1) p=probx=0 ,q=1−p=probx=1 H X =− plog2 pq log2q Check the two extreme cases: As p goes to zero, H(X) goes to 0 bps → compression gains the most As p goes to a half, H(X) goes to 1 bps → no compression can help Entropy of Binary Bernoulli Source Source Entropy Examples N • Example 2: (4-way random walk) 1 1 W E prob x=S = ,prob x=N= 2 4 1 prob x=E =prob x=W = S 8 1 1 1 1 1 1 1 1 H X =− log log log log =1.75bps 2 2 2 4 2 4 8 2 8 8 2 8 Source Entropy Examples (Con't) • Example 3: (source with geometric distribution) A jar contains the same number of balls with two different colors: blue and red. Each time a ball is randomly picked out from the jar and then put back. Consider the event that at the k-th picking, it is the first time to see a red ball ± what is the probability of such event? 1 1 p=probx=red= ,1−p=prob x=blue= 2 2 Prob(event)=Prob(blue in the first k-1 picks)Prob(red in the k-th pick ) =(1/2)k-1(1/2)=(1/2)k Morse Code (1838) A B C D E F G H I J K L M .08 .01 .03 .04 .12 .02 .02 .06 .07 .00 .01 .04 .02 .- -¼ -.-.
Load more

Recommended publications
  • Speech Coding and Compression
    Introduction to voice coding/compression PCM coding Speech vocoders based on speech production LPC based vocoders Speech over packet networks Speech coding and compression Corso di Networked Multimedia Systems Master Universitario di Primo Livello in Progettazione e Gestione di Sistemi di Rete Carlo Drioli Università degli Studi di Verona Facoltà di Scienze Matematiche, Dipartimento di Informatica Fisiche e Naturali Speech coding and compression Introduction to voice coding/compression PCM coding Speech vocoders based on speech production LPC based vocoders Speech over packet networks Speech coding and compression: OUTLINE Introduction to voice coding/compression PCM coding Speech vocoders based on speech production LPC based vocoders Speech over packet networks Speech coding and compression Introduction to voice coding/compression PCM coding Speech vocoders based on speech production LPC based vocoders Speech over packet networks Introduction Approaches to voice coding/compression I Waveform coders (PCM) I Voice coders (vocoders) Quality assessment I Intelligibility I Naturalness (involves speaker identity preservation, emotion) I Subjective assessment: Listening test, Mean Opinion Score (MOS), Diagnostic acceptability measure (DAM), Diagnostic Rhyme Test (DRT) I Objective assessment: Signal to Noise Ratio (SNR), spectral distance measures, acoustic cues comparison Speech coding and compression Introduction to voice coding/compression PCM coding Speech vocoders based on speech production LPC based vocoders Speech over packet networks
    [Show full text]
  • Digital Speech Processing— Lecture 17
    Digital Speech Processing— Lecture 17 Speech Coding Methods Based on Speech Models 1 Waveform Coding versus Block Processing • Waveform coding – sample-by-sample matching of waveforms – coding quality measured using SNR • Source modeling (block processing) – block processing of signal => vector of outputs every block – overlapped blocks Block 1 Block 2 Block 3 2 Model-Based Speech Coding • we’ve carried waveform coding based on optimizing and maximizing SNR about as far as possible – achieved bit rate reductions on the order of 4:1 (i.e., from 128 Kbps PCM to 32 Kbps ADPCM) at the same time achieving toll quality SNR for telephone-bandwidth speech • to lower bit rate further without reducing speech quality, we need to exploit features of the speech production model, including: – source modeling – spectrum modeling – use of codebook methods for coding efficiency • we also need a new way of comparing performance of different waveform and model-based coding methods – an objective measure, like SNR, isn’t an appropriate measure for model- based coders since they operate on blocks of speech and don’t follow the waveform on a sample-by-sample basis – new subjective measures need to be used that measure user-perceived quality, intelligibility, and robustness to multiple factors 3 Topics Covered in this Lecture • Enhancements for ADPCM Coders – pitch prediction – noise shaping • Analysis-by-Synthesis Speech Coders – multipulse linear prediction coder (MPLPC) – code-excited linear prediction (CELP) • Open-Loop Speech Coders – two-state excitation
    [Show full text]
  • Speech Compression Using Discrete Wavelet Transform and Discrete Cosine Transform
    International Journal of Engineering Research & Technology (IJERT) ISSN: 2278-0181 Vol. 1 Issue 5, July - 2012 Speech Compression Using Discrete Wavelet Transform and Discrete Cosine Transform Smita Vatsa, Dr. O. P. Sahu M. Tech (ECE Student ) Professor Department of Electronicsand Department of Electronics and Communication Engineering Communication Engineering NIT Kurukshetra, India NIT Kurukshetra, India Abstract reproduced with desired level of quality. Main approaches of speech compression used today are Aim of this paper is to explain and implement waveform coding, transform coding and parametric transform based speech compression techniques. coding. Waveform coding attempts to reproduce Transform coding is based on compressing signal input signal waveform at the output. In transform by removing redundancies present in it. Speech coding at the beginning of procedure signal is compression (coding) is a technique to transform transformed into frequency domain, afterwards speech signal into compact format such that speech only dominant spectral features of signal are signal can be transmitted and stored with reduced maintained. In parametric coding signals are bandwidth and storage space respectively represented through a small set of parameters that .Objective of speech compression is to enhance can describe it accurately. Parametric coders transmission and storage capacity. In this paper attempts to produce a signal that sounds like Discrete wavelet transform and Discrete cosine original speechwhether or not time waveform transform
    [Show full text]
  • Speech Coding Using Code Excited Linear Prediction
    ISSN : 0976-8491 (Online) | ISSN : 2229-4333 (Print) IJCST VOL . 5, Iss UE SPL - 2, JAN - MAR C H 2014 Speech Coding Using Code Excited Linear Prediction 1Hemanta Kumar Palo, 2Kailash Rout 1ITER, Siksha ‘O’ Anusandhan University, Bhubaneswar, Odisha, India 2Gandhi Institute For Technology, Bhubaneswar, Odisha, India Abstract The main problem with the speech coding system is the optimum utilization of channel bandwidth. Due to this the speech signal is coded by using as few bits as possible to get low bit-rate speech coders. As the bit rate of the coder goes low, the intelligibility, SNR and overall quality of the speech signal decreases. Hence a comparative analysis is done of two different types of speech coders in this paper for understanding the utility of these coders in various applications so as to reduce the bandwidth and by different speech coding techniques and by reducing the number of bits without any appreciable compromise on the quality of speech. Hindi language has different number of stops than English , hence the performance of the coders must be checked on different languages. The main objective of this paper is to develop speech coders capable of producing high quality speech at low data rates. The focus of this paper is the development and testing of voice coding systems which cater for the above needs. Keywords PCM, DPCM, ADPCM, LPC, CELP Fig. 1: Speech Production Process I. Introduction Speech coding or speech compression is the compact digital The two types of speech sounds are voiced and unvoiced [1]. representations of voice signals [1-3] for the purpose of efficient They produce different sounds and spectra due to their differences storage and transmission.
    [Show full text]
  • An Ultra Low-Power Miniature Speech CODEC at 8 Kb/S and 16 Kb/S Robert Brennan, David Coode, Dustin Griesdorf, Todd Schneider Dspfactory Ltd
    To appear in ICSPAT 2000 Proceedings, October 16-19, 2000, Dallas, TX. An Ultra Low-power Miniature Speech CODEC at 8 kb/s and 16 kb/s Robert Brennan, David Coode, Dustin Griesdorf, Todd Schneider Dspfactory Ltd. 611 Kumpf Drive, Unit 200 Waterloo, Ontario, N2V 1K8 Canada Abstract SmartCODEC platform consists of an effi- cient, block-floating point, oversampled This paper describes a CODEC implementa- Weighted OverLap-Add (WOLA) filterbank, a tion on an ultra low-power miniature applica- software-programmable dual-Harvard 16-bit tion specific signal processor (ASSP) designed DSP core, two high fidelity 14-bit A/D con- for mobile audio signal processing applica- verters, a 14-bit D/A converter and a flexible tions. The CODEC records speech to and set of peripherals [1]. The system hardware plays back from a serial flash memory at data architecture (Figure 1) was designed to enable rates of 16 and 8 kb/s, with a bandwidth of 4 memory upgrades. Removable memory cards kHz. This CODEC consumes only 1 mW in a or more power-efficient memory could be package small enough for use in a range of substituted for the serial flash memory. demanding portable applications. Results, improvements and applications are also dis- The CODEC communicates with the flash cussed. memory over an integrated SPI port that can transfer data at rates up to 80 kb/s. For this application, the port is configured to block 1. Introduction transfer frame packets every 14 ms. e Speech coding is ubiquitous. Increasing de- c i WOLA Filterbank v mands for portability and fidelity coupled with A/D e and D the desire for reduced storage and bandwidth o i l Programmable d o r u utilization have increased the demand for and t D/A DSP Core A deployment of speech CODECs.
    [Show full text]
  • Cognitive Speech Coding Milos Cernak, Senior Member, IEEE, Afsaneh Asaei, Senior Member, IEEE, Alexandre Hyafil
    1 Cognitive Speech Coding Milos Cernak, Senior Member, IEEE, Afsaneh Asaei, Senior Member, IEEE, Alexandre Hyafil Abstract—Speech coding is a field where compression ear and undergoes a highly complex transformation paradigms have not changed in the last 30 years. The before it is encoded efficiently by spikes at the auditory speech signals are most commonly encoded with com- nerve. This great efficiency in information representation pression methods that have roots in Linear Predictive has inspired speech engineers to incorporate aspects of theory dating back to the early 1940s. This paper tries to cognitive processing in when developing efficient speech bridge this influential theory with recent cognitive studies applicable in speech communication engineering. technologies. This tutorial article reviews the mechanisms of speech Speech coding is a field where research has slowed perception that lead to perceptual speech coding. Then considerably in recent years. This has occurred not it focuses on human speech communication and machine because it has achieved the ultimate in minimizing bit learning, and application of cognitive speech processing in rate for transparent speech quality, but because recent speech compression that presents a paradigm shift from improvements have been small and commercial applica- perceptual (auditory) speech processing towards cognitive tions (e.g., cell phones) have been mostly satisfactory for (auditory plus cortical) speech processing. The objective the general public, and the growth of available bandwidth of this tutorial is to provide an overview of the impact has reduced requirements to compress speech even fur- of cognitive speech processing on speech compression and discuss challenges faced in this interdisciplinary speech ther.
    [Show full text]
  • A Novel Speech Enhancement Approach Based on Modified Dct and Improved Pitch Synchronous Analysis
    American Journal of Applied Sciences 11 (1): 24-37, 2014 ISSN: 1546-9239 ©2014 Science Publication doi:10.3844/ajassp.2014.24.37 Published Online 11 (1) 2014 (http://www.thescipub.com/ajas.toc) A NOVEL SPEECH ENHANCEMENT APPROACH BASED ON MODIFIED DCT AND IMPROVED PITCH SYNCHRONOUS ANALYSIS 1Balaji, V.R. and 2S. Subramanian 1Department of ECE, Sri Krishna College of Engineering and Technology, Coimbatore, India 2Department of CSE, Coimbatore Institute of Engineering and Technology, Coimbatore, India Received 2013-06-03, Revised 2013-07-17; Accepted 2013-11-21 ABSTRACT Speech enhancement has become an essential issue within the field of speech and signal processing, because of the necessity to enhance the performance of voice communication systems in noisy environment. There has been a number of research works being carried out in speech processing but still there is always room for improvement. The main aim is to enhance the apparent quality of the speech and to improve the intelligibility. Signal representation and enhancement in cosine transformation is observed to provide significant results. Discrete Cosine Transformation has been widely used for speech enhancement. In this research work, instead of DCT, Advanced DCT (ADCT) which simultaneous offers energy compaction along with critical sampling and flexible window switching. In order to deal with the issue of frame to frame deviations of the Cosine Transformations, ADCT is integrated with Pitch Synchronous Analysis (PSA). Moreover, in order to improve the noise minimization performance of the system, Improved Iterative Wiener Filtering approach called Constrained Iterative Wiener Filtering (CIWF) is used in this approach. Thus, a novel ADCT based speech enhancement using improved iterative filtering algorithm integrated with PSA is used in this approach.
    [Show full text]
  • Speech Compression
    information Review Speech Compression Jerry D. Gibson Department of Electrical and Computer Engineering, University of California, Santa Barbara, CA 93118, USA; [email protected]; Tel.: +1-805-893-6187 Academic Editor: Khalid Sayood Received: 22 April 2016; Accepted: 30 May 2016; Published: 3 June 2016 Abstract: Speech compression is a key technology underlying digital cellular communications, VoIP, voicemail, and voice response systems. We trace the evolution of speech coding based on the linear prediction model, highlight the key milestones in speech coding, and outline the structures of the most important speech coding standards. Current challenges, future research directions, fundamental limits on performance, and the critical open problem of speech coding for emergency first responders are all discussed. Keywords: speech coding; voice coding; speech coding standards; speech coding performance; linear prediction of speech 1. Introduction Speech coding is a critical technology for digital cellular communications, voice over Internet protocol (VoIP), voice response applications, and videoconferencing systems. In this paper, we present an abridged history of speech compression, a development of the dominant speech compression techniques, and a discussion of selected speech coding standards and their performance. We also discuss the future evolution of speech compression and speech compression research. We specifically develop the connection between rate distortion theory and speech compression, including rate distortion bounds for speech codecs. We use the terms speech compression, speech coding, and voice coding interchangeably in this paper. The voice signal contains not only what is said but also the vocal and aural characteristics of the speaker. As a consequence, it is usually desired to reproduce the voice signal, since we are interested in not only knowing what was said, but also in being able to identify the speaker.
    [Show full text]
  • Meeting Abstracts
    PROGRAM OF The 118th Meeting of the AcousticalSociety of America Adam's Mark Hotel ß St. Louis, Missouri ß 27 November-1 December 1989 MONDAY EVENING, 27 NOVEMBER 1989 ST. LOUIS BALLROOM D, 7:00 TO 9:00 P.M. Tutorial on Architectural Acoustics Mauro Pierucci, Chairman Departmentof Aerospaceand EngineeringMechanics, San DiegoState University,San Diego, California 92182 TUI. Architecturalacoustics: The forgottendimension. Ewart A. Wetherill (Wilson, lhrig, and Associates, lnc., 5776 Broadway,Oakland, CA 94618) The basic considerationsof architeclural acouslics---isolation from unwanled noise and vibration, control of mechanicalsystem noise, and room acousticsdesign---are all clearly exemplifiedin Sabinc'sdesign for BostonSymphony Hall. Openedin ! 900,this hall isone of theoutstanding successes in musical acoustics. Yet, aswe approachthe hundredthanniversary of Sabine'sfirst experiments, acoustical characteristics remain one of the leastconsidered aspects of buildingdesign. This is due, in part, to the difficultyof visualizingthe acouslicaloutcome of designdecisions, complicated by individualjudgment as to whatconstitutes good acous- tics. However,the lack of a comprehensiveteaching program remains the dominantproblem. Significant advancesover the past 2 or 3 decadesin measurementand evaluationhave refinedthe ability to design predictabilityand to demonsIrateacoustical concerns to others. New techniquessuch as sound intensity measurements,new descriptors for roomacoustics phenomena, and the refinemen t of recording,analysis, and amplificationtechniques provide fresh insights into the behaviorof soundin air and other media.These topics are reviewedwith particularemphasis on the needfor a comparableadvance in translationof acousticprinci- plesinto buildingtechnologies. Sl J. Acoust.Soc. Am. Suppl. 1, VoL86, Fall1989 118thMeeting: Acoustical Society of America S1 TUESDAY MORNING, 28 NOVEMBER 1989 ST. LOUIS BALLROOM C, 8:00 A.M. TO 12:00 NOON SessionA.
    [Show full text]
  • 4: Speech Compression
    4: Speech Compression Mark Handley Data Rates Telephone quality voice: 8000 samples/sec, 8 bits/sample, mono 64Kb/s CD quality audio: 44100 samples/sec, 16 bits/sample, stereo ~1.4Mb/s Communications channels and storage cost money (although less than they used to) What can we do to reduce the transmission and/or storage costs without sacrificing too much quality? 1 Speech Codec Overview PCM - send every sample DPCM - send differences between samples ADPCM - send differences, but adapt how we code them SB-ADPCM - wideband codec, use ADPCM twice, once for lower frequencies, again at lower bitrate for upper frequencies. LPC - linear model of speech formation CELP - use LPC as base, but also use some bits to code corrections for the things LPC gets wrong. PCM µ-law and a-law PCM have already reduced the data sent. Lost frequencies above 4KHz. Non-linear encoding to reduce bits per sample. However, each sample is still independently encoded. In reality, samples are correlated. Can utilize this correlation to reduce the data sent. 2 Differential PCM Normally the difference between samples is relatively small and can be coded with less than 8 bits. Simplest codec sends only the differences between samples. Typically use 6 bits for difference, rather than 8 bits for absolute value. Compression is lossy, as not all differences can be coded Decoded signal is slightly degraded. Next difference must then be encoded off the previous decoded sample, so losses don’t accumulate. Differential PCM Difference accurately coded Code next in 6 bits difference Lossy off previous Compression decoded sample max 6 bit difference 3 ADPCM (Adaptive Differential PCM) Makes a simple prediction of the next sample, based on weighted previous n samples.
    [Show full text]
  • Source Coding Basics and Speech Coding
    Source Coding Basics and Speech Coding Yao Wang Polytechnic University, Brooklyn, NY11201 http://eeweb.poly.edu/~yao Outline • Why do we need to compress speech signals • Basic components in a source coding system • Variable length binary encoding: Huffman coding • Speech coding overview • Predictive coding: DPCM, ADPCM • Vocoder • Hybrid coding • Speech coding standards ©Yao Wang, 2006 EE3414: Speech Coding 2 Why do we need to compress? • Raw PCM speech (sampled at 8 kbps, represented with 8 bit/sample) has data rate of 64 kbps • Speech coding refers to a process that reduces the bit rate of a speech file • Speech coding enables a telephone company to carry more voice calls in a single fiber or cable • Speech coding is necessary for cellular phones, which has limited data rate for each user (<=16 kbps is desired!). • For the same mobile user, the lower the bit rate for a voice call, the more other services (data/image/video) can be accommodated. • Speech coding is also necessary for voice-over-IP, audio-visual teleconferencing, etc, to reduce the bandwidth consumption over the Internet ©Yao Wang, 2006 EE3414: Speech Coding 3 Basic Components in a Source Coding System Input Transformed Quantized Binary Samples parameters parameters bitstreams Transfor- Quanti- Binary mation zation Encoding Lossy Lossless Prediction Scalar Q Fixed length Transforms Vector Q Variable length Model fitting (Huffman, …... arithmetic, LZW) • Motivation for transformation --- To yield a more efficient representation of the original samples. ©Yao Wang, 2006 EE3414:
    [Show full text]
  • Answers to Exercises
    Answers to Exercises A bird does not sing because he has an answer, he sings because he has a song. —Chinese Proverb Intro.1: abstemious, abstentious, adventitious, annelidous, arsenious, arterious, face- tious, sacrilegious. Intro.2: When a software house has a popular product they tend to come up with new versions. A user can update an old version to a new one, and the update usually comes as a compressed file on a floppy disk. Over time the updates get bigger and, at a certain point, an update may not fit on a single floppy. This is why good compression is important in the case of software updates. The time it takes to compress and decompress the update is unimportant since these operations are typically done just once. Recently, software makers have taken to providing updates over the Internet, but even in such cases it is important to have small files because of the download times involved. 1.1: (1) ask a question, (2) absolutely necessary, (3) advance warning, (4) boiling hot, (5) climb up, (6) close scrutiny, (7) exactly the same, (8) free gift, (9) hot water heater, (10) my personal opinion, (11) newborn baby, (12) postponed until later, (13) unexpected surprise, (14) unsolved mysteries. 1.2: A reasonable way to use them is to code the five most-common strings in the text. Because irreversible text compression is a special-purpose method, the user may know what strings are common in any particular text to be compressed. The user may specify five such strings to the encoder, and they should also be written at the start of the output stream, for the decoder’s use.
    [Show full text]