Voice over IP is a method of forwarding voice as packets using the Internet Protocol (IP) over an IP network . Sending a voice over a packet-switched network has some advantages such as cost savings and improved services . But the quality of the voice sent has not always been competitive. Packet switching has a 'best effort' performance . The network sends every packet as fast as possible but there is no preference in treating the packets. Also, there is no guarantee that all packets have been delivered successfully . According to V.Hardman et al., 1995 , 'packet loss is a persistent problem and the end-to-end delay is also a critical factor.' Jitter is also a problem occurring in Voice over IP and in the study done by Shveni Mehta, 2005 , the codec used to transform the analog signals into digital form is a factor to be considered as well.
2.1 Packet loss and discards
Get your grade
or your money back
using our Essay Writing Service!
Loss of packets greatly affects the voice quality and unfortunately they are very common. Some sources of packet loss are:
Congestion of routers and gateways , . When there are too many packets which are being sent, the router cannot handle all of them. The packets start queuing and there is a buffer overflow. The arriving packets are discarded by routers . The size of the buffer is limited.
The internet routes packets one at time. Some of the packets may be delayed during their transmission , , . If they are late for too long, they become useless in some cases and are discarded by the receiver .
Bit error can be another problem. In certain cases, there are some bits which get changed when the packets travel from one place to another . The sum of bits present in the packet is attached to it. When the packet is received, the router checks the content of the packet and the sum of bits. If they are different, the packet gets discarded.
Also packets can get lost if it's time-to-live (TTL) in its header is expired. Due to this reason, even with an infinite buffer size, packet loss is not eliminated as stated by Nagle 1987.
2.2 Types of delays
Packets are sent to their destination via a series of intermediate nodes. The sum of all delays experienced by a packet on its way to the destination is called the end-to-end delay. In a research conducted by T.Brady, 1971, if the conversation patterns are not to be broken down, the end-to-end delay should be kept below 600ms in the absence of echoes. The packet size directly affects the end-to-end delay. There are some delays which are relatively fixed such as coding algorithms and decoding and there are some which rely on the network conditions .
Processing delay: the time a routing device takes to acquire a packet in and forward it . The information takes a certain amount of time to travel across the network and to reach the other end. Router need to examine the packet's header and direct it, manage the data flow and select the best path.
Queuing/Buffering delay: time taken for the packet to be buffered before transmission of packets onto the link . When a user sends many packets at a time, the router cannot deal with all of them together. So it assigns priorities and a queue is created. The packets wait until the router processes then.
Propagation delay: time taken for a digital signal to be transmitted via the wire .
Transmission delay: time taken for a router to send the packet onto the wire .
Packetization delay: time taken for the encoded information to be placed in a packet. This delay is also called accumulation delay since the voice accumulates in a buffer before being released . Packetization delay depends on the block size and the number of blocks.
Jitter is the variation of delay of the arrivals of the packet and it is present only in packet-based networks . There is an expected time interval for the packets to reach its destination but they may experience different delays. Edward J.Daniel et al., 2003  examined the characteristics and causes of the network delay jitter and developed a model for simulation of jitter. In the study, the main cause of jitter is the queuing delays experienced by the packets at the nodes. Also when there is congestion in the IP network, the packets take different paths to reach their destination and this may lead to packet delay jitter. To reduce this effect, jitter buffers or play-out buffers are used . The buffer will introduce a small amount of delay so that the timing variations are smooth. However, using buffers to surmount this problem can lead to end-to-end delay .
2.4 Packet Recovery Techniques
Always on Time
Marked to Standard
'Packet loss is unavoidable' as stated by T J.Kostas et al., 1998  but it can be controlled so that a better quality of speech is produced. Many methods were proposed by many authors and they can be separated into two techniques :
2.4.1 Receiver-based techniques
Receiver-based techniques perform its action at the receiver only. This technique performs error-concealment whereby only an estimate of the missing packet is obtained . There are three main categories in the received-based repair:
Figure 2.1: Receiver based schemes 
184.108.40.206 Insertion-based schemes
In this type of scheme, a 'fill-in' frame is inserted for a lost packet. This technique is easy to implement. A special feature of this technique is that the features of the signal are not used to help reconstruction. But the performance is usually of poor quality .
In splicing, the lost packet is replaced by zero-length fill-in. There is no gap left but the timing of the data is changed . A study on this technique has been performed by J. G. Gruber and L. Strawczynski, 1985 . Splicing was shown to perform weakly and can be used for very low loss rates (<3%).
In this technique, the lost packets are replaced by the value '0'. The space left by a missing packet is filled up by silence so as the timing relationship between the neighbouring packets is maintained . This method is widely used because it is very simple to implement. However as the packet sizes and loss rate increases, the result produced by silence substitution gets worst. The performance of silence substitution is good for short packet lengths (< 4 ms) and low loss rates (< 2 %) .
The use of noise can be a replacement for a lost packet. Background noise, usually additive white Gaussian noise, is inserted in the space left by the missing packet. Warren, 1982  investigated the human perception of interrupted speech. It was shown that the human brain has the capacity of repairing the missing speech segment with a noise rather than a moment of silence. This is done naturally by the human brain. This effect is known as 'phonemic restoration'. The quality of the speech seems to be better  and it has an improved intelligibility  with noise substitution. The timing relationship can still be preserved. Moreover during the silent periods, the sender can send a 'comfort noise' for the lost packet. Therefore noise substitution is usually more recommended than silence substitution , .
Packet repetition is the replacement of the missing packet by a copy of the previous packet that reached just before the loss. The performance of packet repetition is good and it is less complex. Fading of the repeated units can be made to improve the quality of repetition. The signal amplitude is decreased to zero. Packet repetition with fading is a step towards the interpolation techniques .
220.127.116.11 Interpolation-based schemes
There are several Interpolation-based methods and they try to interpolate from packets which are found near a loss so as to act as a substitute for the missing packet . Interpolation has a key advantage compared to insertion-based techniques. The varying features of a signal are taken into consideration for the replacement. But they are more difficult to implement .
In this method, a sound is used before and non-compulsorily after so as to find a signal which is suitable to replace the missing packet. From the correct speech which is received, a segment is taken to fill in the lost packet. A study of waveform substitution has been performed by Goodman et al., 1986 . The sound quality has been found to be better than using silence substitution or packet repetition.
Pitch Waveform Replication
Wasem et al, 1988  used a pitch detection algorithm. In this scheme, positive and negative peaks in the waveform which give an approximation of the pitch are continuously searched. It has been found that Pitch Waveform Replication gives a better result than waveform substitution.
Time Scale Modification
Time Scale Modification enables the audio signal to be stretched across the space created left by the missing packet. Sanneck et al, 1996  presented a scheme where vectors of pitch cycles which intertwine each other on each side of the loss, are offset to compensate for the loss and at the place of overlapping, the vectors are averaged. Time scale modification is computationally heavier but the result is better than waveform substitution and pitch waveform replication .
18.104.22.168 Regeneration-Based schemes
This Essay is
a Student's Work
This essay has been submitted by a student. This is not an example of the work written by our professional essay writers.Examples of our work
Regeneration-Based scheme uses algorithms for audio compression so as to obtain codec factors to produce a replacement waveform. The result is expected to be good since a lot of information is used in the repair but this model is used rarely because it is difficult to implement . There are two types for this scheme:
Interpolation of transmitted state
The decoding part can interpret what the state codec should be in. The reproduced signal gradually fades when there are more losses. This method is not simple to implement .
In this technique, speech is regenerated to fit in the missing segment to cover the loss. 
2.4.2 Sender-Based Repair techniques
Figure 2.2: taxonomy of sender-based repair techniques 
The audio encoding format is modified by the Sender-Based Repair technique by adding a certain amount of redundancy information to it unlike receiver-based techniques . The sender-based repair can be divided into two parts :
Passive channel coding
Retransmission is simple to work with. To retransmit, it is not necessary to use the original data. The speech can be changed to a lower bandwidth depending on how much overhead can be accepted. But it adds on to the communication latency. Retransmission requires information like the packet's sequence number and an acknowledgement thus increasing the amount of overheads .
2.5 Forward Error Correction (FEC)
A common example of passive channel coding is forward error correction (FEC). FEC techniques are generally based on the use of error detection and correction. In FEC, a controlled amount of redundant packets is transmitted together with the original packets. Errors can be spotted and corrected without retransmitting the message again . There are many FEC algorithms namely Hamming code, Bose-Chandhuri-Hocquenghem code and Reed-Solomon code. The data transmission channel can greatly affect a code's performance . FEC can be media-independent, that is it does not depend on the contents of the information. However FEC schemes introduce additional delays and an increased amount of bandwidth is used. Media-specific FEC technique transmits each unit of the speech in many different packets. In case of a packet loss, another packet with same unit can be used instead , . Error-correcting codes, though being more complex than error detection codes are usually given more attention in communication applications . It can be divided into:
Message blocks of fixed length are formed from the binary information sequence. Each message block contains k information bits and they are encoded into a block of n codeword digits. Parity bits are attached to the information bits forming the group of n bits. Linear block codes are characterised by the notation (n,k) with a block code of length n and 2k code words . Reed-Solomon code is the most known block code. Block codes are usually chosen in cases where applications need high speed to perform.
2.5.1 Convolutional codes
Convolutional code adds redundant bits. Its notation is (n, k, K). The ratio k/n is known as the code rate. The integer K is the constraint length and it represents the number of K (k bit) stages that the shift registers consists of. In a convolutional encoder, the input sequence of k-bit information is passed through shift registers. The output bits of the registers are sampled to form the binary code symbols and are then transmitted. The original information sequence can be found if the decoder knows the encoder's state sequence. An important feature of the convolutional encoder is that it has a memory. The outputs of the encoder do not depend only on the input k, but also on the previous K-1 input .
Figure 2.3: Convolutional encoder 
Viterbi Convolutional decoding
The viterbi algorithm reconstructs the maximum likelihood path in the trellis. The distance between the received signal at a time t and all the trellis paths go through each state at that time is calculated. This algorithm causes less heavy load .
2.5.2 Reed-Solomon codes
22.214.171.124 Overview and Properties
Reed-Solomon codes are non-binary cyclic error correcting codes and they form part of optimal erasure codes. Since its discovery in 1959 by Irving Reed and Gus Solomon, the Reed-Solomon code has become an essential part of many wireless communiction applications, satellite communication, storage devices, digital television and broadband modems (ADSL) .
Reed-Solomon codes add redundant information to the original data. After encoding, the encoded data may contain errors. The decoder will then detect where errors are found in the output data and will correct them with the help of the redundant information added. The amount of redundancy is important since the number of errors that can be corrected will depend on it.
The total number of code symbols in the encoded block, n, present in a block code consist of k information bits and r parity bits. A Reed-Solomon code is represented by the notation (n, k). The code has n number of symbols which consist of m number of bits. The number of k information symbols is also known as the dimension of the code.
n = 2m - 1 [2.1]
The difference (n-k) which represents the number of parity symbols is also called 2t. The number of symbols that can be corrected by the Reed-Solomon decoder is up to (n-k)/2 .
Only half of the parity symbols are corrected. One parity symbol is used to trace the error and another one to correct the error. One useful characteristic of Reed-Solomon code is that information symbols added to an RS code of length n wiill not decrease its minimum distance . The minimum distance is given as:
dmin = n - k +1 [2.2]
One property of Reed-Solomon codes is that they can correct burst errors . These errors are caused due to fading in the communication channel. RS code can correct a symbol with only one bit error and also a symbol which has errors in all its bits since it will take it as a single error. In case of erasures, the error is already situated. So only one parity symbol is used so as to correct the error. Reed-Solomon code is the best option for encoding and decoding for its ability to correct burst errors and erasures according to Mohit Agrawal, 2010-2011 .
Reed-Solomon code is a good choice when long block codes need to be transmitted because when the code block size increases, the error performance is also better. As the amount of redundancy added increases, the code rate decreases and the error-correcting capability also increases .
126.96.36.199 Galois field
Encoding and decoding with Reed-Solomon codes is based on a field called Galois field. A field is a resulting collection of operations like addition, subtraction, division or multiplication and they are subject to the laws of commutativity, distributivity and associativity . Galois fields are finite and can be represented by a fixed length binary word. A galois field GF(p) contains p elements.
The Galois field can be widened to GF(pm) where m is non zero positive integer . A generator polynomial generates each element of the field. There can be different polynomials which will generate different fields. Primitive polynomial is used in Reed-Solomon codes and it defines the finite fields (2m) . A polynomial is normally written starting with low order to the high order.
2.6 Theoretical Framework
In this section, some theories of digital communication will be reviewed.
Digital voice communication
Voiced and unvoiced sounds
In this part we will discuss how speech signals are produced. Speech production can be grouped into three different components :
The first one is the quasi-periodical pulse.
The second case is where the input excitation is noise-like in nature.
And the last one is where there is no excitation.
Voice speech occurs when the input excitation is almost periodic. Oscillatory vibrations of the vocal cords form voiced sounds. The vocal fords stop the air blown out of the lungs through the trachea and the glottal wave is produced . There are some fundamental frequency and its harmonics in the spectrum of the voiced speech. The existence of the harmonic structure is defined by the frequency components which are repeated at regular intervals.
C:\Users\MY PC\Desktop\mashouda\voiced nd unvoiced_files\experiment3-theory-fig4.JPG
Figure: Block diagram representation of voiced speech production 
The duration of each cycle is known as the fundamental period (T0) .The fundamental frequency (F0) of input excitation is called theÂ pitch frequencyÂ and it is one of most essential factor of the voice source , . The pitch depends on the intensity and composition. The pitch is much higher in female and children voice, about 200 Hz for an average female voice and 200-300 Hz for children whereas for men it is usually around 100 Hz .
In unvoiced speech, the air is forced through a vocal tract obstruction resulting in a turbulence and the sound caused is usually represented by a noise source. There is neither fundamental frequency nor any harmonic structure in the excitation signal . It has a relatively flat spectrum. This is how a voiced and an unvoiced speech can be distinguished .
C:\Users\MY PC\Desktop\mashouda\voiced nd unvoiced_files\experiment3-theory-fig61.jpg
Figure: Block diagram representation of unvoiced speech production 
The voiced and unvoiced speech is produced in sequence and they are separated by a silence region. In this region, there is no speech output. However silence is important since the speech becomes clearer and the information present in the speech can be identified .
In the analog, the voice transmission frequency spectrum is technically 4 KHz. For digital telecommunication, the signal is 8 KHz, that is it is sampled twice the rate .
Figure: PCM Communication 
Figure shows the steps required for PCM communication. Pulse Code Modulation is used to convert analog signals into digital form . The input signal which is an analog signal is first passed through a low pass filter of a certain cutoff frequency. All frequency components above this cutoff frequency will be blocked. The signal is then sampled to produce a Pulse Amplitude Modulated signal. Sampling is a process whereby the values of the filtered input signal can be obtained at discrete time intervals, that is at a constant sampling frequency . The sampling rate (fs = 2fm) is also known as the Nyquist rate. The sampling frequency should be selected above the Nyquist rate so that there is sufficient number of samples to represent the analog waveform (aliasing) .
fs â‰¥ 2fm
The PAM signal is continuous in amplitude and discrete in time. The signal is converted to a digital form. Each sample obtained is allocated a discrete value from a range of possible values which is reliant on the number of bits used to characterize each sample and this process is called quantization. Each sample is assigned to the quantization level nearest to the value of the sample. Quantization noise or error is obtained by making the difference between the original speech and the discrete value assigned to it. It can be reduced by increasing the number of quantization levels. When Quantization noise increases, the signal-to-noise ratio of a signal decreases since there are more errors. .
Quantization can be uniform or non-uniform. In the uniform quantization, the quantization levels are uniformly spaced. The quantization noise is the same for all the magnitudes since noise is dependent on the step size.
A non-uniform quantization process is also known as companding. In non-uniform quantization, the step size varies.Â The quantization noise is proportional to the signal size . Noise is reduced for the weak leading signals but for the rarely occurring signals, noise increases .
Compressing the signal to be transmitted at the transmission side and expanding it at the receiving side forms the companding process. There are two companding schemes  namely:
Âµ-law companding (used in North America)
A-law companding (used in Europe)
Speech coding is the process of compressing the voice signals for efficient transmission. Coding algorithm is used to minimize the bit rate in the digital representation of a signal without a significant loss of the signal. A digital speech is changed into a coded representation by a speech coder and a speech decoder reconstructs the speech . Speech coders are different in terms of bit rate, delay, level of complexity and perceptual quality of the speech . A good speech coding is one which uses less bit rate to represent a speech while preserving a good quality of speech. Speech can be processed in blocks using the speech coders but this causes a communication delay. There are mainly two speech coding techniques:
It tries to reproduce the speech waveform as identical as possible . It is at high bit rates that this type of coding gives a good quality of speech .
They keep only the spectral properties of the speech. Even a lower bit rates, a clear speech can be produced .
Speech coders are used in cellular communication, videoconferencing and voice over IP.
2.6.4 Gilbert Model
Figure: Gilbert Model
The Gilbert loss model, also known as the 2-state Markov chain model is used to implement burst packet loss. It is simple and is well accepted to be used in voice over IP. The network is modeled with two states. State '1' represents a packet loss and state '0' represents delivery of the packet to its destination . Figure shows the different states and whether a packet is lost or delivered.
Gilbert model is usually a better approximation for the processes of packet loss. The parameter p denotes the transition probability from state '0' to state '1'. It is the probability that a packet will be dropped next given that the previous packet is not lost. The parameter q denotes the probability to remain in state '1'. It is the probability of a packet being dropped given that the previous packet is dropped.
The matrix of transition probability of Gilbert model is:
2.6.5 Erasure codes
Erasure code is a forward error correction code for the binary erasure channel. To protect information from getting lost, erasure codes provide space-optimal data redundancy . These codes are used in communication systems and in storage systems . k blocks of source data generates n blocks of encoded data such that the original data can be recovered back from a subset of the k blocks. The receiver protects the data up to n-k nodes. The code is represented as an (n, k) code . The code rate is as follows:
r = ()
There are different types of erasure codes:
Optimal erasure code
Near optimal erasure code (examples: LT codes, Raptor codes)
Rateless erasure code/ Near optimal fountain
In this project, both receiver and sender-based repair techniques are used for the concealment of packet loss. The speech is encoded using two different FEC schemes, Reed-Solomon code and Convolutional code. After passing through the Gilbert packet loss model, the lost packets are replaced using silence substitution and packet repetition techniques. The two FEC schemes and the receiver-based techniques are compared to know which combinations of techniques perform better.
 You Don't Know Jack About VoIP, THE COMMUNICATIONS THEY ARE A-CHANGIN'.
