A.R. Hammons

On the theory of space-time codes for PSK modulation

The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated codewords, which is difficult to relate to traditional code designs over finite fields and rings. We present general binary design criteria for PSK-modulated space-time codes. For linear BPSK/QPSK codes, the rank of (binary projections of) the unmodulated codewords, as binary matrices over the binary field, is a sufficient design criterion: full binary rank guarantees full spatial diversity. This criterion accounts for much of what is currently known about PSK-modulated space-time codes. We develop new fundamental code constructions for both quasi-static and time-varying channels. These are perhaps the first general constructions-other than delay diversity schemes-that guarantee full spatial diversity for an arbitrary number of transmit antennas.

Analyzing the turbo decoder using the Gaussian approximation

We introduce a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as additive white Gaussian noise (AWGN) channels. The technique is based on the observation that the extrinsic information from constituent maximum a posteriori (MAP) decoders is well approximated by Gaussian random variables when the inputs to the decoders are Gaussian. The independent Gaussian model implies the existence of an iterative decoder threshold that statistically characterizes the convergence of the iterative decoder. Specifically, the iterative decoder converges to zero probability of error as the number of iterations increases if and only if the channel E/sub b//N/sub 0/ exceeds the threshold. Despite the idealization of the model and the simplicity of the analysis technique, the predicted threshold values are in excellent agreement with the waterfall regions observed experimentally in the literature when the codeword lengths are large. Examples are given for parallel concatenated convolutional codes, serially concatenated convolutional codes, and the generalized low-density parity-check (LDPC) codes of Gallager and Cheng-McEliece (1996). Convergence-based design of asymmetric parallel concatenated convolutional codes (PCCC) is also discussed.

A new approach to layered space-time coding and signal processing

