A Study of Source Controlled Channel Decoding for GSM AMR Vocoder
|
|
- Kelly Hopkins
- 5 years ago
- Views:
Transcription
1 A Study of Source Controlled Channel Decoding for GSM AMR Vocoder K.S.M. Phanindra Girish A Redekar David Koilpillai Department of Electrical Engineering, IIT Madras, Chennai phanindra@midascomm.com, girish@iitm.ac.in, koilpillai@tenet.res.in Abstract Error resilience is an important consideration in wireless communication systems, where effects like multipath fading and shadowing make channels error-prone. In this regard, Source Controlled Channel Decoding (SCCD), introduced by J. Hagenauer [2], is a useful method to reduce the errors induced by the channel. In the literature, this technique has been successfully applied to the GSM full rate (FR) and enhanced full rate (EFR) codecs. Adaptive Multirate (AMR) coder is a state of the art vocoder introduced into GSM standard in In this paper, we study the effect of using the wellknown SCCD algorithm for three representative modes of the GSM AMR vocoder kbps, 7.4 kbps and 4.75 kbps modes. Significant inter-frame and intra-frame correlations are observed between bits of these three modes. We exploit these correlations using an APRI-SOVA[2] algorithm and show that for the highly correlated bits, SNR gains of 1 db can be obtained as compared to the conventional approach. 1. Introduction Practical source coders do not perform complete compression due to limitations like delay, complexity, and non-stationary nature of the source, leaving some redundancy in the encoded bits. Different source-encoded bits have different significance with regard to reconstruction. In the GSM AMR vocoder, a 20 msec speech segment is encoded into a single frame. These encoded bits are not completely independent and some bear significant correlation with other bits in the same frame (intra-frame correlation); equipositioned bits in succeeding/preceding frames are also correlated (inter-frame correlation). This correlation can be exploited to combat noise and other signal impairments in order to improve the overall performance [Fig.1]. Source Controlled Channel decoding [2] exploits source redundancy at the channel decoder. We study the use of this Figure 1: Relation between source and channel (de)coding in a wireless link technique for the GSM AMR codec. A simple modification of the Viterbi Algorithm (VA) that accomodates a priori information about the source symbols and generates soft outputs was presented in [2]. The resulting A priori Soft Output Viterbi Algorithm (APRI-SOVA) was then used to obtain improved BER performance in the GSM full rate (FR) vocoder. Hindelang [1] extended Hagenauer s work on GSM-FR vocoder by exploiting intra-frame correlation in addition to inter-frame correlation. Veaux [4] exploits both inter and intra-frame correlations and presents results for GSM full rate as well as enhanced full rate speech codecs. Strauch [3] presents a low complexity approach to SCCD and gives results for both GSM full rate and enhanced full rate systems. In this paper, we explore the use of SCCD for three modes of the GSM AMR system. AMR has eight different modes, viz. 12.2, 10.2, 7.95, 7.4, 6.7, 5.9, 5.15 and 4.75 kbps. In our simulations, we investigated 12.2, 7.4 and 4.75 kbps modes for presence of inter-frame and intra-frame correlations. We have found significant amount of both types of correlations. As expected, 12.2 kbps mode has the largest correlation whereas the 4.75 kbps mode, the least. We have identified the highly correlated bits in these three modes and used an APRI-SOVA algorithm to improve BER. For the highly correlated bits in the 12.2 kbps mode, we have achieved SNR gains of around 1 db over the SOVA algorithm which does not use one or both of the inter- and intra-frame correlations. For the other two modes, the gains obtained are less but are still significant. Compared to the SOVA algorithm, 1
2 the bit-errors of the highly correlated bits reduced significantly by the use of APRI-SOVA algorithm. These highly correlated bits also represent the most important bits for signal reconstruction at the source decoder and hence the reconstucted speech quality can be expected to be better. The paper is organized as follows. We present the observed inter-frame and intra-frame correlations in the next section. The APRI-SOVA model used for exploiting the correlations is described in section 3. Finally, simulation results are presented for the three modes of AMR that we have studied. 2. Inter-frame and Intra-frame correlations in GSM AMR In order to study inter and intra-frame correlations in GSM- AMR encoded bits, we took several noise-free speech test vectors, encoded them using the AMR encoder, and then observed the output frames for the presence of inter-frame and intra-frame correlations. To quantify the amount of correlation, we estimated the probability of change (P c ). Let u k,b {1, 1} represent the bit at position b in frame k. Inter-frame correlation for bits in position b is estimated over N frames by finding the probability of change as P c = P (u k,b u k 1,b ) = P (u k,b u k 1,b = 1) = no. of times u k,b u k 1,b = 1 (1) N 1 Intra-frame correlation between bits at position m and n of the frame k is estimated over N frames by finding probability of change as P c = P (u k,m u k,n ) = P (u k,m u k,n = 1) = no. of times u k,m u k,n = 1 N Given a bit pair, P c indicates the probability with which one of the correlated bit will be different from the other. If P c is close to zero, the bits will be very highly correlated. To identify highly correlated bits, we chose a P c value of 0.35 as the thresold. All bit pairs which have a probability of change less than or equal to this thresold are identified as highly correlated bits Inter-frame correlation The bit-positions (in an AMR encoded frame) of the highly correlated bits for the 12.2 kbps, 7.4 kbps and 4.75 kbps modes of AMR are listed below. (2) 12.2 kbps mode : 1, 8, 9, 10, 25, 39, 40, 41, 48, 87, 88, 98, 137, 138, 142, 143, 144, 151, 190, 201, 240, kbps mode : 1, 27, 28, 29, 52, 55, 81, 84, 88, 89, 90, 113, 116, 142, kbps mode : 1, 24, 25, 26, 48, 82 The 12.2 kbps mode has the highest inter-frame correlation with 22 highly correlated bits whereas the 7.4 kbps mode has 15 higly correlated bits. The inter-frame correlations exhibited by 4.75 kbps mode are somewhat inconsistent for different test vectors. Also, the amount of correlation is not as significant as in the 12.2 kbps and 7.4 kbps modes Intra-frame correlation We give below the bit-numbers of the intra-frame correlated bit pairs in the frame output by the AMR encoder kbps mode : , , , 48-98, , , kbps mode : 27-88, 28-89, 29-90, 52-81, 55-84, , kbps mode : 48-82, Only the first two modes have significant intra-frame correlations. In the 4.75 kbps mode, only two highly correlated bit pairs are found, and these are again incostitent over several test-vectors Observations Most of the bits that exhibit inter-frame correlation also exhibit intra-frame correlation. All the bits that exhibit significant correlations are class 1a bits and hence very important for signal reconstruction at the source decoder. The correlated bits mostly represent the MSBs of the line spectral frequencies, adaptive code-book index, and fixed code-book gain. 3. Correlation model to generate a priori information A complete GSM AMR link as shown in Fig.2 was used for our simulations. We used a soft-output equalizer and an APRI-SOVA channel decoder. Hagenauer has shown in his paper [2] that the Viterbi metric for the APRI-VA can be derived as M m k = M m k 1 + N x m k,nl ck,n y k,n + u m k L(u k ) (3) n=1 2
3 P prio (u q = +1 u r = 1) = P (c) P (c) + P (a) (5) We can similarly find the a priori conditional probabilities of bit u r. Once these are found, taking the log-likelihood ratio gives the a priori soft values used in Eq.(3). Figure 2: GSM AMR link level block diagram where the subscript k indicates time, Mk m denotes the path metric of the m th state sequence through the trellis, 1/N is the rate of the convolutional code, x k,n is the n th bit of the output of the convolutional encoder, L ck,n y k,n denotes the received soft output from the channel corresponding to x k,n, and L(u k ) denotes the a priori soft values of the source. From equation (3), it can be seen that we need a model to generate the a priori soft values L(u k ). The model uses the soft-values of the already decoded frames coupled with correlation data to generate this a priori information. Several simple models are proposed in the literature to estimate the a priori information, notably Hagenauer s HUK model [2], Veaux s model [4] and Hindelang s intra-frame model [1]. We extended Hindelang s model and used it both for interframe and intra-frame correlations. We describe it below. Assume that bits u q and u r are correlated with each other and we want to estimate the a priori probability of bit u q. Now, from probability arguments, we can write P prio (u q = +1) = P prio (u q = +1 u r = +1).Ppost(u r = +1) + P prio (u q = +1 u r = 1).Ppost(u r = 1) (4) where P prio and Ppost refer to the a priori and a posteriori probabilities respectively. The model estimates the conditional probabilities in the above equations based on the available statistics. As frames are received, the values of u q and u r are stored as the set (u q, u r ). The 4 possible sets are a = ( 1, 1), b = ( 1, +1), c = (+1, 1) and d = (+1, +1). The probabilities of each of these sets can be estimated dynamically using a sliding window that stores the N recent sets. For example, P (a) = of times a occurs in sliding window N Once the probabilities of the symbols are calculated, the a priori conditional probabilities of bit u q can be found from P prio (u q = +1 u r = +1) = P (d) P (d) + P (b) Note that this model uses Ppost(u q ) to estimate P prio (u r ). In the case of inter-frame correlation, u q is the bit in the previous frame and hence Ppost(u q ) is available. But for intra-frame correlation, u q is a bit in the current frame and hence Ppost(u q ) is not available at the time of decoding u r. To obtain this information, the channel decoder needs to be run twice in intra-frame correlation case. We first run a SOVA decoder without a priori information. Then from the obtained soft outputs, we can get L post (u q ) and from that Ppost(u q ). Then we run the APRI SOVA channel decoder with the obtained a priori information just obtained. 4. Simulation results In this section, simulation results obtained using a two-path block-rayleigh fading channel are presented. The results are for a clean speech test vector that has 10,000 frames. In the following sections, the word gain refers to the gain in SNR obtained by using APRI SOVA compared with SOVA, and the word relative bit errors (RBE) refers to the bit errors made by APRI SOVA per 100 bit errors of SOVA. In the tables, the bit numbers presented are the bit numbers after subjective re-ordering at the channel encoder Results for inter-frame correlation A maximum gain of 1 db is achieved for the highly correlated bits in the 12.2 kbps mode, (see Fig. 3). Table 1 gives the relative bit errors for these correlated bits. Note that for some very highly correlated bits, the relative bit-errors are reduced by a factor of 4 5. A gain of 0.8 db is achieved for the highly correlated bits in the 7.4 kbps mode (see Fig. 4). The 4.75 kbps mode has the least correlation and a gain of only 0.25 db is obtained for the highly correlated bits as shown in Fig Results for intra-frame correlation Results for intra-frame correlation are similar to their interframe counterparts, in terms of the gains achieved. Gain of 1 db is achieved for the highly correlated bits of 12.2 kbps Bit RBE
4 Bit RBE Table 1: Relative bit errors using inter-frame correlation for 12.2 kbps mode mode. Fig. 6 shows the gain for the highly correlated bits. Table 2 summarizes the relative bit error performance. Bit RBE Figure 3: Gain using inter-frame correlation for correlated bits of 12.2 kbps mode Bit RBE Table 2: Relative bit errors using intra-frame correlation for 12.2 kbps mode Gain of 0.5 db is obtained for the highly correlated bits of 7.4 kbps mode. Fig. 7 shows the gain for the highly correlated bits. Finally, for 4.75 kbps mode, a gain of only 0.2 db is obtained for the highly correlated bits as shown in Fig Conclusions Figure 4: Gain using inter-frame correlation for correlated bits of 7.4 kbps mode We have shown that using SCCD for GSM AMR can result in significant SNR gains. AMR codec has significant inter-frame and intra-frame correlations which can be exploited. SCCD is particularly useful for the 12.2 kbps mode and its effectiveness successively decreases for the 7.4 and 4.75 kbps modes. Exploiting inter-frame and intra-frame correlations gave similar gains showing that both these correlations are present to the same extent. Also, since bits which are highly correlated are also most important in signal reconstruction, error resilience for these bits would lead to better perceptual speech quality at the decoder output. A future direction would be an improved method for exploiting both the inter and intra frame correlations. Another interesting problem is exploring the use of using correlations across different modes when there is mode switching, i.e., the vocoder rate of AMR is dynamically switched. Figure 5: Gain using inter-frame correlation for correlated bits of 4.75 kbps mode 4
5 References [1] A.Ruscitto and T.Hindelang. Channel decoding using residual intra frame correlation in GSM system,. IEEE Electronic Letters, pages , Oct [2] J.Hagenauer. Source Controlled Channel Decoding. IEEE Transactions on Communications, pages , Sept [3] P. Strauch, C. Lusci, M. Sandel, and R. Yan. Low complexity source controlled channel decoding in a GSM system. IEEE transactions on communications, Figure 6: Gain using intra-frame correlation for correlated bits of 12.2 kbps mode [4] C. Veaux, P. Scalart, and A. Gilloire. Channel decoding using inter and intra-correlation of source encoded frames. Data compression conference, DCC 00, March Figure 7: Gain using intra-frame correlation for correlated bits of 7.4 kbps mode Figure 8: Gain using intra-frame correlation for correlated bits of 4.75 kbps mode 5
Channel Coding and Interleaving
Lecture 6 Channel Coding and Interleaving 1 LORA: Future by Lund www.futurebylund.se The network will be free for those who want to try their products, services and solutions in a precommercial stage.
More informationCode design: Computer search
Code design: Computer search Low rate codes Represent the code by its generator matrix Find one representative for each equivalence class of codes Permutation equivalences? Do NOT try several generator
More informationA Systematic Description of Source Significance Information
A Systematic Description of Source Significance Information Norbert Goertz Institute for Digital Communications School of Engineering and Electronics The University of Edinburgh Mayfield Rd., Edinburgh
More informationSoft-Output Trellis Waveform Coding
Soft-Output Trellis Waveform Coding Tariq Haddad and Abbas Yongaçoḡlu School of Information Technology and Engineering, University of Ottawa Ottawa, Ontario, K1N 6N5, Canada Fax: +1 (613) 562 5175 thaddad@site.uottawa.ca
More informationA Hyper-Trellis based Turbo Decoder for Wyner-Ziv Video Coding
A Hyper-Trellis based Turbo Decoder for Wyner-Ziv Video Coding Arun Avudainayagam, John M. Shea and Dapeng Wu Wireless Information Networking Group (WING) Department of Electrical and Computer Engineering
More informationTurbo Codes for Deep-Space Communications
TDA Progress Report 42-120 February 15, 1995 Turbo Codes for Deep-Space Communications D. Divsalar and F. Pollara Communications Systems Research Section Turbo codes were recently proposed by Berrou, Glavieux,
More informationProc. of NCC 2010, Chennai, India
Proc. of NCC 2010, Chennai, India Trajectory and surface modeling of LSF for low rate speech coding M. Deepak and Preeti Rao Department of Electrical Engineering Indian Institute of Technology, Bombay
More informationPredictive Coding. Prediction Prediction in Images
Prediction Prediction in Images Predictive Coding Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe
More informationPredictive Coding. Prediction
Predictive Coding Prediction Prediction in Images Principle of Differential Pulse Code Modulation (DPCM) DPCM and entropy-constrained scalar quantization DPCM and transmission errors Adaptive intra-interframe
More informationPerformance of Multi Binary Turbo-Codes on Nakagami Flat Fading Channels
Buletinul Ştiinţific al Universităţii "Politehnica" din Timişoara Seria ELECTRONICĂ şi TELECOMUNICAŢII TRANSACTIONS on ELECTRONICS and COMMUNICATIONS Tom 5(65), Fascicola -2, 26 Performance of Multi Binary
More information1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g
Exercise Generator polynomials of a convolutional code, given in binary form, are g 0, g 2 0 ja g 3. a) Sketch the encoding circuit. b) Sketch the state diagram. c) Find the transfer function TD. d) What
More informationThe Choice of MPEG-4 AAC encoding parameters as a direct function of the perceptual entropy of the audio signal
The Choice of MPEG-4 AAC encoding parameters as a direct function of the perceptual entropy of the audio signal Claus Bauer, Mark Vinton Abstract This paper proposes a new procedure of lowcomplexity to
More informationSENS'2006 Second Scientific Conference with International Participation SPACE, ECOLOGY, NANOTECHNOLOGY, SAFETY June 2006, Varna, Bulgaria
SENS'6 Second Scientific Conference with International Participation SPACE, ECOLOGY, NANOTECHNOLOGY, SAFETY 4 6 June 6, Varna, Bulgaria SIMULATION ANALYSIS OF THE VITERBI CONVOLUTIONAL DECODING ALGORITHM
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationOn the Performance of. Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels
On the Performance of 1 Golden Space-Time Trellis Coded Modulation over MIMO Block Fading Channels arxiv:0711.1295v1 [cs.it] 8 Nov 2007 Emanuele Viterbo and Yi Hong Abstract The Golden space-time trellis
More informationIntroduction to Wireless & Mobile Systems. Chapter 4. Channel Coding and Error Control Cengage Learning Engineering. All Rights Reserved.
Introduction to Wireless & Mobile Systems Chapter 4 Channel Coding and Error Control 1 Outline Introduction Block Codes Cyclic Codes CRC (Cyclic Redundancy Check) Convolutional Codes Interleaving Information
More informationResearch on Unequal Error Protection with Punctured Turbo Codes in JPEG Image Transmission System
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 4, No. 1, June 007, 95-108 Research on Unequal Error Protection with Punctured Turbo Codes in JPEG Image Transmission System A. Moulay Lakhdar 1, R. Méliani,
More informationPulse-Code Modulation (PCM) :
PCM & DPCM & DM 1 Pulse-Code Modulation (PCM) : In PCM each sample of the signal is quantized to one of the amplitude levels, where B is the number of bits used to represent each sample. The rate from
More informationNew Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding
1 New Designs for Bit-Interleaved Coded Modulation with Hard-Decision Feedback Iterative Decoding Alireza Kenarsari-Anhari, Student Member, IEEE, and Lutz Lampe, Senior Member, IEEE Abstract Bit-interleaved
More informationNAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR. Sp ' 00
NAME... Soc. Sec. #... Remote Location... (if on campus write campus) FINAL EXAM EE568 KUMAR Sp ' 00 May 3 OPEN BOOK exam (students are permitted to bring in textbooks, handwritten notes, lecture notes
More informationHARMONIC VECTOR QUANTIZATION
HARMONIC VECTOR QUANTIZATION Volodya Grancharov, Sigurdur Sverrisson, Erik Norvell, Tomas Toftgård, Jonas Svedberg, and Harald Pobloth SMN, Ericsson Research, Ericsson AB 64 8, Stockholm, Sweden ABSTRACT
More informationDistributed Arithmetic Coding
Distributed Arithmetic Coding Marco Grangetto, Member, IEEE, Enrico Magli, Member, IEEE, Gabriella Olmo, Senior Member, IEEE Abstract We propose a distributed binary arithmetic coder for Slepian-Wolf coding
More informationThe Turbo Principle in Wireless Communications
The Turbo Principle in Wireless Communications Joachim Hagenauer Institute for Communications Engineering () Munich University of Technology (TUM) D-80290 München, Germany Nordic Radio Symposium, Oulu,
More informationRate-Constrained Multihypothesis Prediction for Motion-Compensated Video Compression
IEEE TRANSACTIONS ON CIRCUITS AND SYSTEMS FOR VIDEO TECHNOLOGY, VOL 12, NO 11, NOVEMBER 2002 957 Rate-Constrained Multihypothesis Prediction for Motion-Compensated Video Compression Markus Flierl, Student
More informationTHE EFFECT OF PUNCTURING ON THE CONVOLUTIONAL TURBO-CODES PERFORMANCES
THE EFFECT OF PUNCTURING ON THE CONVOLUTIONAL TURBO-COES PERFORMANCES Horia BALTA 1, Lucian TRIFINA, Anca RUSINARU 1 Electronics and Telecommunications Faculty, Bd. V. Parvan, 1900 Timisoara, ROMANIA,
More informationTurbo Compression. Andrej Rikovsky, Advisor: Pavol Hanus
Turbo Compression Andrej Rikovsky, Advisor: Pavol Hanus Abstract Turbo codes which performs very close to channel capacity in channel coding can be also used to obtain very efficient source coding schemes.
More informationBinary Convolutional Codes
Binary Convolutional Codes A convolutional code has memory over a short block length. This memory results in encoded output symbols that depend not only on the present input, but also on past inputs. An
More informationThe Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks
The Concept of Soft Channel Encoding and its Applications in Wireless Relay Networks Gerald Matz Institute of Telecommunications Vienna University of Technology institute of telecommunications Acknowledgements
More informationPARAMETRIC coding has proven to be very effective
966 IEEE TRANSACTIONS ON AUDIO, SPEECH, AND LANGUAGE PROCESSING, VOL. 15, NO. 3, MARCH 2007 High-Resolution Spherical Quantization of Sinusoidal Parameters Pim Korten, Jesper Jensen, and Richard Heusdens
More informationIterative Equalization using Improved Block DFE for Synchronous CDMA Systems
Iterative Equalization using Improved Bloc DFE for Synchronous CDMA Systems Sang-Yic Leong, Kah-ing Lee, and Yahong Rosa Zheng Abstract Iterative equalization using optimal multiuser detector and trellis-based
More informationA 600bps Vocoder Algorithm Based on MELP. Lan ZHU and Qiang LI*
2017 2nd International Conference on Electrical and Electronics: Techniques and Applications (EETA 2017) ISBN: 978-1-60595-416-5 A 600bps Vocoder Algorithm Based on MELP Lan ZHU and Qiang LI* Chongqing
More informationSolution Manual for "Wireless Communications" by A. F. Molisch
Solution Manual for "Wireless Communications" by A. F. Molisch Peter Almers, Ove Edfors, Fredrik Floren, Anders Johanson, Johan Karedal, Buon Kiong Lau, Andreas F. Molisch, Andre Stranne, Fredrik Tufvesson,
More informationA Video Codec Incorporating Block-Based Multi-Hypothesis Motion-Compensated Prediction
SPIE Conference on Visual Communications and Image Processing, Perth, Australia, June 2000 1 A Video Codec Incorporating Block-Based Multi-Hypothesis Motion-Compensated Prediction Markus Flierl, Thomas
More informationHyper-Trellis Decoding of Pixel-Domain Wyner-Ziv Video Coding
1 Hyper-Trellis Decoding of Pixel-Domain Wyner-Ziv Video Coding Arun Avudainayagam, John M. Shea, and Dapeng Wu Wireless Information Networking Group (WING) Department of Electrical and Computer Engineering
More informationSelective Use Of Multiple Entropy Models In Audio Coding
Selective Use Of Multiple Entropy Models In Audio Coding Sanjeev Mehrotra, Wei-ge Chen Microsoft Corporation One Microsoft Way, Redmond, WA 98052 {sanjeevm,wchen}@microsoft.com Abstract The use of multiple
More informationRADIO SYSTEMS ETIN15. Lecture no: Equalization. Ove Edfors, Department of Electrical and Information Technology
RADIO SYSTEMS ETIN15 Lecture no: 8 Equalization Ove Edfors, Department of Electrical and Information Technology Ove.Edfors@eit.lth.se Contents Inter-symbol interference Linear equalizers Decision-feedback
More informationPerformance Analysis of BPSK over Joint Fading and Two-Path Shadowing Channels
IEEE VTC-Fall 2014, Vancouver, Sept. 14-17, 2014 IqIq Performance of BPSK over Joint Fading and Two-Path Shadowing Channels I. Dey and G. G. Messier Electrical and Computer Engineering University of Calgary,
More informationA new analytic approach to evaluation of Packet Error Rate in Wireless Networks
A new analytic approach to evaluation of Packet Error Rate in Wireless Networks Ramin Khalili Université Pierre et Marie Curie LIP6-CNRS, Paris, France ramin.khalili@lip6.fr Kavé Salamatian Université
More informationOptimal Speech Enhancement Under Signal Presence Uncertainty Using Log-Spectral Amplitude Estimator
1 Optimal Speech Enhancement Under Signal Presence Uncertainty Using Log-Spectral Amplitude Estimator Israel Cohen Lamar Signal Processing Ltd. P.O.Box 573, Yokneam Ilit 20692, Israel E-mail: icohen@lamar.co.il
More informationIntroduction to Convolutional Codes, Part 1
Introduction to Convolutional Codes, Part 1 Frans M.J. Willems, Eindhoven University of Technology September 29, 2009 Elias, Father of Coding Theory Textbook Encoder Encoder Properties Systematic Codes
More informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
More informationSub-Gaussian Model Based LDPC Decoder for SαS Noise Channels
Sub-Gaussian Model Based LDPC Decoder for SαS Noise Channels Iulian Topor Acoustic Research Laboratory, Tropical Marine Science Institute, National University of Singapore, Singapore 119227. iulian@arl.nus.edu.sg
More informationError Correction and Trellis Coding
Advanced Signal Processing Winter Term 2001/2002 Digital Subscriber Lines (xdsl): Broadband Communication over Twisted Wire Pairs Error Correction and Trellis Coding Thomas Brandtner brandt@sbox.tugraz.at
More informationOn the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding
On the Computation of EXIT Characteristics for Symbol-Based Iterative Decoding Jörg Kliewer, Soon Xin Ng 2, and Lajos Hanzo 2 University of Notre Dame, Department of Electrical Engineering, Notre Dame,
More informationDigital Communications
Digital Communications Chapter 8: Trellis and Graph Based Codes Saeedeh Moloudi May 7, 2014 Outline 1 Introduction 2 Convolutional Codes 3 Decoding of Convolutional Codes 4 Turbo Codes May 7, 2014 Proakis-Salehi
More informationExact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel
Exact Probability of Erasure and a Decoding Algorithm for Convolutional Codes on the Binary Erasure Channel Brian M. Kurkoski, Paul H. Siegel, and Jack K. Wolf Department of Electrical and Computer Engineering
More informationConvolutional Coding LECTURE Overview
MIT 6.02 DRAFT Lecture Notes Spring 2010 (Last update: March 6, 2010) Comments, questions or bug reports? Please contact 6.02-staff@mit.edu LECTURE 8 Convolutional Coding This lecture introduces a powerful
More informationQPP Interleaver Based Turbo-code For DVB-RCS Standard
212 4th International Conference on Computer Modeling and Simulation (ICCMS 212) IPCSIT vol.22 (212) (212) IACSIT Press, Singapore QPP Interleaver Based Turbo-code For DVB-RCS Standard Horia Balta, Radu
More informationWavelet Scalable Video Codec Part 1: image compression by JPEG2000
1 Wavelet Scalable Video Codec Part 1: image compression by JPEG2000 Aline Roumy aline.roumy@inria.fr May 2011 2 Motivation for Video Compression Digital video studio standard ITU-R Rec. 601 Y luminance
More informationPipelined Viterbi Decoder Using FPGA
Research Journal of Applied Sciences, Engineering and Technology 5(4): 1362-1372, 2013 ISSN: 2040-7459; e-issn: 2040-7467 Maxwell Scientific Organization, 2013 Submitted: July 05, 2012 Accepted: August
More informationTrellis Coded Modulation
Trellis Coded Modulation Trellis coded modulation (TCM) is a marriage between codes that live on trellises and signal designs We have already seen that trellises are the preferred way to view convolutional
More informationMultimedia Networking ECE 599
Multimedia Networking ECE 599 Prof. Thinh Nguyen School of Electrical Engineering and Computer Science Based on lectures from B. Lee, B. Girod, and A. Mukherjee 1 Outline Digital Signal Representation
More informationNew Puncturing Pattern for Bad Interleavers in Turbo-Codes
SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol. 6, No. 2, November 2009, 351-358 UDK: 621.391.7:004.052.4 New Puncturing Pattern for Bad Interleavers in Turbo-Codes Abdelmounaim Moulay Lakhdar 1, Malika
More informationEVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS
EVALUATION OF PACKET ERROR RATE IN WIRELESS NETWORKS Ramin Khalili, Kavé Salamatian LIP6-CNRS, Université Pierre et Marie Curie. Paris, France. Ramin.khalili, kave.salamatian@lip6.fr Abstract Bit Error
More informationSpeech Coding. Speech Processing. Tom Bäckström. October Aalto University
Speech Coding Speech Processing Tom Bäckström Aalto University October 2015 Introduction Speech coding refers to the digital compression of speech signals for telecommunication (and storage) applications.
More informationOPTIMUM fixed-rate scalar quantizers, introduced by Max
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, VOL 54, NO 2, MARCH 2005 495 Quantizer Design for Channel Codes With Soft-Output Decoding Jan Bakus and Amir K Khandani, Member, IEEE Abstract A new method of
More informationSCELP: LOW DELAY AUDIO CODING WITH NOISE SHAPING BASED ON SPHERICAL VECTOR QUANTIZATION
SCELP: LOW DELAY AUDIO CODING WITH NOISE SHAPING BASED ON SPHERICAL VECTOR QUANTIZATION Hauke Krüger and Peter Vary Institute of Communication Systems and Data Processing RWTH Aachen University, Templergraben
More informationSome UEP Concepts in Coding and Physical Transport
Some UEP Concepts in Coding and Physical Transport Werner Henkel, Neele von Deetzen, and Khaled Hassan School of Engineering and Science Jacobs University Bremen D-28759 Bremen, Germany Email: {w.henkel,
More informationExpectation propagation for signal detection in flat-fading channels
Expectation propagation for signal detection in flat-fading channels Yuan Qi MIT Media Lab Cambridge, MA, 02139 USA yuanqi@media.mit.edu Thomas Minka CMU Statistics Department Pittsburgh, PA 15213 USA
More informationINTERNATIONAL ORGANISATION FOR STANDARDISATION ORGANISATION INTERNATIONALE DE NORMALISATION ISO/IEC JTC1/SC29/WG11 CODING OF MOVING PICTURES AND AUDIO
INTERNATIONAL ORGANISATION FOR STANDARDISATION ORGANISATION INTERNATIONALE DE NORMALISATION ISO/IEC JTC1/SC9/WG11 CODING OF MOVING PICTURES AND AUDIO ISO/IEC JTC1/SC9/WG11 MPEG 98/M3833 July 1998 Source:
More informationConvolutional Codes ddd, Houshou Chen. May 28, 2012
Representation I, II Representation III, IV trellis of Viterbi decoding Turbo codes Convolutional Codes ddd, Houshou Chen Department of Electrical Engineering National Chung Hsing University Taichung,
More informationML Detection with Blind Linear Prediction for Differential Space-Time Block Code Systems
ML Detection with Blind Prediction for Differential SpaceTime Block Code Systems Seree Wanichpakdeedecha, Kazuhiko Fukawa, Hiroshi Suzuki, Satoshi Suyama Tokyo Institute of Technology 11, Ookayama, Meguroku,
More informationOn Compression Encrypted Data part 2. Prof. Ja-Ling Wu The Graduate Institute of Networking and Multimedia National Taiwan University
On Compression Encrypted Data part 2 Prof. Ja-Ling Wu The Graduate Institute of Networking and Multimedia National Taiwan University 1 Brief Summary of Information-theoretic Prescription At a functional
More informationON DISTRIBUTED ARITHMETIC CODES AND SYNDROME BASED TURBO CODES FOR SLEPIAN-WOLF CODING OF NON UNIFORM SOURCES
7th European Signal Processing Conference (EUSIPCO 2009) Glasgow, Scotland, August 24-28, 2009 ON DISTRIBUTED ARITHMETIC CODES AND SYNDROME BASED TURBO CODES FOR SLEPIAN-WOLF CODING OF NON UNIFORM SOURCES
More informationPhysical Layer and Coding
Physical Layer and Coding Muriel Médard Professor EECS Overview A variety of physical media: copper, free space, optical fiber Unified way of addressing signals at the input and the output of these media:
More informationSimplified Implementation of the MAP Decoder. Shouvik Ganguly. ECE 259B Final Project Presentation
Simplified Implementation of the MAP Decoder Shouvik Ganguly ECE 259B Final Project Presentation Introduction : MAP Decoder û k = arg max i {0,1} Pr[u k = i R N 1 ] LAPPR Λ k = log Pr[u k = 1 R N 1 ] Pr[u
More informationSoft-Output Decision-Feedback Equalization with a Priori Information
Soft-Output Decision-Feedback Equalization with a Priori Information Renato R. opes and John R. Barry School of Electrical and Computer Engineering Georgia Institute of Technology, Atlanta, Georgia 333-5
More informationSAGE-based Estimation Algorithms for Time-varying Channels in Amplify-and-Forward Cooperative Networks
SAGE-based Estimation Algorithms for Time-varying Channels in Amplify-and-Forward Cooperative Networks Nico Aerts and Marc Moeneclaey Department of Telecommunications and Information Processing Ghent University
More informationCHAPTER 8 Viterbi Decoding of Convolutional Codes
MIT 6.02 DRAFT Lecture Notes Fall 2011 (Last update: October 9, 2011) Comments, questions or bug reports? Please contact hari at mit.edu CHAPTER 8 Viterbi Decoding of Convolutional Codes This chapter describes
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationThe Super-Trellis Structure of Turbo Codes
2212 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 46, NO 6, SEPTEMBER 2000 The Super-Trellis Structure of Turbo Codes Marco Breiling, Student Member, IEEE, and Lajos Hanzo, Senior Member, IEEE Abstract
More informationAdvanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur
Advanced 3 G and 4 G Wireless Communication Prof. Aditya K Jagannathan Department of Electrical Engineering Indian Institute of Technology, Kanpur Lecture - 19 Multi-User CDMA Uplink and Asynchronous CDMA
More informationh 8x8 chroma a b c d Boundary filtering: 16x16 luma H.264 / MPEG-4 Part 10 : Intra Prediction H.264 / MPEG-4 Part 10 White Paper Reconstruction Filter
H.264 / MPEG-4 Part 10 White Paper Reconstruction Filter 1. Introduction The Joint Video Team (JVT) of ISO/IEC MPEG and ITU-T VCEG are finalising a new standard for the coding (compression) of natural
More informationAN EXACT SOLUTION FOR OUTAGE PROBABILITY IN CELLULAR NETWORKS
1 AN EXACT SOLUTION FOR OUTAGE PROBABILITY IN CELLULAR NETWORKS Shensheng Tang, Brian L. Mark, and Alexe E. Leu Dept. of Electrical and Computer Engineering George Mason University Abstract We apply a
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More information16.36 Communication Systems Engineering
MIT OpenCourseWare http://ocw.mit.edu 16.36 Communication Systems Engineering Spring 2009 For information about citing these materials or our Terms of Use, visit: http://ocw.mit.edu/terms. 16.36: Communication
More informationUtilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check Codes in the Presence of Burst Noise
Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 5-2012 Utilizing Correct Prior Probability Calculation to Improve Performance of Low-Density Parity- Check
More informationHigh rate soft output Viterbi decoder
High rate soft output Viterbi decoder Eric Lüthi, Emmanuel Casseau Integrated Circuits for Telecommunications Laboratory Ecole Nationale Supérieure des Télécomunications de Bretagne BP 83-985 Brest Cedex
More informationInformation and Entropy
Information and Entropy Shannon s Separation Principle Source Coding Principles Entropy Variable Length Codes Huffman Codes Joint Sources Arithmetic Codes Adaptive Codes Thomas Wiegand: Digital Image Communication
More informationVector Quantizers for Reduced Bit-Rate Coding of Correlated Sources
Vector Quantizers for Reduced Bit-Rate Coding of Correlated Sources Russell M. Mersereau Center for Signal and Image Processing Georgia Institute of Technology Outline Cache vector quantization Lossless
More informationCoherentDetectionof OFDM
Telematics Lab IITK p. 1/50 CoherentDetectionof OFDM Indo-UK Advanced Technology Centre Supported by DST-EPSRC K Vasudevan Associate Professor vasu@iitk.ac.in Telematics Lab Department of EE Indian Institute
More informationCode-aided ML joint delay estimation and frame synchronization
Code-aided ML joint delay estimation and frame synchronization Henk Wymeersch and Marc Moeneclaey Digital Communications Research Group Dept. of Telecommunications and Information Processing Ghent University,
More informationIN MOST OF the theory and practice of error-control
1344 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 8, AUGUST 2004 Transmission of Nonuniform Memoryless Sources via Nonsystematic Turbo Codes Guang-Chong Zhu, Member, IEEE, Fady Alajaji, Senior Member,
More informationConvolutional Codes Klaus von der Heide
Convolutional Codes Klaus von der Heide Convolutional codes encode a stream of symbols into n streams of symbols. 1/n = R is called the code rate. A second important parameter is the constraint length
More informationAALTO UNIVERSITY School of Electrical Engineering. Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES
AALTO UNIVERSITY School of Electrical Engineering Sergio Damian Lembo MODELING BLER PERFORMANCE OF PUNCTURED TURBO CODES Thesis submitted for examination for the degree of Master of Science in Technology
More informationReceived Signal, Interference and Noise
Optimum Combining Maximum ratio combining (MRC) maximizes the output signal-to-noise ratio (SNR) and is the optimal combining method in a maximum likelihood sense for channels where the additive impairment
More informationEmpirical Lower Bound on the Bitrate for the Transparent Memoryless Coding of Wideband LPC Parameters
Empirical Lower Bound on the Bitrate for the Transparent Memoryless Coding of Wideband LPC Parameters Author So, Stephen, Paliwal, Kuldip Published 2006 Journal Title IEEE Signal Processing Letters DOI
More informationCyclic Redundancy Check Codes
Cyclic Redundancy Check Codes Lectures No. 17 and 18 Dr. Aoife Moloney School of Electronics and Communications Dublin Institute of Technology Overview These lectures will look at the following: Cyclic
More informationDigital Image Processing Lectures 25 & 26
Lectures 25 & 26, Professor Department of Electrical and Computer Engineering Colorado State University Spring 2015 Area 4: Image Encoding and Compression Goal: To exploit the redundancies in the image
More informationAppendix D: Basics of convolutional codes
Appendix D: Basics of convolutional codes Convolutional encoder: In convolutional code (B. P. Lathi, 2009; S. G. Wilson, 1996; E. Biglieri, 2005; T. Oberg, 2001), the block of n code bits generated by
More informationLORD: LOw-complexity, Rate-controlled, Distributed video coding system
LORD: LOw-complexity, Rate-controlled, Distributed video coding system Rami Cohen and David Malah Signal and Image Processing Lab Department of Electrical Engineering Technion - Israel Institute of Technology
More informationLOW COMPLEXITY WIDEBAND LSF QUANTIZATION USING GMM OF UNCORRELATED GAUSSIAN MIXTURES
LOW COMPLEXITY WIDEBAND LSF QUANTIZATION USING GMM OF UNCORRELATED GAUSSIAN MIXTURES Saikat Chatterjee and T.V. Sreenivas Department of Electrical Communication Engineering Indian Institute of Science,
More informationState-of-the-Art Channel Coding
Institut für State-of-the-Art Channel Coding Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationIntraframe Prediction with Intraframe Update Step for Motion-Compensated Lifted Wavelet Video Coding
Intraframe Prediction with Intraframe Update Step for Motion-Compensated Lifted Wavelet Video Coding Aditya Mavlankar, Chuo-Ling Chang, and Bernd Girod Information Systems Laboratory, Department of Electrical
More informationJoint Source-Channel Coding Optimized On Endto-End Distortion for Multimedia Source
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 8-2016 Joint Source-Channel Coding Optimized On Endto-End Distortion for Multimedia Source Ebrahim Jarvis ej7414@rit.edu
More informationOne Lesson of Information Theory
Institut für One Lesson of Information Theory Prof. Dr.-Ing. Volker Kühn Institute of Communications Engineering University of Rostock, Germany Email: volker.kuehn@uni-rostock.de http://www.int.uni-rostock.de/
More informationAudio Coding. Fundamentals Quantization Waveform Coding Subband Coding P NCTU/CSIE DSPLAB C.M..LIU
Audio Coding P.1 Fundamentals Quantization Waveform Coding Subband Coding 1. Fundamentals P.2 Introduction Data Redundancy Coding Redundancy Spatial/Temporal Redundancy Perceptual Redundancy Compression
More informationSPEECH ANALYSIS AND SYNTHESIS
16 Chapter 2 SPEECH ANALYSIS AND SYNTHESIS 2.1 INTRODUCTION: Speech signal analysis is used to characterize the spectral information of an input speech signal. Speech signal analysis [52-53] techniques
More informationWeibull-Gamma composite distribution: An alternative multipath/shadowing fading model
Weibull-Gamma composite distribution: An alternative multipath/shadowing fading model Petros S. Bithas Institute for Space Applications and Remote Sensing, National Observatory of Athens, Metaxa & Vas.
More informationDistributed Decoding of Convolutional Network Error Correction Codes
1 Distributed Decoding of Convolutional Network Error Correction Codes Hengjie Yang and Wangmei Guo arxiv:1701.06283v2 [cs.it] 18 Feb 2017 Abstract A Viterbi-like decoding algorithm is proposed in this
More information