PHIL SHERBURNE AND CARY FITZGERALD, CISCO, September 1, 2004 at:
 A Brief History of VoIP, Document One, Joe Hallock - The Past, November 26, 2004
Evolution and Trends in Digital Media Technologies - COM 538 Masters of Communication in Digital Media University of Washington at:
 JISC Voice over IP: what it is, why people want it, and where it is going, Jane Dudman, Contributing author: Gaynor Backhouse, September 2006 at:
 QuickStudy: Packet-Switched vs. Circuit-Switched Networks, By Lee Copeland, March 20, 2000 12:00 PM at: http://www.computerworld.com/s/article/41904/Packet_Switched_vs._Circuit_Switched_Networks
 Vicky Hardman, Martina Angela Sasse, Mark Handley, Anna Watson,, ''Reliable audio for use over the Internet,'' Proc.INET '95, 1995.
 Comparative Study of Techniques to minimize packet loss in VoIP, Shveni P Mehta, 21st Computer Science Seminar SB3-T2-1, 2005 at:
 C. Perkins, O. Hodson, and V. Hardman, "A survey of packet loss recovery techniques for streaming audio," IEEE Network, 1998, pp. 40-48.
 Real-Time Voice Over Packet-Switched Networks
Thomas J.Kostas, Michael S.Borella, Ikhlaq Sidhu, Guido M.Schuster, Jacek Grabiec and Jerry Mahler 3COM, IEEE Network, January/February 1998
 AN OVERVIEW OF VOICE OVER INTERNET PROTOCOL (VOIP)
