#### DMCA

## On comparability of multiple antenna channels (2004)

Venue: | IEEE Trans. Inform. Theory |

Citations: | 1 - 1 self |

### Citations

2423 | On limits of wireless communications in a fading environment when using multiple antennas
- Foschini, Gans
- 1998
(Show Context)
Citation Context ...hannels is also Gaussian [4], [5], where the encoder uses the same average power over all time instances. Generalizations of the above results to multiple antenna channels are well known [6], [7] and =-=[8]-=-. The capacity and capacity-achieving distributions of fading channels with no channel state information (NCSI) are largely unknown. To the best of our knowledge, [9] was the first rigorous result in ... |

1778 | SpaceTime Codes for High Data Rate Wireless Communications: Performance Criterion and Code Construction
- Tarokh, Seshadri, et al.
- 1998
(Show Context)
Citation Context ... ¯ ∣, we have WG( ¯ H1) c ≼ WG( ¯ H2) c ≼ WG( ¯ H3) c ≼ WG( ¯ H4). 4 Full Channel State Information at the Receiver Now let us move our attention toward fading channels with FCSI at the receiver [4], =-=[28]-=-. From the practical point of view, this represents slowly fading channels where the system allows channel estimation at the receiver. This is possible in block-fading channels with a large coherence ... |

1349 | Information theory: coding theorems for discrete memoryless systems - Csiszar, Körner - 2011 |

583 | Capacity of fading channels with channel side information
- Goldsmith, Varaiya
- 1986
(Show Context)
Citation Context ... available at both the transmitter and the receiver, then the capacity-achieving input distribution is Gaussian, and the optimal encoder employs a power adaptation algorithm (water pouring), see e.g. =-=[1]-=-, [2], and [3]. In contrast, if FCSI is just available at the receiver, the capacity of the channel is known to be the average capacity of a family of additive white Gaussian noise (AWGN) channels whi... |

518 | Variable-rate variable-power MQAM for fading channels
- Goldsmith, Chua
- 1997
(Show Context)
Citation Context ...lable at both the transmitter and the receiver, then the capacity-achieving input distribution is Gaussian, and the optimal encoder employs a power adaptation algorithm (water pouring), see e.g. [1], =-=[2]-=-, and [3]. In contrast, if FCSI is just available at the receiver, the capacity of the channel is known to be the average capacity of a family of additive white Gaussian noise (AWGN) channels which ar... |

