Computing Probability of Symbol Error
|
|
- Henry Carson
- 5 years ago
- Views:
Transcription
1 Computing Probability of Symbol Error I When decision boundaries intersect at right angles, then it is possible to compute the error probability exactly in closed form. I The result will be in terms of the Q-function. I This happens whenever the signal points form a rectangular grid in signal space. I Examples: QPSK and 16-QAM I When decision regions are not rectangular, then closed form expressions are not available. I Computation requires integrals over the Q-function. I We will derive good bounds on the error rate for these cases. I For exact results, numerical integration is required. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 207
2 Illustration: 2-dimensional Rectangle I Assume that the n-th signal was transmitted and that the representation for this signal is~s n =(s n,0, s n,1 ) 0. I Assume that the decision region G n is a rectangle G n = {~r =(r 0, r 1 ) 0 :s n,0 a 1 < r 0 < s n,0 + a 2 and s n,1 b 1 < r 1 < s n,1 + b 2 }. I I Note: we have assumed that the sides of the rectangle are parallel to the axes in signal space. Since rotation and translation of signal space do not affect distances this can be done without affecting the error probability. I Question: What is the conditional error probability, assuming that s n (t) was sent. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 208
3 Illustration: 2-dimensional Rectangle I In terms of the random variables R k = hr t, F k i, with k = 0, 1, an error occurs if z error event 1 } { (R 0 apple s n,0 a 1 or R 0 s n,0 + a 2 ) or (R 1 apple s n,1 b 1 or R {z 1 s n,1 + b 2 ). } error event 2 I Note that the two error events are not mutually exclusive. I Therefore, it is better to consider correct decisions instead, i.e., ~ R 2 Gn : s n,0 a 1 < R 0 < s n,0 + a 2 and s n,1 b 1 < R 1 < s n,1 + b , B.-P. Paris ECE 630: Statistical Communication Theory 209
4 Illustration: 2-dimensional Rectangle I We know that R 0 and R 1 are I independent - because F k are orthogonal I with means s n,0 and s n,1, respectively I variance 2. I Hence, the probability of a correct decision is Pr{c s n } = Pr{ a 1 < < a 2 } Pr{ b 1 < N 1 < b 2 } Z a2 = p R0 s n (r 0 ) dr 0 a 1 a1 =(1 Q p N0 /2 b1 (1 Q p N0 /2 Z b2 p R1 s n (r 1 ) dr 1 b 1 a2 Q p ) N0 /2 b2 Q p ). N0 /2 2017, B.-P. Paris ECE 630: Statistical Communication Theory 210
5 Exercise: QPSK I Find the error rate for the signal set s n (t) = p 2E s /T cos(2pf c t + n p/2 + p/4), for n = 0,..., 3. I Answer: (Recall h P = d min 2 E b = 4 for QPSK) s! s E s Pr{e} = 2Q Q 2 = 2Q = 2Q s s 2E b h P E b 2!! Q 2 Q 2 E s! s! 2E b s h P E b 2!. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 211
6 Exercise: 16-QAM = 5 3 (Recall h P = d min 2 E b for 16-QAM) I Find the error rate for the signal set (a I, a Q 2{ 3, 1, 1, 3}) s n (t) = p 2E 0 /Ta I cos(2pf c t)+ p 2E 0 /Ta Q sin(2pf c t) I Answer: (h P = d min 2 E b = 4) s! 2E Pr{e} = 0 3Q s! 4E = b 3Q 5 s! h = P E b 3Q Q2 9 4 Q2 9 4 Q2 s! 2E 0 s! 4E b 5 s h P E b 2!. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 212
7 N-dimensional Hypercube I Find the error rate for the signal set with 2 N signals of the form (b k,n 2{ 1, 1}): r 2Es s n (t) = NT b k,n cos(2pnt/t ), for 0 apple t apple T I Answer: N Â k=1 Pr{e} = 1 1 Q = 1 1 Q = 1 1 Q s 2E s!! N N s!! N 2E b s!! N h P E b N Q 2 s! h P E b , B.-P. Paris ECE 630: Statistical Communication Theory 213
8 Comparison Symbol Error Probability BPSK (η P =4) QPSK (η P =4) 16-QAM (η P =1.6) 3D-Hypercube (η=4) E b / (db) I Better power efficiency h P leads to better error performance (at high SNR). 2017, B.-P. Paris ECE 630: Statistical Communication Theory 214
9 What if Decision Regions are not Rectangular? I Example: For 8-PSK, the probability of a correct decision is given by the following integral over the decision region for s 0 (t) Pr{c} = Z 1 p 2pN0 /2 exp( (x 0 Z x tan(p/8) p Es ) 2 2N o /2 1 p x tan(p/8) 2pN0 /2 exp( y 2 2 /2 ) dy {z } =1 2Q( x p tan(p/8) ) N0 /2 dx I This integral cannot be computed in closed form. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 215
10 Union Bound I When decision boundaries do not intersect at right angles, then the error probability cannot be computed in closed form. I An upper bound on the conditional probability of error (assuming that s n was sent) is provided by: Pr{e s n }apple  Pr{k~ R ~s k k < k~ R ~s n k ~s n } k6=n k ~s = k ~s n k  Q k6=n 2 p. /2 I Note that this bound is computed from pairwise error probabilities between s n and all other signals. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 216
11 Union Bound I Then, the average probability of error can be bounded by k ~s Pr{e} = k ~s n k  p n  Q p. n k6=n 2N0 I This bound is called the union bound; it approximates the union of all possible error events by the sum of the pairwise error probabilities. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 217
12 Example: QPSK I For the QPSK signal set s n (t) = p 2E s /T cos(2pf c t + n p/2 + p/4), for n = 0,..., 3 the union bound is s! s! Pr{e} apple2q E s + Q 2E s. I Recall that the exact probability of error is s! s! E s Pr{e} = 2Q Q 2 E s. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 218
13 "Intelligent" Union Bound I The union bound is easily tightened by recognizing that only immediate neighbors of s n must be included in the bound on the conditional error probability. I Define the the neighbor set N ML (s n ) of s n as the set of signals s k that share a decision boundary with signal s n. I Then, the conditional error probability is bounded by Pr{e s n }apple  Pr{k~ R ~s k k < k~ R ~s n k ~s n } k2n ML (s n ) k ~s = k ~s n k  Q k2n ML (s n ) 2 p. /2 2017, B.-P. Paris ECE 630: Statistical Communication Theory 219
14 "Intelligent" Union Bound I Then, the average probability of error can be bounded by k ~s Pr{e} k ~s n k appleâ p n  Q p. n k2n ML (s n ) 2N0 I We refer to this bound as the intelligent union bound. I It still relies on pairwise error probabilities. I It excludes many terms in the union bound; thus, it is tighter. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 220
15 Example: QPSK I For the QPSK signal set s n (t) = p 2E s /T cos(2pf c t + n p/2 + p/4), for n = 0,..., 3 the intelligent union bound includes only the immediate neighbors of each signal: s! E s Pr{e} apple2q. I Recall that the exact probability of error is s! s! E s Pr{e} = 2Q Q 2 E s. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 221
16 Example: 16-QAM I For the 16-QAM signal set, there are I 4 signals s i that share a decision boundary with 4 neighbors; bound on conditional error probability: Pr{e s i } = 4Q(q 2E0 ). I 8 signals s c that share a decision boundary with 3 neighbors; bound on conditional error probability: Pr{e s c } = 3Q(q 2E0 ). I 4 signals s o that share a decision boundary with 2 neighbors; bound on conditional error probability: Pr{e s o } = 2Q(q 2E0 N ). 0 I The resulting intelligent union bound is Pr{e} apple3q s 2E 0!. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 222
17 Example: 16-QAM I The resulting intelligent union bound is s! 2E Pr{e} 0 apple3q. I Recall that the exact probability of error is s! s 2E Pr{e} = 3Q 0 9 2E 0 4 Q2!. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 223
18 Nearest Neighbor Approximation I At high SNR, the error probability is dominated by terms that involve the shortest distance d min between any pair of nodes. I The corresponding error probability is proportional to Q(q dmin 2 ). I For each signal s n, we count the number N n of neighbors at distance d min. I Then, the error probability at high SNR can be approximated as s s Pr{e} 1 d N n Q( min )= N min Q( M 2 M 1 Â n=1 d min 2 ). 2017, B.-P. Paris ECE 630: Statistical Communication Theory 224
19 Example: 16-QAM I In 16-QAM, the distance between adjacent signals is d min = 2 p E s. I There are: I I I 4 signals with 4 nearest neighbors 8 signals with 3 nearest neighbors 4 signals with 2 nearest neighbors I The average number of neighbors is N min = 3. I The error probability is approximately, s! 2E Pr{e} 0 3Q. I same as the intelligent union bound. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 225
20 Example: 8-PSK I For 8-PSK, eachq signal has 2 nearest neighbors at p distance d min = (2 2)Es. I Hence, both the intelligent union bound and the nearest neighbor approximation yield 0s p 1 0s Pr{e} (2 2)Es A = 3(2 2 2 p 2)Eb 1 A I Since, E b = 3E s. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 226
21 Comparison Symbol Error Probability (with bound) BPSK (η P =4) QPSK (η P =4) 16-QAM (η P =1.6) 8-PSK (η=1.76) E b / (db) Solid: exact P e, dashed: approximation. For 8PSK, only approximation is shown. I The intelligent union bound is very tight for all cases considered here. I It also coincides with the nearest neighbor approximation 2017, B.-P. Paris ECE 630: Statistical Communication Theory 227
22 General Approximation for Probability of Symbol Error I From the above examples, we can conclude that a good, general approximation for the probability of error is given by s! dmin h Pr{e} N min Q p = P E b N min Q. 2N0 2 I Probability of error depends on I signal-to-noise ratio (SNR) E b / and I geometry of the signal constellation via the average number of neighbors N min and the power efficiency h P. 2017, B.-P. Paris ECE 630: Statistical Communication Theory 228
23 Bit Errors I So far, we have focused on symbol errors; however, ultimately we are concerned about bit errors. I There are many ways to map groups of log 2 (M) bits to the M signals in a constellation. I Example QPSK: Which mapping is better? QPSK Phase Mapping 1 Mapping 2 p/ p/ p/ p/ , B.-P. Paris ECE 630: Statistical Communication Theory 229
24 Bit Errors I Example QPSK: QPSK Phase Mapping 1 Mapping 2 p/ p/ p/ p/ I Note, that for Mapping 2 nearest neighbors differ in exactly one bit position. I That implies, that the most common symbol errors will induce only one bit error. I That is not true for Mapping , B.-P. Paris ECE 630: Statistical Communication Theory 230
25 Gray Coding I A mapping of log 2 (M) bits to M signals is called Gray Coding if I The bit patterns that are assigned to nearest neighbors in the constelation I differ in exactly one bit position. I With Gray coding, the most likely symbol errors induce exactly one bit error. I Note that there are log 2 (M) bits for each symbol. I Hence, with Gray coding the bit error probability is well approximated by Pr{bit error} N s! min log 2 (M) Q h P E b dmin. Q p. 2 2N0 2017, B.-P. Paris ECE 630: Statistical Communication Theory 231
A Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. = 4 for QPSK) E b Q 2. 2E b.
Exercie: QPSK I Find the error rate for the ignal et n (t) = p 2E /T co(2pf c t + n p/2 + p/4), for n = 0,, 3 I Anwer: (Recall h P = d min 2 E b = 4 for QPSK) E Pr{e} = 2Q Q 2 = 2Q = 2Q 2E b h P E b 2
More informationA Simple Example Binary Hypothesis Testing Optimal Receiver Frontend M-ary Signal Sets Message Sequences. possible signals has been transmitted.
Introduction I We have focused on the problem of deciding which of two possible signals has been transmitted. I Binary Signal Sets I We will generalize the design of optimum (MPE) receivers to signal sets
More informationA First Course in Digital Communications
A First Course in Digital Communications Ha H. Nguyen and E. Shwedyk February 9 A First Course in Digital Communications 1/46 Introduction There are benefits to be gained when M-ary (M = 4 signaling methods
More informationPerformance of small signal sets
42 Chapter 5 Performance of small signal sets In this chapter, we show how to estimate the performance of small-to-moderate-sized signal constellations on the discrete-time AWGN channel. With equiprobable
More informationRandom Processes Why we Care
Random Processes Why we Care I Random processes describe signals that change randomly over time. I Compare: deterministic signals can be described by a mathematical expression that describes the signal
More informationECE 564/645 - Digital Communications, Spring 2018 Homework #2 Due: March 19 (In Lecture)
ECE 564/645 - Digital Communications, Spring 018 Homework # Due: March 19 (In Lecture) 1. Consider a binary communication system over a 1-dimensional vector channel where message m 1 is sent by signaling
More informationDigital Transmission Methods S
Digital ransmission ethods S-7.5 Second Exercise Session Hypothesis esting Decision aking Gram-Schmidt method Detection.K.K. Communication Laboratory 5//6 Konstantinos.koufos@tkk.fi Exercise We assume
More information392D: Coding for the AWGN Channel Wednesday, January 24, 2007 Stanford, Winter 2007 Handout #6. Problem Set 2 Solutions
392D: Coding for the AWGN Channel Wednesday, January 24, 2007 Stanford, Winter 2007 Handout #6 Problem Set 2 Solutions Problem 2.1 (Cartesian-product constellations) (a) Show that if A is a K-fold Cartesian
More informationSummary: SER formulation. Binary antipodal constellation. Generic binary constellation. Constellation gain. 2D constellations
TUTORIAL ON DIGITAL MODULATIONS Part 8a: Error probability A [2011-01-07] 07] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello 1 Part 8a: Error
More informationEE4304 C-term 2007: Lecture 17 Supplemental Slides
EE434 C-term 27: Lecture 17 Supplemental Slides D. Richard Brown III Worcester Polytechnic Institute, Department of Electrical and Computer Engineering February 5, 27 Geometric Representation: Optimal
More informationRevision of Lecture Eight
Revision of Lectue Eight Baseband equivalent system and equiements of optimal tansmit and eceive filteing: (1) achieve zeo ISI, and () maximise the eceive SNR Thee detection schemes: Theshold detection
More information8 PAM BER/SER Monte Carlo Simulation
xercise.1 8 PAM BR/SR Monte Carlo Simulation - Simulate a 8 level PAM communication system and calculate bit and symbol error ratios (BR/SR). - Plot the calculated and simulated SR and BR curves. - Plot
More informationρ = sin(2π ft) 2π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero.
Problem 5.1 : The correlation of the two signals in binary FSK is: ρ = sin(π ft) π ft To find the minimum value of the correlation, we set the derivative of ρ with respect to f equal to zero. Thus: ϑρ
More informationChapter 7: Channel coding:convolutional codes
Chapter 7: : Convolutional codes University of Limoges meghdadi@ensil.unilim.fr Reference : Digital communications by John Proakis; Wireless communication by Andreas Goldsmith Encoder representation Communication
More informationSummary II: Modulation and Demodulation
Summary II: Modulation and Demodulation Instructor : Jun Chen Department of Electrical and Computer Engineering, McMaster University Room: ITB A1, ext. 0163 Email: junchen@mail.ece.mcmaster.ca Website:
More informationModulation & Coding for the Gaussian Channel
Modulation & Coding for the Gaussian Channel Trivandrum School on Communication, Coding & Networking January 27 30, 2017 Lakshmi Prasad Natarajan Dept. of Electrical Engineering Indian Institute of Technology
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1. Overview. Ragnar Thobaben CommTh/EES/KTH
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Wednesday, June 1, 2016 09:15-12:00, SIP 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationa) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics.
Digital Modulation and Coding Tutorial-1 1. Consider the signal set shown below in Fig.1 a) Find the compact (i.e. smallest) basis set required to ensure sufficient statistics. b) What is the minimum Euclidean
More informationThe Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals
Clemson University TigerPrints All Theses Theses 1-015 The Performance of Quaternary Amplitude Modulation with Quaternary Spreading in the Presence of Interfering Signals Allison Manhard Clemson University,
More informationProblem Set 7 Due March, 22
EE16: Probability and Random Processes SP 07 Problem Set 7 Due March, Lecturer: Jean C. Walrand GSI: Daniel Preda, Assane Gueye Problem 7.1. Let u and v be independent, standard normal random variables
More informationLecture 9: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1
: Diversity-Multiplexing Tradeoff Theoretical Foundations of Wireless Communications 1 Rayleigh Friday, May 25, 2018 09:00-11:30, Kansliet 1 Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless
More informationDigital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10
Digital Band-pass Modulation PROF. MICHAEL TSAI 211/11/1 Band-pass Signal Representation a t g t General form: 2πf c t + φ t g t = a t cos 2πf c t + φ t Envelope Phase Envelope is always non-negative,
More informationA Hilbert Space for Random Processes
Gaussian Basics Random Processes Filtering of Random Processes Signal Space Concepts A Hilbert Space for Random Processes I A vector space for random processes X t that is analogous to L 2 (a, b) is of
More informationECE 564/645 - Digital Communications, Spring 2018 Midterm Exam #1 March 22nd, 7:00-9:00pm Marston 220
ECE 564/645 - Digital Communications, Spring 08 Midterm Exam # March nd, 7:00-9:00pm Marston 0 Overview The exam consists of four problems for 0 points (ECE 564) or 5 points (ECE 645). The points for each
More informationGEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems
GEORGIA INSTITUTE OF TECHNOLOGY SCHOOL OF ELECTRICAL AND COMPUTER ENGINEERING Final Examination - Fall 2015 EE 4601: Communication Systems Aids Allowed: 2 8 1/2 X11 crib sheets, calculator DATE: Tuesday
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M. Kurkoski kurkoski@ice.uec.ac.jp University of Electro-Communications Tokyo, Japan ICC 2011 IEEE International Conference on Communications
More informationElectrical Engineering Written PhD Qualifier Exam Spring 2014
Electrical Engineering Written PhD Qualifier Exam Spring 2014 Friday, February 7 th 2014 Please do not write your name on this page or any other page you submit with your work. Instead use the student
More informationGaussian Random Variables Why we Care
Gaussian Random Variables Why we Care I Gaussian random variables play a critical role in modeling many random phenomena. I By central limit theorem, Gaussian random variables arise from the superposition
More informationSIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land
SIPCom8-1: Information Theory and Coding Linear Binary Codes Ingmar Land Ingmar Land, SIPCom8-1: Information Theory and Coding (2005 Spring) p.1 Overview Basic Concepts of Channel Coding Block Codes I:
More informationPSK bit mappings with good minimax error probability
PSK bit mappings with good minimax error probability Erik Agrell Department of Signals and Systems Chalmers University of Technology 4196 Göteborg, Sweden Email: agrell@chalmers.se Erik G. Ström Department
More informationCoding theory: Applications
INF 244 a) Textbook: Lin and Costello b) Lectures (Tu+Th 12.15-14) covering roughly Chapters 1,9-12, and 14-18 c) Weekly exercises: For your convenience d) Mandatory problem: Programming project (counts
More informationSOLUTIONS TO ECE 6603 ASSIGNMENT NO. 6
SOLUTIONS TO ECE 6603 ASSIGNMENT NO. 6 PROBLEM 6.. Consider a real-valued channel of the form r = a h + a h + n, which is a special case of the MIMO channel considered in class but with only two inputs.
More informationThe E8 Lattice and Error Correction in Multi-Level Flash Memory
The E8 Lattice and Error Correction in Multi-Level Flash Memory Brian M Kurkoski University of Electro-Communications Tokyo, Japan kurkoski@iceuecacjp Abstract A construction using the E8 lattice and Reed-Solomon
More informationCHAPTER 14. Based on the info about the scattering function we know that the multipath spread is T m =1ms, and the Doppler spread is B d =0.2 Hz.
CHAPTER 4 Problem 4. : Based on the info about the scattering function we know that the multipath spread is T m =ms, and the Doppler spread is B d =. Hz. (a) (i) T m = 3 sec (ii) B d =. Hz (iii) ( t) c
More informationMapper & De-Mapper System Document
Mapper & De-Mapper System Document Mapper / De-Mapper Table of Contents. High Level System and Function Block. Mapper description 2. Demodulator Function block 2. Decoder block 2.. De-Mapper 2..2 Implementation
More informationMITOCW ocw-6-451_ feb k_512kb-mp4
MITOCW ocw-6-451_4-261-09feb2005-220k_512kb-mp4 And what we saw was the performance was quite different in the two regimes. In power-limited regime, typically our SNR is much smaller than one, whereas
More informationProblem 7.7 : We assume that P (x i )=1/3, i =1, 2, 3. Then P (y 1 )= 1 ((1 p)+p) = P (y j )=1/3, j=2, 3. Hence : and similarly.
(b) We note that the above capacity is the same to the capacity of the binary symmetric channel. Indeed, if we considerthe grouping of the output symbols into a = {y 1,y 2 } and b = {y 3,y 4 } we get a
More informationTightened Upper Bounds on the ML Decoding Error Probability of Binary Linear Block Codes and Applications
on the ML Decoding Error Probability of Binary Linear Block Codes and Department of Electrical Engineering Technion-Israel Institute of Technology An M.Sc. Thesis supervisor: Dr. Igal Sason March 30, 2006
More informationA Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems
A Design of High-Rate Space-Frequency Codes for MIMO-OFDM Systems Wei Zhang, Xiang-Gen Xia and P. C. Ching xxia@ee.udel.edu EE Dept., The Chinese University of Hong Kong ECE Dept., University of Delaware
More informationDigital Modulation 1
Digital Modulation 1 Lecture Notes Ingmar Land and Bernard H. Fleury Navigation and Communications () Department of Electronic Systems Aalborg University, DK Version: February 5, 27 i Contents I Basic
More informationSupplementary Figure 1: Scheme of the RFT. (a) At first, we separate two quadratures of the field (denoted by and ); (b) then, each quadrature
Supplementary Figure 1: Scheme of the RFT. (a At first, we separate two quadratures of the field (denoted by and ; (b then, each quadrature undergoes a nonlinear transformation, which results in the sine
More informationEntropy, Inference, and Channel Coding
Entropy, Inference, and Channel Coding Sean Meyn Department of Electrical and Computer Engineering University of Illinois and the Coordinated Science Laboratory NSF support: ECS 02-17836, ITR 00-85929
More informationProjects in Wireless Communication Lecture 1
Projects in Wireless Communication Lecture 1 Fredrik Tufvesson/Fredrik Rusek Department of Electrical and Information Technology Lund University, Sweden Lund, Sept 2018 Outline Introduction to the course
More informationList Decoding: Geometrical Aspects and Performance Bounds
List Decoding: Geometrical Aspects and Performance Bounds Maja Lončar Department of Information Technology Lund University, Sweden Summer Academy: Progress in Mathematics for Communication Systems Bremen,
More informationBASICS OF DETECTION AND ESTIMATION THEORY
BASICS OF DETECTION AND ESTIMATION THEORY 83050E/158 In this chapter we discuss how the transmitted symbols are detected optimally from a noisy received signal (observation). Based on these results, optimal
More informationImpact of channel-state information on coded transmission over fading channels with diversity reception
Impact of channel-state information on coded transmission over fading channels with diversity reception Giorgio Taricco Ezio Biglieri Giuseppe Caire September 4, 1998 Abstract We study the synergy between
More informationE&CE 358, Winter 2016: Solution #2. Prof. X. Shen
E&CE 358, Winter 16: Solution # Prof. X. Shen Email: xshen@bbcr.uwaterloo.ca Prof. X. Shen E&CE 358, Winter 16 ( 1:3-:5 PM: Solution # Problem 1 Problem 1 The signal g(t = e t, t T is corrupted by additive
More informationEs e j4φ +4N n. 16 KE s /N 0. σ 2ˆφ4 1 γ s. p(φ e )= exp 1 ( 2πσ φ b cos N 2 φ e 0
Problem 6.15 : he received signal-plus-noise vector at the output of the matched filter may be represented as (see (5-2-63) for example) : r n = E s e j(θn φ) + N n where θ n =0,π/2,π,3π/2 for QPSK, and
More informationTheoretical Analysis and Performance Limits of Noncoherent Sequence Detection of Coded PSK
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 46, NO. 4, JULY 2000 1483 Theoretical Analysis and Permance Limits of Noncoherent Sequence Detection of Coded PSK Giulio Colavolpe, Student Member, IEEE, and
More informationDiversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver
Diversity Performance of a Practical Non-Coherent Detect-and-Forward Receiver Michael R. Souryal and Huiqing You National Institute of Standards and Technology Advanced Network Technologies Division Gaithersburg,
More informationComputation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems
Computation of Bit-Error Rate of Coherent and Non-Coherent Detection M-Ary PSK With Gray Code in BFWA Systems Department of Electrical Engineering, College of Engineering, Basrah University Basrah Iraq,
More informationPower Spectral Density of Digital Modulation Schemes
Digital Communication, Continuation Course Power Spectral Density of Digital Modulation Schemes Mikael Olofsson Emil Björnson Department of Electrical Engineering ISY) Linköping University, SE-581 83 Linköping,
More informationarxiv:cs/ v1 [cs.it] 11 Sep 2006
0 High Date-Rate Single-Symbol ML Decodable Distributed STBCs for Cooperative Networks arxiv:cs/0609054v1 [cs.it] 11 Sep 2006 Zhihang Yi and Il-Min Kim Department of Electrical and Computer Engineering
More informationThe University of Texas at Austin Department of Electrical and Computer Engineering. EE381V: Large Scale Learning Spring 2013.
The University of Texas at Austin Department of Electrical and Computer Engineering EE381V: Large Scale Learning Spring 2013 Assignment 1 Caramanis/Sanghavi Due: Thursday, Feb. 7, 2013. (Problems 1 and
More informationSolutions to Selected Problems
Solutions to Selected Problems from Madhow: Fundamentals of Digital Communication and from Johannesson & Zigangirov: Fundamentals of Convolutional Coding Saif K. Mohammed Department of Electrical Engineering
More informationMultiphase Shift Keying (MPSK) Lecture 8. Constellation. Decision Regions. s i. 2 T cos 2π f c t iφ 0 t As iφ 1 t. t As. A c i.
π fc uliphase Shif Keying (PSK) Goals Lecure 8 Be able o analyze PSK modualion s i Ac i Ac Pcos π f c cos π f c iφ As iφ π i p p As i sin π f c p Be able o analyze QA modualion Be able o quanify he radeoff
More informationLecture 12. Block Diagram
Lecture 12 Goals Be able to encode using a linear block code Be able to decode a linear block code received over a binary symmetric channel or an additive white Gaussian channel XII-1 Block Diagram Data
More information1 1 0, g Exercise 1. Generator polynomials of a convolutional code, given in binary form, are g
Exercise Generator polynomials of a convolutional code, given in binary form, are g 0, g 2 0 ja g 3. a) Sketch the encoding circuit. b) Sketch the state diagram. c) Find the transfer function TD. d) What
More informationOn the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA
On the Optimum Asymptotic Multiuser Efficiency of Randomly Spread CDMA Ralf R. Müller Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) Lehrstuhl für Digitale Übertragung 13 December 2014 1. Introduction
More informationAdvanced Spatial Modulation Techniques for MIMO Systems
Advanced Spatial Modulation Techniques for MIMO Systems Ertugrul Basar Princeton University, Department of Electrical Engineering, Princeton, NJ, USA November 2011 Outline 1 Introduction 2 Spatial Modulation
More informationRecitation 2: Probability
Recitation 2: Probability Colin White, Kenny Marino January 23, 2018 Outline Facts about sets Definitions and facts about probability Random Variables and Joint Distributions Characteristics of distributions
More informationAnalysis of Receiver Quantization in Wireless Communication Systems
Analysis of Receiver Quantization in Wireless Communication Systems Theory and Implementation Gareth B. Middleton Committee: Dr. Behnaam Aazhang Dr. Ashutosh Sabharwal Dr. Joseph Cavallaro 18 April 2007
More informationDifferential spatial modulation for high-rate transmission systems
Nguyen et al. EURASIP Journal on Wireless Communications and Networking (2018) 2018:6 DOI 10.1186/s13638-017-1013-1 RESEARCH Open Access Differential spatial modulation for high-rate transmission systems
More informationCHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS
THE UNIVERSITY OF SOUTH AUSTRALIA SCHOOL OF ELECTRONIC ENGINEERING CHANNEL CAPACITY CALCULATIONS FOR M ARY N DIMENSIONAL SIGNAL SETS Philip Edward McIllree, B.Eng. A thesis submitted in fulfilment of the
More informationDiversity Multiplexing Tradeoff in ISI Channels Leonard H. Grokop, Member, IEEE, and David N. C. Tse, Senior Member, IEEE
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 55, NO 1, JANUARY 2009 109 Diversity Multiplexing Tradeoff in ISI Channels Leonard H Grokop, Member, IEEE, and David N C Tse, Senior Member, IEEE Abstract The
More informationON DECREASING THE COMPLEXITY OF LATTICE-REDUCTION-AIDED K-BEST MIMO DETECTORS.
17th European Signal Processing Conference (EUSIPCO 009) Glasgow, Scotland, August 4-8, 009 ON DECREASING THE COMPLEXITY OF LATTICE-REDUCTION-AIDED K-BEST MIMO DETECTORS. Sandra Roger, Alberto Gonzalez,
More informationProperties of the Autocorrelation Function
Properties of the Autocorrelation Function I The autocorrelation function of a (real-valued) random process satisfies the following properties: 1. R X (t, t) 0 2. R X (t, u) =R X (u, t) (symmetry) 3. R
More informationSoft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antennas
Soft-Decision-and-Forward Protocol for Cooperative Communication Networks with Multiple Antenn Jae-Dong Yang, Kyoung-Young Song Department of EECS, INMC Seoul National University Email: {yjdong, sky6174}@ccl.snu.ac.kr
More informationTrellis Coded Modulation
Trellis Coded Modulation Trellis coded modulation (TCM) is a marriage between codes that live on trellises and signal designs We have already seen that trellises are the preferred way to view convolutional
More informationMessage-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras
Message-Passing Decoding for Low-Density Parity-Check Codes Harish Jethanandani and R. Aravind, IIT Madras e-mail: hari_jethanandani@yahoo.com Abstract Low-density parity-check (LDPC) codes are discussed
More informationLecture 11: Continuous-valued signals and differential entropy
Lecture 11: Continuous-valued signals and differential entropy Biology 429 Carl Bergstrom September 20, 2008 Sources: Parts of today s lecture follow Chapter 8 from Cover and Thomas (2007). Some components
More informationExpectation propagation for symbol detection in large-scale MIMO communications
Expectation propagation for symbol detection in large-scale MIMO communications Pablo M. Olmos olmos@tsc.uc3m.es Joint work with Javier Céspedes (UC3M) Matilde Sánchez-Fernández (UC3M) and Fernando Pérez-Cruz
More informationError Floors of LDPC Coded BICM
Electrical and Computer Engineering Conference Papers, Posters and Presentations Electrical and Computer Engineering 2007 Error Floors of LDPC Coded BICM Aditya Ramamoorthy Iowa State University, adityar@iastate.edu
More informationComparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs
Comparison of the Achievable Rates in OFDM and Single Carrier Modulation with I.I.D. Inputs Yair Carmon, Shlomo Shamai and Tsachy Weissman arxiv:36.578v4 [cs.it] Nov 4 Abstract We compare the maimum achievable
More informationMobile Communications (KECE425) Lecture Note Prof. Young-Chai Ko
Mobile Communications (KECE425) Lecture Note 20 5-19-2014 Prof Young-Chai Ko Summary Complexity issues of diversity systems ADC and Nyquist sampling theorem Transmit diversity Channel is known at the transmitter
More informationEE6604 Personal & Mobile Communications. Week 15. OFDM on AWGN and ISI Channels
EE6604 Personal & Mobile Communications Week 15 OFDM on AWGN and ISI Channels 1 { x k } x 0 x 1 x x x N- 2 N- 1 IDFT X X X X 0 1 N- 2 N- 1 { X n } insert guard { g X n } g X I n { } D/A ~ si ( t) X g X
More informationRapport technique #INRS-EMT Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping
Rapport technique #INRS-EMT-010-0604 Exact Expression for the BER of Rectangular QAM with Arbitrary Constellation Mapping Leszek Szczeciński, Cristian González, Sonia Aïssa Institut National de la Recherche
More informationMulti-Branch MMSE Decision Feedback Detection Algorithms. with Error Propagation Mitigation for MIMO Systems
Multi-Branch MMSE Decision Feedback Detection Algorithms with Error Propagation Mitigation for MIMO Systems Rodrigo C. de Lamare Communications Research Group, University of York, UK in collaboration with
More informationECE 630: Statistical Communication Theory
ECE 630: Statistical Communication Theory Dr. B.-P. Paris Dept. Electrical and Comp. Engineering George Mason University Last updated: April 6, 2017 2017, B.-P. Paris ECE 630: Statistical Communication
More informationReliability of Radio-mobile systems considering fading and shadowing channels
Reliability of Radio-mobile systems considering fading and shadowing channels Philippe Mary ETIS UMR 8051 CNRS, ENSEA, Univ. Cergy-Pontoise, 6 avenue du Ponceau, 95014 Cergy, France Philippe Mary 1 / 32
More informationProbability. Lecture Notes. Adolfo J. Rumbos
Probability Lecture Notes Adolfo J. Rumbos October 20, 204 2 Contents Introduction 5. An example from statistical inference................ 5 2 Probability Spaces 9 2. Sample Spaces and σ fields.....................
More informationAdaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems
ACSTSK Adaptive Space-Time Shift Keying Based Multiple-Input Multiple-Output Systems Professor Sheng Chen Electronics and Computer Science University of Southampton Southampton SO7 BJ, UK E-mail: sqc@ecs.soton.ac.uk
More informationMaximum Likelihood Decoding of Codes on the Asymmetric Z-channel
Maximum Likelihood Decoding of Codes on the Asymmetric Z-channel Pål Ellingsen paale@ii.uib.no Susanna Spinsante s.spinsante@univpm.it Angela Barbero angbar@wmatem.eis.uva.es May 31, 2005 Øyvind Ytrehus
More informationAPPENDIX 2.1 LINE AND SURFACE INTEGRALS
2 APPENDIX 2. LINE AND URFACE INTEGRAL Consider a path connecting points (a) and (b) as shown in Fig. A.2.. Assume that a vector field A(r) exists in the space in which the path is situated. Then the line
More informationConsider a 2-D constellation, suppose that basis signals =cosine and sine. Each constellation symbol corresponds to a vector with two real components
TUTORIAL ON DIGITAL MODULATIONS Part 3: 4-PSK [2--26] Roberto Garello, Politecnico di Torino Free download (for personal use only) at: www.tlc.polito.it/garello Quadrature modulation Consider a 2-D constellation,
More informationLecture 7: February 6
CS271 Randomness & Computation Spring 2018 Instructor: Alistair Sinclair Lecture 7: February 6 Disclaimer: These notes have not been subjected to the usual scrutiny accorded to formal publications. They
More informationOptimized Symbol Mappings for Bit-Interleaved Coded Modulation with Iterative Decoding
Optimized Symbol Mappings for Bit-nterleaved Coded Modulation with terative Decoding F. Schreckenbach, N. Görtz, J. Hagenauer nstitute for Communications Engineering (LNT) Munich University of Technology
More informationEE6604 Personal & Mobile Communications. Week 13. Multi-antenna Techniques
EE6604 Personal & Mobile Communications Week 13 Multi-antenna Techniques 1 Diversity Methods Diversity combats fading by providing the receiver with multiple uncorrelated replicas of the same information
More informationOptimum Soft Decision Decoding of Linear Block Codes
Optimum Soft Decision Decoding of Linear Block Codes {m i } Channel encoder C=(C n-1,,c 0 ) BPSK S(t) (n,k,d) linear modulator block code Optimal receiver AWGN Assume that [n,k,d] linear block code C is
More informationFigure 9.1: A Latin square of order 4, used to construct four types of design
152 Chapter 9 More about Latin Squares 9.1 Uses of Latin squares Let S be an n n Latin square. Figure 9.1 shows a possible square S when n = 4, using the symbols 1, 2, 3, 4 for the letters. Such a Latin
More informationCommunication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1
Communication Over MIMO Broadcast Channels Using Lattice-Basis Reduction 1 Mahmoud Taherzadeh, Amin Mobasher, and Amir K. Khandani Coding & Signal Transmission Laboratory Department of Electrical & Computer
More informationAsymptotically optimal induced universal graphs
Asymptotically optimal induced universal graphs Noga Alon Abstract We prove that the minimum number of vertices of a graph that contains every graph on vertices as an induced subgraph is (1+o(1))2 ( 1)/2.
More informationCSCI 239 Discrete Structures of Computer Science Lab 6 Vectors and Matrices
CSCI 239 Discrete Structures of Computer Science Lab 6 Vectors and Matrices This lab consists of exercises on real-valued vectors and matrices. Most of the exercises will required pencil and paper. Put
More informationFast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems
Fast Near-Optimal Energy Allocation for Multimedia Loading on Multicarrier Systems Michael A. Enright and C.-C. Jay Kuo Department of Electrical Engineering and Signal and Image Processing Institute University
More informationOptimal Receiver for MPSK Signaling with Imperfect Channel Estimation
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the WCNC 27 proceedings. Optimal Receiver for PSK Signaling with Imperfect
More informationUC Berkeley Department of Electrical Engineering and Computer Science. EE 126: Probablity and Random Processes. Problem Set 3: Solutions Fall 2007
UC Berkeley Department of Electrical Engineering and Computer Science EE 126: Probablity and Random Processes Problem Set 3: Solutions Fall 2007 Issued: Thursday, September 13, 2007 Due: Friday, September
More informationELEG 635 Digital Communication Theory. Lecture 9
ELEG 635 Digital Cmmunicatin Thery Lecture 9 10501 Agenda Optimal receiver fr PSK Effects f fading n BER perfrmance Tw ray mdel Pulse shaping Rectangle Raised csine Rt raised csine Receivers and pulse
More informationECE Information theory Final (Fall 2008)
ECE 776 - Information theory Final (Fall 2008) Q.1. (1 point) Consider the following bursty transmission scheme for a Gaussian channel with noise power N and average power constraint P (i.e., 1/n X n i=1
More informationUTA EE5362 PhD Diagnosis Exam (Spring 2011)
EE5362 Spring 2 PhD Diagnosis Exam ID: UTA EE5362 PhD Diagnosis Exam (Spring 2) Instructions: Verify that your exam contains pages (including the cover shee. Some space is provided for you to show your
More information