Graduate student, M.S. in Computer Science Program, Rivier College
RIVIER COLLEGE ONLINE ACADEMIC JOURNAL, VOLUME 2, NUMBER 1, SPRING 2006
 An Analytic and Experimental Study on the Impact of Jitter Playout Buffer on the
E-model in VoIP Quality Measurement
Olusegun Obafemi, Tibor Gyires ,Yongning Tang
ICN 2011 : The Tenth International Conference on Networks
 The benefits of VoIP, By Yuval Shavit, Features Writer, This was first published in November 2007 at:http://searchnetworkingchannel.techtarget.com/feature/The-benefits-of-VoIP
 Best Efforts Networking, Geoff Huston July 2001, at :
 Tier 1, MPLS Specialists Telecom Et Wan Solutions Worldwide, What Causes Packet Loss on the Internet?, October 30, 2007 by sgarson at:http://www.mpls-experts.com/what-causes-packet-loss-on-the-internet/?doing_wp_cron=1361361661.8698310852050781250000
 SHORT PAPER
International Journal of Recent Trends in Engineering, Vol 2, No. 3, November 2009 120
AN IMPROVED PACKET LOSS RECOVERY IN VOIP USING COMBINED SOURCE AND RECEIVER BASED TECHNIQUE
K.Maheswari1, Dr. M.Punithavalli 2
1SNR Sons College
Dept. of Computer Applications ,coimbatore, India
2 Sri Ramakrishna College of Arts and Science for Women
Dept. of Computer Science and Applications, coimbatore, India
 On Packet Switches with Infinite Storage, This paper appears in:
