Learn More
—The Grassmann manifold G n;p () is the set of all p-dimensional planes (through the origin) in the n-dimensional Euclidean space n , where is either or. This paper considers the quantization problem in which a source in G n;p () is quantized through a code in G n;q (), with p and q not necessarily the same. The analysis is based on the volume of a metric(More)
The general MIMO interference network is considered and is named the B-MAC Network, for it is a combination of multiple interfering broadcast channels and multiaccess channels. Included as special cases are interference channels, X channels, X networks, and most practical wireless networks. The optimization of this important class of networks has been(More)
—In this paper, we propose a combined adaptive power control and beamforming framework for optimizing multiple-input/multiple-output (MIMO) link capacity in the presence of feedback-link capacity constraint. The feedback 1 is assumed to be noiseless and causal with a feedback capacity constraint in terms of maximum number of feedback bits per fading block.(More)
—A coding theorem is proved for memoryless channels when the channel state feedback of finite cardinality can be designed. Channel state information is estimated at the receiver and a function of the estimated channel state is causally fed back to the transmitter. The feedback link is assumed to be noiseless with a finite feedback alphabet, or equivalently,(More)
—Transmit diversity through multiple transmit antennas is generally regarded as beneficial to the link-level performance. In this paper, we shall investigate the role of transmit diversity with respect to the link level and the system-level performance. We focus on the reverse link analysis, where mobile users are assumed to have independent fading, and(More)
— This paper considers the quantization problem on the Grassmann manifold with dimension n and p. The unique contribution is the derivation of a closed-form formula for the volume of a metric ball in the Grassmann manifold when the radius is sufficiently small. This volume formula holds for Grassmann manifolds with arbitrary dimension n and p, while(More)
— This paper considers broadcast channels with L antennas at the base station and m single-antenna users, where each user has perfect channel knowledge and the base station obtains channel information through a finite rate feedback. The key observation of this paper is that the optimal number of on-users (users turned on), say s, is a function of(More)
— We analyze the performance of CDMA signature optimization with finite rate feedback. For a particular user, the receiver selects a signature vector from a signature codebook to avoid the interference from other users, and feeds the corresponding index back to this user through a finite rate and error-free feedback link. We assume the codebook is randomly(More)
This paper proposes a class of full space diversity full rate space-time turbo codes. Both parallel concatenated and serially concatenated codes are designed. The full space diversity design is facilitated by a rank theory. Compared with space-time trellis codes, the simulations show the space-time turbo codes have excellent performance in both quasi-static(More)