Already have an account? Get multiple benefits of using own account!
Login in your account..!
Remember me
Don't have an account? Create your account in less than a minutes,
Forgot password? how can I recover my password now!
Enter right registered email to receive password!
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.
FIG - Companding Curves for PCM
Q. Explain about Integration Levels? Initially only few gates were integrated consistently on a chip. This initial integration was termed as small-scale integration (SSI). With
Q. Returns and Procedures definitions in 8086? 8086 microprocessor supports RET and CALL instructions for procedure call. CALL instruction not only branches to indicate address
Forward Chaining: Now we have suppose we have a set of axioms that we know are true statements about the world. Whether we set these to each be an initial state of the segoal
What do you mean by complexity of an algorithm? The term complexity is used to define the performance of an algorithm. Typically performance is calculated in terms of time or s
Suppose there are 2 copies of resource A, 3 copies of resource B, and 3 copies of resource C. Suppose further that process 1 holds one unit of resources B and C and is waiting for
SSTF stands for ? Ans. Shortest-Seek-time-first scheduling.
TCP and UDP are both transport-level protocols. TCP is designed to give reliable statement across a variety of reliable and unreliable networks and internets. UDP gives a conne
Q. Explain about System Deadlock? A deadlock denotes to the condition when simultaneous processes are holding resources and putting off each other from finishing their executio
Describe briefly how firewalls prevent network. A firewall is only a program or hardware device which filters the information coming via the Internet connection within your pr
What is the Octant to hexadecimal conversion of 734 ? Ans. (734) 8 = (1 D C) 16 0001 ¦ 1101 ¦ 1100 1 D C
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!
whatsapp: +91-977-207-8620
Phone: +91-977-207-8620
Email: [email protected]
All rights reserved! Copyrights ©2019-2020 ExpertsMind IT Educational Pvt Ltd