Communications, IEEE Transactions on
Date of Publication:Â Apr 1987
Product Type:Â Journals & Magazines
On Packet Switches with Infinite Storage, JOHN B. NAGLE, IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. COM-35, NO. 4, APRIL 1987
 Brady P.T. 'Effects of Transmission delay on Conversational Behaviour on Echo-Free Telephone Circuits' Bell System Technical Journal, pp 115-134, January 1971.
Characterizing Network Processing Delay
Ramaswamy Ramaswamy, Ning Weng and Tilman Wolf
Department of Electrical and Computer Engineering
University of Massachusetts
Amherst, MA 01003
 An Inter-arrival Delay Jitter Model using Multi-Structure
Network Delay Characteristics for Packet Networks
EdwardJ Daniel, Christopher M White, and Keith A. Teague
School of Electrical and Computer Engineering
Oklahoma State University
 Packet Loss Concealment for Audio Streaming
Submitted in Partial Fulfillment of The Requirements for the Degree of Master of Science in Electrical Engineering
Submitted to the Senate of the Technion - Israel Institute of TechnologySivan, 5766 Haifa June, 2006
 J. G. Gruber and L. Strawczynski, "Subjective effects of variable delay and clipping in dynamically managed voice systems," IEEE Trans. Commun., vol.COM-33, no. 8, Aug. 1985, pp. 801-8.
 N. S. Jayant and S. W. Christenssen, "Effects of packet losses in waveform
