SCIENCES AND ENGINEERING

Similar documents
COMMUNICATION SCIENCES AND ENGINEERING

COMMUNICATION SCIENCES AND ENGINEERING

Digital Band-pass Modulation PROF. MICHAEL TSAI 2011/11/10

EE 574 Detection and Estimation Theory Lecture Presentation 8

Stochastic Chemical Kinetics

QPR No. 80 VIII. NOISE IN ELECTRON DEVICES. Academic and Research Staff. Prof. H. A. Haus Prof. P. Penfield, Jr. Prof. R. P. Rafuse.

Final Solutions Fri, June 8

Information Theory and Coding Prof. S. N. Merchant Department of Electrical Engineering Indian Institute of Technology, Bombay

Chapter [4] "Operations on a Single Random Variable"

SCIENCES COMMUNICATION AND ENGINEERING

Lecture 7. Union bound for reducing M-ary to binary hypothesis testing

Explicit evaluation of the transmission factor T 1. Part I: For small dead-time ratios. by Jorg W. MUller

COMMUNICATION SCIENCES AND ENGINEERING

LECTURE 16 AND 17. Digital signaling on frequency selective fading channels. Notes Prepared by: Abhishek Sood

This examination consists of 11 pages. Please check that you have a complete copy. Time: 2.5 hrs INSTRUCTIONS

arxiv:quant-ph/ v1 4 Nov 2005

Introduction to Convolutional Codes, Part 1

A NOTE ON A DISTRIBUTION OF WEIGHTED SUMS OF I.I.D. RAYLEIGH RANDOM VARIABLES

Lecture 6: Ideal gas ensembles

PROCESSING AND TRANSMISSION OF INFORMATION*

The goal of this chapter is to study linear systems of ordinary differential equations: dt,..., dx ) T

Flat Rayleigh fading. Assume a single tap model with G 0,m = G m. Assume G m is circ. symmetric Gaussian with E[ G m 2 ]=1.

Dr. Horace P. H. Yuen. Graduate Students

Problems 5: Continuous Markov process and the diffusion equation

COMMUNICATION SCIENCES

Figure 10.1: Recording when the event E occurs

Failure detectors Introduction CHAPTER

ECE Branch GATE Paper The order of the differential equation + + = is (A) 1 (B) 2

i~ ti = H 0 ti. (24.1) i = 0i of energy E 0 at time t 0, then the state at afuturetimedi ers from the initial state by a phase factor

EXAMINATIONS OF THE ROYAL STATISTICAL SOCIETY

Academic and Research Staff. Prof. R. Weiss. Graduate Students. G. D. Blum T. R. Brown S. Ezekiel

SEQUENTIAL TESTS FOR COMPOSITE HYPOTHESES

Is the superposition of many random spike trains a Poisson process?

Communication Signals (Haykin Sec. 2.4 and Ziemer Sec Sec. 2.4) KECE321 Communication Systems I

MATH4104: Quantum nonlinear dynamics. Lecture Two. Review of quantum theory.

Lecture 11: Non-Equilibrium Statistical Physics

Lecture 13 Date:

ENSC327 Communications Systems 2: Fourier Representations. Jie Liang School of Engineering Science Simon Fraser University

E[X n ]= dn dt n M X(t). ). What is the mgf? Solution. Found this the other day in the Kernel matching exercise: 1 M X (t) =

Continuous-time Markov Chains

CptS 464/564 Fall Prof. Dave Bakken. Cpt. S 464/564 Lecture January 26, 2014

Advanced Quantum Mechanics

F(t) equilibrium under H 0

2. SPECTRAL ANALYSIS APPLIED TO STOCHASTIC PROCESSES

The Poisson Channel with Side Information

E&CE 358, Winter 2016: Solution #2. Prof. X. Shen

DISCRETE STOCHASTIC PROCESSES Draft of 2nd Edition

THIS paper is aimed at designing efficient decoding algorithms

Change-point models and performance measures for sequential change detection

On a proposal for Quantum Signalling

Recap. Probability, stochastic processes, Markov chains. ELEC-C7210 Modeling and analysis of communication networks

BRANCHING PROCESSES AND THEIR APPLICATIONS: Lecture 15: Crump-Mode-Jagers processes and queueing systems with processor sharing

