Coded modulation: What is it?
|
|
- Derek Sims
- 7 years ago
- Views:
Transcription
1 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: Coding not useful for spectral effiencies 1 Coding gain achieved at the expense of bandwidth expansion Quantum leap: Coded modulation Trellis coded modulation (TCM) Block coded modulation (BCM) Turbo coded modulation 1
2 Coded modulation: What is it? Concatenation of an error correcting code (convolutional code, block code, turbo code) and a signal constellation Groups of coded bits are mapped into points in the signal constellation in a way that enhances the distance properties of the code Thus, a codeword can be seen as a vector of signal points Decode, ideally, to the codeword which is closest to the received vector in terms of squared Euclidean distance (assuming an AWGN channel) 2
3 Coded modulation: Fair comparisons Gain of coding? Reference system: Uncoded information mapped, k bits at a time, into signal constellation with 2 k different signal points, and with average signal energy E s Reference spectral efficiency is k Typical scheme with coded modulation: Rate k/(k+1) error correcting code. Coded bits are mapped, k+1 bits at a time, into signal constellation with 2 k+1 different signal points, and scaled down so that the average signal energy is E s Spectral efficiency is k 3
4 Coded modulation: Constellations 4
5 Coded modulation: Energy per symbol Assume in all cases that the minimum Euclidean distance between two points is 2 2-AM: E s = 2 (+1) 2 /2 = 1 4-AM: E s = 2 ((+1) 2 + (+3) 2 )/4 = 5 8-AM: E s = 2 ((+1) 2 + (+3) 2 + (+5) 2 + (+7) 2 )/8 = 21 5
6 QAM: Energy per symbol Assume in all cases that the minimum Euclidean distance between two points is 2 4-QAM: E s = 4 ((+1) 2 + (+1) 2 )/4 = 2 8-CROSS: E s = 4 (((+1) 2 + (+1) 2 ) + ((0) 2 + (+3) 2 ))/8 = 5.5 6
7 Coded modulation: Energy per symbol 7
8 Symbol error probability Uncoded modulation (QPSK): P s 2Q((E s /N 0 ) 1/2 ) + Q((2E s /N 0 ) 1/2 ) 2Q((E s /N 0 ) 1/2 ) Uncoded modulation (general constellation): P s A min Q((d min2 /2N 0 ) 1/2 ) (A min / 2) e -d min 2 /4N 0 A min = number of nearest neighbour points d min 2 = minimum squared Euclidean distance (MSE) between signal points (= 2E s for QPSK) Coded modulation: P e (A dfree / 2) e -d free 2 /4N 0 8
9 Asymptotic coding gain Now, the uncoded reference system and the coded system have the same spectral efficiency Asymptotic coding gain γ = (d free:coded 2 / E coded )/(d min:uncoded 2 / E uncoded ) γ = (E uncoded / E coded ) (d free:coded 2 / d min:uncoded2 ) = γ c -1 γ d = (constellation expansion factor) -1 distance gain factor But what is d free:coded? Binary modulation: d free:coded is proportional to the free Hamming distance of the code. Hence, design for Hamming distance Nonbinary modulation: d free:coded depends on the code as well as on the mapping from code bits to points in the signal constellation 9
10 Average and minimum Euclidean WE Constellation with 2 k+1 points Let e {0,1} k+1, v s (v is label of s), and v = (v e) s For each e, there are 2 k+1 pairs (v,v ) of this type. The distance v2 (e) between s and s varies over the set of pairs {(v,v )} For a specified constellation and for each error vector e, the average Euclidean WE (AEWE) is e2 (X) = 2 -k-1 v X v 2 (e) For a specified constellation and for each error vector e, the minimum Euclidean WE (MEWE) is δ e2 (X) = X min v v 2 (e) 10
11 Use the error trellis Computing the WEFs Mason's gain formula on the modified error state diagram with the branch labels X w(e) can be used to compute the Hamming WEF The same algorithm applied to the modified error state diagram with branch labels δ e2 (X) can compute the minimum free squared Euclidean (MFSE) distance of the system, provided the code-bit-to-signal mapping is uniform The same algorithm applied to the modified error state diagram with branch labels e2 (X) can compute the average weight enumerating function of the system, provided the 11 code-bit-to-signal mapping is uniform
12 Uniform mapping Split the signal constellation in two subsets, Q(0) and Q(1) such that Q(i) consists of points with a label v with v (0) = i Let e,i2 (X) be the AEWE for e with respect to Q(i) A 1-1 mapping f: v s is uniform iff. e,02 (X) = e,12 (X) e 12
13 Uniform mapping: Example Q(0) and Q(1) isomorphic. One can be obtained from the other by isometric mapping. Necessary for the existence of a uniform mapping 13
14 Nonuniform mapping: Example No isometry between Q(0) and Q(1) 14
15 Nonuniform mapping: Example Q(0) and Q(1) isomorphic. One can be obtained from the other by isometric mapping. Necessary but not sufficient for the existence of a uniform mapping 15
16 Uniform mapping Lemma: Consider a (k+1,k) binary convolutional code whose output is blockwisely and uniformly mapped to a 2 k+1 - ary signal constellation. Then, for each binary error sequence e(d) in the error trellis, there exists a pair of sequences y(d) and y (D) such that l vl2 (e l ) = l 2 (e l ), where the summation is over the blocks where y(d) and y (D) differ Proof: Follows because the mapping is uniform Thus, the MFSE distance can be computed by a modified Viterbi algorithm on the error trellis, with the MEWEs as edge labels By similar reasoning, the average WEF can be computed by using a modified error state diagram with the AEWEs as 16 edge labels
17 Two commonly used mappings Gray mapping: The labels of two adjacent signal points will differ in only one position Used for uncoded modulation. Also used in coded modulation, as it is distance preserving in some cases, for example for QPSK Natural mapping: Signal points are labeled in ascending order (integerwise) Used for applications which need to be robust against carrier phase errors 17
18 Examples: QPSK ( min 2 = 2) 18
19 Using the error trellis to compute distance
20 Example: R = 2/3 with 8-PSK 20
21 Example: R = 2/3 with 8-PSK But uncoded QPSK has min 2 =
22 Example: R = 1/2 with 8-PSK Parallel branches
23 Example: R = 1/2 with 8-PSK Best possible
24 Initial rules for design of coded modulation MSE distance between parallel branches should be maximized Branches in the modified error trellis leaving and entering the same state should have the largest possible MSE distance 24
25 On uniform and nonuniform mappings For nonuniform mappings: Calculations on the error trellis will provide only a lower bound on the minimum distance (Example 18.5) More difficult to analyze (but the system as such may be as good as or better than one using a uniform mapping) Stricter condition: Geometric uniform (GU) mappings Even easier to analyze Most systems are not GU 25
ELEC3028 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 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 informationPolarization codes and the rate of polarization
Polarization codes and the rate of polarization Erdal Arıkan, Emre Telatar Bilkent U., EPFL Sept 10, 2008 Channel Polarization Given a binary input DMC W, i.i.d. uniformly distributed inputs (X 1,...,
More informationCoded Bidirectional Relaying in Wireless Networks
Coded Bidirectional Relaying in Wireless Networks Petar Popovski and Toshiaki Koike - Akino Abstract The communication strategies for coded bidirectional (two way) relaying emerge as a result of successful
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 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 informationVector Signal Analyzer FSQ-K70
Product brochure Version 02.00 Vector Signal Analyzer FSQ-K70 July 2004 Universal demodulation, analysis and documentation of digital radio signals For all major mobile radio communication standards: GSM
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 informationDesign of LDPC codes
Design of LDPC codes Codes from finite geometries Random codes: Determine the connections of the bipartite Tanner graph by using a (pseudo)random algorithm observing the degree distribution of the code
More informationClassification of Fingerprints. Sarat C. Dass Department of Statistics & Probability
Classification of Fingerprints Sarat C. Dass Department of Statistics & Probability Fingerprint Classification Fingerprint classification is a coarse level partitioning of a fingerprint database into smaller
More informationContents. A Error probability for PAM Signals in AWGN 17. B Error probability for PSK Signals in AWGN 18
Contents 5 Signal Constellations 3 5.1 Pulse-amplitude Modulation (PAM).................. 3 5.1.1 Performance of PAM in Additive White Gaussian Noise... 4 5.2 Phase-shift Keying............................
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 informationRADIO FREQUENCY INTERFERENCE AND CAPACITY REDUCTION IN DSL
RADIO FREQUENCY INTERFERENCE AND CAPACITY REDUCTION IN DSL Padmabala Venugopal, Michael J. Carter*, Scott A. Valcourt, InterOperability Laboratory, Technology Drive Suite, University of New Hampshire,
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 informationIEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 55, NO. 1, JANUARY 2007 341
IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 55, NO. 1, JANUARY 2007 341 Multinode Cooperative Communications in Wireless Networks Ahmed K. Sadek, Student Member, IEEE, Weifeng Su, Member, IEEE, and K.
More informationTime and Frequency Domain Equalization
Time and Frequency Domain Equalization Presented By: Khaled Shawky Hassan Under Supervision of: Prof. Werner Henkel Introduction to Equalization Non-ideal analog-media such as telephone cables and radio
More informationMeasurements on MPEG2 and DVB-T signals (1)
Measurements on MPEG2 and DVB-T signals (1) With the expansion of multi-frequency networks (MFNs) and single-frequency networks (SFNs) for DVB-T*, there is a growing demand for measuring instruments and
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 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 informationCoding 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 informationDigital Communications
Digital Communications Fourth Edition JOHN G. PROAKIS Department of Electrical and Computer Engineering Northeastern University Boston Burr Ridge, IL Dubuque, IA Madison, Wl New York San Francisco St.
More informationVector storage and access; algorithms in GIS. This is lecture 6
Vector storage and access; algorithms in GIS This is lecture 6 Vector data storage and access Vectors are built from points, line and areas. (x,y) Surface: (x,y,z) Vector data access Access to vector
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 informationMaximal Capacity Partial Response Signaling
Maximal Capacity Partial Response Signaling Fredrik Rusek and John B. Anderson Dept. of Information echnology Lund University, Lund, Sweden Email: {fredrikr,anderson}@it.lth.se Abstract In this paper we
More informationGambling and Data Compression
Gambling and Data Compression Gambling. Horse Race Definition The wealth relative S(X) = b(x)o(x) is the factor by which the gambler s wealth grows if horse X wins the race, where b(x) is the fraction
More informationMeasurements on DVB-S2 Transmitters
Measurements on DVB-S2 Transmitters Application Note Products: R&S FSQ R&S FSG R&S FSU R&S FSUP R&S FSMR R&S FSQ-K70 R&S FSQ-B72 R&S FSU-B73 This application note provides information about measurements
More informationOptimal Index Codes for a Class of Multicast Networks with Receiver Side Information
Optimal Index Codes for a Class of Multicast Networks with Receiver Side Information Lawrence Ong School of Electrical Engineering and Computer Science, The University of Newcastle, Australia Email: lawrence.ong@cantab.net
More informationSphere-Bound-Achieving Coset Codes and Multilevel Coset Codes
820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 46, NO 3, MAY 2000 Sphere-Bound-Achieving Coset Codes and Multilevel Coset Codes G David Forney, Jr, Fellow, IEEE, Mitchell D Trott, Member, IEEE, and Sae-Young
More informationLoad balancing in a heterogeneous computer system by self-organizing Kohonen network
Bull. Nov. Comp. Center, Comp. Science, 25 (2006), 69 74 c 2006 NCC Publisher Load balancing in a heterogeneous computer system by self-organizing Kohonen network Mikhail S. Tarkov, Yakov S. Bezrukov Abstract.
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 information1. (Ungraded) A noiseless 2-kHz channel is sampled every 5 ms. What is the maximum data rate?
Homework 2 Solution Guidelines CSC 401, Fall, 2011 1. (Ungraded) A noiseless 2-kHz channel is sampled every 5 ms. What is the maximum data rate? 1. In this problem, the channel being sampled gives us the
More informationOffline sorting buffers on Line
Offline sorting buffers on Line Rohit Khandekar 1 and Vinayaka Pandit 2 1 University of Waterloo, ON, Canada. email: rkhandekar@gmail.com 2 IBM India Research Lab, New Delhi. email: pvinayak@in.ibm.com
More informationRevision of Lecture Eighteen
Revision of Lecture Eighteen Previous lecture has discussed equalisation using Viterbi algorithm: Note similarity with channel decoding using maximum likelihood sequence estimation principle It also discusses
More informationLTE Multimedia Broadcast Multicast Services (MBMS)
LTE Multimedia Broadcast Multicast Services (MBMS) LTE is the technology of choice for mobile operators because it delivers significantly higher bandwidth with the lowest amount of spectral resources.
More informationNonlinear Multi-Error Correction Codes for Reliable NAND Flash Memories
1 Nonlinear Multi-Error Correction Codes for Reliable NAND Flash Memories Zhen Wang, Student Member, IEEE, Mark Karpovsky, Fellow, IEEE, and Ajay Joshi, Member, IEEE Abstract Multi-level cell (MLC NAND
More information3GPP Wireless Standard
3GPP Wireless Standard Shishir Pandey School of Technology and Computer Science TIFR, Mumbai April 10, 2009 Shishir Pandey (TIFR) 3GPP Wireless Standard April 10, 2009 1 / 23 3GPP Overview 3GPP : 3rd Generation
More informationCMPSCI611: Approximating MAX-CUT Lecture 20
CMPSCI611: Approximating MAX-CUT Lecture 20 For the next two lectures we ll be seeing examples of approximation algorithms for interesting NP-hard problems. Today we consider MAX-CUT, which we proved to
More informationINTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena *1, K. Upendra Chowdary 2
ISSN 2277-2685 IJESR/June 2014/ Vol-4/Issue-6/333-337 Y. Naveena et al./ International Journal of Engineering & Science Research INTER CARRIER INTERFERENCE CANCELLATION IN HIGH SPEED OFDM SYSTEM Y. Naveena
More information2 SYSTEM DESCRIPTION TECHNIQUES
2 SYSTEM DESCRIPTION TECHNIQUES 2.1 INTRODUCTION Graphical representation of any process is always better and more meaningful than its representation in words. Moreover, it is very difficult to arrange
More informationCOMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH. 1. Introduction
COMBINATORIAL PROPERTIES OF THE HIGMAN-SIMS GRAPH ZACHARY ABEL 1. Introduction In this survey we discuss properties of the Higman-Sims graph, which has 100 vertices, 1100 edges, and is 22 regular. In fact
More informationISI Mitigation in Image Data for Wireless Wideband Communications Receivers using Adjustment of Estimated Flat Fading Errors
International Journal of Engineering and Management Research, Volume-3, Issue-3, June 2013 ISSN No.: 2250-0758 Pages: 24-29 www.ijemr.net ISI Mitigation in Image Data for Wireless Wideband Communications
More informationGRAPH THEORY LECTURE 4: TREES
GRAPH THEORY LECTURE 4: TREES Abstract. 3.1 presents some standard characterizations and properties of trees. 3.2 presents several different types of trees. 3.7 develops a counting method based on a bijection
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 informationReliability Level List Based Direct Target Codeword Identification Algorithm for Binary BCH Codes
Reliability Level List Based Direct Target Codeword Identification Algorithm for Binary BCH Codes B.YAMUNA, T.R.PADMANABHAN 2 Department of ECE, 2 Department of IT Amrita Vishwa Vidyapeetham. Amrita School
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 information= 2 + 1 2 2 = 3 4, Now assume that P (k) is true for some fixed k 2. This means that
Instructions. Answer each of the questions on your own paper, and be sure to show your work so that partial credit can be adequately assessed. Credit will not be given for answers (even correct ones) without
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 informationComputer Science and Engineering Department, Wright State University, Dayton, OH 45435, USA 2
Hindawi Publishing Corporation EURASIP Journal on Advances in Signal Processing Volume 2007, Article ID 86915, 12 pages doi:10.1155/2007/86915 Research Article Cross-Layer Design for Video Transmission
More informationADSL part 2, Cable Internet, Cellular
ADSL part 2, Cable Internet, Cellular 20 June 2016 Lecture 12 20 June 2016 SE 428: Advanced Computer Networks 1 Topics for Today ADSL Cable Internet Cellular Radio Networks 20 June 2016 SE 428: Advanced
More informationDATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS
DATA MINING CLUSTER ANALYSIS: BASIC CONCEPTS 1 AND ALGORITHMS Chiara Renso KDD-LAB ISTI- CNR, Pisa, Italy WHAT IS CLUSTER ANALYSIS? Finding groups of objects such that the objects in a group will be similar
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 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 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 informationQAM Demodulation. Performance Conclusion. o o o o o. (Nyquist shaping, Clock & Carrier Recovery, AGC, Adaptive Equaliser) o o. Wireless Communications
0 QAM Demodulation o o o o o Application area What is QAM? What are QAM Demodulation Functions? General block diagram of QAM demodulator Explanation of the main function (Nyquist shaping, Clock & Carrier
More informationEvolution of the Air Interface From 2G Through 4G and Beyond
Evolution of the Air Interface From 2G Through 4G and Beyond Presentation to IEEE Ottawa Section / Alliance of IEEE Consultants Network (AICN) - 2nd May 2012 Frank Rayal BLiNQ Networks/ Telesystem Innovations
More informationSystem Interconnect Architectures. Goals and Analysis. Network Properties and Routing. Terminology - 2. Terminology - 1
System Interconnect Architectures CSCI 8150 Advanced Computer Architecture Hwang, Chapter 2 Program and Network Properties 2.4 System Interconnect Architectures Direct networks for static connections Indirect
More informationEuclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions Chaojun Li. Advised by: Dave Mount. May 22, 2014
Euclidean Minimum Spanning Trees Based on Well Separated Pair Decompositions Chaojun Li Advised by: Dave Mount May 22, 2014 1 INTRODUCTION In this report we consider the implementation of an efficient
More information5 Capacity of wireless channels
CHAPTER 5 Capacity of wireless channels In the previous two chapters, we studied specific techniques for communication over wireless channels. In particular, Chapter 3 is centered on the point-to-point
More informationComputational Geometry. Lecture 1: Introduction and Convex Hulls
Lecture 1: Introduction and convex hulls 1 Geometry: points, lines,... Plane (two-dimensional), R 2 Space (three-dimensional), R 3 Space (higher-dimensional), R d A point in the plane, 3-dimensional space,
More informationDigital transmission 10.1 Introduction
CHAPTER 10 Contents 10.1 Introduction 10.2 DVB satellite 10.3 DVB cable 10.4 DVB terrestrial 10.5 Summary and conclusions Digital transmission 10.1 Introduction The introduction of digital transmission
More information17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function
17. Inner product spaces Definition 17.1. Let V be a real vector space. An inner product on V is a function, : V V R, which is symmetric, that is u, v = v, u. bilinear, that is linear (in both factors):
More informationBit Error Rate Performance Analysis on Modulation Techniques of Wideband Code Division Multiple Access
22 Bit Error Rate Performance Analysis on Modulation Techniques of Wideband Code Division Multiple Access M. A. Masud, M. Samsuzzaman, M. A.Rahman Abstract - In the beginning of 21 st century there has
More informationPlanning for 802.11ac Adoption with Ekahau Site Survey 6.0
Planning for 802.11ac Adoption with Ekahau Site Survey 6.0 1 P a g e w w w. e k a h a u. c o m / e s s Introduction to 802.11ac The emerging next generation Wi-Fi standard IEEE 802.11ac aims to break the
More informationCourse Curriculum for Master Degree in Electrical Engineering/Wireless Communications
Course Curriculum for Master Degree in Electrical Engineering/Wireless Communications The Master Degree in Electrical Engineering/Wireless Communications, is awarded by the Faculty of Graduate Studies
More informationThe Evolution of 3G CDMA Wireless Networks. David W. Paranchych IEEE CVT Luncheon January 21, 2003
The Evolution of 3G CDMA Wireless Networks David W. Paranchych IEEE CVT Luncheon January 21, 2003 Outline Past: cdma2000 1xRTT Present: 1xEV-DO What is it? How does it work? How well does it work? What
More informationUniversity of Manchester School of Computer Science CS3282: Digital Communications '06 Section 9: Multi-level digital modulation & demodulation.
CS3282 Digital Comms 9.1 2 May 06 / BMGC University of Manchester School of Computer Science CS3282: Digital Communications '06 Section 9: Multi-level digital modulation & demodulation. 9.1. ntroduction:
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 informationThird Southern African Regional ACM Collegiate Programming Competition. Sponsored by IBM. Problem Set
Problem Set Problem 1 Red Balloon Stockbroker Grapevine Stockbrokers are known to overreact to rumours. You have been contracted to develop a method of spreading disinformation amongst the stockbrokers
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 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 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 informationLoad Balancing between Computing Clusters
Load Balancing between Computing Clusters Siu-Cheung Chau Dept. of Physics and Computing, Wilfrid Laurier University, Waterloo, Ontario, Canada, NL 3C5 e-mail: schau@wlu.ca Ada Wai-Chee Fu Dept. of Computer
More informationNext Generation of High Speed. Modems8
Next Generation of High Speed Modems High Speed Modems. 1 Traditional Modems Assume both ends have Analog connection Analog signals are converted to Digital and back again. Limits transmission speed to
More informationConnectivity and cuts
Math 104, Graph Theory February 19, 2013 Measure of connectivity How connected are each of these graphs? > increasing connectivity > I G 1 is a tree, so it is a connected graph w/minimum # of edges. Every
More informationA Practical Scheme for Wireless Network Operation
A Practical Scheme for Wireless Network Operation Radhika Gowaikar, Amir F. Dana, Babak Hassibi, Michelle Effros June 21, 2004 Abstract In many problems in wireline networks, it is known that achieving
More informationDSAM Digital Quality Index (DQI) A New Technique for Assessing Downstream Digital Services
Application Note DSAM Digital Quality Index (DQI) A New Technique for Assessing Downstream Digital Services Overview As cable operators move to digital simulcast and all digital networks, the majority
More informationIntroduction to Algebraic Coding Theory
Introduction to Algebraic Coding Theory Supplementary material for Math 336 Cornell University Sarah A. Spence Contents 1 Introduction 1 2 Basics 2 2.1 Important code parameters..................... 4
More informationThe Effect of Network Cabling on Bit Error Rate Performance. By Paul Kish NORDX/CDT
The Effect of Network Cabling on Bit Error Rate Performance By Paul Kish NORDX/CDT Table of Contents Introduction... 2 Probability of Causing Errors... 3 Noise Sources Contributing to Errors... 4 Bit Error
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 informationNetwork Coding for Security and Error Correction
Network Coding for Security and Error Correction NGAI, Chi Kin A Thesis Submitted in Partial Fulfilment of the Requirements for the Degree of Doctor of Philosophy in Information Engineering c The Chinese
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 informationLDPC Codes: An Introduction
LDPC Codes: An Introduction Amin Shokrollahi Digital Fountain, Inc. 39141 Civic Center Drive, Fremont, CA 94538 amin@digitalfountain.com April 2, 2003 Abstract LDPC codes are one of the hottest topics
More information