Communications Systems Laboratory. Department of Electrical Engineering. University of Virginia. Charlottesville, VA 22903
|
|
- Catherine Randall
- 7 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: wjb3w@virginia.edu Modulation (TCM). n Turbo TCM (T-TCM) 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 T-TCM 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 T-TCM 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 M-ary 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 Turbo-TCM system was presented where a single M-ary symbol is transmitted at each trellis interval, e.g. 2 information bits into 8-PSK. 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 M-ary M-ary Figure 1: T-TCM 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 4-AM Figure 2: T-TCM of [4] -1 -Channel Q-Channel 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 in-phase and quadrature modulation to form a composite symbol or by serializing the symbols for transmission, e.g. sequentially sending two 8-PSK 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 T-TCM 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 one-step 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 multiple-step 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 multiple-step 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 one-step 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 single-step error event. 2.3 Adaptation With the above condition in mind, it is possible to now discuss conditions under which the previously discussed T-TCM 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 multiple-step 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, one-step 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 M-ARY M-ARY 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 one-step 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 T-TCM 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 = (1-m) log 2 metric s -1 * first decoding all others metric metric "0" "0" MAP MAP m-1 Hard Decision Figure 4: Non Parallel T-TCM decoder There are two modications which need to be made so that this decoder will properly decode a Turbo-TCM 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 M-ary symbol. 4 Simulation Results The following plots compare the performance of T-TCM systems of the type presented in [3] with and without parallel transitions. n all cases the systems in question used 16-QAM 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 Non-Parallel 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 one-step 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 one-step error events can improve T-TCM system performance. References [1] C. Berrou, A. Glavieux, and P. Thitimajshima, \Near Shannon limit error-correcting coding and decoding: Turbo Codes," in CC, pp. 1064{1070, [2] G. Ungerboeck, \Trellis-coded 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., \Turbo-codes and high spectral eciency modulation," in CC, pp. 645{ 649, [6] S. G. Wilson, Digital Modulation and Coding. Englewood Clis, New Jersey: Prentice-Hall, 1995.
Coding Theorems for Turbo-Like Codes Abstract. 1. Introduction.
Coding Theorems for Turbo-Like Codes Dariush Divsalar, Hui Jin, and Robert J. McEliece Jet Propulsion Laboratory and California Institute of Technology Pasadena, California USA E-mail: dariush@shannon.jpl.nasa.gov,
More informationPerformance of Quasi-Constant Envelope Phase Modulation through Nonlinear Radio Channels
Performance of Quasi-Constant Envelope Phase Modulation through Nonlinear Radio Channels Qi Lu, Qingchong Liu Electrical and Systems Engineering Department Oakland University Rochester, MI 48309 USA E-mail:
More informationCODED SOQPSK-TG USING THE SOFT OUTPUT VITERBI ALGORITHM
CODED SOQPSK-TG 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 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 multi-mode 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 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 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 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 informationInterleave-Division Multiple-Access (IDMA) Communications 1
Interleave-Division Multiple-Access (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 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 informationWITH his 1948 paper, A Mathematical Theory of
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 44, NO. 6, OCTOBER 1998 2531 Applications of Error-Control 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. 2007-2008 Lezione 6 Communications Blockset Ing. Marco GALEAZZI 1 What Is Communications Blockset? Communications Blockset extends Simulink with a comprehensive
More informationBER Performance Analysis of SSB-QPSK over AWGN and Rayleigh Channel
Performance Analysis of SSB-QPSK over AWGN and Rayleigh Channel Rahul Taware ME Student EXTC Department, DJSCOE Vile-Parle (W) Mumbai 056 T. D Biradar Associate Professor EXTC Department, DJSCOE Vile-Parle
More informationJoint Message-Passing Decoding of LDPC Codes and Partial-Response Channels
1410 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 6, JUNE 2002 Joint Message-Passing Decoding of LDPC Codes Partial-Response Channels Brian M. Kurkoski, Student Member, IEEE, Paul H. Siegel, Fellow,
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 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 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 informationPublic Switched Telephone System
Public Switched Telephone System Structure of the Telephone System The Local Loop: Modems, ADSL Structure of the Telephone System (a) Fully-interconnected network. (b) Centralized switch. (c) Two-level
More informationMIMO detector algorithms and their implementations for LTE/LTE-A
GIGA seminar 11.01.2010 MIMO detector algorithms and their implementations for LTE/LTE-A Markus Myllylä and Johanna Ketonen 11.01.2010 2 Outline Introduction System model Detection in a MIMO-OFDM system
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 informationA New Digital Communications Course Enhanced by PC-Based Design Projects*
Int. J. Engng Ed. Vol. 16, No. 6, pp. 553±559, 2000 0949-149X/91 $3.00+0.00 Printed in Great Britain. # 2000 TEMPUS Publications. A New Digital Communications Course Enhanced by PC-Based Design Projects*
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 Finite-Alphabet Source-Channel Codes Ahmadreza Hedayat, Student
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 k-bit
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. xxx-xxx Copyright c 2004 Holon Academic Institute of Technology Selection of data modulation techniques in spread spectrum systems
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 informationEfficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation
Efficient Data Recovery scheme in PTS-Based OFDM systems with MATRIX Formulation Sunil Karthick.M PG Scholar Department of ECE Kongu Engineering College Perundurau-638052 Venkatachalam.S Assistant Professor
More informationImage Compression through DCT and Huffman Coding Technique
International Journal of Current Engineering and Technology E-ISSN 2277 4106, P-ISSN 2347 5161 2015 INPRESSCO, All Rights Reserved Available at http://inpressco.com/category/ijcet Research Article Rahul
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 informationLog-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network
Recent Advances in Electrical Engineering and Electronic Devices Log-Likelihood Ratio-based Relay Selection Algorithm in Wireless Network Ahmed El-Mahdy and Ahmed Walid Faculty of Information Engineering
More informationMOST error-correcting 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 Pishro-Nik,
More informationKhalid Sayood and Martin C. Rost Department of Electrical Engineering University of Nebraska
PROBLEM STATEMENT A ROBUST COMPRESSION SYSTEM FOR LOW BIT RATE TELEMETRY - TEST RESULTS WITH LUNAR DATA Khalid Sayood and Martin C. Rost Department of Electrical Engineering University of Nebraska The
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 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 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 2-WIRE MOEM FOR FASIMILE APPLIATIONS WITH RATES UP
More informationChapter 3: Sample Questions, Problems and Solutions Bölüm 3: Örnek Sorular, Problemler ve Çözümleri
Chapter 3: Sample Questions, Problems and Solutions Bölüm 3: Örnek Sorular, Problemler ve Çözümleri Örnek Sorular (Sample Questions): What is an unacknowledged connectionless service? What is an acknowledged
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 informationRECOMMENDATION ITU-R F.1101 * Characteristics of digital fixed wireless systems below about 17 GHz
Rec. ITU-R F.1101 1 RECOMMENDATION ITU-R F.1101 * Characteristics of digital fixed wireless systems below about 17 GHz (Question ITU-R 135/9) (1994) The ITU Radiocommunication Assembly, considering a)
More information858-651-4351 858-845-7566
Conference Call C30-20030930-062 Title: R-PDCCH Performance Evaluation Abstract: The performance of R-PDCCH is evaluated in this contribution. In particular, we study different approaches for error detection
More informationMain Ways to Enhance Throughput
802.11n Sanna Puha Contents 1. Introduction 2. Ways to Enhance Throughput 3. MIMO operation 4. Structure of Operating Channel 5. MIMO Transmission Modes 6. Modulation Rates 7. Physical Transmission, PLCP:
More informationLinear Codes. Chapter 3. 3.1 Basics
Chapter 3 Linear Codes In order to define codes that we can encode and decode efficiently, we add more structure to the codespace. We shall be mainly interested in linear codes. A linear code of length
More informationError Control Coding and Ethernet
Error Control Coding and Ethernet Steven W. McLaughlin and David Warland Calimetrics, Inc. Alameda, CA smclaughlin@calimetrics.com 1 Agenda Background on error control coding History of error control coding
More informationDigital Video Broadcasting By Satellite
Digital Video Broadcasting By Satellite Matthew C. Valenti Lane Department of Computer Science and Electrical Engineering West Virginia University U.S.A. Apr. 2, 2012 ( Lane Department LDPCof Codes Computer
More informationChapter 4 Multi-Stage Interconnection Networks The general concept of the multi-stage interconnection network, together with its routing properties, have been used in the preceding chapter to describe
More informationplc numbers - 13.1 Encoded values; BCD and ASCII Error detection; parity, gray code and checksums
plc numbers - 3. Topics: Number bases; binary, octal, decimal, hexadecimal Binary calculations; s compliments, addition, subtraction and Boolean operations Encoded values; BCD and ASCII Error detection;
More informationCapacity Limits of MIMO Channels
Tutorial and 4G Systems Capacity Limits of MIMO Channels Markku Juntti Contents 1. Introduction. Review of information theory 3. Fixed MIMO channels 4. Fading MIMO channels 5. Summary and Conclusions References
More informationCommunication Theory in the Cloud
Communication Theory in the Cloud Matthew C. Valenti 1 West Virginia University October 30, 2009 1 This work supported by the National Science Foundation under award CNS-0750821. Valenti Communication
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 Serial-data speed is usually stated in terms of bit rate. However, another oftquoted measure of speed is
More informationADVANCED APPLICATIONS OF ELECTRICAL ENGINEERING
Development of a Software Tool for Performance Evaluation of MIMO OFDM Alamouti using a didactical Approach as a Educational and Research support in Wireless Communications JOSE CORDOVA, REBECA ESTRADA
More informationCNR Requirements for DVB-T2 Fixed Reception Based on Field Trial Results
CNR Requirements for DVB-T2 Fixed Reception Based on Field Trial Results Iñaki Eizmendi, Gorka Berjon-Eriz, Manuel Vélez, Gorka Prieto, Amaia Arrinda This letter presents the C/N requirements for DVB-T2
More informationManchester Encoder-Decoder for Xilinx CPLDs
Application Note: CoolRunner CPLDs R XAPP339 (v.3) October, 22 Manchester Encoder-Decoder for Xilinx CPLDs Summary This application note provides a functional description of VHDL and Verilog source code
More information1 Multi-channel frequency division multiplex frequency modulation (FDM-FM) emissions
Rec. ITU-R SM.853-1 1 RECOMMENDATION ITU-R SM.853-1 NECESSARY BANDWIDTH (Question ITU-R 77/1) Rec. ITU-R SM.853-1 (1992-1997) The ITU Radiocommunication Assembly, considering a) that the concept of necessary
More informationHardware Implementation for Error Correction Using Software-Defined Radio Platform
European Journal of Scientific Research ISSN 1450-216X Vol.38 No.2 (2009), pp.337-350 EuroJournals Publishing, Inc. 2009 http://www.eurojournals.com/ejsr.htm Hardware Implementation for Error Correction
More informationFAREY FRACTION BASED VECTOR PROCESSING FOR SECURE DATA TRANSMISSION
FAREY FRACTION BASED VECTOR PROCESSING FOR SECURE DATA TRANSMISSION INTRODUCTION GANESH ESWAR KUMAR. P Dr. M.G.R University, Maduravoyal, Chennai. Email: geswarkumar@gmail.com Every day, millions of people
More informationGoldberg, D. E. (1989). Genetic algorithms in search, optimization, and machine learning. Reading, MA:
is another objective that the GA could optimize. The approach used here is also adaptable. On any particular project, the designer can congure the GA to focus on optimizing certain constraints (such as
More informationClustering and scheduling maintenance tasks over time
Clustering and scheduling maintenance tasks over time Per Kreuger 2008-04-29 SICS Technical Report T2008:09 Abstract We report results on a maintenance scheduling problem. The problem consists of allocating
More informationEfficient Recovery of Secrets
Efficient Recovery of Secrets Marcel Fernandez Miguel Soriano, IEEE Senior Member Department of Telematics Engineering. Universitat Politècnica de Catalunya. C/ Jordi Girona 1 i 3. Campus Nord, Mod C3,
More informationImplementing Digital Wireless Systems. And an FCC update
Implementing Digital Wireless Systems And an FCC update Spectrum Repacking Here We Go Again: The FCC is reallocating 600 MHz Frequencies for Wireless Mics 30-45 MHz (8-m HF) 174-250 MHz (VHF) 450-960 MHz
More informationIrregular Designs for Two-State Systematic with Serial Concatenated Parity Codes
rregular Designs for Two-State Systematic with Serial Concatenated Parity Codes Jordan Melzer and Keith M. Chugg Electrical Engineering Department, University of Southern California Los Angeles, California
More information2011, The McGraw-Hill Companies, Inc. Chapter 3
Chapter 3 3.1 Decimal System The radix or base of a number system determines the total number of different symbols or digits used by that system. The decimal system has a base of 10 with the digits 0 through
More informationProbability Interval Partitioning Entropy Codes
SUBMITTED TO IEEE TRANSACTIONS ON INFORMATION THEORY 1 Probability Interval Partitioning Entropy Codes Detlev Marpe, Senior Member, IEEE, Heiko Schwarz, and Thomas Wiegand, Senior Member, IEEE Abstract
More informationIntroduzione alle reti DVB-H
UNIVERSITÀ DEGLI STUDI DI CASSINO FACOLTA DI INGEGNERIA Corso di sistemi radiomobili Introduzione alle reti DVB-H Gianfranco Miele 8 giugno 2007 Contents 1 DVB-T system 1 1.1 Introduction................................
More informationFUNDAMENTALS of INFORMATION THEORY and CODING DESIGN
DISCRETE "ICS AND ITS APPLICATIONS Series Editor KENNETH H. ROSEN FUNDAMENTALS of INFORMATION THEORY and CODING DESIGN Roberto Togneri Christopher J.S. desilva CHAPMAN & HALL/CRC A CRC Press Company Boca
More informationHow To Encode Data From A Signal To A Signal (Wired) To A Bitcode (Wired Or Coaxial)
Physical Layer Part 2 Data Encoding Techniques Networks: Data Encoding 1 Analog and Digital Transmissions Figure 2-23.The use of both analog and digital transmissions for a computer to computer call. Conversion
More information2.0 System Description
2.0 System Description The wireless alarm system consists of two or more alarm units within a specified range of one another. Each alarm unit employs a radio transceiver, allowing it to communicate with
More informationDiffusion and Data compression for data security. A.J. Han Vinck University of Duisburg/Essen April 2013 Vinck@iem.uni-due.de
Diffusion and Data compression for data security A.J. Han Vinck University of Duisburg/Essen April 203 Vinck@iem.uni-due.de content Why diffusion is important? Why data compression is important? Unicity
More informationData Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine
Data Link Layer(1) Principal service: Transferring data from the network layer of the source machine to the one of the destination machine Virtual communication versus actual communication: Specific functions
More informationAN INTRODUCTION TO DIGITAL MODULATION
AN INTRODUCTION TO DIGITAL MODULATION This article provides readers a simple overview of the various popular methods used in modulating a digital signal. The relative merits of each of these modulation
More informationProt Maximization and Cost Minimization
Simon Fraser University Prof. Karaivanov Department of Economics Econ 0 COST MINIMIZATION Prot Maximization and Cost Minimization Remember that the rm's problem is maximizing prots by choosing the optimal
More informationInformation Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay
Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay Lecture - 17 Shannon-Fano-Elias Coding and Introduction to Arithmetic Coding
More informationAppendix D Digital Modulation and GMSK
D1 Appendix D Digital Modulation and GMSK A brief introduction to digital modulation schemes is given, showing the logical development of GMSK from simpler schemes. GMSK is of interest since it is used
More informationHSDPA Mobile Broadband Data A Smarter Approach to UMTS Downlink Data
HSDPA Mobile Broadband Data A Smarter Approach to UMTS Downlink Data UMTS mobile wireless systems have enjoyed widespread uptake of high-quality circuit-switched applications like voice and video telephony.
More informationELEC3028 Digital Transmission Overview & Information Theory. Example 1
Example. A source emits symbols i, i 6, in the BCD format with probabilities P( i ) as given in Table, at a rate R s = 9.6 kbaud (baud=symbol/second). State (i) the information rate and (ii) the data rate
More informationA brief Overview of the GSM Radio Interface. Thierry Turletti. Massachussets Institute of Technology. March 1, 1996. Abstract
A brief Overview of the GSM Radio Interface Thierry Turletti Telemedia Networks and Systems Group Laboratory for Computer Science Massachussets Institute of Technology turletti@lcs.mit.edu March 1, 1996
More informationAnalysis of Compression Algorithms for Program Data
Analysis of Compression Algorithms for Program Data Matthew Simpson, Clemson University with Dr. Rajeev Barua and Surupa Biswas, University of Maryland 12 August 3 Abstract Insufficient available memory
More informationInternational Journal of Computer Sciences and Engineering. Research Paper Volume-4, Issue-4 E-ISSN: 2347-2693
International Journal of Computer Sciences and Engineering Open Access Research Paper Volume-4, Issue-4 E-ISSN: 2347-2693 PAPR Reduction Method for the Localized and Distributed DFTS-OFDM System Using
More informationTransform-domain Wyner-Ziv Codec for Video
Transform-domain Wyner-Ziv Codec for Video Anne Aaron, Shantanu Rane, Eric Setton, and Bernd Girod Information Systems Laboratory, Department of Electrical Engineering Stanford University 350 Serra Mall,
More informationMIMO Antenna Systems in WinProp
MIMO Antenna Systems in WinProp AWE Communications GmbH Otto-Lilienthal-Str. 36 D-71034 Böblingen mail@awe-communications.com Issue Date Changes V1.0 Nov. 2010 First version of document V2.0 Feb. 2011
More informationFirst-order Asymptotics of the BICM Mutual Information: Uniform vs. Nonuniform Distributions
First-order Asymptotics of the BICM Mutual Information: Uniform vs. Nonuniform Distributions Erik Agrell Department of Signals and Systems Chalmers University of Technology SE-41296 Göteborg Sweden Email:
More informationSimple, Robust Software RAID for Linux 2.6
Simple, Robust Software RAID for Linux 2.6 Daniel Phillips 21st June 2003 Abstract Linux's new Device Mapper subsystem provides ecient facilities for concatenating, striping and mirroring physical volumes
More informationIntroduction to Logistic Regression
OpenStax-CNX module: m42090 1 Introduction to Logistic Regression Dan Calderon This work is produced by OpenStax-CNX and licensed under the Creative Commons Attribution License 3.0 Abstract Gives introduction
More informationAdaptive Linear Programming Decoding
Adaptive Linear Programming Decoding Mohammad H. Taghavi and Paul H. Siegel ECE Department, University of California, San Diego Email: (mtaghavi, psiegel)@ucsd.edu ISIT 2006, Seattle, USA, July 9 14, 2006
More informationTransmission of Voice Signal: BER Performance Analysis of Different FEC Schemes Based OFDM System over Various Channels
Transmission of Voice Signal: BER Performance Analysis of Different FEC Schemes Based OFDM System over Various Channels Md. Golam Rashed 1, M. Hasnat Kabir 2, Md. Selim Reza 3, Md. Matiqul Islam 2, Rifat
More informationChap#5 (Data communication)
Chap#5 (Data communication) Q#1: Define analog transmission. Normally, analog transmission refers to the transmission of analog signals using a band-pass channel. Baseband digital or analog signals are
More informationEvolution from Voiceband to Broadband Internet Access
Evolution from Voiceband to Broadband Internet Access Murtaza Ali DSPS R&D Center Texas Instruments Abstract With the growth of Internet, demand for high bit rate Internet access is growing. Even though
More informationAppendix C GSM System and Modulation Description
C1 Appendix C GSM System and Modulation Description C1. Parameters included in the modelling In the modelling the number of mobiles and their positioning with respect to the wired device needs to be taken
More informationStandardized software components will help in mastering the. software should be developed for FlexRay were presented at
Embedded Software for FlexRay Systems Special aspects and benefits of implementing modularized software Standardized software components will help in mastering the growing complexity of the interplay of
More informationMODULATION Systems (part 1)
Technologies and Services on Digital Broadcasting (8) MODULATION Systems (part ) "Technologies and Services of Digital Broadcasting" (in Japanese, ISBN4-339-62-2) is published by CORONA publishing co.,
More informationA Software Development Framework Based on C++ OOP Language for Link-level Simulation Tools
A Software Development Framework Based on C++ OOP Language for Link-level Simulation Tools Carlos H. M. de Lima, Elvis M. G. Stancanelli, Emanuel B. Rodrigues, Jean M. da S. Maciel and Francisco R. P.
More information(Refer Slide Time: 00:01:16 min)
Digital Computer Organization Prof. P. K. Biswas Department of Electronic & Electrical Communication Engineering Indian Institute of Technology, Kharagpur Lecture No. # 04 CPU Design: Tirning & Control
More informationCDMA TECHNOLOGY. Brief Working of CDMA
CDMA TECHNOLOGY History of CDMA The Cellular Challenge The world's first cellular networks were introduced in the early 1980s, using analog radio transmission technologies such as AMPS (Advanced Mobile
More informationPeter Eisert, Thomas Wiegand and Bernd Girod. University of Erlangen-Nuremberg. Cauerstrasse 7, 91058 Erlangen, Germany
RATE-DISTORTION-EFFICIENT VIDEO COMPRESSION USING A 3-D HEAD MODEL Peter Eisert, Thomas Wiegand and Bernd Girod Telecommunications Laboratory University of Erlangen-Nuremberg Cauerstrasse 7, 91058 Erlangen,
More informationNumber Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi)
Conversions Dr. Sarita Agarwal (Acharya Narendra Dev College,University of Delhi) INTRODUCTION System- A number system defines a set of values to represent quantity. We talk about the number of people
More informationVoice services over Adaptive Multi-user Orthogonal Sub channels An Insight
TEC Voice services over Adaptive Multi-user Orthogonal Sub channels An Insight HP 4/15/2013 A powerful software upgrade leverages quaternary modulation and MIMO techniques to improve network efficiency
More informationTake-Home Exercise. z y x. Erik Jonsson School of Engineering and Computer Science. The University of Texas at Dallas
Take-Home Exercise Assume you want the counter below to count mod-6 backward. That is, it would count 0-5-4-3-2-1-0, etc. Assume it is reset on startup, and design the wiring to make the counter count
More informationWritten examination in Computer Networks
Written examination in Computer Networks February 14th 2014 Last name: First name: Student number: Provide on all sheets (including the cover sheet) your last name, rst name and student number. Use the
More informationNon-Data Aided Carrier Offset Compensation for SDR Implementation
Non-Data Aided Carrier Offset Compensation for SDR Implementation Anders Riis Jensen 1, Niels Terp Kjeldgaard Jørgensen 1 Kim Laugesen 1, Yannick Le Moullec 1,2 1 Department of Electronic Systems, 2 Center
More informationIN current film media, the increase in areal density has
IEEE TRANSACTIONS ON MAGNETICS, VOL. 44, NO. 1, JANUARY 2008 193 A New Read Channel Model for Patterned Media Storage Seyhan Karakulak, Paul H. Siegel, Fellow, IEEE, Jack K. Wolf, Life Fellow, IEEE, and
More informationComplementary Code Keying with PIC Based Microcontrollers For The Wireless Radio Communications
Complementary Code Keying with PIC Based Microcontrollers For The Wireless Radio Communications Boris Ribov, Grisha Spasov Abstract: The IEEE 802.11b is a Direct Sequence Spread Spectrum (DSSS) system
More informationReading.. IMAGE COMPRESSION- I IMAGE COMPRESSION. Image compression. Data Redundancy. Lossy vs Lossless Compression. Chapter 8.
Reading.. IMAGE COMPRESSION- I Week VIII Feb 25 Chapter 8 Sections 8.1, 8.2 8.3 (selected topics) 8.4 (Huffman, run-length, loss-less predictive) 8.5 (lossy predictive, transform coding basics) 8.6 Image
More informationBROADBAND CABLE ACCESS NETWORKS FOR TRIPLE PLAY SERVICES: SOURCE-DESTENATION
American Journal of Engineering Research (AJER) e-issn : 2320-0847 p-issn : 2320-0936 Volume-01, Issue-01, pp-01-15 www.ajer.us Research Paper Open Access BROADBAND CABLE ACCESS NETWORKS FOR TRIPLE PLAY
More information