The Einstein-Podolsky-Rosen thought experiment and Bell s theorem

Square Root Raised Cosine Filter

Decentralized Detection In Wireless Sensor Networks

A Polynomial-Time Algorithm for Pliable Index Coding

The Einstein-Podolsky-Rosen thought-experiment and Bell s theorem

ECE531 Lecture 2b: Bayesian Hypothesis Testing

Communication Engineering Prof. Surendra Prasad Department of Electrical Engineering Indian Institute of Technology, Delhi

5 Analog carrier modulation with noise

14 : Theory of Variational Inference: Inner and Outer Approximation

Physics 6720 Introduction to Statistics April 4, 2017

Quantum Detection of Quaternary. Amplitude-Shift Keying Coherent State Signal

Residual Versus Suppressed-Carrier Coherent Communications

Asymptotically Optimal and Bandwith-efficient Decentralized Detection

X(t)e 2πi nt t dt + 1 T

Point Process Control

UCSD ECE250 Handout #27 Prof. Young-Han Kim Friday, June 8, Practice Final Examination (Winter 2017)

Page 684. Lecture 40: Coordinate Transformations: Time Transformations Date Revised: 2009/02/02 Date Given: 2009/02/02

A Study of Integral Pulse Frequency Modulation of a Random Carrier

Information Theory and Neuroscience II

Chapter 5 Random Variables and Processes

1 Deterministic Turing Machines

Putzer s Algorithm. Norman Lebovitz. September 8, 2016

10 Transfer Matrix Models

Digital Transmission Methods S

Algebraic aspects of some Riordan arrays related to binary words avoiding a pattern

EE303: Communication Systems

EE214 Early Final Examination: Fall STANFORD UNIVERSITY Department of Electrical Engineering. SAMPLE FINAL EXAMINATION Fall Quarter, 2002

ON REARRANGEMENTS OF SERIES H. M. SENGUPTA

Worst case analysis for a general class of on-line lot-sizing heuristics

Fourier Series : Dr. Mohammed Saheb Khesbak Page 34

1 Deterministic Turing Machines

Drude theory & linear response

Functional Limit theorems for the quadratic variation of a continuous time random walk and for certain stochastic integrals

Optional Stopping Theorem Let X be a martingale and T be a stopping time such

Manual for SOA Exam MLC.

Coins and Counterfactuals

Reliability Theory of Dynamically Loaded Structures (cont.)

Thermalization and Revivals after a Quantum Quench in a Finite System

The Underlying Semantics of Transition Systems

Practical Decidability

1 Mathematical Preliminaries

Entanglement Enabled Intensity Interferometry

CS 256: Neural Computation Lecture Notes

2 Quantization of the Electromagnetic Field

LECTURE 10: THE PARALLEL TRANSPORT

Lecture 7 Introduction to Statistical Decision Theory

On background radiation and effective source strength. by Jorg,~. Müller. Bureau International des Poids et Mesures, F Sèvres

Maximum-Likelihood fitting

Transcription:

COMMUNICATION SCIENCES AND ENGINEERING

VII. PROCESSING AND TRANSMISSION OF INFORMATION Academic and Research Staff Prof. P. Elias Prof. R. S. Kennedy Prof. C. E. Shannon Prof. R. G. Gallager Dr. E. V. Hoversten Graduate Students Donna Jean Brown J. G. Himes N. Pippenger V. Chan R. J. Metzger L. Rapisarda S. J. Dolinar, Jr. A. Z. Muszynsky S. R. Robinson R. A. Flower N-S. Myung M. A. Sirbu, Jr. L. M. Hawthorne F. Nourani V. Vilnrotter A. AN OPTIMUM RECEIVER FOR THE BINARY COHERENT STATE QUANTUM CHANNEL National Aeronautics and Space Administration (Grant NGL 22-009-013) S. J. Dolinar, Jr. Recently an (ideally) implementable receiver for the detection of binary coherentstate signals has been discoveredl whose performance is exponentially optimum, differing from that of the optimum quantum receiver by at most a factor of two in the error pro- bability. By suitably generalizing the structure of that receiver, we have been able to obtain one that achieves quantum optimal performance precisely for this particular detection problem. Our problem is to decide, with minimum probability of error, between two possible messages m and ml, with a priori probabilities Tro and rl, respectively, when the received field, conditioned on m. being sent, is a linearly polarized narrow-band plane wave corresponding to the quantum coherent state sj), j = 0, 1. The minimum error probability for this problem is well known, P(E) = I1-1 - 4 -ro 1 K s s l 2 (1) where ( s o sl) is the inner product of so) with s]). For coherent states, the magnitude squared of this inner product may be simply expressed in terms of the complex envelopes So(t), S (t) of the classical received fields corresponding to the states I so ) s). (s Isl) 1 2 = exp - f kx(t) dt), (2) where we have defined (t) to be the photon-counting rate for direct detection of a plane QPR No. 111 115