The information-theoretic capacity of multiple antenna systems has been shown to be significantly higher than that of single antenna systems in Rayleigh-fading channels. In an attempt to realize this capacity, Foschini (1996) proposed the layered space-time architecture. This scheme was argued to asymptotically achieve a lower bound on the capacity. Another line of work has focused on the design of channel codes that exploit the spatial diversity provided by multiple transmit antennas (Tarokh et al. 1998, Hammons and Gamal 2000). In this paper, we take a fresh look at the problem of designing multiple-input-multiple-output (MIMO) wireless systems. First, we develop a generalized framework for the design of layered space-time systems. Then, we present a novel layered architecture that combines efficient algebraic code design with iterative signal processing techniques. This novel layered system is referred to as the threaded space-time (TST) architecture. The TST architecture provides more flexibility in the tradeoff between power efficiency, bandwidth efficiency, and receiver complexity. It also allows for exploiting the temporal diversity provided by time-varying fading channels. Simulation results are provided for the various techniques that demonstrate the superiority of the proposed TST architecture over both the diagonal layered space-time architecture in Foschini (1996) and the multilayering approach (Tarokh et al. (1999).

On the design of algebraic space-time codes for MIMO block-fading channels

The availability of multiple transmit antennas allows for two-dimensional channel codes that exploit the spatial transmit diversity. These codes were referred to as space-time codes by Tarokh et al. (see ibid., vol.44, p.744-765, Mar. 1998) Most prior works on space-time code design have considered quasi-static fading channels. We extend our earlier work on algebraic space-time coding to block-fading channels. First, we present baseband design criteria for space-time codes in multi-input multi-output (MIMO) block-fading channels that encompass as special cases the quasi-static and fast fading design rules. The diversity advantage baseband criterion is then translated into binary rank criteria for phase shift keying (PSK) modulated codes. Based on these binary criteria, we construct algebraic space-time codes that exploit the spatial and temporal diversity available in MIMO block-fading channels. We also introduce the notion of universal space-time codes as a generalization of the smart-greedy design rule. As a part of this work, we establish another result that is important in its own right: we generalize the full diversity space-time code constructions for quasi-static channels to allow for higher rate codes at the expense of minimal reductions in the diversity advantage. Finally, we present simulation results that demonstrate the excellent performance of the proposed codes.

Space-time overlays for convolutionally coded systems

We consider the design of space-time overlays to upgrade single-antenna wireless communication systems to accommodate multiple transmit antennas efficiently. We define the overlay constraint such that the signal transmitted from the first antenna in the upgraded system is the same as that in the single-antenna system. The signals transmitted from the remaining antennas are designed according to space-time coding principles to achieve full spatial diversity in quasi-static flat fading channels. For both binary phase-shift keying (BPSK) and quaternary phase-shift keying modulation systems, we develop an algebraic design framework that exploits the structure of existing single-dimensional convolutional codes in designing overlays that achieve full spatial diversity with minimum additional decoding complexity at the receiver. We also investigate a concatenated coding approach for a BPSK overlay design in which the inner code is an orthogonal block code. This approach is shown to yield near optimal asymptotic performance for quasi-static fading channels. We conclude by offering a brief discussion outlining the extension of the proposed techniques to time-varying block fading channels.

On the design of space-time codes

The design of space-time codes to achieve full spatial diversity over fading channels has largely been addressed by handcrafting example codes using computer search methods and only for small numbers of antennas. The lack of more general designs is in part due to the fact that the diversity advantage of a code is the minimum rank among the complex baseband differences between modulated code words, which is difficult to relate to traditional code designs over finite fields and rings. In this paper, we present general binary design criteria for PSK-modulated space-time codes. For linear BPSK/QPSK codes, the rank of (binary projections of) the unmodulated code words, as binary matrices over the binary field, is a sufficient design criterion: full binary rank guarantees full spatial diversity. This criterion accounts for much of what is currently known about PSK-modulated space-time codes. We develop new fundamental code constructions for both quasi-static and time-varying channels. These are perhaps the first general constructions-other than delay diversity schemes-that guarantee full spatial diversity for an arbitrary number of transmit antennas.

Algebraic space-time overlays for convolutionally coded systems

In this paper, we consider the design of space-time overlays to upgrade single antenna wireless communication systems to accommodate multiple transmit antennas efficiently. We define the overlay constraint such that the signal transmitted from the first antenna in the upgraded system is the same as that in the single antenna system. The signals transmitted from the remaining antennas are designed according to space-time coding principles to achieve full spatial diversity in quasi-static flat fading channels. For both BPSK and QPSK modulated systems, we develop an algebraic design framework that exploits the structure of existing single dimensional convolutional codes in designing overlays that achieve full spatial diversity with minimum additional decoding complexity at the receiver.

Algebraic designs for coherent and differentially coherent space-time codes

The authors previously presented a new space-time architecture combining generalized layered transmission, advanced iterative multi-user detection techniques, and space-time code design that provides superior performance compared to the layered architectures proposed by Foschini (1996) and Tarokh et al. (see IEEE Trans. on Information Theory, vol.IT-44, p.744-65, 1998). We discuss the design of algebraic space-time codes for layered and non-layered architectures. We present new constructions for the quasi-static and block fading channels that extend to the diagonal transmission architecture proposed for differentially coherent space-time coding.

On the design of algebraic space-time overlays

We consider the design of space-time overlays to upgrade single antenna wireless communication systems to efficiently accommodate multiple transmit antennas. We define the overlay constraint such that the signal transmitted from the first antenna in the upgraded system is the same as that in the single antenna system. The signals transmitted from the remaining antennas are designed according to space-time coding principles to achieve full spatial diversity in quasi-static flat fading channels. For both BPSK and QPSK modulated systems, we develop an algebraic design framework that exploits the structure of existing single dimensional convolutional codes in designing overlays that achieve full spatial diversity with minimum additional decoding complexity at the receiver. We also investigate a concatenated coding approach for BPSK overlay design in which the inner code is an orthogonal block code. This approach is shown to yield near optimal asymptotic performance for quasi-static fading channels.

Convergence based design of turbo codes

In earlier work (see IEEE Trans. Inform. Theory, vol.47, no.2, p.671-86, Feb. 2001), we introduced a simple technique for analyzing the iterative decoder that is broadly applicable to different classes of codes defined over graphs in certain fading as well as AWGN channels. This technique is based on the observation that the extrinsic information from constituent MAP decoders is well approximated by Gaussian random variables when the inputs to the decoders are Gaussian. The independent Gaussian model implies the existence of an iterative decoder threshold that statistically characterizes the convergence of the iterative decoder. In this paper, we present an interesting convergence-based construction for asymmetric parallel concatenated convolutional codes.