coded speech and improvements due to an odd-even sample-interpolation procedure," IEEE Trans. Commun., vol. COM-29, no. 2, Feb. 1981, pp. 101-9.
 R. M. Warren, Auditory Perception, Pergamon Press, 1982
 G. A. Miller and J. C. R. Licklider, "The intelligibility of interrupted speech,"
J. Acoust. Soc. Amer., vol. 22, no. 2, 1950, pp. 167-73.
 [D.J Goodman, G.B Lockhrt, O.J. Wasem and W.-C Wong, ''Waveform Substitution Techniques for Recovering Missing Speech Segments in Packet Voice Communications'', IEEE Transactions on Acoustics, Speech and Signal Processing, vol 34,num6,pp 1440-1448, December 1986
 C. O.J.Wasem, D.J.Goodman and H.G.Page, \The effects of waveform substitution on the quality of pcm packet communication," IEEE Transactions on Acoustics, Speech, and Signal Processing, vol. 36, no. 3, pp. 342-348, 1988.
 K. H.Sanneck, A.Stenger and B.Girod, \A new technique for audio packet loss concealment," in IEEE Global Telecommunications Conference, pp. 48-52, November 1996.
 Frequency-Domain Stochastic Error Concealmentfor Wireless Audio Applications, Andreas Floros & Markos Avlonitis & Panayiotis Vlamos
# Springer Science + Business Media, LLC 2008
 Use Forward Error Correction To Improve Data Communications, Electronic Design, Aug 20,2000 at:
 J.C Bolot and A.Vega.Garcia, ''The case for FEC based error control for packet audio in the Internet,'' to appear, ACM Multimedia Sys.
 Forward Error Correction (FEC)
David R.Goff, Fiber Optic Video Transmission, 1st ed Focal Press: Woburn, Massachusetts, 2003 and other private writings.
 Digital Communications: Fundamentals and Applications, Second Edition, Bernard Sklar, Prentice Hall PTR, Upper Saddle River, New Jersey 07458, Published Jan 11, 2001 byÂ Prentice Hall
 QoS Evaluation of Sender-Based, Loss-Recovery Techniques for VoIP, Teck-Kuen Chua and David C. Pheanis, Arizona State University, IEEE Network November/December 2006 pg 16 at:
 Reed Solomon codes, Joel Sylvester, January 2001, elektrobit at:
 IMPLEMENTATION OF REED SOLOMON ERROR CORRECTING CODES
A THESIS SUBMITTED IN PARTIAL FULFILLMENT OF THE REQUIREMENTS FOR THE DEGREE OF Bachelor of Technology in Electronics and Communication Engineering By MOHIT AGRAWAL , Department of Electronics & Communication Engineering ,National Institute of Technology Rourkela ,2010-2011
 Reed Solomon Encoder/Decoder on the StarCoreâ„¢ SC140/SC1400 Cores, With Extended Examples By Jasmin Oz and Assaf Naor
Rev. 1, 12/2004 pg 1-2
SPEECH ANALYSIS: THE PRODUCTION-PERCEPTION PERSPECTIVE
Li Deng and Jianwu Dang
One Microsoft Way, Redmond, WA 98052
School of Information Science , Japan Advanced Institute of Science and Technology
University of California Los Angeles The Voice Source in Speech Production: Data, Analysis and Models A dissertation submitted in partial satisfaction of the requirements for the degree Doctor of Philosophy in Electrical Engineering By Yen-Liang Shue 2010, pg3
 COMP449: Speech Recognition
Department of Computing, Macquarie University,Â Sydney, Australia
Chapter 7. The Source Filter Model of Speech Production,
Part I. Acoustics and Digital Signal Processing
Copyright Â© 2002 Department of Computing at:
 Technology Review#2001-2 , Network Convergence and Voice over IP, Debashish Mitra ,March 2001 at:
 Title: Pulse code modulation techniques : with applications in communications and data recording /â€‹ Bill Waggener.
Author: Waggener, William N.
Published: New York : Van Nostrand Reinhold, c1995.
 Communication Systems II, Dr. Wa'il A.H. Hadi
Digital Communication Systems at:
 SPEECH CODING: FUNDAMENTALS AND APPLICATIONS
University of Illinois at Urbana-Champaign
University of California at Los Angeles
Los Angeles, California at:
 10.2 Speech Coding, Bishnu S. Atal & Nikil S. Jayant
AT&T Bell Laboratories, Murray Hill, New Jersey, USA at:http://www.cslu.ogi.edu/HLTsurvey/ch10node4.html
 Packet Loss Recovery and Control for Voice Transmission over the Internet (2000) by Henning Sanneck pg 70-72 at:
 Using Erasure Codes Efficiently for Storage in a Distributed System, Marcos K. Aguilera, Ramaprabhu Janakiraman, Lihao Xu, 2005 at:
 Effective Erasure code for Reliable computer Communication Protocols, Luigi Rizzo, Dip.di Ingegnaria dell'Informazione, Universita di Pisa via Diotisalvi 2-56126 Pisa(Italy)
Published in: Newsletter ACM SIGCOMM Computer Communication Review, vol.27 issue 2, Apr. 1997, page 24-36