Explain in detail companding, Computer Engineering

Assignment Help:

Explain in detail companding.

Companding: It is the process of compressing and expanding. This includes compressing the signal at the transmitter and expanding this at the receiver. The modulating signal to be transmitted is passed by an amplifier that has correctly adjusted non linear transfer characteristic, favoring minute amplitude signals. Such are the artificially large while they are quantized and therefore the effect of quantizing noise upon them is decreased. The correct amplifier relations are restored at the receiver by expander. This is desirable to agree to several standards for companding as order to realize hardware efficiencies and to permit sending and receiving with a variety of users. The most general application of companding is in voice transmission. Japan and North America have adopted a standard compression curve termed as µ law companding. The law µ companding formula is specified by

Vout = ( Vmax X In (1+ µ Vin / Vmax) / In (1+ µ ) Where

Vmax = Maximum uncompressed modulating input amplitude.

Vin = Amplitude of the input signal at particular immediate at time

µ = Parameter used to describe the amount of compression

Vout = Compressed output voltage.

1421_Companding Curves for PCM.png

FIG - Companding Curves for PCM


Related Discussions:- Explain in detail companding

Explain the meaning of accept socket primitive, Explain the meaning of A...

Explain the meaning of ACCEPT socket primitive. The Accept Primitive: A server which uses connection-oriented transport should call procedure accepts to accept

4 bit comparator, how to breadboARD THE 4 BIT COMPARATOR

how to breadboARD THE 4 BIT COMPARATOR

Define rules for reducing karnaugh maps, Define Rules for Reducing Karnaugh...

Define Rules for Reducing Karnaugh Maps? The rules for reducing Karnaugh Maps (k- maps) are as follows: All of the 1's in the Karnaugh Map are called as minterms. The

Quick sort , Write Quick sort non recursive program

Write Quick sort non recursive program

Back propagation learning routine, Back propagation Learning Routine - Aart...

Back propagation Learning Routine - Aartificial intelligence As with perceptrons, the information in the network is stored in the weights, so the learning problem comes down to

Application and function areas - artificial intelligence, Application and F...

Application and Function Areas - artificial intelligence: Individual applications and function often drive "AI" research much more than the long term relative field described

Execute sparse matrix dynamically, To execute sparse matrix dynamically, Wh...

To execute sparse matrix dynamically, Which data structure is used Linked List data structure is used to execute sparse matrix dynamically

What are the advantages of using uml, Benefits of using UML breaks the comp...

Benefits of using UML breaks the complex system into discrete pieces that can be understood simply. Handover the system to new team becomes simpler. Complex system can be un

State the example of begin end, State the Example of begin end module s...

State the Example of begin end module sequential(); reg a; initial begin $monitor ("‰g a = ‰b", $time, a); #10 a = 0; #11 a = 1; #12 a = 0; #13 a = 1; #

Define memory allocation functions, The various memory allocation functions...

The various memory allocation functions are described below: (i) malloc( ) : It is a memory allocation function that assigns requested size of bytes and returns a pointer to t

Write Your Message!

Captcha
Free Assignment Quote

Assured A++ Grade

Get guaranteed satisfaction & time on delivery in every assignment order you paid with us! We ensure premium quality solution document along with free turntin report!

All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd