Fading-Resilient Super-Orthogonal Space-Time Signal Sets: Can Good Constellations Survive in Fading?

In this correspondence, first-tier indirect (direct) discernible constellation expansions are defined for generalized orthogonal designs. The expanded signal constellation, leading to so-called super-orthogonal codes, allows the achievement of coding gains in addition to diversity gains enabled by orthogonal designs. Conditions that allow the shape of an expanded multidimensional constellation to be preserved at the channel output, on an instantaneous basis, are derived. It is further shown that, for such constellations, the channel alters neither the relative distances nor the angles between signal points in the expanded signal constellation.Comment: 10 pages, 0 figures, 2 tables, uses IEEEtran.cls, submitted to 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 $I(X;S)\le I((X,H);S)$ 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

Abstract algebra, projective geometry and time encoding of quantum information

Algebraic geometrical concepts are playing an increasing role in quantum applications such as coding, cryptography, tomography and computing. We point out here the prominent role played by Galois fields viewed as cyclotomic extensions of the integers modulo a prime characteristic $p$. They can be used to generate efficient cyclic encoding, for transmitting secrete quantum keys, for quantum state recovery and for error correction in quantum computing. Finite projective planes and their generalization are the geometric counterpart to cyclotomic concepts, their coordinatization involves Galois fields, and they have been used repetitively for enciphering and coding. Finally the characters over Galois fields are fundamental for generating complete sets of mutually unbiased bases, a generic concept of quantum information processing and quantum entanglement. Gauss sums over Galois fields ensure minimum uncertainty under such protocols. Some Galois rings which are cyclotomic extensions of the integers modulo 4 are also becoming fashionable for their role in time encoding and mutual unbiasedness.Comment: To appear in R. Buccheri, A.C. Elitzur and M. Saniga (eds.), "Endophysics, Time, Quantum and the Subjective," World Scientific, Singapore. 16 page

Geometric Approach to Digital Quantum Information

We present geometric methods for uniformly discretizing the continuous N-qubit Hilbert space. When considered as the vertices of a geometrical figure, the resulting states form the equivalent of a Platonic solid. The discretization technique inherently describes a class of pi/2 rotations that connect neighboring states in the set, i.e. that leave the geometrical figures invariant. These rotations are shown to generate the Clifford group, a general group of discrete transformations on N qubits. Discretizing the N-qubit Hilbert space allows us to define its digital quantum information content, and we show that this information content grows as N^2. While we believe the discrete sets are interesting because they allow extra-classical behavior--such as quantum entanglement and quantum parallelism--to be explored while circumventing the continuity of Hilbert space, we also show how they may be a useful tool for problems in traditional quantum computation. We describe in detail the discrete sets for one and two qubits.Comment: Introduction rewritten; 'Sample Application' section added. To appear in J. of Quantum Information Processin

Modeling Shallow Water Flows on General Terrains

A formulation of the shallow water equations adapted to general complex terrains is proposed. Its derivation starts from the observation that the typical approach of depth integrating the Navier-Stokes equations along the direction of gravity forces is not exact in the general case of a tilted curved bottom. We claim that an integration path that better adapts to the shallow water hypotheses follows the "cross-flow" surface, i.e., a surface that is normal to the velocity field at any point of the domain. Because of the implicitness of this definition, we approximate this "cross-flow" path by performing depth integration along a local direction normal to the bottom surface, and propose a rigorous derivation of this approximation and its numerical solution as an essential step for the future development of the full "cross-flow" integration procedure. We start by defining a local coordinate system, anchored on the bottom surface to derive a covariant form of the Navier-Stokes equations. Depth integration along the local normals yields a covariant version of the shallow water equations, which is characterized by flux functions and source terms that vary in space because of the surface metric coefficients and related derivatives. The proposed model is discretized with a first order FORCE-type Godunov Finite Volume scheme that allows implementation of spatially variable fluxes. We investigate the validity of our SW model and the effects of the bottom geometry by means of three synthetic test cases that exhibit non negligible slopes and surface curvatures. The results show the importance of taking into consideration bottom geometry even for relatively mild and slowly varying curvatures

Curves on torus layers and coding for continuous alphabet sources

In this paper we consider the problem of transmitting a continuous alphabet discrete-time source over an AWGN channel. The design of good curves for this purpose relies on geometrical properties of spherical codes and projections of $N$-dimensional lattices. We propose a constructive scheme based on a set of curves on the surface of a 2N-dimensional sphere and present comparisons with some previous works.Comment: 5 pages, 4 figures. Accepted for presentation at 2012 IEEE International Symposium on Information Theory (ISIT). 2th version: typos corrected. 3rd version: some typos corrected, a footnote added in Section III B, a comment added in the beggining of Section V and Theorem I adde