No abstract

Roof and Variaya pmved the existence of codes that can communicate reliably over any linear Gaussian channel for which rhe mutual information exceeds the infomation rare of the code. In this paper we demonstrate rhar pmperly designed Low-Densip Parip-Check (LDPC) codes are such codes and that their performance lies in close pmximity ro rhe Root and Variaya capacity for rhe linear Gaussian vecror channels (a.k.a. space-time channels). We also demonstrate rhe robustness of the codes on the panial-band jamming channel and in fasr Rayleigh fading.However, these codes were too short for the sphere packing bound to approach Shannon capacity, and the computational resources for longer random codes were decades away from being broadly accessible.Following (1) indicates that for a given rate R and input distribution there exists a single code that can achieve reliable information transmission at rate R o n every channel H for which the input distribution induces a mutual information (MI) higher than R.The immemate implication of this result is that good error performance on one particular channel does not have to come at the expense of significant performance degradation on others. Codes that have consistently good proximity to capacity (to the extent their blocklength and decoding complexity permit) over a class of channels will he referred to as universal codes in this paper. Since the linear Gaussian vector channels are commonly called space-time channels today, we refer to such codes as universal space-time codes.The capacity promise of multiple-input multiple-output (MIMO) systems in.rich scattering environments [2] makes the existence and use of universal codes of practical interest. In Low-density parity-check (LDPC) codes were proposed by Gallager in the early 1960s [7]. The stmcture of Gallager's codes (uniform column and mw weight) led them to be called regular LDPC codes. Gallager provided simulation results for codes with block lengths on the order of hundreds of bits.California Wugh UC MICRO Grant 03-093Funded by NSF Grant CcR0209110, Texas h s~e n t s . and the Slate of ~. .(around 0.1 bits per real dimension) for all the channels that we examine. For a matrix channel, the excess mutual information per dimension is defined as the capacity margin between the operational channel MI per lransmit antenna and the information transmission rate per transmit antenna.The rest of the paper is organized as follows. Section II describes the partial-hand jamming channel and demonstrates the performance of LDPC in this channel environment. Typical p. EsIN, measures are provided, but an additional technique will he introduced specifically for the purpose of comparison to mutual information. Section 111 presents LDPC performance results across a uniform sampling of 2 x 2 MlMO channels to illustrate the universal property of the codes. The performance of the codes on any specific 2 x 2 quasi-static distribution (for instance Rayleigh) can he inferred from the provided results. Though fast Rayleigh fading does no...

No abstract

No abstract

Foschini's diagonally layered space-time transmission system known as D-BLAST is an architecture designed for a Rayleigh fading environment using multiple element antenna arrays at both the transmit and receive sites to achieve very high spectral efficiencies. In this paper, we propose a simple coding technique for D-BLAST that uses a single trellis code with finite-traceback Viterbi decoding. We examine the performance of universal trellis codes that are designed to have a distance structure that is matched to the periodic signal-to-noise ratio (SNR) variation of the channel created by D-BLAST, under the assumption that the channel is static during one burst but may change from burst to burst. We show that a universal 64-state trellis code on a 2 2 D-BLAST system with long enough blocklengths displays universal behavior working on almost every 2 2 channel with at least the mutual information required by a standard 64-state AWGN trellis code. The only 2 2 channel where more mutual information is required is a certain rotation of the zero eigenvalue channel. We also presnt 4 4 and 8 8 examples.

No abstract

No abstract

No abstract