wave of complex envelope So(t) - SI(t), and [0, T] is the signaling interval. X(t) = C IS(t) - Sl(t) 2, (3) where C is a constant related to the aperture area, the impedance of space, and the energy of photons at the carrier frequency. The near-optimum receiver processes the received field by adding to it a fixed linearly polarized local reference plane wave 1(t), equal to the negative of one of the signals So(t) or Sl(t), and direct-detecting the result with a photon counter. We generalize this concept by allowing the choice of the local reference field added at the receiver to depend causally on the actual output of the photon counter, via a feedback arrangement. This generalization immediately introduces complexities in the analysis of the photon counter output, since it is no longer a Poisson process conditioned on the message sent. It remains at least a regular point process, and so it is characterized by the set of times t 1 < t 2 <... at which counts occur. Thus, the class of receivers that we are considering is identifiable with the set of all possible feedback functions, {((t: t), t = (tl... tn): 0 <t <. t n < t < T, n= 0, 1, 2,.... Here, 1(t: t) represents the feedback field at time t when the vector of counts observed prior to t is t. The structure of such a receiver is illustrated in Fig. VII-1. RECEIVED FIELD: LINEARLY POLARIZED PLANE WAVE OF COMPLEX AMPLITUDE 5 0 (t) OR Sl(t) BEAM PHOTON COMBINER DETECTOR EVOLVING EVENT TIMES OPTIMUM DECIDE =(t 1, t 2.,n) t DECISION RULE (t) ( IDE, O<tl<t2<...< tn< t BASED ON t, AT TIME t LINEARLY POLARIZED PLANE WAVE OF COMPLEX AMPLITUDE Lct: t) rgenerate Fig. VII-1. Receiver structure considered here. When a particular feedback function f( ) is specified, the statistics of the photon counter output may be determined from the following observation. Conditioned on the message m. being sent and also on the entire history of event times t of the photon count process up to time t, the probability that a single count will occur in the small interval (t, t+ A) is Xj(t:t)A, within o(a), and the probability of multiple counts in this interval is o(a), where QPR No. 111 116 ~

\.(t:t) = C S (t)+ f(t: t). (4) This incremental analysis may be easily extended to yield the probability density p (t: T) for the set of event times t within the entire observation interval [0, T], conditioned on m.. n n+l 1 1 pj(t: T) = I J(t: t.1 ) 1 exp - (a-:t ) do-, (5) i= 1 ti where t = (t 1... tn) to 0 ti 1 = (t 1.... ) tn+ 1 - T. The optimum decision rule is obvious from (5), may be obtained by integrating the expressions in (5) regions in and in principle the probability of error over the appropriate decision t, for any feedback function f(). As expected, explicit evaluation of performance is possible only for certain special cases, one of which is the optimum feed- A back function f(. ). In this report, we shall describe, rather than derive, the optimum feedback f( ), and then calculate performance and verify that it is quantum-optimal. a deterministic weighting function f (t), which depends on S ( ), y T Irl o Without loss of generality, we assume -y > 1. We first define (S1(), and the ratio f (t) = em(t) - 1 + )2 e2m(t) - 4 em(t), (6) where m(t) = k(o-) d- = C f So(o)-S1() 2 do-. Next, we define two weighted combinations of the signals So(t), S 1 (t). f (t) = S (t ) f (t) - So(t) f (t) - 1 (7a) So(t) = S o() f (t) - S ( t ) f (t) - 1 (7b) The optimum feedback function C(. ) depends very trivially on the observations t: QPR No. 111 117

( t A ), t (t... tn) (t:t) = if0(t), t =(tl,, t n), n even n odd If we use this feedback function in (4) and (5) and make use of the fact that f ( ') satisfies the integral equation f (t) In - t Y X([f () + 1 k(o-) do-, 0 < t < t < T, o Y it is straightforward, albeit tedious, to obtain an expression for the likelihood ratio A(t: T) = Pl(t: T)/p (t: T). T) = n(t: [ ya(t: T) = [f (T)](-1 t = (t..., t ). -- n (10) Since f (T) > 1, the decision regions for minimum probability of error are very simply defined: D = {t = (t..., t ):ya(t: T) > I} = {t= (t... t ): n even} 1-1' n 1. n (Ila) Do = {t= (t.., t ):ya(t: T)< 1} = {t= (t, o (. ' n =''"., t n): n odd}. (llb) The probability of error is given by P(E) = fd 0 Tr 1 p 1 (t: T) dt + fd Iropo(t: T) dt o 1 = D ya(t: T) To o(t: T) o dt + fd 1 D 1 'ya(t: T) rlpl (t: T) dt D 1 of (T) c Tr op (t: T) dt + fd 00-1 1 1 (t:t) f ( T) 1 f (T) C ID To o (t: T) dt + fdi1 Trlp(t:T) dt]. (12) The quantity in brackets is the probability of correct detection, or 1 - P(E). Solving for P(E), we obtain QPR No. 111 118

P(E) = 1 1 + f (T) S1 -m(t) 21-1 - em(t 1(1+ )2 1-1 - 4 r em(t)]. (13) Recalling the definition of m(t), we see that this is identical to the quantum-optimal results in (1) and (2). Let us briefly discuss some aspects of the behavior of our optimum receiver (Fig. VII-2). The feedback field alternates between fl(t) and fo(t) with each count. At the same time, In ya(t:t) changes sign at each count, but its magnitude is a deterministically increasing function of time, In f (t). Thus the occurrence of each successive count constitutes a more and more conclusive negative test of the hypothesis last considered more probable. As time goes on, the optimum feedback SWITCHES BEAM PHOTON BACK AND FORTH COMBINER DETECTOR WITH EACH A (t) = m C COUNT I DECIDE COUNTER RECEIVED FIELD: (t) m LINEARLY POLARIZED PLANE WAVE OF COMPLEX AMPLITUDE S0(t) OR S l (t LINEARLY POLARIZED PLANE WAVE OF COMPLEX AMPLITUDE 0(t) OR I ( 0 GENERATE, -- - lo(t) GENERATE 1 Fig. VII-2. Optimum receiver for known So(t), S l (t). alternates less frequently between I(t) and fo(t) and with increasing probability tends toward nulling whichever signal was actually sent. In fact, if lim m(t) = cc, there is, t- oc with probability one, a final count even in the case of an infinite signaling interval (T = c). We remark that in the case of equal a priori probabilities (y = 1), Eqs. 4, 7, QPR No. 111 119

and 8 provide only a formal description of the optimum processing, since the required feedback field, and hence the photon counting rate, are infinite at t = 0. It is possible to define rigorously the random process which represents the photodetector output for this optimum processor, but it is not a regular point process on [0, T] and so the optimum receiver technically does not belong to the class we are considering. We point out, however, that we may approach optimum performance as closely as desired with bounded feedback fields by appropriately redefining k(t:t) for t in some small interval [0, E), 0 < E < T, and letting E 0. One redefinition that has this convergence property is f (t: t) = -S ( t ), t E [0, c) f(t: t), te [E, T] (14) From a practical point of view, the foregoing result might seem insignificant, since an exponentially optimum receiver for this particular detection problem is already available. The attainment of precisely optimum performance, however, warrants an investigation into the possible connection between the type of feedback receiver considered here and quantum-optimal measurements for more general problems for which exponentially optimum receivers have not yet been found. Further study is being conducted on this question. References 1. R. S. Kennedy, "A Near-Optimum Receiver for the Binary Coherent State Quantum Channel," Quarterly Progress Report No. 108, Research Laboratory of Electronics, M.I.T., January 15, 1973, pp. 219-225. 2. C. W. Helstrom, "Detection Theory and Quantum Mechanics," Inform. Contr. 10, 254-291 (1968). QPR No. 111 120