61 research outputs found
Density of Spherically-Embedded Stiefel and Grassmann Codes
The density of a code is the fraction of the coding space covered by packing
balls centered around the codewords. This paper investigates the density of
codes in the complex Stiefel and Grassmann manifolds equipped with the chordal
distance. The choice of distance enables the treatment of the manifolds as
subspaces of Euclidean hyperspheres. In this geometry, the densest packings are
not necessarily equivalent to maximum-minimum-distance codes. Computing a
code's density follows from computing: i) the normalized volume of a metric
ball and ii) the kissing radius, the radius of the largest balls one can pack
around the codewords without overlapping. First, the normalized volume of a
metric ball is evaluated by asymptotic approximations. The volume of a small
ball can be well-approximated by the volume of a locally-equivalent tangential
ball. In order to properly normalize this approximation, the precise volumes of
the manifolds induced by their spherical embedding are computed. For larger
balls, a hyperspherical cap approximation is used, which is justified by a
volume comparison theorem showing that the normalized volume of a ball in the
Stiefel or Grassmann manifold is asymptotically equal to the normalized volume
of a ball in its embedding sphere as the dimension grows to infinity. Then,
bounds on the kissing radius are derived alongside corresponding bounds on the
density. Unlike spherical codes or codes in flat spaces, the kissing radius of
Grassmann or Stiefel codes cannot be exactly determined from its minimum
distance. It is nonetheless possible to derive bounds on density as functions
of the minimum distance. Stiefel and Grassmann codes have larger density than
their image spherical codes when dimensions tend to infinity. Finally, the
bounds on density lead to refinements of the standard Hamming bounds for
Stiefel and Grassmann codes.Comment: Two-column version (24 pages, 6 figures, 4 tables). To appear in IEEE
Transactions on Information Theor
Geometrical relations between space time block code designs and complexity reduction
In this work, the geometric relation between space time block code design for
the coherent channel and its non-coherent counterpart is exploited to get an
analogue of the information theoretic inequality in
terms of diversity. It provides a lower bound on the performance of
non-coherent codes when used in coherent scenarios. This leads in turn to a
code design decomposition result splitting coherent code design into two
complexity reduced sub tasks. Moreover a geometrical criterion for high
performance space time code design is derived.Comment: final version, 11 pages, two-colum
Coding on Flag Manifolds for Limited Feedback MIMO Systems
The efficiency of the physical layer in modern communication systems using multi-input multi-output (MIMO) techniques is largely based on the availability of channel state information (CSI) at the transmitter. In many practical systems, CSI needs to be quantized at the receiver side before transmission through a limited rate feedback channel. This is typically done using a codebook-based precoding transmission, where the receiver transmits the index of a codeword from a pre-designed codebook shared with the transmitter. To construct such codes one has to discretize complex flag manifolds. For single-user MIMO with a maximum likelihood receiver, the spaces of interest are Grassmann manifolds. With a linear receiver and network MIMO, the codebook design is related to discretization of Stiefel manifolds and more general flag manifolds.
In this thesis, coding in flag manifolds is studied. In a first part, flag manifolds are defined as metric spaces corresponding to subsurfaces of hyperspheres. The choice of distance defines the geometry of the space and impacts clustering and averaging (centroid computation) in vector quantization, as well as coding theoretical packing bounds and optimum constructions.
For two transmitter antenna systems, the problem reduces to designing spherical codes. A simple isomorphism enables to analytically derive closed-form codebooks with inherent low-implementation complexity. For more antennas, the concept of orbits of symmetry groups is investigated. Optimum codebooks, having desirable implementation properties as described in industry standardization, can be obtained using orbits of specific groups.
For large antenna systems and base station cooperation, a product codebook strategy is also considered. Such a design requires to jointly discretize the Grassmann and Stiefel manifolds. A vector quantization algorithm for joint Grassmann-Stiefel quantization is proposed. Finally, the pertinence of flag codebook design is illustrated for a MIMO system with linear receiver
Recommended from our members
A Geometric Framework for Analyzing the Performance of Multiple-Antenna Systems under Finite-Rate Feedback
We study the performance of multiple-antenna systems under finite-rate feedback of some function of the current channel realization from a channel-aware receiver to the transmitter. Our analysis is based on a novel geometric paradigm whereby the feedback information is modeled as a source distributed over a Riemannian manifold. While the right singular vectors of the channel matrix and the subspace spanned by them are located on the traditional Stiefel and Grassmann surfaces, the optimal input covariance matrix is located on a new manifold of positive semi-definite matrices - specified by rank and trace constraints - called the Pn manifold. The geometry of these three manifolds is studied in detail; in particular, the precise series expansion for the volume of geodesic balls over the Grassmann and Stiefel manifolds is obtained. Using these geometric results, the distortion incurred in quantizing sources using either a sphere-packing or a random code over an arbitrary manifold is quantified. Perturbative expansions are used to evaluate the susceptibility of the ergodic information rate to the quality of feedback information, and thereby to obtain the tradeoff of the achievable rate with the number of feedback bits employed. For a given system strategy, the gap between the achievable rates in the infinite and finite-rate feedback cases is shown to be for Grassmann feedback and for other cases, where is the dimension of the manifold used for quantization and is the number of bits used by the receiver per block for feedback. The geometric framework developed enables the results to hold for arbitrary distributions of the channel matrix and extends to all covariance computation strategies including, waterfilling in the short-term/long-term power constraint case, antenna selection and other rank-limited scenarios that could not be analyzed using previous probabilistic approaches
Semidefinite programming, harmonic analysis and coding theory
These lecture notes where presented as a course of the CIMPA summer school in
Manila, July 20-30, 2009, Semidefinite programming in algebraic combinatorics.
This version is an update June 2010
Codebook Design for Limited Feedback Multiple Input Multiple Output Systems
From the past few years, there has been an exponential rise in the communication sector, especially wireless continuously fueled by the demand of higher data rates by users. The concept of multiple input multiple output (MIMO) systems is used extensively in currently deployed technologies to provide necessary data rates. MIMO systems using spatial multiplexing achieves higher data rates without wasting frequency or time resources. This happens even when there is channel state information only at the receiver.
It was observed that the channel knowledge at the transmitter further increases the capacity of a system. Perfect channel state information at the transmitter (CSIT) is generally not feasible in FDD systems, however, partial CSIT may be used to further increase the capacity of a system. This is commonly referred to as pre-coding. In pre-coding, codebooks which are designed off-line and stored, known to both the transmitter and receiver, are used.
The main objective of this thesis pertains to the designing of codebooks and the effect of codebooks on the capacity of limited feedback MIMO systems. A codebook contains code words in the form of matrices and the design of these matrices reduces to a quantization problem on certain manifolds. The algorithm employed for quantizing these manifolds is the Lloyd algorithm, one of the most widely used. We make use of specific geometrical properties of these manifolds to design codebooks.
Previously, much work has been done on designing codebooks by quantizing a Grassmann manifold. Here, an alternate quantization of a permutation invariant flag manifold is considered. We derive semi analytical distortion bounds to evaluate our codebook. Through this work, codebooks thus obtained are used and their effect on capacity is observed and analyzed
- …