High-rate codes that are linear in space and time

Multiple-antenna systems that operate at high rates require simple yet effective space-time transmission schemes to handle the large traffic volume in real time. At rates of tens of bits per second per hertz, Vertical Bell Labs Layered Space-Time (V-BLAST), where every antenna transmits its own independent substream of data, has been shown to have good performance and simple encoding and decoding. Yet V-BLAST suffers from its inability to work with fewer receive antennas than transmit antennas-this deficiency is especially important for modern cellular systems, where a base station typically has more antennas than the mobile handsets. Furthermore, because V-BLAST transmits independent data streams on its antennas there is no built-in spatial coding to guard against deep fades from any given transmit antenna. On the other hand, there are many previously proposed space-time codes that have good fading resistance and simple decoding, but these codes generally have poor performance at high data rates or with many antennas. We propose a high-rate coding scheme that can handle any configuration of transmit and receive antennas and that subsumes both V-BLAST and many proposed space-time block codes as special cases. The scheme transmits substreams of data in linear combinations over space and time. The codes are designed to optimize the mutual information between the transmitted and received signals. Because of their linear structure, the codes retain the decoding simplicity of V-BLAST, and because of their information-theoretic optimality, they possess many coding advantages. We give examples of the codes and show that their performance is generally superior to earlier proposed methods over a wide range of rates and signal-to-noise ratios (SNRs)

Space-Time Signal Design for Multilevel Polar Coding in Slow Fading Broadcast Channels

Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications are non-ergodic. The appropriate measure for designing signals in non-ergodic channels is the outage probability. In this paper, we provide a method to optimize STBCs based on the outage probability at moderate SNRs. Multilevel polar coded-modulation is a new class of coded-modulation techniques that benefits from low complexity decoders and simple rate matching. In this paper, we derive the outage optimality condition for multistage decoding and propose a rule for determining component code rates. We also derive an upper bound on the outage probability of STBCs for designing the set-partitioning-based labelling. Finally, due to the optimality of the outage-minimized STBCs for long codes, we introduce a novel method for the joint optimization of short-to-moderate length polar codes and STBCs

A Purely Symbol-Based Precoded and LDPC-Coded Iterative-Detection Assisted Sphere-Packing Modulated Space-Time Coding Scheme

In this contribution, we propose a purely symbol-based LDPC-coded scheme based on a Space-Time Block Coding (STBC) signal construction method that combines orthogonal design with sphere packing, referred to here as (STBCSP). We demonstrate that useful performance improvements may be attained when sphere packing aided modulation is concatenated with non-binary LDPC especially, when performing purely symbol-based turbo detection by exchanging extrinsic information between the non-binary LDPC decoder and a rate-1 non-binary inner precoder. We also investigate the convergence behaviour of this symbol-based concatenated scheme with the aid of novel non-binary Extrinsic Information Transfer (EXIT) Charts. The proposed symbol-based turbo-detected STBC-SP scheme exhibits a 'turbo-cliff' at Eb/N0 = 5.0 dB and achieves an Eb/N0 gain of 19.2dB at a BER of 10-5 over Alamouti’s scheme

Maximum-rate Transmission with Improved Diversity Gain for Interference Networks

Interference alignment (IA) was shown effective for interference management to improve transmission rate in terms of the degree of freedom (DoF) gain. On the other hand, orthogonal space-time block codes (STBCs) were widely used in point-to-point multi-antenna channels to enhance transmission reliability in terms of the diversity gain. In this paper, we connect these two ideas, i.e., IA and space-time block coding, to improve the designs of alignment precoders for multi-user networks. Specifically, we consider the use of Alamouti codes for IA because of its rate-one transmission and achievability of full diversity in point-to-point systems. The Alamouti codes protect the desired link by introducing orthogonality between the two symbols in one Alamouti codeword, and create alignment at the interfering receiver. We show that the proposed alignment methods can maintain the maximum DoF gain and improve the ergodic mutual information in the long-term regime, while increasing the diversity gain to 2 in the short-term regime. The presented examples of interference networks have two antennas at each node and include the two-user X channel, the interferring multi-access channel (IMAC), and the interferring broadcast channel (IBC).Comment: submitted to IEEE Transactions on Information Theor

Entropic bounds on coding for noisy quantum channels

In analogy with its classical counterpart, a noisy quantum channel is characterized by a loss, a quantity that depends on the channel input and the quantum operation performed by the channel. The loss reflects the transmission quality: if the loss is zero, quantum information can be perfectly transmitted at a rate measured by the quantum source entropy. By using block coding based on sequences of n entangled symbols, the average loss (defined as the overall loss of the joint n-symbol channel divided by n, when n tends to infinity) can be made lower than the loss for a single use of the channel. In this context, we examine several upper bounds on the rate at which quantum information can be transmitted reliably via a noisy channel, that is, with an asymptotically vanishing average loss while the one-symbol loss of the channel is non-zero. These bounds on the channel capacity rely on the entropic Singleton bound on quantum error-correcting codes [Phys. Rev. A 56, 1721 (1997)]. Finally, we analyze the Singleton bounds when the noisy quantum channel is supplemented with a classical auxiliary channel.Comment: 20 pages RevTeX, 10 Postscript figures. Expanded Section II, added 1 figure, changed title. To appear in Phys. Rev. A (May 98