The Fading Number of a Multiple-Access Rician Fading Channel
|
|
- Octavia Cross
- 5 years ago
- Views:
Transcription
1 The Fading Number of a Multiple-Access Rician Fading Channel Intermediate Report of NSC Project Capacity Analysis of Various Multiple-Antenna Multiple-Users Communication Channels with Joint Estimation and Detection Date: 31 May 9 Project-Number: NSC 96-1-E-9-1-MY3 Project Duration: 1 August 7 31 July 1 Funded by: National Science Council, Taiwan Author: Stefan M. Moser Organization: Information Theory Laboratory Department of Communication Engineering National Chiao Tung University Address: Engineering Building IV, Office Ta Hsueh Rd. Hsinchu 31, Taiwan stefan.moser@ieee.org
2 Abstract The fading number of a noncoherent two-user Rician fading channel is derived. The fading number is the second term in the high-snr expansion of the sum-rate capacity of this multiple-access channel. It is shown that the fading number is identical to the fading number of the single-user Rician fading channel that is obtained when the user seeing the worse channel is switched off. Keywords: Channel capacity, fading number, flat fading, high signal-to-noise ratio SNR), multiple-access. 1
3 Contents 1 Introduction Channel Model and Previous Results 3 Main Result 4 4 Proof of Main Result 5 5 Conclusions 8 A Proof of Proposition 3 8 Bibliography 9 1 Introduction In a noncoherent fading channel where neither transmitter nor receiver know the fading realization, it has been shown in [1] that the capacity at high SNR behaves fundamentally different from the usual asymptotics seen in AWGN channels or in coherent fading channels: instead of a logarithmic growth in the SNR, the capacity only grows double-logarithmically. In detail, we have Csnr) = log1 + log1 + snr)) + χ + o1) 1) where o1) denote terms that tend to zero as the SNR tends to infinity; and where χ is a constant independent of the SNR that is denoted fading number. The value of χ depends on the exact specifications of the fading law. Note that even though the fading number is defined only in the limit when the available SNR tends to infinity, it has practical relevance also for finite SNR because it is a good estimator for the threshold where the capacity changes from the normal logarithmic growth to the highly inefficient double-logarithmic growth. In the situation of single-user fading channels with multiple antennas both at transmitter and receiver and with a fading process that may contain memory, a formula for the fading number has been derived in []. The present paper is a first step towards extending the setup to a multiple-user situation. Channel Model and Previous Results We consider a multiple-access channel with two independently transmitting users and one receiver. All terminals are assumed to have only one antenna, and the two fading channels from each user to the receiver are assumed to suffer from independent Rician fading. The channel output Y C can then be written as Y = H 1 x 1 + H x + Z ) = d 1 x 1 + H 1 x 1 + d x + H x + Z, 3)
4 where x i C denotes the input of user i, i = 1, ; where the random variables H i describe Rician fading H i + d i = H i N C d i, 1), i = 1,, 4) hence, H i are zero-mean, circularly symmetric, complex Gaussian random variables with variance 1) and are assumed to be independent H 1 H ; 5) and where Z N C, σ ) denotes additive, zero-mean, circularly symmetric Gaussian noise, independent from the fading vector H 1, H ) T. We assume a noncoherent situation, i.e., neither transmitter nor receiver have knowledge of the current fading realization, they only know the fading distributions. Moreover we assume two different types of input constraints: a peak-power constraint and an average-power constraint. We use E to denote the maximum allowed total instantaneous power in the former case, and to denote the allowed total average power in the latter case. This total power then still must be split and distributed among the users. The sum-rate capacity CE) of the channel 3) is given by CE) = IX 1, X ; Y ) 6) where the remum is over the set of all probability distributions on X = X 1, X ) T for which both components are independent and satisfy the input constraint, i.e., for a peak-power constraint, or X 1 + X E, almost surely 7) E [ X 1 + X ] E 8) for an average-power constraint. Note that the difference of this multiple-access channel MAC) to the multipleinput single-output MISO) fading channel with two transmit antennas and one receive antenna is that in the latter both transmit antennas can cooperate, while in the former they are assumed to be independent. Hence, it immediately follows from this that the MAC sum-rate capacity can be upper-bounded by the MISO capacity: C MAC E) C MISO E). 9) On the other hand, obviously the sum rate cannot be smaller than the single-user rate that can be achieved if the weaker of the two users is switched off, i.e., C MAC E) max i=1, C SISO,iE). 1) Using this and specializing [1, Theorem 4.] and [4, Theorem 6.1] to memoryless MISO and SISO fading, respectively, we get {C MAC E) log log Eσ } <. 11) lim We now define the MAC fading number accordingly see [1, Definition 4.6], [4, Definition 6.13]) as χ MAC lim {C MAC E) log log Eσ }. 1) 3
5 Prima facie the MAC fading number depends on whether a peak-power constraint 7) or an average-power constraint 8) is imposed on the input. However, it will turn out that the MAC fading number is identical for both cases. From [1, Corollary 4.8] we know that χ MISO = log d 1 + d ) Ei d 1 + d ) 1 13) were Ei ) is the exponential integral function defined as Hence, from 9) we have Ei x) e t x t dt, x >. 14) χ MAC χ MISO = log d 1 + d ) Ei d 1 + d ) 1. 15) On the other hand from 1) χ MAC max i χ i,siso = max i { log di ) Ei d i ) 1 }. 16) Using the monotonicity of ξ logξ) Ei ξ) we therefore see that χ MAC = log d MAC) Ei d MAC ) 1 17) where we have introduced d MAC to be a nonnegative real number satisfying max { d 1, d } d MAC d 1 + d. 18) In the following we will evaluate the exact value of d MAC. Note that from [5] we actually know that with strict inequality. 3 Main Result d MAC < d 1 + d 19) Theorem 1. Assume a Rician fading channel as defined in Section. Then the sum-rate fading number is given by where χ MAC = log d MAC) Ei d MAC ) 1, ) This shows that the lower bound in 18) is tight. d MAC = max { d 1, d }. 1) Note that if the magnitude of the line-of-sight component of one user is strictly smaller than of the other user, then this sum rate can only be achieved if the user with the weaker d i is switched off. If both line-of-sight components have identical magnitudes, then the sum rate can be achieved by time-sharing. Remark. Note that Theorem 1 continues to hold even if we do not allow power optimization over the users, i.e., if we constrain the inputs to satisfy X i E, almost surely, i. ) 4
6 4 Proof of Main Result The proof of Theorem 1 consists of two parts. The first part is given already in 18). There it is shown that max{ d 1, d } is a lower bound to d MAC. Note that this lower bound can be achieved using an input that satisfies the peak-power constraint. The second part will be to prove that max{ d 1, d } is also an upper bound. We will prove this under the assumption of an average-power constraint. Since a peak-power constraint is more stringent than an average-power constraint, the result follows. The proof of this upper bound relies strongly on a generalization of the concept of input distributions that escape to infinity as introduced in [1] and in [6]. Proposition 3. Let {Q E } E> be a family of joint input distributions of the two-user MAC given in 3) parameterized by the available power E, E >, satisfying the average-power constraint 8) and IQ E, W) lim = 1. 3) log log E Then at least one user s input distribution must escape to infinity, i.e., for any E >, { lim Q E X 1 E } { X E }) = 1. 4) Proof. See the appendix. Using [1, Eq. 5)] for our channel model we get after some steps the bound IX 1, X ; Y ) ν [ β 1 + E log d 1X 1 + d X ] [ X 1 + X E Ei d 1X 1 + d X )] X 1 + X + ǫ ν + log Γ α, ν β ) + αlog β log σ + γ) + 1 β 1 + d max ) E + σ ) 5) which with the right choice of the free parameters α, β, and ν leads to the upper bound { [ d1 X 1 + d X ] χ MAC lim Q E A log E X 1 + X Ei E [ d1 X 1 + d X X 1 + X ]) } 1. 6) Here we define A be the set of joint input distributions such that X 1 X and the input distribution of at least one user escapes to infinity when the available power E tends to infinity, i.e., { { A X 1, X X 1 X, lim Q E X1 E / } { X E / }) = 1 } for any fixed E >. 7) 5
7 In the following we will only prove the special case where d 1 = d = d. The proof of the case of general d 1, d is omitted. Noting that ξ logξ) Ei ξ) is monotonically increasing and writing X i = R i e iφ i, we see that our problem becomes [ dx1 + dx ] [ d X 1 + X ] E Q E A X 1 + X = E Q E A = E Q E A X 1 + X 8) [ d 1 + X )] 1 X cosφ 1 Φ ) X 1 + X 9) [ ] ) X1 X cosφ 1 Φ ) X 1 + X 3) ] ), 31) = d 1 + E Q E A [ d 1 R1 R + E Q E A R1 + R where in the last inequality we upper-bounded cosφ 1 Φ ) 1. The result now follows once we can show that [ ] lim R1 R E Q E A R1 + =. 3) R where To that goal let E [ X 1 ] E 1 33) E [ X ] E 34) E 1 + E = E. 35) Note that from Proposition 3 we know that if E then E 1 or E or both. Without loss of generality assume that E 1. Note further that r 1 r r 1 + r 1 36) and that r 1 r 1r is monotonically decreasing in r r1 1 if r 1 > r. Hence, for an +r arbitrary choice of a > 1, [ ] lim R1 R E Q E A R1 + R [ ] lim R1 R E Q R1 A 1 R1 + 37) R = lim r 1 r Q R1 A 1 r1 + dq R1 r 1 )d r ) 38) r ar lim r 1 r Q R1 A 1 r1 + dq R1 r 1 )d r ) r + lim Q R1 A 1 r 1 r ar r1 + r dq R1 r 1 )d r ). 39) Here in the first inequality we define A 1 as the set of all input distributions of the first user that escape to infinity, we use that from E we know that E 1 and take the remum over all without any constraint on the average power 6
8 and no dependence on Q R1. The last inequality then follows from splitting the integration into two parts and from the property that the remum of a sum is always upper-bounded by the sum of the rema. Next, let s look at the first term in 39): lim Q R1 A 1 lim ar Q R1 A 1 lim = = lim r 1 r r 1 + r }{{} 1 ar ar Q R1 A 1 ar Q R1 A 1 dq R1 r 1 )d r ) dq R1 r 1 )d r ) 4) dq R1 r 1 )d r ) 41) dq R1 r 1 )d r ) 4) d r ) 43) =. 44) Here, 43) follows because Q R1 escapes to infinity; and in 4) we exchange the limit and the integration which can be justified as follows: let Then note that g E1 r ) ar Q R1 A 1 Q R1 A 1 dq R1 r 1 ) 45) dq R1 r 1 ) 46) = 1 g upper r ). 47) g upper r )d r ) = d r ) = 1, 48) i.e., g upper ) is independent of E 1 and integrable. Hence by the Dominated Convergence Theorem DCT) [7, Ch. 14] we are allowed to swap limit and integration. Hence, we continue with 39) as follows: [ ] lim R1 R E Q E A R1 + R lim lim = lim lim Q R1 A 1 Q R1 A 1 Q R1 A 1 Q R1 A 1 r 1 r ar r1 + r ar dq R1 r 1 )d r ) 49) ar )r ar ar ) + r dq R1 r 1 )d r ) 5) a a + 1 dq R 1 r 1 )d r ) a a + 1 dq R 1 r 1 )d r ) 7 51) 5)
9 = a a + 1 lim Q R1 A 1 dq R1 r 1 )d r ) 53) = a a < ǫ + 1 if a large enough. 54) Here 5) follows because r 1 r 1 r /r 1 + r ) is monotonically decreasing in r 1 if r 1 > r. Since a is arbitrary, the result follows. 5 Conclusions We have shown that at very high SNR, the sum-rate capacity of a noncoherent multiple-access Rician fading channel is limited by the capacity of the better of the two users. This rather pessimistic result fits to the very pessimistic behavior of noncoherent fading channels at high SNR. Currently we are working on an extension of this result to more than two users where each user is allowed to use several antennas. We believe that the stated theorem generalizes accordingly, i.e., the MAC fading number corresponds to the MISO fading number if only the user seeing the best channel is allowed to transmit. A Proof of Proposition 3 In the following we will prove Proposition 3. From 9) we know that Moreover note that lim { µ,µ ] C MAC E) lim = 1. 55) log log E µlog log E µ log log E } < 1, < µ < 1. 56) Fix some E > and let E { 1 if X 1 E / or X 1 E /, if X 1 < E / and X 1 < E /. 57) and Then µ Pr[E = 1]. 58) IQ X1, Q X, W) = I X 1, X ; Y ) 59) = I X 1, X, E; Y ) 6) = IE; Y ) + I X 1, X ; Y E) 61) = IE; Y ) + I X 1, X ; Y E = ) Pr[E = ] + I X 1, X ; Y E = 1) Pr[E = 1] 6) log + I X 1, X ; Y E = ) + µi X 1, X ; Y E = 1) 63) ) E log + CE ) + µc, 64) µ 8
10 where the first inequality follows because E is a binary random variable and because Pr[E = ] 1; the subsequent inequality follows because conditional on E =, E [ X 1 + X ] < E and E [ X 1 + X ] = µe [ X 1 + X E = 1 ] + 1 µ)e [ X 1 + X E = ] 65) }{{} µe [ X 1 + X ] E = 1 66) from which follows that E [ X 1 + X E = 1 ] E[ X 1 + X ] E µ µ. 67) To show µ 1, let E n be a sequence with E n. Let Q En be a family of joint input distributions on the MAC channel 3) such that and define IQ En, W) lim = 1 68) n log log E n { µ n Q En X 1 E } { X E }). 69) By contradiction, assume µ n µ < 1. Then µ < 1 such that From 64) we have IQ En, W) log log E n }{{} 1 µ n < µ, n sufficiently large. 7) log + CE ) log log E n } {{ } + C En µ n ) log log En µ n }{{} 1 µn log log En µ n log log E n. 71) Here the limiting behavior of the LHS follows from 68); the limiting behavior of the first term on the RHS is because CE ) < ; the second term on the RHS tends to one because E n implies E n /µ n and because of 55). Hence, when n we obtain the contradiction 1 lim n lim µ n log log En µ n 7) log log E n { µ,µ ] µlog log E µ log log E } 73) < 1, 74) where the first inequality follows from 71); the second inequality follows from 7); and the last inequality follows from 56). References [1] A. Lapidoth and S. M. Moser, Capacity bounds via duality with applications to multiple-antenna systems on flat fading channels, IEEE Transactions on Information Theory, vol. 49, no. 1, pp , October 3. 9
11 [] S. M. Moser, The fading number of multiple-input multiple-output fading channels with memory, IEEE Transactions on Information Theory, vol. 55, no. 6, pp , June 9. [3] G.-R. Lin and S. M. Moser, The fading number of a multiple-access Rician fading channel, March 9, submitted to IEEE Information Theory Workshop ITW). [4] S. M. Moser, Duality-based bounds on channel capacity, Ph.D. dissertation, Swiss Federal Institute of Technology ETH), Zurich, October 4, Diss. ETH No [Online]. Available: [5] A. Lapidoth and S. M. Moser, On the Ricean fading multi-access channel, in Proceedings Winter School on Coding and Information Theory, Monte Verità, Ascona, Switzerland, February 4 7, 3. [6], The fading number of single-input multiple-output fading channels with memory, IEEE Transactions on Information Theory, vol. 5, no., pp , February 6. [7] H. A. Priestley, Introduction to Integration. Oxford University Press,
Some Expectations of a Non-Central Chi-Square Distribution With an Even Number of Degrees of Freedom
Some Expectations of a Non-Central Chi-Square Distribution With an Even Number of Degrees of Freedom Stefan M. Moser April 7, 007 Abstract The non-central chi-square distribution plays an important role
More informationCapacity Analysis of Multiple-Access OFDM Channels
Capacity Analysis of Multiple-Access OFDM Channels Final Report of Project TW4G Wireless Access Technology Contract-Number: G-9600 Project Duration: January 2007 3 December 2007 Funded by: Industrial Technology
More informationOn the Capacity of Free-Space Optical Intensity Channels
On the Capacity of Free-Space Optical Intensity Channels Amos Lapidoth TH Zurich Zurich, Switzerl mail: lapidoth@isi.ee.ethz.ch Stefan M. Moser National Chiao Tung University NCTU Hsinchu, Taiwan mail:
More informationWE study the capacity of peak-power limited, single-antenna,
1158 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 3, MARCH 2010 Gaussian Fading Is the Worst Fading Tobias Koch, Member, IEEE, and Amos Lapidoth, Fellow, IEEE Abstract The capacity of peak-power
More informationWE consider a memoryless discrete-time channel whose
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 55, NO. 1, JANUARY 2009 303 On the Capacity of the Discrete-Time Poisson Channel Amos Lapidoth, Fellow, IEEE, and Stefan M. Moser, Member, IEEE Abstract The
More informationNearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 3, MARCH 2012 1483 Nearest Neighbor Decoding in MIMO Block-Fading Channels With Imperfect CSIR A. Taufiq Asyhari, Student Member, IEEE, Albert Guillén
More informationThe Additive Inverse Gaussian Noise Channel: an Attempt on Modeling Molecular Communication
National Chiao Tung University Taiwan Dept. of Electrical and Computer Engineering 2013 IEEE Taiwan/Hong Kong Joint Workshop on Information Theory and Communications The Additive Inverse Gaussian Noise
More informationApproximately achieving the feedback interference channel capacity with point-to-point codes
Approximately achieving the feedback interference channel capacity with point-to-point codes Joyson Sebastian*, Can Karakus*, Suhas Diggavi* Abstract Superposition codes with rate-splitting have been used
More informationOptimal Power Control in Decentralized Gaussian Multiple Access Channels
1 Optimal Power Control in Decentralized Gaussian Multiple Access Channels Kamal Singh Department of Electrical Engineering Indian Institute of Technology Bombay. arxiv:1711.08272v1 [eess.sp] 21 Nov 2017
More informationOn the Duality between Multiple-Access Codes and Computation Codes
On the Duality between Multiple-Access Codes and Computation Codes Jingge Zhu University of California, Berkeley jingge.zhu@berkeley.edu Sung Hoon Lim KIOST shlim@kiost.ac.kr Michael Gastpar EPFL michael.gastpar@epfl.ch
More informationThe Poisson Channel with Side Information
The Poisson Channel with Side Information Shraga Bross School of Enginerring Bar-Ilan University, Israel brosss@macs.biu.ac.il Amos Lapidoth Ligong Wang Signal and Information Processing Laboratory ETH
More informationPerformance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless Networks
Communications and Networ, 2010, 2, 87-92 doi:10.4236/cn.2010.22014 Published Online May 2010 (http://www.scirp.org/journal/cn Performance Analysis of a Threshold-Based Relay Selection Algorithm in Wireless
More informationCell throughput analysis of the Proportional Fair scheduler in the single cell environment
Cell throughput analysis of the Proportional Fair scheduler in the single cell environment Jin-Ghoo Choi and Seawoong Bahk IEEE Trans on Vehicular Tech, Mar 2007 *** Presented by: Anh H. Nguyen February
More informationIN this paper, we show that the scalar Gaussian multiple-access
768 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 50, NO. 5, MAY 2004 On the Duality of Gaussian Multiple-Access and Broadcast Channels Nihar Jindal, Student Member, IEEE, Sriram Vishwanath, and Andrea
More informationTitle. Author(s)Tsai, Shang-Ho. Issue Date Doc URL. Type. Note. File Information. Equal Gain Beamforming in Rayleigh Fading Channels
Title Equal Gain Beamforming in Rayleigh Fading Channels Author(s)Tsai, Shang-Ho Proceedings : APSIPA ASC 29 : Asia-Pacific Signal Citationand Conference: 688-691 Issue Date 29-1-4 Doc URL http://hdl.handle.net/2115/39789
More informationGeneralized Writing on Dirty Paper
Generalized Writing on Dirty Paper Aaron S. Cohen acohen@mit.edu MIT, 36-689 77 Massachusetts Ave. Cambridge, MA 02139-4307 Amos Lapidoth lapidoth@isi.ee.ethz.ch ETF E107 ETH-Zentrum CH-8092 Zürich, Switzerland
More informationMultiuser Capacity in Block Fading Channel
Multiuser Capacity in Block Fading Channel April 2003 1 Introduction and Model We use a block-fading model, with coherence interval T where M independent users simultaneously transmit to a single receiver
More informationOn Comparability of Multiple Antenna Channels
On Comparability of Multiple Antenna Channels Majid Fozunbal, Steven W. McLaughlin, and Ronald W. Schafer School of Electrical and Computer Engineering Georgia Institute of Technology Atlanta, GA 30332-0250
More informationCapacity of Block Rayleigh Fading Channels Without CSI
Capacity of Block Rayleigh Fading Channels Without CSI Mainak Chowdhury and Andrea Goldsmith, Fellow, IEEE Department of Electrical Engineering, Stanford University, USA Email: mainakch@stanford.edu, andrea@wsl.stanford.edu
More informationPERFECTLY secure key agreement has been studied recently
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 45, NO. 2, MARCH 1999 499 Unconditionally Secure Key Agreement the Intrinsic Conditional Information Ueli M. Maurer, Senior Member, IEEE, Stefan Wolf Abstract
More informationSum-Rate Capacity of Poisson MIMO Multiple-Access Channels
1 Sum-Rate Capacity of Poisson MIMO Multiple-Access Channels Ain-ul-Aisha, Lifeng Lai, Yingbin Liang and Shlomo Shamai (Shitz Abstract In this paper, we analyze the sum-rate capacity of two-user Poisson
More informationBinary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity 1
5 Conference on Information Sciences and Systems, The Johns Hopkins University, March 6 8, 5 inary Transmissions over Additive Gaussian Noise: A Closed-Form Expression for the Channel Capacity Ahmed O.
More informationOptimal Power Allocation for Cognitive Radio under Primary User s Outage Loss Constraint
This full text paper was peer reviewed at the direction of IEEE Communications Society subject matter experts for publication in the IEEE ICC 29 proceedings Optimal Power Allocation for Cognitive Radio
More informationOn the Secrecy Capacity of the Z-Interference Channel
On the Secrecy Capacity of the Z-Interference Channel Ronit Bustin Tel Aviv University Email: ronitbustin@post.tau.ac.il Mojtaba Vaezi Princeton University Email: mvaezi@princeton.edu Rafael F. Schaefer
More informationto reprint/republish this material for advertising or promotional purposes
c 8 IEEE Personal use of this material is permitted However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution
More informationClean relaying aided cognitive radio under the coexistence constraint
Clean relaying aided cognitive radio under the coexistence constraint Pin-Hsun Lin, Shih-Chun Lin, Hsuan-Jung Su and Y.-W. Peter Hong Abstract arxiv:04.3497v [cs.it] 8 Apr 0 We consider the interference-mitigation
More informationLecture 7: Wireless Channels and Diversity Advanced Digital Communications (EQ2410) 1
Wireless : Wireless Advanced Digital Communications (EQ2410) 1 Thursday, Feb. 11, 2016 10:00-12:00, B24 1 Textbook: U. Madhow, Fundamentals of Digital Communications, 2008 1 / 15 Wireless Lecture 1-6 Equalization
More informationLecture 4. Capacity of Fading Channels
1 Lecture 4. Capacity of Fading Channels Capacity of AWGN Channels Capacity of Fading Channels Ergodic Capacity Outage Capacity Shannon and Information Theory Claude Elwood Shannon (April 3, 1916 February
More informationSpatial and Temporal Power Allocation for MISO Systems with Delayed Feedback
Spatial and Temporal ower Allocation for MISO Systems with Delayed Feedback Venkata Sreekanta Annapureddy and Srikrishna Bhashyam Department of Electrical Engineering Indian Institute of Technology Madras
More informationThe Optimality of Beamforming: A Unified View
The Optimality of Beamforming: A Unified View Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 92697-2625 Email: sudhirs@uciedu,
More informationOn the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection
On the Low-SNR Capacity of Phase-Shift Keying with Hard-Decision Detection ustafa Cenk Gursoy Department of Electrical Engineering University of Nebraska-Lincoln, Lincoln, NE 68588 Email: gursoy@engr.unl.edu
More informationMinimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading
Minimum Feedback Rates for Multi-Carrier Transmission With Correlated Frequency Selective Fading Yakun Sun and Michael L. Honig Department of ECE orthwestern University Evanston, IL 60208 Abstract We consider
More informationTransmit Directions and Optimality of Beamforming in MIMO-MAC with Partial CSI at the Transmitters 1
2005 Conference on Information Sciences and Systems, The Johns Hopkins University, March 6 8, 2005 Transmit Directions and Optimality of Beamforming in MIMO-MAC with Partial CSI at the Transmitters Alkan
More informationUSING multiple antennas has been shown to increase the
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 55, NO. 1, JANUARY 2007 11 A Comparison of Time-Sharing, DPC, and Beamforming for MIMO Broadcast Channels With Many Users Masoud Sharif, Member, IEEE, and Babak
More informationCapacity Pre-Log of SIMO Correlated Block-Fading Channels
Capacity Pre-Log of SIMO Correlated Block-Fading Channels Wei Yang, Giuseppe Durisi, Veniamin I. Morgenshtern, Erwin Riegler 3 Chalmers University of Technology, 496 Gothenburg, Sweden ETH Zurich, 809
More informationCapacity-achieving Feedback Scheme for Flat Fading Channels with Channel State Information
Capacity-achieving Feedback Scheme for Flat Fading Channels with Channel State Information Jialing Liu liujl@iastate.edu Sekhar Tatikonda sekhar.tatikonda@yale.edu Nicola Elia nelia@iastate.edu Dept. of
More informationWideband Fading Channel Capacity with Training and Partial Feedback
Wideband Fading Channel Capacity with Training and Partial Feedback Manish Agarwal, Michael L. Honig ECE Department, Northwestern University 145 Sheridan Road, Evanston, IL 6008 USA {m-agarwal,mh}@northwestern.edu
More informationDirty Paper Coding vs. TDMA for MIMO Broadcast Channels
TO APPEAR IEEE INTERNATIONAL CONFERENCE ON COUNICATIONS, JUNE 004 1 Dirty Paper Coding vs. TDA for IO Broadcast Channels Nihar Jindal & Andrea Goldsmith Dept. of Electrical Engineering, Stanford University
More informationMismatched Multi-letter Successive Decoding for the Multiple-Access Channel
Mismatched Multi-letter Successive Decoding for the Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@cam.ac.uk Alfonso Martinez Universitat Pompeu Fabra alfonso.martinez@ieee.org
More informationAsymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections
IEEE TRANSACTIONS ON INFORMATION THEORY, SUBMITTED (MAY 10, 2005). 1 Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections arxiv:cs/0505020v1 [cs.it] 10 May 2005
More informationELEC546 Review of Information Theory
ELEC546 Review of Information Theory Vincent Lau 1/1/004 1 Review of Information Theory Entropy: Measure of uncertainty of a random variable X. The entropy of X, H(X), is given by: If X is a discrete random
More informationOn the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels
On the Throughput, Capacity and Stability Regions of Random Multiple Access over Standard Multi-Packet Reception Channels Jie Luo, Anthony Ephremides ECE Dept. Univ. of Maryland College Park, MD 20742
More informationConvexity Properties of Detection Probability for Noncoherent Detection of a Modulated Sinusoidal Carrier
Convexity Properties of Detection Probability for Noncoherent Detection of a Modulated Sinusoidal Carrier Cuneyd Ozturk, Berkan Dulek, Member, IEEE, and Sinan Gezici, Senior Member, IEEE Abstract In this
More informationError Exponent Region for Gaussian Broadcast Channels
Error Exponent Region for Gaussian Broadcast Channels Lihua Weng, S. Sandeep Pradhan, and Achilleas Anastasopoulos Electrical Engineering and Computer Science Dept. University of Michigan, Ann Arbor, MI
More informationPROMPTED by recent results suggesting possible extraordinary
1102 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 4, NO. 3, MAY 2005 On the Capacity of Multiple-Antenna Systems in Rician Fading Sudharman K. Jayaweera, Member, IEEE, and H. Vincent Poor, Fellow,
More informationAsymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections
IEEE TRANSACTIONS ON INFORMATION THEORY, SUBMITTED (MAY 10, 2005). 1 Asymptotic Capacity Results for Non-Stationary Time-Variant Channels Using Subspace Projections arxiv:cs.it/0505020 v1 10 May 2005 Thomas
More informationOn the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels
On the Required Accuracy of Transmitter Channel State Information in Multiple Antenna Broadcast Channels Giuseppe Caire University of Southern California Los Angeles, CA, USA Email: caire@usc.edu Nihar
More informationApproximate Capacity of Fast Fading Interference Channels with no CSIT
Approximate Capacity of Fast Fading Interference Channels with no CSIT Joyson Sebastian, Can Karakus, Suhas Diggavi Abstract We develop a characterization of fading models, which assigns a number called
More informationThe Fading Number of a Multiple-Access Rician Fading Channel
XTNDD VRSION of a Paper in I TRANSACTIONS ON INFORMATION THORY, VOL. 57, NO. 8, AUGUST 011 1 The Fading Nuber of a Multiple-Access Rician Fading Channel Gu-Rong Lin and Stefan M. Moser, Senior Meber, I
More informationCapacity Pre-log of Noncoherent SIMO Channels via Hironaka s Theorem
Capacity Pre-log of Noncoherent SIMO Channels via Hironaka s Theorem Veniamin I. Morgenshtern 22. May 2012 Joint work with E. Riegler, W. Yang, G. Durisi, S. Lin, B. Sturmfels, and H. Bőlcskei SISO Fading
More informationAdvanced Topics in Information Theory
Advanced Topics in Information Theory Lecture Notes Stefan M. Moser c Copyright Stefan M. Moser Signal and Information Processing Lab ETH Zürich Zurich, Switzerland Institute of Communications Engineering
More informationMulti-User Gain Maximum Eigenmode Beamforming, and IDMA. Peng Wang and Li Ping City University of Hong Kong
Multi-User Gain Maximum Eigenmode Beamforming, and IDMA Peng Wang and Li Ping City University of Hong Kong 1 Contents Introduction Multi-user gain (MUG) Maximum eigenmode beamforming (MEB) MEB performance
More informationLecture 5: Antenna Diversity and MIMO Capacity Theoretical Foundations of Wireless Communications 1. Overview. CommTh/EES/KTH
: Antenna Diversity and Theoretical Foundations of Wireless Communications Wednesday, May 4, 206 9:00-2:00, Conference Room SIP Textbook: D. Tse and P. Viswanath, Fundamentals of Wireless Communication
More informationPolar codes for the m-user MAC and matroids
Research Collection Conference Paper Polar codes for the m-user MAC and matroids Author(s): Abbe, Emmanuel; Telatar, Emre Publication Date: 2010 Permanent Link: https://doi.org/10.3929/ethz-a-005997169
More informationPerformance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels
Performance Analysis and Code Optimization of Low Density Parity-Check Codes on Rayleigh Fading Channels Jilei Hou, Paul H. Siegel and Laurence B. Milstein Department of Electrical and Computer Engineering
More informationSingle-User MIMO systems: Introduction, capacity results, and MIMO beamforming
Single-User MIMO systems: Introduction, capacity results, and MIMO beamforming Master Universitario en Ingeniería de Telecomunicación I. Santamaría Universidad de Cantabria Contents Introduction Multiplexing,
More informationThe Noncoherent Rician Fading Channel Part II : Spectral Efficiency in the Low-Power Regime
The Noncoherent Rician Fading Channel Part II : Spectral Efficiency in the Low-Power Regime Mustafa Cenk Gursoy H. Vincent Poor Sergio Verdú arxiv:cs/0501067v1 [cs.it] 24 Jan 2005 Dept. of Electrical Engineering
More information820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY Stefano Rini, Daniela Tuninetti, and Natasha Devroye
820 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 2, FEBRUARY 2012 Inner and Outer Bounds for the Gaussian Cognitive Interference Channel and New Capacity Results Stefano Rini, Daniela Tuninetti,
More informationOn the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation
On the Capacity and Degrees of Freedom Regions of MIMO Interference Channels with Limited Receiver Cooperation Mehdi Ashraphijuo, Vaneet Aggarwal and Xiaodong Wang 1 arxiv:1308.3310v1 [cs.it] 15 Aug 2013
More information5958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010
5958 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 12, DECEMBER 2010 Capacity Theorems for Discrete, Finite-State Broadcast Channels With Feedback and Unidirectional Receiver Cooperation Ron Dabora
More informationEnergy Harvesting Multiple Access Channel with Peak Temperature Constraints
Energy Harvesting Multiple Access Channel with Peak Temperature Constraints Abdulrahman Baknina, Omur Ozel 2, and Sennur Ulukus Department of Electrical and Computer Engineering, University of Maryland,
More informationComputation of Information Rates from Finite-State Source/Channel Models
Allerton 2002 Computation of Information Rates from Finite-State Source/Channel Models Dieter Arnold arnold@isi.ee.ethz.ch Hans-Andrea Loeliger loeliger@isi.ee.ethz.ch Pascal O. Vontobel vontobel@isi.ee.ethz.ch
More informationCapacity of the Discrete Memoryless Energy Harvesting Channel with Side Information
204 IEEE International Symposium on Information Theory Capacity of the Discrete Memoryless Energy Harvesting Channel with Side Information Omur Ozel, Kaya Tutuncuoglu 2, Sennur Ulukus, and Aylin Yener
More informationAn Achievable Error Exponent for the Mismatched Multiple-Access Channel
An Achievable Error Exponent for the Mismatched Multiple-Access Channel Jonathan Scarlett University of Cambridge jms265@camacuk Albert Guillén i Fàbregas ICREA & Universitat Pompeu Fabra University of
More informationMulti-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. X, NO. X, DECEMBER 007 Multi-Antenna Cooperative Wireless Systems: A Diversity-Multiplexing Tradeoff Perspective Melda Yuksel, Student Member, IEEE, and Elza
More informationParallel Additive Gaussian Channels
Parallel Additive Gaussian Channels Let us assume that we have N parallel one-dimensional channels disturbed by noise sources with variances σ 2,,σ 2 N. N 0,σ 2 x x N N 0,σ 2 N y y N Energy Constraint:
More informationTight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels
Tight Lower Bounds on the Ergodic Capacity of Rayleigh Fading MIMO Channels Özgür Oyman ), Rohit U. Nabar ), Helmut Bölcskei 2), and Arogyaswami J. Paulraj ) ) Information Systems Laboratory, Stanford
More informationDegrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel
/33 Degrees-of-Freedom Robust Transmission for the K-user Distributed Broadcast Channel Presented by Paul de Kerret Joint work with Antonio Bazco, Nicolas Gresset, and David Gesbert ESIT 2017 in Madrid,
More informationOn Wiener Phase Noise Channels at High Signal-to-Noise Ratio
On Wiener Phase Noise Channels at High Signal-to-Noise Ratio Hassan Ghozlan Department of Electrical Engineering University of Southern California Los Angeles, CA 989 USA ghozlan@usc.edu Gerhard Kramer
More information672 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 2, FEBRUARY We only include here some relevant references that focus on the complex
672 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 57, NO. 2, FEBRUARY 2009 Ordered Eigenvalues of a General Class of Hermitian Rom Matrices With Application to the Performance Analysis of MIMO Systems Luis
More informationIEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 56, NO. 1, JANUARY
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 56, NO 1, JANUARY 2010 367 Noncoherent Capacity of Underspread Fading Channels Giuseppe Durisi, Member, IEEE, Ulrich G Schuster, Member, IEEE, Helmut Bölcskei,
More informationAnalysis of coding on non-ergodic block-fading channels
Analysis of coding on non-ergodic block-fading channels Joseph J. Boutros ENST 46 Rue Barrault, Paris boutros@enst.fr Albert Guillén i Fàbregas Univ. of South Australia Mawson Lakes SA 5095 albert.guillen@unisa.edu.au
More informationOn the Capacity of MIMO Rician Broadcast Channels
On the Capacity of IO Rician Broadcast Channels Alireza Bayesteh Email: alireza@shannon2.uwaterloo.ca Kamyar oshksar Email: kmoshksa@shannon2.uwaterloo.ca Amir K. Khani Email: khani@shannon2.uwaterloo.ca
More informationarxiv: v4 [cs.it] 17 Oct 2015
Upper Bounds on the Relative Entropy and Rényi Divergence as a Function of Total Variation Distance for Finite Alphabets Igal Sason Department of Electrical Engineering Technion Israel Institute of Technology
More informationAsymptotic Capacity Bounds for Magnetic Recording. Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold)
Asymptotic Capacity Bounds for Magnetic Recording Raman Venkataramani Seagate Technology (Joint work with Dieter Arnold) Outline Problem Statement Signal and Noise Models for Magnetic Recording Capacity
More informationLIKELIHOOD RECEIVER FOR FH-MFSK MOBILE RADIO*
LIKELIHOOD RECEIVER FOR FH-MFSK MOBILE RADIO* Item Type text; Proceedings Authors Viswanathan, R.; S.C. Gupta Publisher International Foundation for Telemetering Journal International Telemetering Conference
More informationThe Impact of Dark Current on the Wideband Poisson Channel
I International Symposium on Information Theory The Impact of Dark Current on the Wideband Poisson Channel Ligong Wang and Gregory W. Wornell Department of lectrical ngineering and Computer Science Massachusetts
More informationDecoupling of CDMA Multiuser Detection via the Replica Method
Decoupling of CDMA Multiuser Detection via the Replica Method Dongning Guo and Sergio Verdú Dept. of Electrical Engineering Princeton University Princeton, NJ 08544, USA email: {dguo,verdu}@princeton.edu
More informationDiversity-Multiplexing Tradeoff in MIMO Channels with Partial CSIT. ECE 559 Presentation Hoa Pham Dec 3, 2007
Diversity-Multiplexing Tradeoff in MIMO Channels with Partial CSIT ECE 559 Presentation Hoa Pham Dec 3, 2007 Introduction MIMO systems provide two types of gains Diversity Gain: each path from a transmitter
More information2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE Mai Vu, Student Member, IEEE, and Arogyaswami Paulraj, Fellow, IEEE
2318 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL. 54, NO. 6, JUNE 2006 Optimal Linear Precoders for MIMO Wireless Correlated Channels With Nonzero Mean in Space Time Coded Systems Mai Vu, Student Member,
More informationSecure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel
Secure Degrees of Freedom of the MIMO Multiple Access Wiretap Channel Pritam Mukherjee Sennur Ulukus Department of Electrical and Computer Engineering University of Maryland, College Park, MD 074 pritamm@umd.edu
More informationInformation Theory for Wireless Communications, Part II:
Information Theory for Wireless Communications, Part II: Lecture 5: Multiuser Gaussian MIMO Multiple-Access Channel Instructor: Dr Saif K Mohammed Scribe: Johannes Lindblom In this lecture, we give the
More informationErgodic and Outage Capacity of Narrowband MIMO Gaussian Channels
Ergodic and Outage Capacity of Narrowband MIMO Gaussian Channels Yang Wen Liang Department of Electrical and Computer Engineering The University of British Columbia April 19th, 005 Outline of Presentation
More informationOn Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength
On Single-Antenna Rayleigh Block-Fading Channels at Finite Blocklength Alejandro ancho, Tobias Koch, and Giuseppe Durisi arxiv:706.07778v3 [cs.it] 0 Dec 08 Abstract This paper concerns the maximum coding
More information4888 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 7, JULY 2016
4888 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 15, NO. 7, JULY 2016 Online Power Control Optimization for Wireless Transmission With Energy Harvesting and Storage Fatemeh Amirnavaei, Student Member,
More informationDispersion of the Gilbert-Elliott Channel
Dispersion of the Gilbert-Elliott Channel Yury Polyanskiy Email: ypolyans@princeton.edu H. Vincent Poor Email: poor@princeton.edu Sergio Verdú Email: verdu@princeton.edu Abstract Channel dispersion plays
More informationLecture 6: Gaussian Channels. Copyright G. Caire (Sample Lectures) 157
Lecture 6: Gaussian Channels Copyright G. Caire (Sample Lectures) 157 Differential entropy (1) Definition 18. The (joint) differential entropy of a continuous random vector X n p X n(x) over R is: Z h(x
More informationAn Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 58, NO. 4, APRIL 2012 2427 An Alternative Proof for the Capacity Region of the Degraded Gaussian MIMO Broadcast Channel Ersen Ekrem, Student Member, IEEE,
More information,... We would like to compare this with the sequence y n = 1 n
Example 2.0 Let (x n ) n= be the sequence given by x n = 2, i.e. n 2, 4, 8, 6,.... We would like to compare this with the sequence = n (which we know converges to zero). We claim that 2 n n, n N. Proof.
More informationVector Channel Capacity with Quantized Feedback
Vector Channel Capacity with Quantized Feedback Sudhir Srinivasa and Syed Ali Jafar Electrical Engineering and Computer Science University of California Irvine, Irvine, CA 9697-65 Email: syed@ece.uci.edu,
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 informationStatistical Beamforming on the Grassmann Manifold for the Two-User Broadcast Channel
6464 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 59, NO. 10, OCTOBER 2013 Statistical Beamforming on the Grassmann Manifold for the Two-User Broadcast Channel Vasanthan Raghavan, Senior Member, IEEE,
More informationA Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback
A Tight Upper Bound on the Second-Order Coding Rate of Parallel Gaussian Channels with Feedback Vincent Y. F. Tan (NUS) Joint work with Silas L. Fong (Toronto) 2017 Information Theory Workshop, Kaohsiung,
More informationCharacterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems
2382 IEEE TRANSACTIONS ON SIGNAL PROCESSING, VOL 59, NO 5, MAY 2011 Characterization of Convex and Concave Resource Allocation Problems in Interference Coupled Wireless Systems Holger Boche, Fellow, IEEE,
More informationAchievable Outage Rate Regions for the MISO Interference Channel
Achievable Outage Rate Regions for the MISO Interference Channel Johannes Lindblom, Eleftherios Karipidis and Erik G. Larsson Linköping University Post Print N.B.: When citing this work, cite the original
More informationOn Convexity of Error Rates in Digital Communications
IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 59, NO. 10, OCTOBER 2013 6501 On Convexity of Error Rates in Digital Communications Sergey Loyka, Victoria Kostina, and Francois Gagnon, Senior Member, IEEE
More informationOn the Throughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States
On the hroughput of Proportional Fair Scheduling with Opportunistic Beamforming for Continuous Fading States Andreas Senst, Peter Schulz-Rittich, Gerd Ascheid, and Heinrich Meyr Institute for Integrated
More informationDuality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels
2658 IEEE TRANSACTIONS ON INFORMATION THEORY, VOL 49, NO 10, OCTOBER 2003 Duality, Achievable Rates, and Sum-Rate Capacity of Gaussian MIMO Broadcast Channels Sriram Vishwanath, Student Member, IEEE, Nihar
More informationGame Theoretic Solutions for Precoding Strategies over the Interference Channel
Game Theoretic Solutions for Precoding Strategies over the Interference Channel Jie Gao, Sergiy A. Vorobyov, and Hai Jiang Department of Electrical & Computer Engineering, University of Alberta, Canada
More informationOn the Relation between Outage Probability and Effective Frequency Diversity Order
Appl. Math. Inf. Sci. 8, No. 6, 2667-267 (204) 2667 Applied Mathematics & Information Sciences An International Journal http://dx.doi.org/0.2785/amis/080602 On the Relation between and Yongjune Kim, Minjoong
More information