On the Mutual Information Distribution of OFDM-Based Spatial Multiplexing: Exact Variance and Outage Approximation

McKay, Matthew R.; Smith, Peter J.; Suraweera, Himal A.; Collings, Iain B.

doi:10.1109/tit.2008.924685

Cited by 71 publications

(56 citation statements)

References 37 publications

(114 reference statements)

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In a cellular network with Rayleigh flat fading, since the achievable rate is modeled by a normally distributed random variable [30], [31], with Lemma 1, Lemma 2 and Corollary 1, we have the following theorem for PFS. Proof: Please refer to Appendix D. We now have the important theoretical result for PFC.…”

Section: B Theoretical Results For Pfs and Pfcmentioning

confidence: 99%

“…Smith and McKay etc. [30], [31] have shown that, in Rayleigh or Ricean fading networks, the achievable rate R = log 2 [1 + SNR] can be approximated modeled by a normally distributed random variable with extremely high accuracy. Specially, for a single-input-singleoutput (SISO) link over a Rayleigh flat fading channel, the Normal distribution is characterized by a mean and variance given as follows Specifically, with (19), (20) and (21), we obtain the Normal distribution that characterizes R…”

Section: Analysis Of Pfc Over a Rayleigh Flat Fading Channelmentioning

confidence: 99%

See 1 more Smart Citation

Relay-Assisted Transmission with Fairness Constraint for Cellular Networks

Liu

Zhang

Leung

2012

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

Abstract-We consider the problem of relay-assisted transmission for cellular networks. In the considered system, a source node together with n relay nodes are selected in a proportionally fair (PF) manner to transmit to the base station (BS), which uses the maximal ratio combining (MRC) to combine the signals received from the source node in the first half slot and the n relay nodes in the second half slot for successful reception. The proposed algorithm incorporates the PF criterion and cooperative diversity, and is called proportionally fair cooperation (PFC). Compared with the proportional fair scheduling (PFS) algorithm, PFC provides improved efficiency and fairness.The ordinary differential equation (ODE) analysis used to study PFS cannot be used for PFC, otherwise one has to solve a large number of nonlinear and interrelated ODE equations which is time-prohibited. In this paper, we present a mathematical framework for the performance of PFC. The cornerstone of our framework is a realistic yet simple model that captures node cooperation, fading, and fair resource allocation-induced dependencies. We obtain analytical expressions for the throughput gain of PFC over traditional PFS without node cooperation. Compared with the highly time-consuming ordinary differential equation (ODE) analysis, our formulae are intuitive yet easy to evaluate numerically.To our knowledge, it is the first time that a closed-form expression is obtained for the throughput of relay-assisted transmission in a cellular network with the PF constraint.

show abstract

Section: B Theoretical Results For Pfs and Pfcmentioning

confidence: 99%

Section: Analysis Of Pfc Over a Rayleigh Flat Fading Channelmentioning

confidence: 99%

Relay-Assisted Transmission with Fairness Constraint for Cellular Networks

Liu

Zhang

Leung

2012

IEEE Trans. on Mobile Comput.

View full text Add to dashboard Cite

show abstract

“…Note that the received signal power has been increased by T N times in formula (14) and thus, the channel capacity is given as 2 2 2 log 1 log 1 In figure 3, result are drawn with vary number of transmit and receive for example NT=NR=1 for SISO system, NT=1 and NR=2 for SIMO system and NT=NR=4 is a MIMO system. It is clear from the figure, that the SIMO and MISO channel has nearly same performance.…”

Section: Csi Is Availed At the Transmitter Sidementioning

confidence: 99%

“…In the sequel, we consider the capacity of the MIMO channel when the channel gains between transmit and received antennas are correlated [6][7][8][9][10]. When the SNR is high, the deterministic channel capacity can be approximated as constrained to be a unity [11][12][13][14][15][16]. From (5), then, the MIMO channel is given as log det log det( ) log det( )…”

Section: Mimo Channel Capacity In the Presence Of Antenna Correlamentioning

confidence: 99%

Ergodic Capacity of MIMO Channel in Multipath Fading Environment

Ahmad¹,

Singh²,

Singh³

2013

IJIEEB

View full text Add to dashboard Cite

Abstract-The demand for the higher bandwidth is continuously increasing, and to cater to wireless communication can be used. The bandwidth has a close relationship with data-rates in turn has a dependency with channel capacity. In this paper, the channel capacity is estimated when CSI is known/not known at the transmitter and it has been shown that the knowledge of the CSI at the transmitter may not be very useful. The channel capacity for the random MIMO channels is also estimated through simulation and outage capacity is discussed. Finally, MIMO channel capacity in the presence of antenna correlation effect is estimated and obtained results are discussed.

show abstract

“…[28] and [29] have shown that, in Rayleigh or Ricean fading networks, the Shannon capacity R = log 2 [1+SNR] can be accurately approximated by Normal distribution. Specially, for a SISO link over a Rayleigh flat fading channel where SNR is exponential distributed, the Normal distribution is characterized by a mean and variance given as follows…”

Section: Analysis Of Pfsc Over a Rayleigh Flat Fading Channelmentioning

confidence: 99%

Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis

Liu

Zhang

Leung

2012

Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

View full text Add to dashboard Cite

Abstract. We consider the problem of 2-node cooperation for cellular networks. In the considered system, a node and a cooperative relay are selected in a proportionally fair (PF) manner to transmit to the base station (BS), which uses the maximal ratio combining (MRC) for reception. The proposed scheme integrates the PF criterion in selective cooperation to maximize the overall utility of all 2-node cooperative transmissions, and is called proportionally fair selective cooperation (PFSC). This technique does not require distributed space-time coding algorithms and its simplicity allows for immediate implementation in existing hardware. In this research, we further provide a mathematical framework to analyze the performance of PFSC under a Rayleigh flat fading channel. We also present an analytical expression for quantifying the throughput gain of a PFSC-enabled cellular network over a traditional PFS-enabled cellular network without node cooperation. Using simulations, we show that our model is very accurate. To our knowledge, it is the first time that a closed-form expression is obtained for the throughput of 2-node cooperative communication in a cellular network with the PF constraint.

show abstract

On the Mutual Information Distribution of OFDM-Based Spatial Multiplexing: Exact Variance and Outage Approximation

Abstract: Index Terms-multiple-input-multiple-output (MIMO) systems, mutual information, orthogonal frequency-division multiplexing (OFDM).

Cited by 71 publications

References 37 publications

Relay-Assisted Transmission with Fairness Constraint for Cellular Networks

Relay-Assisted Transmission with Fairness Constraint for Cellular Networks

Ergodic Capacity of MIMO Channel in Multipath Fading Environment

Proportionally Fair Selective Cooperation for Cellular Networks: Algorithm, Simulation and Analysis

Contact Info

Product

Resources

About