ECEN 5682 Theory and Practice of Error Control Codes
|
|
- Cornelius Cunningham
- 7 years ago
- Views:
Transcription
1 ECEN 5682 Theory and Practice of Error Control Codes Convolutional Code Performance University of Colorado Spring 2007
2 Definition: A convolutional encoder which maps one or more data sequences of infinite weight into code sequences of finite weight is called a catastrophic encoder. Example: Encoder #5. The binary R = 1/2, K = 3 convolutional encoder with transfer function matrix G(D) = [ 1 + D 1 + D 2], has the encoder state diagram shown in Figure 15, with states S 0 = 00, S 1 = 10, S 2 = 01, and S 3 = 11.
3 S 1 1/11 1/01 0/00 S 0 S 3 1/00 1/10 0/10 0/01 0/11 S 2 Fig.15 Encoder State Diagram for Catastrophic R = 1/2, K = 3 Encoder
4 S S 2 S 1 S Fig.16 A Detour of Weight w =7andi= 3, Starting at Time t =0
5 Definition: The complete weight distribution {A(w, i, l)} of a convolutional code is defined as the number of detours (or codewords), beginning at time 0 in the all-zero state S 0 of the encoder, returning again for the first time to S 0 after l time units, and having code (Hamming) weight w and data (Hamming) weight i. Definition: The extended weight distribution {A(w, i)} of a convolutional code is defined by A(w, i) = A(w, i, l). l=1 That is, {A(w, i)} is the number of detours (starting at time 0) from the all-zero path with code sequence (Hamming) weight w and corresponding data sequence (Hamming) weight i.
6 Definition: The weight distribution {A w } of a convolutional code is defined by A w = A(w, i). i=1 That is, {A w } is the number of detours (starting at time 0) from the all-zero path with code sequence (Hamming) weight w. Theorem: The probability of an error event (or decoding error) P E for a convolutional code with weight distribution {A w }, decoded by a ML decoder, at any given time t (measured in frames) is upper bounded by P E A w P w (E), w=d free where P w (E) = P{ML decoder makes detour with weight w}.
7 Theorem: On a memoryless BSC with transition probability ɛ < 0.5, the probability of error P d (E) between two detours or codewords distance d apart is given by 8 >< P d (E) = >: dx e=(d+1)/2 1 2 d d/2!! d e ɛ e (1 ɛ) d e, d odd, ɛ d/2 (1 ɛ) d/2 + dx e=d/2+1! d ɛ e (1 ɛ) d e, d even. e Proof: Under the Hamming distance measure, an error between two binary codewords distance d apart is made if more than d/2 of the bits in which the codewords differ are in error. If d is even and exactly d/2 bits are in error, then an error is made with probability 1/2. QED
8 Note: A somewhat simpler but less tight bound is obtained by dropping the factor of 1/2 in the first term for d even as follows P d (E) d e= d/2 ( ) d ɛ e (1 ɛ) d e. e A much simpler, but often also much more loose bound is the Bhattacharyya bound P d (E) 1 2 [ 4ɛ (1 ɛ) ] d/2.
9 Probability of Symbol Error. Suppose now that A w = P i=1 A(w, i) is substituted in the bound for P E. Then X X P E A(w, i) P w (E). w=d i=1 free Multiplying A(w, i) by i and summing over all i then yields the total number of data symbol errors that result from all detours of weight w as P i=1 i A(w, i). Dividing by k, the number of data symbols per frame, thus leads to the following theorem. Theorem: The probability of a symbol error P s (E) at any given time t (measured in frames) for a convolutional code with rate R = k/n and extended weight distribution {A(w, i)}, when decoded by a ML decoder, is upper bounded by P s (E) 1 i A(w, i) P w (E), k w=d free i=1 where P w (E) is the probability of error between the all-zero path and a detour of weight w.
10 The graph on the next slide shows different bounds for the probability of a bit error on a BSC for a binary rate R = 1/2, K = 3 convolutional encoder with transfer function matrix G(D) = [ 1 + D D + D 2].
11 10 0 Binary R=1/2, K=3, d free =5, Convolutional Code, Bit Error Probability P b (E) P b (E) BSC P b (E) BSC Bhattcharyya P b (E) AWGN soft log 10 (ε)
12 Upper Bounds on P b (E) for Convolutional Codes on BSC (Hard Decisions) 10 0 R=1/2,K=3,d free = R=2/3,K=3,d free =5 R=3/4,K=3,d free =5 R=1/2,K=5,d free = R=1/2,K=7,d free = P b (E) log 10 (ε) for BSC
13
14 Transmission Over AWGN Channel The following figure shows a one-shot model for transmitting a data symbol with value a 0 over an additive Gaussian noise (AGN) waveform channel using pulse amplitude modulation (PAM) of a pulse p(t) and a matched filter (MF) receiver. The main reason for using a one-shot model for performance evaluation with respect to channel noise is that it avoids intersymbol interference (ISI). Noise n(t), S n (f) s(t) =a 0 p(t) + r(t) Filter b(t) h R (t) b 0 t =0 } {{ } } {{ } Channel Receiver
15 If the noise is white with power spectral density (PSD) S n (f ) = N 0 /2 for all f, the channel model is called additive white Gaussian noise (AWGN) model. In this case the matched filter (which maximizes the SNR at its output at t = 0) is h R (t) = p ( t) p(µ) 2 dµ H R (f ) = P (f ) P(ν) 2 dν, where denotes complex conjugation. If the PAM pulse p(t) is normalized so that E p = p(µ) 2 dµ = 1 then the symbol energy at the input of the MF is E s = E [ s(µ) 2 dµ ] = E [ a 0 2], where the expectation is necessary since a 0 is a random variable.
16 When the AWGN model with S n (f ) = N 0 /2 is used and a 0 = α is transmitted, the received symbol b 0 at the sampler after the output of the MF is a Gaussian random variable with mean α and variance σ 2 b = N 0/2. For antipodal binary signaling (e.g., using BPSK) a 0 { E s, + E s } where E s is the (average) energy per symbol. Thus, b 0 is characterized by the conditional pdf s f b0 (β a 0 = E s ) = e (β+ Es) 2 /N 0, πn0 and f b0 (β a 0 =+ E s ) = e (β Es) 2 /N 0. πn0 These pdf s are shown graphically on the following slide.
17 â 0 = E s â 0 =+ E s f b0 (β a 0 = E s ) f b0 (β a 0 =+ E s ) E s 0 + E s β 2 E s If the two values of a 0 are equally likely or if a ML decoding rule is used, then the (hard) decision threshold per symbol is to decide a 0 = + E s if β > 0 and a 0 = E s otherwise.
18 The probability of a symbol error when hard decisions are used is P(E A 0 = E s ) = 1 πn0 0 e (β+ E s) 2 /N 0 dβ = 1 2 erfc ( E s N 0 ), where erfc(x) = 2 x e γ2 dγ e x2. Because of the symmetry of antipodal signaling, the same result is obtained for P(E a 0 = + E s ) and thus a BSC derived from an AWGN channel used with antipodal signaling has transition probability π ɛ = 1 2 erfc ( E s N 0 ), where E s is the energy received per transmitted symbol.
19 To make a fair comparison in terms of signal-to-noise ratio (SNR) of the transmitted information symbols between coded and uncoded systems, the energy per code symbol of the coded system needs to be scaled by the rate R of the code. Thus, when hard decisions and coding are used in a binary system, the transition probability of the BSC model becomes ɛ c = 1 2 erfc ( R E s N 0 ), where R = k/n is the rate of the code. The figure on the next slide compares P b (E) versus E b /N 0 for an uncoded and a coded binary system. The coded system uses a R = 1/2 K = 3 convolutional encoder with G(D) = [ 1 + D D + D 2].
20 10 2 Binary R=1/2, K=3, d free =5, Convolutional Code, Hard decisions AWGN channel 10 0 P b (E) uncoded P b (E) union bound P b (E) Bhattacharyya P b (E) E /N [db], E : info bit energy b 0 b
21 Definition: Coding Gain. Coding gain is defined as the reduction in E s /N 0 permissible for a coded communication system to obtain the same probability of error (P s (E) or P B (E) as an uncoded system, both using the same average energy per transmitted information symbol. Definition: Coding Threshold. The value of E s /N 0 (where E s is the energy per transmitted information symbol) for which the coding gain becomes zero is called the coding threshold. The graphs on the following slide show P b (E) (computed using the union bound) versus E b /N 0 for a number of different binary convolutional encoders.
22 10 0 Upper Bounds on P b (E) for Convolutional Codes on AWGN Channel, Hard Decisions P b (E) Uncoded R=1/2,K=3,d free =5 R=2/3,K=3,d free =5 R=3/4,K=3,d free =5 R=1/2,K=5,d free =7 R=1/2,K=7,d free = E /N [db], E : info bit energy b 0 b
23 Soft Decisions and AWGN Channel Assuming a memoryless channel model used without feedback, the ML decoding rule after the MF and the sampler is: Output code sequence estimate ĉ = c i iff i maximizes f b (β a=c i ) = N 1 j=0 f bj (β j a j =c ij ), over all code sequences c i = (c i0, c i1, c i2,...) for i = 0, 1, 2,.... If the mapping 0 1 and 1 +1 is used so that c ij { 1, +1} then f bj (β j a j =c ij ) can be written as f bj (β j a j =c ij ) = e (β j c ij Es) 2 /N 0. πn0
24 Taking (natural) logarithms and defining v j = β j / E s yields N 1 ln f b (β a=c i ) = ln j=0 N 1 f bj (β j a j =c ij ) = N 1 j=0 ln f bj (β j a j =c ij ) (β j c ij Es ) 2 = N N 0 2 ln(πn 0) = E s N 0 = 2E s N 0 j=0 N 1 j=0 N 1 (v 2 j 2 v j c ij + c 2 ij) N 2 ln(πn 0) v j c ij j=0 N 1 = K 1 v j c ij K 2, j=0 ( β 2 + NE s + N ) N 0 2 ln(πn 0) where K 1 and K 2 are constants independent of the codeword c i and thus irrelevant for ML decoding.
25 Example: Suppose the convolutional encoder with G(D) = [ D ] is used and the received data is v = -0.4, -1.7, 0.1, 0.3, -1.1, 1.2, 1.2, 0.0, 0.3, 0.2, -0.2, 0.7,...
26 Soft Decisions versus Hard Decisions To compare the performance of coded binary systems on a AWGN channel when the decoder performs either hard or soft decisions, the energy E c per coded bit is fixed and P b (E) is plotted versus ɛ of the hard decision BSC model where ɛ = 1 2 erfc( E c /N 0 ) as before. For soft decisions the expression P w (E) = 1 2 erfc ( w E c N 0 ) is used for the probability that the ML decoder makes a detour with weight w from the correct path. Thus, for soft decisions with fixed SNR per code symbol P b (E) 1 2k Examples are shown on the next slide. ( w E ) c D w erfc. N 0 w=d free
27 Upper Bounds on P b (E) for Convolutional Codes with Soft Decisons (Dashed: Hard Decisions) 10 0 R=1/2,K=3,d free =5 R=2/3,K=3,d free =5 R=3/4,K=3,d free =5 R=1/2,K=5,d free =7 R=1/2,K=7,d free = P b (E) log 10 (ε) for BSC
28 Coding Gain for Soft Decisions To compare the performance of uncoded and coded binary systems with soft decisions on a AWGN channel, the energy E b per information bit is fixed and P b (E) is plotted versus the signal-to-noise ratio (SNR) E b /N 0. For an uncoded system P b (E) = 1 2 erfc ( E b N 0 ), (uncoded). For a coded system with soft decision ML decoding on a AWGN channel P b (E) 1 ( wr E ) b D w erfc, 2k N 0 w=d free where R = k/n is the rate of the code. Examples are shown in the graph on the next slide.
29 10 0 Upper Bounds on P b (E) for Convolutional Codes on AWGN Channel, Soft Decisions P b (E) Uncoded R=1/2,K=3,d free =5 R=2/3,K=3,d free =5 R=3/4,K=3,d free =5 R=1/2,K=5,d free =7 R=1/2,K=7,d free = E /N [db], E : info bit energy b 0 b
Coding 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 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 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 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 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 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 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 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 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 informationComparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks
Comparison of Network Coding and Non-Network Coding Schemes for Multi-hop Wireless Networks Jia-Qi Jin, Tracey Ho California Institute of Technology Pasadena, CA Email: {jin,tho}@caltech.edu Harish Viswanathan
More informationDigital Baseband Modulation
Digital Baseband Modulation Later Outline Baseband & Bandpass Waveforms Baseband & Bandpass Waveforms, Modulation A Communication System Dig. Baseband Modulators (Line Coders) Sequence of bits are modulated
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 informationSignal Detection C H A P T E R 14 14.1 SIGNAL DETECTION AS HYPOTHESIS TESTING
C H A P T E R 4 Signal Detection 4. SIGNAL DETECTION AS HYPOTHESIS TESTING In Chapter 3 we considered hypothesis testing in the context of random variables. The detector resulting in the minimum probability
More information5 Signal Design for Bandlimited Channels
225 5 Signal Design for Bandlimited Channels So far, we have not imposed any bandwidth constraints on the transmitted passband signal, or equivalently, on the transmitted baseband signal s b (t) I[k]g
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 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 informationNRZ Bandwidth - HF Cutoff vs. SNR
Application Note: HFAN-09.0. Rev.2; 04/08 NRZ Bandwidth - HF Cutoff vs. SNR Functional Diagrams Pin Configurations appear at end of data sheet. Functional Diagrams continued at end of data sheet. UCSP
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 informationDepartment of Electrical and Computer Engineering Ben-Gurion University of the Negev. LAB 1 - Introduction to USRP
Department of Electrical and Computer Engineering Ben-Gurion University of the Negev LAB 1 - Introduction to USRP - 1-1 Introduction In this lab you will use software reconfigurable RF hardware from National
More informationTCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS
TCOM 370 NOTES 99-4 BANDWIDTH, FREQUENCY RESPONSE, AND CAPACITY OF COMMUNICATION LINKS 1. Bandwidth: The bandwidth of a communication link, or in general any system, was loosely defined as the width of
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 informationExample/ an analog signal f ( t) ) is sample by f s = 5000 Hz draw the sampling signal spectrum. Calculate min. sampling frequency.
1 2 3 4 Example/ an analog signal f ( t) = 1+ cos(4000πt ) is sample by f s = 5000 Hz draw the sampling signal spectrum. Calculate min. sampling frequency. Sol/ H(f) -7KHz -5KHz -3KHz -2KHz 0 2KHz 3KHz
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 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 informationImplementation of Digital Signal Processing: Some Background on GFSK Modulation
Implementation of Digital Signal Processing: Some Background on GFSK Modulation Sabih H. Gerez University of Twente, Department of Electrical Engineering s.h.gerez@utwente.nl Version 4 (February 7, 2013)
More informationDigital Transmission of Analog Data: PCM and Delta Modulation
Digital Transmission of Analog Data: PCM and Delta Modulation Required reading: Garcia 3.3.2 and 3.3.3 CSE 323, Fall 200 Instructor: N. Vlajic Digital Transmission of Analog Data 2 Digitization process
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 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 informationT = 1 f. Phase. Measure of relative position in time within a single period of a signal For a periodic signal f(t), phase is fractional part t p
Data Transmission Concepts and terminology Transmission terminology Transmission from transmitter to receiver goes over some transmission medium using electromagnetic waves Guided media. Waves are guided
More informationCapacity of the Multiple Access Channel in Energy Harvesting Wireless Networks
Capacity of the Multiple Access Channel in Energy Harvesting Wireless Networks R.A. Raghuvir, Dinesh Rajan and M.D. Srinath Department of Electrical Engineering Southern Methodist University Dallas, TX
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 informationSolutions to Exam in Speech Signal Processing EN2300
Solutions to Exam in Speech Signal Processing EN23 Date: Thursday, Dec 2, 8: 3: Place: Allowed: Grades: Language: Solutions: Q34, Q36 Beta Math Handbook (or corresponding), calculator with empty memory.
More informationDigital Transmission (Line Coding)
Digital Transmission (Line Coding) Pulse Transmission Source Multiplexer Line Coder Line Coding: Output of the multiplexer (TDM) is coded into electrical pulses or waveforms for the purpose of transmission
More informationDiversity and Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 5, MAY 2003 1073 Diversity Multiplexing: A Fundamental Tradeoff in Multiple-Antenna Channels Lizhong Zheng, Member, IEEE, David N C Tse, Member, IEEE
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 information%Part of Telecommunication simulations course, Spring 2006 %Harri Saarnisaari, CWC
%Part of Telecommunication simulations course, Spring 2006 %Harri Saarnisaari, CWC %We simulate uncoded BER of BPSK modulated data as a function of SNR %-in an AWGN channel %-in a Rayleigh fading channel
More informationA WEB BASED TRAINING MODULE FOR TEACHING DIGITAL COMMUNICATIONS
A WEB BASED TRAINING MODULE FOR TEACHING DIGITAL COMMUNICATIONS Ali Kara 1, Cihangir Erdem 1, Mehmet Efe Ozbek 1, Nergiz Cagiltay 2, Elif Aydin 1 (1) Department of Electrical and Electronics Engineering,
More informationSignal Detection. Outline. Detection Theory. Example Applications of Detection Theory
Outline Signal Detection M. Sami Fadali Professor of lectrical ngineering University of Nevada, Reno Hypothesis testing. Neyman-Pearson (NP) detector for a known signal in white Gaussian noise (WGN). Matched
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 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 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 informationProbability and Random Variables. Generation of random variables (r.v.)
Probability and Random Variables Method for generating random variables with a specified probability distribution function. Gaussian And Markov Processes Characterization of Stationary Random Process Linearly
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 informationCommunication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 48, NO. 2, FEBRUARY 2002 359 Communication on the Grassmann Manifold: A Geometric Approach to the Noncoherent Multiple-Antenna Channel Lizhong Zheng, Student
More information8 MIMO II: capacity and multiplexing
CHAPTER 8 MIMO II: capacity and multiplexing architectures In this chapter, we will look at the capacity of MIMO fading channels and discuss transceiver architectures that extract the promised multiplexing
More informationPrinciples of Digital Communication
Principles of Digital Communication Robert G. Gallager January 5, 2008 ii Preface: introduction and objectives The digital communication industry is an enormous and rapidly growing industry, roughly comparable
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 informationELE745 Assignment and Lab Manual
ELE745 Assignment and Lab Manual August 22, 2010 CONTENTS 1. Assignment 1........................................ 1 1.1 Assignment 1 Problems................................ 1 1.2 Assignment 1 Solutions................................
More informationJitter Measurements in Serial Data Signals
Jitter Measurements in Serial Data Signals Michael Schnecker, Product Manager LeCroy Corporation Introduction The increasing speed of serial data transmission systems places greater importance on measuring
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 informationModule 13 : Measurements on Fiber Optic Systems
Module 13 : Measurements on Fiber Optic Systems Lecture : Measurements on Fiber Optic Systems Objectives In this lecture you will learn the following Measurements on Fiber Optic Systems Attenuation (Loss)
More informationHD Radio FM Transmission System Specifications Rev. F August 24, 2011
HD Radio FM Transmission System Specifications Rev. F August 24, 2011 SY_SSS_1026s TRADEMARKS HD Radio and the HD, HD Radio, and Arc logos are proprietary trademarks of ibiquity Digital Corporation. ibiquity,
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 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 informationCODING THEORY a first course. Henk C.A. van Tilborg
CODING THEORY a first course Henk C.A. van Tilborg Contents Contents Preface i iv 1 A communication system 1 1.1 Introduction 1 1.2 The channel 1 1.3 Shannon theory and codes 3 1.4 Problems 7 2 Linear
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 informationRECOMMENDATION ITU-R BO.786 *
Rec. ITU-R BO.786 RECOMMENDATION ITU-R BO.786 * MUSE ** system for HDTV broadcasting-satellite services (Question ITU-R /) (992) The ITU Radiocommunication Assembly, considering a) that the MUSE system
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 informationVoice---is analog in character and moves in the form of waves. 3-important wave-characteristics:
Voice Transmission --Basic Concepts-- Voice---is analog in character and moves in the form of waves. 3-important wave-characteristics: Amplitude Frequency Phase Voice Digitization in the POTS Traditional
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 informationHow To Understand The Theory Of Time Division Duplexing
Multiple Access Techniques Dr. Francis LAU Dr. Francis CM Lau, Associate Professor, EIE, PolyU Content Introduction Frequency Division Multiple Access Time Division Multiple Access Code Division Multiple
More informationHigher National Unit Specification. General information for centres. Transmission of Measurement Signals. Unit code: DX4T 35
Higher National Unit Specification General information for centres Unit title: Transmission of Measurement Signals Unit code: DX4T 35 Unit purpose: This Unit is designed to enable candidates to gain knowledge
More informationThis article has been accepted for inclusion in a future issue of this journal. Content is final as presented, with the exception of pagination.
IEEE/ACM TRANSACTIONS ON NETWORKING 1 A Greedy Link Scheduler for Wireless Networks With Gaussian Multiple-Access and Broadcast Channels Arun Sridharan, Student Member, IEEE, C Emre Koksal, Member, IEEE,
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 information(2) (3) (4) (5) 3 J. M. Whittaker, Interpolatory Function Theory, Cambridge Tracts
Communication in the Presence of Noise CLAUDE E. SHANNON, MEMBER, IRE Classic Paper A method is developed for representing any communication system geometrically. Messages and the corresponding signals
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 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 informationDiversity and Degrees of Freedom in Wireless Communications
1 Diversity and Degrees of Freedom in Wireless Communications Mahesh Godavarti Altra Broadband Inc., godavarti@altrabroadband.com Alfred O. Hero-III Dept. of EECS, University of Michigan hero@eecs.umich.edu
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 informationBroadband Networks. Prof. Dr. Abhay Karandikar. Electrical Engineering Department. Indian Institute of Technology, Bombay. Lecture - 29.
Broadband Networks Prof. Dr. Abhay Karandikar Electrical Engineering Department Indian Institute of Technology, Bombay Lecture - 29 Voice over IP So, today we will discuss about voice over IP and internet
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 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 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 informationLecture 8: Signal Detection and Noise Assumption
ECE 83 Fall Statistical Signal Processing instructor: R. Nowak, scribe: Feng Ju Lecture 8: Signal Detection and Noise Assumption Signal Detection : X = W H : X = S + W where W N(, σ I n n and S = [s, s,...,
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 informationMIMO CHANNEL CAPACITY
MIMO CHANNEL CAPACITY Ochi Laboratory Nguyen Dang Khoa (D1) 1 Contents Introduction Review of information theory Fixed MIMO channel Fading MIMO channel Summary and Conclusions 2 1. Introduction The use
More informationSampling Theorem Notes. Recall: That a time sampled signal is like taking a snap shot or picture of signal periodically.
Sampling Theorem We will show that a band limited signal can be reconstructed exactly from its discrete time samples. Recall: That a time sampled signal is like taking a snap shot or picture of signal
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 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 informationTIMING recovery is one of the critical functions for reliable
3752 IEEE TRANSACTIONS ON MAGNETICS, VOL. 42, NO. 11, NOVEMBER 2006 Data-Aided Timing Recovery for Recording Channels With Data-Dependent Noise J. Riani 1, J. W. M. Bergmans 1, S. van Beneden 1, and A.
More informationLimits. Graphical Limits Let be a function defined on the interval [-6,11] whose graph is given as:
Limits Limits: Graphical Solutions Graphical Limits Let be a function defined on the interval [-6,11] whose graph is given as: The limits are defined as the value that the function approaches as it goes
More informationRadar Systems Engineering Lecture 6 Detection of Signals in Noise
Radar Systems Engineering Lecture 6 Detection of Signals in Noise Dr. Robert M. O Donnell Guest Lecturer Radar Systems Course 1 Detection 1/1/010 Block Diagram of Radar System Target Radar Cross Section
More informationInformation Theory and Coding SYLLABUS
SYLLABUS Subject Code : IA Marks : 25 No. of Lecture Hrs/Week : 04 Exam Hours : 03 Total no. of Lecture Hrs. : 52 Exam Marks : 00 PART - A Unit : Information Theory: Introduction, Measure of information,
More information954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005
954 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 3, MARCH 2005 Using Linear Programming to Decode Binary Linear Codes Jon Feldman, Martin J. Wainwright, Member, IEEE, and David R. Karger, Associate
More information8. Cellular Systems. 1. Bell System Technical Journal, Vol. 58, no. 1, Jan 1979. 2. R. Steele, Mobile Communications, Pentech House, 1992.
8. Cellular Systems References 1. Bell System Technical Journal, Vol. 58, no. 1, Jan 1979. 2. R. Steele, Mobile Communications, Pentech House, 1992. 3. G. Calhoun, Digital Cellular Radio, Artech House,
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 informationBasics of Floating-Point Quantization
Chapter 2 Basics of Floating-Point Quantization Representation of physical quantities in terms of floating-point numbers allows one to cover a very wide dynamic range with a relatively small number of
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 informationThe Degrees of Freedom of Compute-and-Forward
The Degrees of Freedom of Compute-and-Forward Urs Niesen Jointly with Phil Whiting Bell Labs, Alcatel-Lucent Problem Setting m 1 Encoder m 2 Encoder K transmitters, messages m 1,...,m K, power constraint
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 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 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 informationRANDOM VIBRATION AN OVERVIEW by Barry Controls, Hopkinton, MA
RANDOM VIBRATION AN OVERVIEW by Barry Controls, Hopkinton, MA ABSTRACT Random vibration is becoming increasingly recognized as the most realistic method of simulating the dynamic environment of military
More informationReview Horse Race Gambling and Side Information Dependent horse races and the entropy rate. Gambling. Besma Smida. ES250: Lecture 9.
Gambling Besma Smida ES250: Lecture 9 Fall 2008-09 B. Smida (ES250) Gambling Fall 2008-09 1 / 23 Today s outline Review of Huffman Code and Arithmetic Coding Horse Race Gambling and Side Information Dependent
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 informationThe Goldberg Rao Algorithm for the Maximum Flow Problem
The Goldberg Rao Algorithm for the Maximum Flow Problem COS 528 class notes October 18, 2006 Scribe: Dávid Papp Main idea: use of the blocking flow paradigm to achieve essentially O(min{m 2/3, n 1/2 }
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 informationE190Q Lecture 5 Autonomous Robot Navigation
E190Q Lecture 5 Autonomous Robot Navigation Instructor: Chris Clark Semester: Spring 2014 1 Figures courtesy of Siegwart & Nourbakhsh Control Structures Planning Based Control Prior Knowledge Operator
More informationRate Constraints for Packet Video Transmission. 3.2 Comparison of VBR and CBR video transmission : : : : : : : : : : : 79
75 Chapter 3 Rate Constraints for Packet Video Transmission Based on Joint SourceèNetwork Criteria 1 Contents 3.1 Introduction : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : : 75 3.2 Comparison
More informationReed-Solomon Codes. by Bernard Sklar
Reed-Solomon Codes by Bernard Sklar Introduction In 1960, Irving Reed and Gus Solomon published a paper in the Journal of the Society for Industrial and Applied Mathematics [1]. This paper described a
More information