494 | Capacity of a mobile multipleantenna communication link in Rayleigh flat fading
- Marzetta, Hochwald
- 1999
(Show Context)
Citation Context ...tion (subject to an average power constraint) for Rayleigh channels. A generalization for Rayleigh multiple antenna channels can be found in [10], along with asymptotic analysis which are provided in =-=[11]-=- and [12]. For Rician channels with NCSI, less in known about capacity. For low signal-to-noise ratio, [13] showed that the capacity-achieving input distribution (subject to second and fourth moment c... |

426 | Fading channels: information-theoretic and communications aspects
- Biglieri, Proakis, et al.
- 1998
(Show Context)
Citation Context ...average capacity of a family of additive white Gaussian noise (AWGN) channels which are parameterized by the channel gain. The capacity-achieving input distribution for such channels is also Gaussian =-=[4]-=-, [5], where the encoder uses the same average power over all time instances. Generalizations of the above results to multiple antenna channels are well known [6], [7] and [8]. The capacity and capaci... |

339 | achievable rates, and sum-rate capacity of Gaussian MIMO broadcast channels
- Vishwanath, Jindal, et al.
- 2003
(Show Context)
Citation Context ... to a set of channels with finite, as follows WG = {WG( ¯ H)|tr ( H¯ H ¯ ′) < ∞}. The results of this section could be helpful in studying multiple antenna Gaussian broadcast channels [25], [26], and =-=[27]-=-. 3.1 Comparison in strong sense Let (WG, s ≼) denote partial ordering of WG in strong sense, where “s” is used as a designation for “strong sense”. Proposition 1. Given a pair of channels WG( ¯ H1) a... |

301 |
Elements of Information Theory, Wiley Series in Telecommunications
- Cover, Thomas
- 1991
(Show Context)
Citation Context ...sible to find simple rules, e.g., for a class of discrete memoryless channels (DMCs) in [16], and for single-input single-output (SISO) Gaussian channels since they are degraded version of each other =-=[24]-=-. In general, such simple rules are not possible, as we shall see for flat-fading MIMO channels. 73 Additive White Gaussian Noise Channels In this section, we consider a class of wireless channels wh... |

272 | Communication on the grassmann manifold: a geometric approach to the noncoherent multiple-antenna channel,” Information Theory
- Zheng, Tse
- 2002
(Show Context)
Citation Context ...ject to an average power constraint) for Rayleigh channels. A generalization for Rayleigh multiple antenna channels can be found in [10], along with asymptotic analysis which are provided in [11] and =-=[12]-=-. For Rician channels with NCSI, less in known about capacity. For low signal-to-noise ratio, [13] showed that the capacity-achieving input distribution (subject to second and fourth moment constraint... |

204 | Adaptive Coded Modulation for Fading Channels,"
- Goldsmith, Chua
- 1998
(Show Context)
Citation Context ...both the transmitter and the receiver, then the capacity-achieving input distribution is Gaussian, and the optimal encoder employs a power adaptation algorithm (water pouring), see e.g. [1], [2], and =-=[3]-=-. In contrast, if FCSI is just available at the receiver, the capacity of the channel is known to be the average capacity of a family of additive white Gaussian noise (AWGN) channels which are paramet... |

176 | Reliable communication under channel uncertainty,” Information Theory
- Lapidoth, Narayan
- 1998
(Show Context)
Citation Context ...ir line-of-sight and scattering components. We believe that these results could also be helpful in information theoretic analysis of compound channels or non-stationary channels [19], [20], [21], and =-=[22]-=-. The organization of this paper is as follows. In Section 2, we present the setup, some 3preliminary definitions, and the goal of this paper. The partial ordering of additive white Gaussian channels... |

145 | Capacity bounds via duality with applications to multiple-antenna systems on flat-fading channels,” Information Theory
- Lapidoth, Moser
- 2003
(Show Context)
Citation Context ...mptotic upper bounds and lower bounds for the capacity are derived in [14], subject to a maximum-power constraint. A novel bounding technique for the capacity of fading channels is also introduced in =-=[15]-=-. 2Despite these advances in capacity assessment of fading channels, the effect of fading parameters (such as the line-of-sight and scattering components) on the capacity of fading channels is not co... |

123 |
The capacity of discrete-time memoryless Rayleigh-fading channels
- Abou-Faycal, Shamai, et al.
- 2001
(Show Context)
Citation Context ...nnels are well known [6], [7] and [8]. The capacity and capacity-achieving distributions of fading channels with no channel state information (NCSI) are largely unknown. To the best of our knowledge, =-=[9]-=- was the first rigorous result in this area that addressed the capacity-achieving input distribution (subject to an average power constraint) for Rayleigh channels. A generalization for Rayleigh multi... |

111 |
Capacity of multi-antenna Gaussian channels
- Teletar
- 1995
(Show Context)
Citation Context ...r such channels is also Gaussian [4], [5], where the encoder uses the same average power over all time instances. Generalizations of the above results to multiple antenna channels are well known [6], =-=[7]-=- and [8]. The capacity and capacity-achieving distributions of fading channels with no channel state information (NCSI) are largely unknown. To the best of our knowledge, [9] was the first rigorous re... |

78 |
Probability Inequalities in Multivariate Distributions.
- Tong
- 1980
(Show Context)
Citation Context ...function f : X → R is said to be symmetric about the origin if f(x) = f(−x) for all x ∈ X. Correspondingly, a set A ⊂ X is called symmetric if its characteristic function χA : X → {0, 1} is symmetric =-=[32]-=-. Let G ⊂ U(n) be a finite subgroup. We say that f is G -invariant if f(x) = f(g(x)) for all x ∈ X and all g ∈ G . A set is said G -invariant if its characteristic function be G -invariant. We restate... |

37 | On the capacity of the multiple antenna broadcast channel
- Viswanath, Tse
- 2002
(Show Context)
Citation Context ...strain ourselves to a set of channels with finite, as follows WG = {WG( ¯ H)|tr ( H¯ H ¯ ′) < ∞}. The results of this section could be helpful in studying multiple antenna Gaussian broadcast channels =-=[25]-=-, [26], and [27]. 3.1 Comparison in strong sense Let (WG, s ≼) denote partial ordering of WG in strong sense, where “s” is used as a designation for “strong sense”. Proposition 1. Given a pair of chan... |

33 | Arbitrarily varying channels with constrained inputs and states
- Csiszár, Narayan
- 1988
(Show Context)
Citation Context ...stigation on their line-of-sight and scattering components. We believe that these results could also be helpful in information theoretic analysis of compound channels or non-stationary channels [19], =-=[20]-=-, [21], and [22]. The organization of this paper is as follows. In Section 2, we present the setup, some 3preliminary definitions, and the goal of this paper. The partial ordering of additive white G... |

26 |
Simultaneous channels.
- Wolfowitz
- 1960
(Show Context)
Citation Context ...e investigation on their line-of-sight and scattering components. We believe that these results could also be helpful in information theoretic analysis of compound channels or non-stationary channels =-=[19]-=-, [20], [21], and [22]. The organization of this paper is as follows. In Section 2, we present the setup, some 3preliminary definitions, and the goal of this paper. The partial ordering of additive w... |

21 |
Arbitrarily varying channels with general alphabets and states
- Csiszár
- 1992
(Show Context)
Citation Context ...ion on their line-of-sight and scattering components. We believe that these results could also be helpful in information theoretic analysis of compound channels or non-stationary channels [19], [20], =-=[21]-=-, and [22]. The organization of this paper is as follows. In Section 2, we present the setup, some 3preliminary definitions, and the goal of this paper. The partial ordering of additive white Gaussia... |

12 |
On the capacity achieving distributions of some fading channels,” Fortieth Annu
- Palanki
(Show Context)
Citation Context ...s area that addressed the capacity-achieving input distribution (subject to an average power constraint) for Rayleigh channels. A generalization for Rayleigh multiple antenna channels can be found in =-=[10]-=-, along with asymptotic analysis which are provided in [11] and [12]. For Rician channels with NCSI, less in known about capacity. For low signal-to-noise ratio, [13] showed that the capacity-achievin... |

8 |
On the Capacity of Some Channels with Channel Side Information
- Caire, Shamai
- 1999
(Show Context)
Citation Context ...ge capacity of a family of additive white Gaussian noise (AWGN) channels which are parameterized by the channel gain. The capacity-achieving input distribution for such channels is also Gaussian [4], =-=[5]-=-, where the encoder uses the same average power over all time instances. Generalizations of the above results to multiple antenna channels are well known [6], [7] and [8]. The capacity and capacity-ac... |

7 |
Ecient signaling for low-power Rician fading channels
- Gursoy, Poor, et al.
- 2002
(Show Context)
Citation Context ... antenna channels can be found in [10], along with asymptotic analysis which are provided in [11] and [12]. For Rician channels with NCSI, less in known about capacity. For low signal-to-noise ratio, =-=[13]-=- showed that the capacity-achieving input distribution (subject to second and fourth moment constraints) is discrete. Asymptotic upper bounds and lower bounds for the capacity are derived in [14], sub... |

5 | On space-time coding in the presence of spatiotemporal correlation
- Fozunbal, McLaughlin, et al.
- 2004
(Show Context)
Citation Context ...alized density functions, the channel is known as Rician. For the case of Rician channels, the non-central element represents the effect of line-of-sight component of the channel [4], [29], [28], and =-=[30]-=-. On the other hand the covariance matrix of the density function denotes the scattering component of the channel which is due to fading [29] and the 11correlation between the propagation paths of di... |

4 | On the asymptotic capacity of fading channels
- Lapidoth
- 2003
(Show Context)
Citation Context ...tio, [13] showed that the capacity-achieving input distribution (subject to second and fourth moment constraints) is discrete. Asymptotic upper bounds and lower bounds for the capacity are derived in =-=[14]-=-, subject to a maximum-power constraint. A novel bounding technique for the capacity of fading channels is also introduced in [15]. 2Despite these advances in capacity assessment of fading channels, ... |

3 |
A note on partial ordering for communication channels,” Information and control
- Shannon
- 1958
(Show Context)
Citation Context .... For example, if the capacity of a specific fading channel is known, what can one say about the capacity for some other fading channel? Such investigations are known for discrete memoryless channels =-=[16]-=- and AWGN channels. For example, in binary symmetric channels, as the crossover probability increases to .5, the channel degrades and the capacity of the channel decreases. Likewise, as the channel ga... |

3 |
Matrix Groups. Universitext
- Curtis
- 1984
(Show Context)
Citation Context ...set of all unitary matrices is called the unitary group defined as U(n) = {A ∈ Mn(C)| |det A| = 1}. (8) It is not difficult to verify that U(n) forms a group under the action of matrix multiplication =-=[31]-=-. A.2 Integral inequalities Let X = Cn . A positive real valued function f : X → R + is said to be unimodal if the set Du = {x ∈ X|f(x) ≥ u} is convex for all u ≥ 0. A function f : X → R is said to be... |