Communications Systems Laboratory. Department of Electrical Engineering. University of Virginia. Charlottesville, VA 22903


 Catherine Randall
 2 years ago
 Views:
Transcription
1 Turbo Trellis Coded Modulation W. J. Blackert y and S. G. Wilson Communications Systems Laboratory Department of Electrical Engineering University of Virginia Charlottesville, VA Abstract Turbo codes have excited the coding community with the promise of performing near channel capacity by using an iterative decoding technique that relies upon simple constituent codes. However, since the original turbo codes are low rate codes, a signicant bandwidth penalty can be incurred by systems which utilize turbo codes. Since the constituent codes that make up turbo codes are convolutional codes, a natural extension of the turbo concept, in order to improve bandwidth eciency, is its application to Trellis Coded Modulation (TCM) systems. This paper will discuss the conditions under which encoders with parallel transitions can be used as constituent codes in Turbo TCM systems and present results to compare systems with and without parallel transition constituent encoders. 1 ntroduction Turbo coding, introduced in [1], is a coding technique that uses an iterative decoding algorithm to give performance near channel capacity. Since Turbo codes use convolutional codes as their constituent codes, a natural extension of the Turbo concept which improves bandwidth eciency is its application to systems using Trellis Coded Sponsor: National Science Foundation y Corresponding Author: Modulation (TCM). n Turbo TCM (TTCM) systems, the objective is to maximize the minimum Euclidean distance (d 2 min) between coded sequences and to maintain small error coecient multipliers as it is with \standard" binary Turbo systems. Ungerboeck's work [2] has shown for encoders with few states the best encoders possess parallel transitions. However, the TTCM methods presented in [3] and [4] either exclude encoders with parallel transitions as constituent codes or do not discuss conditions in which these encoders can be used. This paper will present various bandwidth ecient turbo code schemes, discuss conditions such that encoders with parallel can be used, describe necessary modications to the decoder of [3] so that constituent codes with parallel transitions may be used, and present simulation results to investigate the eectiveness of using encoders with parallel transitions. 2 Turbo TCM s n traditional TCM systems, the encoder attempts to produce a coded modulation sequence of message symbols, each with m bits, so that
2 the Euclidean distance between any pair of valid sequences is large. Rather then using a signal encoder with large constraint length, the turbo coding technique suggests the use of multiple, e.g. two, simple encoders operating on permuted versions of the same message of length N. Although the free Euclidean distance of one encoder may be small, by properly designing the permutation of the data sequence, those sequences that produce modest distance in one encoder will produce a larger distance in the other encoder. 1 n the context of convolutional codes, this is equivalent to short error events in one encoder trellis producing long error events in the other trellis. The fundamental issues in the design of the TTCM encoder are therefore The \merging" of the separate encoder outputs into a single QAM/PSK coded sequence, and the design of the interleaver. 2.1 Proposed Schemes Thus far, three dierent encoder structures have been suggested. n [5], the authors simply map the output of a binary turbo encoder onto an Mary modulator. Decoding is done by forming LLRs of each bit in the signal constellation and then allowing the turbo decoders to use these LLRs as data. Although this system utilizes a bandwidth ecient modulation scheme, the encoder and modulator are not designed cooperatively as in TCM systems. n [3], a TurboTCM system was presented where a single Mary symbol is transmitted at each trellis interval, e.g. 2 information bits into 8PSK. The high level bits of the signal set partition are dened by the message symbol. The low level bit(s) of the modulator sequence are produced by a punctured version of the turbo 1 n turbo systems, it is important to not only have large free distance by also small error multipliers for the low weight sequences. encoder parity output. A generalized version of this encoder is depicted in gure 1. t should be Mary Mary Figure 1: TTCM of [3] noted that the interleaver is constrained to interleave symbols. A third bandwidth ecient modulation scheme has been suggested in [4]. The encoder of this system, an example of which is shown in gure 2, works in a slightly dierent manner then the encoder of [3]. Here each encoder forms a AM 4AM Figure 2: TTCM of [4] 1 Channel QChannel modulation symbol from the parity stream produced by the encoder and a subset of the systematic information. These symbols are then sent, as depicted in gure 2, using inphase and quadrature modulation to form a composite symbol or by serializing the symbols for transmission, e.g. sequentially sending two 8PSK symbols. 2.2 Parallel Transition Conditions As discussed above, for constituent encoders with small memory order, the best (in terms of free distance) encoders will possess parallel transitions. For this reason, it may be desirable to use encoders with parallel transitions as the constituent encoders in the TTCM schemes discussed in [3] and [4]. However, in doing this, one must ensure that the free distance of the entire system is not limited by a codeword that was
3 produced by a single onestep error event in each trellis. Otherwise, the encoder has not beneted from the interleaving and presence of multiple encoders. t is possible to design the interleaver for a T TCM system such that at least one trellis has a multiplestep error event for every input message if the following condition holds. Let f be the fraction of the bits that enter a constituent encoder and inuence the state of the encoder. f there are n encoders present in a system, it is possible to design the interleaver such that at least one trellis has a multiplestep error event for every input message if and only if nf 1 (1) Proof: f nf 1 then, with proper interleaver selection, each bit will inuence the state of at least one encoder. f this occurs, then at least one encoder will be perturbed from the all zeros state which means that onestep transitions do not occur in all n encoders. f nf < 1 then at least one bit, no matter what interleaver is selected, does not inuence the state of any encoder. Therefore, by selecting this bit to be a 1 and all other bits to be a 0, each encoder will remain in the all zero state and the only event that occurs in each encoder is a singlestep error event. 2.3 Adaptation With the above condition in mind, it is possible to now discuss conditions under which the previously discussed TTCM encoders can be implemented with encoders that possess parallel transitions. The interleaver that is used in the encoder of [4] forces bits to maintain \membership" in the input line in which they were presented to the encoder. Due to this constraint on the interleaver, lines may only be \exchanged" in the process of ensuring that each bit is encoded by at least one of the encoders. f the condition of equation (1) holds, then it is possible to exchange lines in such a way each input line inuences the state of at least one encoder. Given this, it is possible to use constituent encoders that possess onestep error events, but guarantee that at least one encoder has a multiplestep error event for each codeword. The encoder of [3] has an interleaver which is constrained to permute only symbols. Due to this constraint on the interleaver, onestep error events in one constituent encoder will become one step error events in all constituent encoders. However, it is possible to modify the encoder of [3], so that this does not occur. Figure 3 presents a modied version of the encoder of [3] that will work with parallel transitions. The only dier M MARY MARY Figure 3: Turbo TCM that allows parallel transitions ence between the systems of gure 1 and gure 3 is the addition of the \mapper" after the interleaver. The purpose to this device is to map the original, interleaved, input symbols onto a new set of symbols within the same alphabet. This mapping may be as simple as exchanging bit lines or as general as swapping symbols but the mapping must be reversible and done such that symbols that would cause a onestep error event in the rst encoder will cause a longer error event in the second encoder. By adding the mapping, the system is no longer limited by the parallel transition case. With the exception of the additional stage of mapping, the operation of this encoder is identical to the operation of the encoder presented in [3]. D
4 3 Decoder Modications t is interesting to discuss the modications to the TTCM decoder of [3] that are necessary to allow for the use of constituent encoders that have parallel transitions. Figure 4 depicts the decoder presented in [3]. The `*' character indicates the position of the switch when the parity of the current symbol was not produced by the encoder that is matched to the decoder in question. noisy channel symbols = (1m) log 2 metric s 1 * first decoding all others metric metric "0" "0" MAP MAP m1 Hard Decision Figure 4: Non Parallel TTCM decoder There are two modications which need to be made so that this decoder will properly decode a TurboTCM system using parallel transitions. The more obvious modication stems from the fact that we have added the mapping operation to the encoder. The presence of the mapping means that we must swap values within each APP vector after we have interleaved. For example, suppose that input symbol i is mapped to input symbol j before it is passed to the second encoder. After the rst decoder has been run, we have a level of condence that the input symbol at a particular time was i. However, for the second decoder to operate correctly, we must * * output now assign this condence level to the symbol j since, if i was in the original data stream, j was encoded by the second encoder. Along the same lines as this modication, since the hard decision is eventually made based on the output of the second decoder, it is necessary to not only deinterleave the symbols but also \unmap" them. The second modication that must be made is for the the block labeled `metric s.' This box computes the likelihood that each possible input symbol was sent by computing the likelihood between the channel symbol formed by the input in question and each possible parity value and then averaging these likelihoods. This operation is only performed for punctured (relative to the rst encoder) symbol positions. Since these symbols are generated by the second decoder, which is working on mapped version of the input data stream, the likelihoods must be assigned to the appropriate positions in the vector to accurately reect the probability that each symbol was sent. For example, let us continue to assume that the input symbol i is mapped to the input symbol j. To appropriately evaluate the `metric s' value for the symbol i, likelihoods must be computed as if symbol j formed the MSBs of the Mary symbol. 4 Simulation Results The following plots compare the performance of TTCM systems of the type presented in [3] with and without parallel transitions. n all cases the systems in question used 16QAM modulation, have identical interleavers and the following 8 state TCM constituent encoders are used: Type h 0 (D) h 1 (D) h 2 (D) h 3 (D) Parallel NonParallel The encoder with parallel transitions is taken from [6] and the encoder without parallel transitions is taken from [3].
5 4.1 Example 1 The rst simulation is done for a system using a bit symbol packet and the following mapping function Original Symbol Mapped Symbol which is equivalent to exchanging the rst two bit lines that enter encoder 2. Pb Parallel Transitions No Parallel Transitions First teration Second teration Seventh teration Eb/No (db) 10 1 Figure 6: 597 Symbol Packet Simulation Results Pb Parallel Transitions No Parallel Transitions First teration Second teration Seventh teration as the number of iterations increase, the performance of the two 597 symbol packet systems becomes comparable. t also interesting to compare the two examples presented here. As expected, the system with the larger packet size has the better performance of the two systems Eb/No (db) Figure 5: 291 Symbol Packet Simulation Results Figure 5 presents simulation results that compare these two systems. Based on these results, it should be noted that the system that uses parallel transitions shows improvement over the nonparallel transition system during the rst two iterations of the decoder. However, as the number of iterations is increased, the performance of the two systems becomes comparable for this frame size. 4.2 Example 2 Figure 6 shows the results for the same systems as in example 1 when a larger packet (597 symbols) is used. Again, the simulation results show that the system with parallel transitions outperforms the system without parallel transitions during the rst several iterations. However, 5 Conclusions This paper has reviewed various bandwidth ecient turbo coding schemes and presented conditions under which encoders having onestep error events can be used as constituent encoders. Modications to the encoder and decoder of [3] have also been presented along with simulation results that demonstrate that the use of encoders with onestep error events can improve TTCM system performance. References [1] C. Berrou, A. Glavieux, and P. Thitimajshima, \Near Shannon limit errorcorrecting coding and decoding: Turbo Codes," in CC, pp. 1064{1070, [2] G. Ungerboeck, \Trelliscoded modulation with redundant signal sets, part : State of
6 the art," EEE Communications Magazine, vol. 25, pp. 12{21, Feb [3] P. Robertson and T. Worz, \A novel coded modulation scheme employing turbo codes," in URS & TG Convference `Kleinheubacher Tagung', (Kleinheubach, Germany), Oct [4] S. Benedetto, D. Divsalar, G. Montorsi, and F. Pollara, \Bandwidth ecient parallel concatentated coding schemes," Electronics Letters, vol. 31, Nov [5] S. L. Go et al., \Turbocodes and high spectral eciency modulation," in CC, pp. 645{ 649, [6] S. G. Wilson, Digital Modulation and Coding. Englewood Clis, New Jersey: PrenticeHall, 1995.
802.11A  OFDM PHY CODING AND INTERLEAVING. Fernando H. Gregorio. Helsinki University of Technology
802.11A  OFDM PHY CODING AND INTERLEAVING Fernando H. Gregorio Helsinki University of Technology Signal Processing Laboratory, POB 3000, FIN02015 HUT, Finland Email:gregorio@wooster.hut.fi 1. INTRODUCTION
More informationEXIT Charts Analysis for TurboTCM Schemes Using NonBinary RSC Encoders
AICT : The Eighth Advanced International Conference on Telecommunications EXIT Charts Analysis for TurboTCM Schemes Using onbinary RSC Encoders Calin Vladeanu, Alexandru Martian Telecommunications Department
More informationModule 6. Channel Coding. Version 2 ECE IIT, Kharagpur
Module 6 Channel Coding Lesson 35 Convolutional Codes After reading this lesson, you will learn about Basic concepts of Convolutional Codes; State Diagram Representation; Tree Diagram Representation; Trellis
More informationCOMPARISON OF TCM + RS CODING AND TURBO CODES FOR SPECTRALLY EFFICIENT LOWDELAY SYSTEMS
COMPARISON OF TCM + RS CODING AND TURBO CODES FOR SPECTRALLY EFFICIENT LOWDELAY SYSTEMS Ranveig Nygaard Bjørk, Helge YtreHauge, Eirik Rosnes, and Anders Vahlin Nera Networks AS P.O. Box 7090 5020 Bergen
More informationCoded modulation: What is it?
Coded modulation So far: Binary coding Binary modulation Will send R information bits/symbol (spectral efficiency = R) Constant transmission rate: Requires bandwidth expansion by a factor 1/R Until 1976:
More informationA REALTIME EMBEDDED SOFTWARE IMPLEMENTATION OF A TURBO ENCODER AND SOFT OUTPUT VITERBI ALGORITHM BASED TURBO DECODER
A REALTIME EMBEDDED SOFTWARE IMPLEMENTATION OF A TURBO ENCODER AND SOFT OUTPUT VITERBI ALGORITHM BASED TURBO DECODER M. Farooq Sabir, Rashmi Tripathi, Brian L. Evans and Alan C. Bovik Dept. of Electrical
More informationPerformance Analysis of Substituting DVBS2 LDPC Code for DVBT Error Control Coding System
Performance Analysis of Substituting DVBS2 LDPC Code for DVBT Error Control Coding System Tero Jokela Turku Centre for Computer Sciences, Department of Information Technology University of Turku, Finland
More informationCoding Theorems for TurboLike Codes Abstract. 1. Introduction.
Coding Theorems for TurboLike Codes Dariush Divsalar, Hui Jin, and Robert J. McEliece Jet Propulsion Laboratory and California Institute of Technology Pasadena, California USA Email: dariush@shannon.jpl.nasa.gov,
More informationTrellis Coded Modulation (TCM)
Trellis Coded Modulation (TCM) Intuitive Guide to Principles of Communications Trellis Coded Modulation (TCM) Trellis Coded Modulation Tutorial Before reading this tutorial, make sure you have read the
More informationPerformance of QuasiConstant Envelope Phase Modulation through Nonlinear Radio Channels
Performance of QuasiConstant Envelope Phase Modulation through Nonlinear Radio Channels Qi Lu, Qingchong Liu Electrical and Systems Engineering Department Oakland University Rochester, MI 48309 USA Email:
More informationChannel Coding and Link Adaptation
Seminar Ausgewählte Kapitel der Nachrichtentechnik, WS 2009/2010 LTE: Der Mobilfunk der Zukunft Channel Coding and Link Adaptation Shahram Zarei 16. December 2009 Abstract In this work channel coding and
More informationCODED SOQPSKTG USING THE SOFT OUTPUT VITERBI ALGORITHM
CODED SOQPSKTG USING THE SOFT OUTPUT VITERBI ALGORITHM Daniel Alam Department of Electrical Engineering & Computer Science University of Kansas Lawrence, KS 66045 danich@ku.edu Faculty Advisor: Erik Perrins
More informationBinary Phase Shift Keying (BPSK)! ( π ) { } ( t) carrier bursts that corresponds to the information bit being a 1 or 0. Binary 0: I
Binary Phase Shift Keying (BPSK)! l In BPSK, the symbol mapping table encodes bits (b n ) 1 and 0 to transmission symbols (a n ) 1 and 1, respectively l Every T b seconds the modulator transmits one of
More informationMaximum Weight Basis Decoding of Convolutional Codes
Maximum Weight Basis Decoding of Convolutional Codes Suman Das, Elza Erkip, Joseph R Cavallaro and Behnaam Aazhang Abstract In this paper we describe a new suboptimal decoding technique for linear codes
More informationTechnical Specifications for KD5HIO Software
Technical Specifications for KD5HIO Software Version 0.2 12/12/2000 by Glen Hansen, KD5HIO HamScope Forward Error Correction Algorithms HamScope is a terminal program designed to support multimode digital
More informationTeaching Convolutional Coding using MATLAB in Communication Systems Course. Abstract
Section T3C2 Teaching Convolutional Coding using MATLAB in Communication Systems Course Davoud Arasteh Department of Electronic Engineering Technology, LA 70813, USA Abstract Convolutional codes are channel
More informationRevision of Lecture 3
Revision of Lecture 3 Modulator/demodulator Basic operations of modulation and demodulation Complex notations for modulation and demodulation Carrier recovery and timing recovery This lecture: bits map
More informationFACULTY OF GRADUATE STUDIES. On The Performance of MSOVA for UMTS and cdma2000 Turbo Codes
FACULTY OF GRADUATE STUDIES On The Performance of MSOVA for UMTS and cdma2000 Turbo Codes By Hani Hashem Mis ef Supervisor Dr. Wasel Ghanem This Thesis was submitted in partial ful llment of the requirements
More informationThe mathematics behind wireless communication
June 2008 Questions and setting In wireless communication, information is sent through what is called a channel. The channel is subject to noise, so that there will be some loss of information. How should
More informationCOHERENT BINARY MODULATION TECHNIQUES
COHERENT BINARY MODULATION TECHNIQUES As mentioned previously, binary modulation has three basic forms: amplitudeshift keying (ASK), phaseshift keying (PSK), and frequencyshift keying (FSK). In this
More informationMultimedia Communications. Huffman Coding
Multimedia Communications Huffman Coding Optimal codes Suppose that a i > w i C + is an encoding scheme for a source alphabet A={a 1,, a N }. Suppose that the source letter a 1,, a N occur with relative
More informationAN INTRODUCTION TO ERROR CORRECTING CODES Part 1
AN INTRODUCTION TO ERROR CORRECTING CODES Part 1 Jack Keil Wolf ECE 154C Spring 2008 Noisy Communications Noise in a communications channel can cause errors in the transmission of binary digits. Transmit:
More informationSpectrum Characteristics of Ternary PSK Signals Amplified with NonLinear Amplifiers
Spectrum Characteristics of Ternary PSK Signals Amplified with NonLinear Amplifiers HIDEYUKI TORII and MAKOTO NAKAMURA Department of Network Engineering Kanagawa Institute of Technology 100 Shimoogino,
More informationCoding Theorems for Turbo Code Ensembles
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 1451 Coding Theorems for Turbo Code Ensembles Hui Jin and Robert J. McEliece, Fellow, IEEE Invited Paper Abstract This paper is devoted
More informationInterleaveDivision MultipleAccess (IDMA) Communications 1
InterleaveDivision MultipleAccess (IDMA) Communications 1 Li Ping, Lihai Liu,. Y. Wu, and W.. Leung Department of Electronic Engineering City University of Hong ong, Hong ong eeliping@cityu.edu.h Abstract:
More informationWITH his 1948 paper, A Mathematical Theory of
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 2531 Applications of ErrorControl Coding Daniel J. Costello, Jr., Fellow, IEEE, Joachim Hagenauer, Fellow, IEEE, Hideki Imai, Fellow,
More informationLezione 6 Communications Blockset
Corso di Tecniche CAD per le Telecomunicazioni A.A. 20072008 Lezione 6 Communications Blockset Ing. Marco GALEAZZI 1 What Is Communications Blockset? Communications Blockset extends Simulink with a comprehensive
More informationA brief history of COFDM  1
COFDM A brief history COFDM principles DVBT framing structure COFDM transmission sequence Countering against echoes and reflections DVBT variable parameters COFDM A brief history COFDM principles DVBT
More informationScientia Iranica, Vol. 13, No. 4, pp 373{378 c Sharif University of Technology, October 2006 Research Note An Adaptive Secure Channel Coding Scheme for Data Transmission over LEO Satellite Channels A.
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Convolutional Codes University of Colorado Spring 2007 Linear (n, k) block codes take k data symbols at a time and encode them into n code symbols.
More informationCoding and decoding with convolutional codes. The Viterbi Algor
Coding and decoding with convolutional codes. The Viterbi Algorithm. 8 Block codes: main ideas Principles st point of view: infinite length block code nd point of view: convolutions Some examples Repetition
More informationBACK. Texas Instrument DSP Solution Challenge. Ecole Nationale Supérieure de Télécommunication de Bretagne. Project Team : William TAPSOBA
BACK Block TurboCodes Decoding using the WalshHadamard Transform applied to Hartmann Nazarov algorithm. Real Time Implementation on the DSP Texas TMS320C6201 platform Texas Instrument DSP Solution Challenge
More informationTurbo Trellis Coded Modulation with Iterative Decoding for Mobile Satellite Communications
Turbo Trellis Coded Modulation ith Iterative Decoding for Mobile atellite Communications D. Divsalar and F. ollara Jet ropulsion Laboratory, California Institute of Technology 400 Oak Grove Dr., asadena,
More informationAfolabi Godfrey 1, Ibrahim A.A 2 & Ibrahim Zaid 3
International Journal of Computational Engineering Research Vol, 04 Issue, 1 The Use Of The Computational Method Of Hamming Code Techniques For The Detection And Correction Of Computational Errors In A
More informationJoint MessagePassing Decoding of LDPC Codes and PartialResponse Channels
1410 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 Joint MessagePassing Decoding of LDPC Codes PartialResponse Channels Brian M. Kurkoski, Student Member, IEEE, Paul H. Siegel, Fellow,
More informationMemoryoptimized Hybrid Decoding Method for Multirate Turbo Codes
Memoryoptimized Hybrid Decoding Method for Multirate Turbo Codes Injae Yoo, Bongjin Kim and InCheol Park Department of Electrical Engineering Korea Advanced Institute of Science and Technology (KAIST)
More informationINTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM
INTRODUCTION TO CODING THEORY: BASIC CODES AND SHANNON S THEOREM SIDDHARTHA BISWAS Abstract. Coding theory originated in the late 1940 s and took its roots in engineering. However, it has developed and
More informationModule 2. Data Communication Fundamentals. Version 2 CSE IIT, Kharagpur
Module 2 Data Communication Fundamentals Lesson 6 Digital Data, Analog Signals Specific Instructional Objective On completion, the students will be able to: Explain the basic concepts of Digital data to
More informationAvailable online Journal of Scientific and Engineering Research, 2015, 2(1):115. Research Article
Available online www.jsaer.com, 2015, 2(1):115 Research Article ISSN: 23942630 CODEN(USA): JSERBR Design of Hamming Encoder and Decoder Circuits For (64, 7) Code and (128, 8) Code Using VHDL Adham Hadi
More informationCyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode
Cyclic Codes Introduction Binary cyclic codes form a subclass of linear block codes. Easier to encode and decode Definition A n, k linear block code C is called a cyclic code if. The sum of any two codewords
More informationDVBS2 standard with normal and short frames Guy Lesthiévent Alban Duverdier
DVBS2 standard with normal and short frames Guy Lesthiévent Alban Duverdier 1 Scope This document is aimed at summarizing the main features and performance of the channel coding scheme selected by the
More informationBit Error Rate Analysis of ReedSolomon Code for Efficient Communication System
Bit Error Rate Analysis of ReedSolomon Code for Efficient Communication System Sanjeev Kumar Asst. Professor/ ECE Amritsar college of Engg. & Technology, Amritsar, 143001, India Ragini Gupta M.Tech Scholar/ECE
More informationDevelopment Plan for Turbo Encoder Core and Devices Implementing the Updated CCSDS Telemetry Channel Coding Standard
Development Plan for Turbo Encoder Core and Devices Implementing the Updated CCSDS Telemetry Channel Coding Standard Sandi Habinc 1, Gian Paolo Calzolari 2, Enrico Vassallo 3 European Space Research and
More informationA New Digital Communications Course Enhanced by PCBased Design Projects*
Int. J. Engng Ed. Vol. 16, No. 6, pp. 553±559, 2000 0949149X/91 $3.00+0.00 Printed in Great Britain. # 2000 TEMPUS Publications. A New Digital Communications Course Enhanced by PCBased Design Projects*
More informationaddress: (N. Marriwala), (O. P. Sahu), (A. Vohra)
Journal of Electrical and Electronic Engineering 2014; 2(4): 5563 Published online November 14, 2014 (http://www.sciencepublishinggroup.com/j/jeee) doi: 10.11648/j.jeee.20140204.11 ISSN: 23291613 (Print);
More information1 Error Control Coding for Fading Channels
1 Error Control Coding for Fading Channels Elements of Error Control Coding A code is a mapping that takes a sequence of information symbols and produces a (larger) sequence of code symbols so as to be
More informationPublic Switched Telephone System
Public Switched Telephone System Structure of the Telephone System The Local Loop: Modems, ADSL Structure of the Telephone System (a) Fullyinterconnected network. (b) Centralized switch. (c) Twolevel
More informationBER Performance Analysis of SSBQPSK over AWGN and Rayleigh Channel
Performance Analysis of SSBQPSK over AWGN and Rayleigh Channel Rahul Taware ME Student EXTC Department, DJSCOE VileParle (W) Mumbai 056 T. D Biradar Associate Professor EXTC Department, DJSCOE VileParle
More informationDuality of Channel Encoding and Decoding  Part II: Rate1 Nonbinary Convolutional Codes
Duality of Channel Encoding and Decoding  Part II: Rate1 Nonbinary Convolutional Codes Qimin You, Yonghui Li, Senior Member, IEEE, Soung Chang Liew, Fellow, IEEE, and Branka Vucetic, Fellow, IEEE Abstract
More informationCyclic Redundancy Checks
Cyclic Redundancy Checks Will Hasenplaugh Intel Corporation October 16, 2006 Outline Introduction to Error Control Systems Properties and Examples Cyclic Redundancy Checks Homework Break Linear Time CRC
More informationChapter 1 Introduction
Chapter 1 Introduction 1. Shannon s Information Theory 2. Source Coding theorem 3. Channel Coding Theory 4. Information Capacity Theorem 5. Introduction to Error Control Coding Appendix A : Historical
More informationExperiment # 4. Quadrature Amplitude Modulation (QAM)
ECE 417 c 2014 Bruno KorstFagundes CommLab Experiment # 4 Quadrature Amplitude Modulation (QAM) 4 Eye Diagram 3 3 2 2 1 1 Amplitude 0 Quadrature 0 1 1 2 2 3 3 4 15 10 5 0 5 10 15 Time 3 2 1 0 1 2 3 In
More informationMIMO detector algorithms and their implementations for LTE/LTEA
GIGA seminar 11.01.2010 MIMO detector algorithms and their implementations for LTE/LTEA Markus Myllylä and Johanna Ketonen 11.01.2010 2 Outline Introduction System model Detection in a MIMOOFDM system
More informationOptimized Message Passing Schedules for LDPC Decoding
Optimized Message Passing Schedules for LDPC Decoding Predrag Radosavevic, Alexandre de Baynast, and Joseph R Cavallaro Department of Electrical and Computer Engineering Rice University, MS3666 Main
More information1872 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004
1872 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 52, NO. 11, NOVEMBER 2004 Transactions Papers Performance Analysis and Design Criteria for FiniteAlphabet SourceChannel Codes Ahmadreza Hedayat, Student
More informationMemoryEfficient Decoding of LDPC Codes
MemoryEfficient Decoding of LDPC Codes Jason KwokSan Lee University of California, Berkeley Email: jlee@eecsberkeleyedu Jeremy Thorpe Jet Propulsion Laboratory California Institute of Technology Email:
More informationA HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER. Figure 1. Basic structure of an encoder.
A HIGH PERFORMANCE SOFTWARE IMPLEMENTATION OF MPEG AUDIO ENCODER Manoj Kumar 1 Mohammad Zubair 1 1 IBM T.J. Watson Research Center, Yorktown Hgts, NY, USA ABSTRACT The MPEG/Audio is a standard for both
More informationIMPLEMENTATION ENHANCED MAJORITY LOGIC DECODING OF EUCLIDEAN GEOMETRY LOW DENSITY PARITY CHECK (EGLDPC) CODES FOR ERROR DETECTION
IMPLEMENTATION ENHANCED MAJORITY LOGIC DECODING OF EUCLIDEAN GEOMETRY LOW DENSITY PARITY CHECK (EGLDPC) CODES FOR ERROR DETECTION 1 Vittalam.D.Kumar Reddy M.Tech, VLSI System Design, 2 P.Giri Babu, Asst.
More informationThe CD player as an information channel
Chapter 9 The CD player as an information channel 9.1 The CD as an information channel The next few chapters use the example of the CD audio system to show some of the basic properties of instruments used
More informationQuadrature AM and Quaternary PSK
Quadrature AM and Quaternary PSK Consider a general angle modulated signal g(t) = A cos(ω c t + D p m(t)) of the baseband signal m(t). If m(t) is a binary signal then the result is a phaseshift keyed
More informationSelection of data modulation techniques in spread spectrum systems using modified processing gain definition
HAIT Journal of Science and Engineering, Series: Engineering 2 (1), pp. xxxxxx Copyright c 2004 Holon Academic Institute of Technology Selection of data modulation techniques in spread spectrum systems
More informationImage Compression through DCT and Huffman Coding Technique
International Journal of Current Engineering and Technology EISSN 2277 4106, PISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul
More informationMobile communications: IS95 and GSM
1 Mobile communications: IS95 and GSM 1. Introduction Two second generation cellular systems are currently being deployed  the Global System for Mobile Communications (GSM) and the Code Division Multiple
More informationDigital Modulation. David Tipper. Department of Information Science and Telecommunications University of Pittsburgh. Typical Communication System
Digital Modulation David Tipper Associate Professor Department of Information Science and Telecommunications University of Pittsburgh http://www.tele.pitt.edu/tipper.html Typical Communication System Source
More informationWhitepaper November 2008. Iterative Detection Read Channel Technology in Hard Disk Drives
Whitepaper November 2008 Iterative Detection Read Channel Technology in Hard Disk Drives / Table of Contents Table of Contents Executive Summary... 1 Background...2 Achieving Enhanced Performance Through
More informationLogLikelihood Ratiobased Relay Selection Algorithm in Wireless Network
Recent Advances in Electrical Engineering and Electronic Devices LogLikelihood Ratiobased Relay Selection Algorithm in Wireless Network Ahmed ElMahdy and Ahmed Walid Faculty of Information Engineering
More informationMOST errorcorrecting codes are designed for the equal
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 3, MARCH 2007 387 Transactions Letters Unequal Error Protection Using Partially Regular LDPC Codes Nazanin Rahnavard, Member, IEEE, Hossein PishroNik,
More informationHybrid TypeII ARQ Schemes for Rayleigh Fading Channels
Hybrid TypeII ARQ Schemes for Rayleigh Fading Channels Sorour Falahati and Arne Svensson Dept. of Signals and Systems, Communication Systems Group Chalmers University of Technology, E42 96 Göteborg,
More informationError Detection & Message Flow Control. Oswald Jumira Stellenbosch University
Error Detection & Message Flow Control Oswald Jumira oswald@ml.sun.ac.za Stellenbosch University Channel Coding Class of signal transformations designed to improve communications performances by enabling
More informationEfficient Data Recovery scheme in PTSBased OFDM systems with MATRIX Formulation
Efficient Data Recovery scheme in PTSBased OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau638052 Venkatachalam.S Assistant Professor
More informationPHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUMBER OF REFERENCE SYMBOLS
PHASE ESTIMATION ALGORITHM FOR FREQUENCY HOPPED BINARY PSK AND DPSK WAVEFORMS WITH SMALL NUM OF REFERENCE SYMBOLS Benjamin R. Wiederholt The MITRE Corporation Bedford, MA and Mario A. Blanco The MITRE
More informationConstellation Shaping, Nonlinear Precoding, and Trellis Coding for Voiceband
Constellation Shaping, Nonlinear Precoding, and Trellis Coding for Voiceband Telephone Channel Modems CONSTELLATION SHAPING, NONLINEAR PRECODING, AND TRELLIS CODING FOR VOICEBAND TELEPHONE CHANNEL MODEMS
More informationError Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance
Error Detection and Correction: Parity Check Code; Bounds Based on Hamming Distance Greg Plaxton Theory in Programming Practice, Fall 2005 Department of Computer Science University of Texas at Austin Error
More informationA VHDL Implementation of WiMAX Convolutional Turbo Code
A VHDL Implementation of WiMAX Convolutional Turbo Code Ailton Akira Shinoda Abstract this article describes the VHDL implementation of convolutional turbo code of an OFDM system based on adaptive data
More informationIntroducing Flexibility into the Network Using Multidimensional Constellations
Introducing Flexibility into the Network Using Multidimensional Constellations Jochen Leibrich jol@tf.unikiel.de ChristianAlbrechtsUniversität zu Kiel Workshop on Optical Communication Systems October
More informationChap 3 Huffman Coding
Chap 3 Huffman Coding 3.1 Overview 3.2 The Huffman Coding Algorithm 3.4 Adaptive Huffman Coding 3.5 Golomb Codes 3.6 Rice Codes 3.7 Tunstall Codes 3.8 Applications of Huffman Coding 1 3.2 The Huffman Coding
More informationDesign and Implementation of Adaptive Turbo Encoder for Quantized Software Defined Low Power DVBRCS Radios
68 Telfor Journal, Vol. 2, No. 2, 2010. Design and Implementation of Adaptive Turbo Encoder for Quantized Software Defined Low Power DVBRCS Radios Sherif Welsen Shaker, Member, IEEE and Salwa Hussien
More informationA Distance Spectrum Interpretation of Turbo Codes
1698 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 42, NO. 6, NOVEMBER 1996 A Distance Spectrum Interpretation of Turbo Codes Lance C. Perez, Member, IEEE, Jan Seghers, and Daniel J. Costello, Jr., Fellow,
More informationAn important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q.
Chapter 3 Linear Codes An important class of codes are linear codes in the vector space Fq n, where F q is a finite field of order q. Definition 3.1 (Linear code). A linear code C is a code in Fq n for
More information6.02 Fall 2012 Lecture #5
6.2 Fall 22 Lecture #5 Error correction for linear block codes  Syndrome decoding Burst errors and interleaving 6.2 Fall 22 Lecture 5, Slide # Matrix Notation for Linear Block Codes Task: given kbit
More informationIntroducing LowDensity ParityCheck Codes
Introducing LowDensity ParityCheck Codes Sarah J. Johnson School of Electrical Engineering and Computer Science The University of Newcastle Australia email: sarah.johnson@newcastle.edu.au Topic 1: LowDensity
More informationHybrid Electronics Laboratory
Hybrid Electronics Laboratory Design and Simulation of Decoders, Encoders, Multiplexer and Demultiplexer Aim: To study decoders, encoders, multiplexer and demultiplexer. Objectives: 1. Implement and simulate
More informationINTERNATIONAL TELECOMMUNICATION UNION DATA COMMUNICATION OVER THE TELEPHONE NETWORK
INTERNATIONAL TELEOMMUNIATION UNION ITT V.7 THE INTERNATIONAL TELEGRAPH AN TELEPHONE ONSULTATIVE OMMITTEE ATA OMMUNIATION OVER THE TELEPHONE NETWORK A 2WIRE MOEM FOR FASIMILE APPLIATIONS WITH RATES UP
More informationPerformance Evaluation of VSATQPSK System
Performance Evaluation of VSATQPSK System T.P. Surekha 1, T. Ananthapadmanabha 2, C. Puttamadappa 3 1 Associate Professor, Dept. of E&CE, Vidyavardhaka College of Engineering, Mysore, India. 2 Professor,
More informationExample: Systematic Encoding (1) Systematic Cyclic Codes. Systematic Encoding. Example: Systematic Encoding (2)
S72.3410 Cyclic Codes 1 S72.3410 Cyclic Codes 3 Example: Systematic Encoding (1) Systematic Cyclic Codes Polynomial multiplication encoding for cyclic linear codes is easy. Unfortunately, the codes obtained
More informationA Viterbi Decoder with Efficient Memory Management
A Viterbi Decoder with Efficient Memory Management Chanho Lee This paper proposes a new architecture for a Viterbi decoder with an efficient management scheme. The traceback operation is eliminated in
More informationQUADRATURE AMPLIDUDE MODULATION. Prepared by Deepa.T, Asst.Prof. /TCE
QUADRATURE AMPLIDUDE MODULATION Prepared by Deepa.T, Asst.Prof. /TCE INTRODUCTION QAM Quadrature Amplitude Modulation or QAM is a form of modulation which is widely used for modulating data signals onto
More informationsituation when the value of coecients (obtained by means of the transformation) corresponding to higher frequencies are either zero or near to zero. T
Dithering as a method for image data compression Pavel Slav k (slavik@cslab.felk.cvut.cz), Jan P ikryl (prikryl@sgi.felk.cvut.cz) Czech Technical University Prague Faculty of Electrical Engineering Department
More informationRational inequality. Sunil Kumar Singh. 1 Sign scheme or diagram for rational function
OpenStaxCNX module: m15464 1 Rational inequality Sunil Kumar Singh This work is produced by OpenStaxCNX and licensed under the Creative Commons Attribution License 2.0 Rational inequality is an inequality
More informationIMPLEMENTATION OF 16APSK MODULATION IN MATLAB USED FOR THE DVBSHB TRANSMISSION
IMPLEMENTATION OF 16APSK MODULATION IN MATLAB USED FOR THE DVBSHB TRANSMISSION Ladislav Polák, Ondřej Kaller, Tomáš Kratochvíl Department of Radio Electronics, Brno University of Technology Purkyňova
More information2.2 Mary Baseband Pulse Amplitude Modulation (PAM)
56 2.2 Mary Baseband Pulse Amplitude Modulation (PAM) 2.2 Mary Baseband Pulse Amplitude Modulation (PAM) Mary baseband pulse amplitude modulation is a onedimensional signal set with basis function
More informationLecture 14. Architecture: Design Principles
6.976/ESD.937 Quantitative Foundations of Engineering Systems Feb 131521, 2006 Lecturer: D. Shah and S. Mitter Lecture 14 Scribe: J. Laracy and D. Shah Architecture: Design Principles Architecture is
More informationModule 3. Data Link control. Version 2 CSE IIT, Kharagpur
Module 3 Data Link control Lesson 2 Error Detection and Correction Special Instructional Objectives: On completion of this lesson, the student will be able to: Explain the need for error detection and
More informationResearch on the UHF RFID Channel Coding Technology based on Simulink
Vol. 6, No. 7, 015 Research on the UHF RFID Channel Coding Technology based on Simulink Changzhi Wang Shanghai 0160, China Zhicai Shi* Shanghai 0160, China Dai Jian Shanghai 0160, China Li Meng Shanghai
More information8586514351 8588457566
Conference Call C3020030930062 Title: RPDCCH Performance Evaluation Abstract: The performance of RPDCCH is evaluated in this contribution. In particular, we study different approaches for error detection
More informationAn Efficient Majority Logic Fault Detection to reduce the Accessing time for Memory Applications
International Journal of Scientific and Research Publications, Volume 3, Issue 3, March 2013 1 An Efficient Majority Logic Fault Detection to reduce the Accessing time for Memory Applications R.Meenaakshi
More informationECEN 5682 Theory and Practice of Error Control Codes
ECEN 5682 Theory and Practice of Error Control Codes Convolutional Code Performance University of Colorado Spring 2007 Definition: A convolutional encoder which maps one or more data sequences of infinite
More informationIrregular Designs for TwoState Systematic with Serial Concatenated Parity Codes
rregular Designs for TwoState Systematic with Serial Concatenated Parity Codes Jordan Melzer and Keith M. Chugg Electrical Engineering Department, University of Southern California Los Angeles, California
More informationWhat s The Difference Between Bit Rate And Baud Rate?
What s The Difference Between Bit Rate And Baud Rate? Apr. 27, 2012 Lou Frenzel Electronic Design Serialdata speed is usually stated in terms of bit rate. However, another oftquoted measure of speed is
More informationRECOMMENDATION ITUR F.1101 * Characteristics of digital fixed wireless systems below about 17 GHz
Rec. ITUR F.1101 1 RECOMMENDATION ITUR F.1101 * Characteristics of digital fixed wireless systems below about 17 GHz (Question ITUR 135/9) (1994) The ITU Radiocommunication Assembly, considering a)
More information