Performance of lattice codes over the Gaussian channel

We derive an upper bound on the error probability of lattice codes combined with Quadrature Amplitude Modulation (qam) over the additive white Gaussian noise channel. This bound depends on a lattice figure of merit and is readily put in exponential form by using Chernoff bound. An interesting lower bound is derived by a similar reasoning. We also examine the estimation of the average information rate based upon the continuous approximation of the average power normalized to two dimensions, and suggest to improve it by using the sphere packing idea. Examples of performance evaluation are given for a few lattices. Finally, we present upper and lower bounds on the best fundamental coding gains per dimension (due to both density and thickness) for an arbitrarily large number of dimensions. It is shown in the Appendix that, as the Ungerboeck codes, the lattice codes do not shape the signal power spectrum.     

Performance of sphere decoding of block codes

A sphere decoder searches for the closest lattice point within a certain search radius. The search radius provides a tradeoff between performance and complexity. We focus on analyzing the performance of sphere decoding of linear block codes. We analyze the performance of soft-decision sphere decoding on AWGN channels and a variety of modulation schemes. A hard-decision sphere decoder is a bounded distance decoder with the corresponding decoding radius. We analyze the performance of hard-decision sphere decoding on binary and q-ary symmetric channels. An upper bound on the performance of maximum-likelihood decoding of linear codes defined over F_q (e.g. Reed- Solomon codes) and transmitted over q-ary symmetric channels is derived and used in the analysis.We then discuss sphere decoding of general block codes or lattices with arbitrary modulation schemes. The tradeoff between the performance and complexity of a sphere decoder is then discussed.     

Lattice code decoder for space-time codes

We explore the lattice sphere packing representation of a multi-antenna system and the algebraic space-time (ST) codes. We apply the sphere decoding (SD) algorithm to the resulted lattice code. For the uncoded system, SD yields, with small increase in complexity, a huge improvement over the well-known V-BLAST detection algorithm. SD of algebraic ST codes exploits the full diversity of the coded multi-antenna system, and makes the proposed scheme very appealing to take advantage of the richness of the multi-antenna environment. The fact that the SD does not depend on the constellation size, gives rise to systems with very high spectral efficiency, maximum-likelihood performance, and low decoding complexity     

Complex Lattice Reduction Algorithm for Low-Complexity Full-Diversity MIMO Detection

Recently, lattice-reduction-aided detectors have been proposed for multiinput multioutput (MIMO) systems to achieve performance with full diversity like the maximum likelihood receiver. However, these lattice-reduction-aided detectors are based on the traditional Lenstra-Lenstra-Lovasz (LLL) reduction algorithm that was originally introduced for reducing real lattice bases, in spite of the fact that the channel matrices are inherently complex-valued. In this paper, we introduce the complex LLL algorithm for direct application to reducing the basis of a complex lattice which is naturally defined by a complex-valued channel matrix. We derive an upper bound on proximity factors, which not only show the full diversity of complex LLL reduction-aided detectors, but also characterize the performance gap relative to the lattice decoder. Our analysis reveals that the complex LLL algorithm can reduce the complexity by nearly 50% compared to the traditional LLL algorithm, and this is confirmed by simulation. Interestingly, our simulation results suggest that the complex LLL algorithm has practically the same bit-error-rate performance as the traditional LLL algorithm, in spite of its lower complexity.     

Real-Domain Decoder for Full-Rate Full-Diversity STBC with Multidimensional Constellations

In this letter, we present a new maximum likelihood (ML) decoding algorithm for space time block codes (STBCs) that employ multidimensional constellations. We start with a lattice representation for STBCs which transforms complex channel models into real matrix equations. Based on the lattice representation, we propose a new decoding algorithm for quasiorthogonal STBCs (QO-STBC) which allows simpleML decoding with performance identical to the conventional ML decoder. Multidimensional rotated constellations are constructed for the QO-STBCs to achieve full diversity. As a consequence, for quasi-orthogonal designs with an arbitrary number of transmit antennas N (N ? 4), the proposed decoding scheme achieves full rate and full diversity while reducing the decoding complexity from ∂(M_c^N/2) to ∂(M_c^N/4) in a M_c-QAM constellation.     

Maximum minimal distance partitioning of the /spl Zopf//sup 2/ lattice

We study the problem of dividing the /spl Zopf//sup 2/ lattice into partitions so that minimal intra-partition distance between the points is maximized. We show that this problem is analogous to the problem of sphere packing. An upper bound on the achievable intra-partition distances for a given number of partitions follows naturally from this observation, since the optimal sphere packing in two dimensions is achieved by the hexagonal lattice. Specific instances of this problem, when the number of partitions is 2/sup m/, were treated in trellis-coded modulation (TCM) code design by Ungerboeck (1982) and others. It is seen that methods previously used for set partitioning in TCM code design are asymptotically suboptimal as the number of partitions increases. We propose an algorithm for solving the /spl Zopf//sup 2/ lattice partitioning problem for an arbitrary number of partitions.     

Vector quantization for entropy coding of image subbands

Vector quantization for entropy coding of image subbands is investigated. Rate distortion curves are computed with mean square error as a distortion criterion. The authors show that full-search entropy-constrained vector quantization of image subbands results in the best performance, but is computationally expensive. Lattice quantizers yield a coding efficiency almost indistinguishable from optimum full-search entropy-constrained vector quantization. Orthogonal lattice quantizers were found to perform almost as well as lattice quantizers derived from dense sphere packings. An optimum bit allocation rule based on a Lagrange multiplier formulation is applied to subband coding. Coding results are shown for a still image.     

Maximal Orders in the Design of Dense Space-Time Lattice Codes

In this paper, we construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, nonvanishing determinants (NVDs) for four transmit antenna multiple-input–single-output (MISO) space-time (ST) applications. The constructions are based on the theory of rings of algebraic integers and related subrings of the Hamiltonian quaternions and can be extended to a larger number of Tx antennas. The usage of ideals guarantees an NVD larger than one and an easy way to present the exact proofs for the minimum determinants. The idea of finding denser sublattices within a given division algebra is then generalized to a multiple-input–multiple-output (MIMO) case with an arbitrary number of Tx antennas by using the theory of cyclic division algebras (CDAs) and maximal orders. It is also shown that the explicit constructions in this paper all have a simple decoding method based on sphere decoding. Related to the decoding complexity, the notion of sensitivity is introduced, and experimental evidence indicating a connection between sensitivity, decoding complexity, and performance is provided. Simulations in a quasi-static Rayleigh fading channel show that our dense quaternionic constructions outperform both the earlier rectangular lattices and the rotated quasi-orthogonal ABBA lattice as well as the diagonal algebraic space-time (DAST) lattice. We also show that our quaternionic lattice is better than the DAST lattice in terms of the diversity-multiplexing gain tradeoff (DMT).      

空时码在Nakagami衰落信道下性能分析

基于Alamouti提出的BPSK调制下空时分组码在Rayleigh衰落信道中的简单分集方案。推导出多发射和多接收天线系统中正交空时分组码在Nakagami衰落信道的BPSK调制下的比特差错率的最小距离球界,并推广到在高阶调制下衰落信道中系统符号差错率的性能。仿真分析和比较了空时分组码的多天线系统中发射和接收天线分集增益,以及信道相关参数的变化对系统误比特性能的影响。     

A unified framework for tree search decoding: rediscovering the sequential decoder

We consider receiver design for coded transmission over linear Gaussian channels. We restrict ourselves to the class of lattice codes and formulate the joint detection and decoding problem as a closest lattice point search (CLPS). Here, a tree search framework for solving the CLPS is adopted. In our framework, the CLPS algorithm is decomposed into the preprocessing and tree search stages. The role of the preprocessing stage is to expose the tree structure in a form matched to the search stage. We argue that the forward and feedback (matrix) filters of the minimum mean-square error decision feedback equalizer (MMSE-DFE) are instrumental for solving the joint detection and decoding problem in a single search stage. It is further shown that MMSE-DFE filtering allows for solving underdetermined linear systems and using lattice reduction methods to diminish complexity, at the expense of a marginal performance loss. For the search stage, we present a generic method, based on the branch and bound (BB) algorithm, and show that it encompasses all existing sphere decoders as special cases. The proposed generic algorithm further allows for an interesting classification of tree search decoders, sheds more light on the structural properties of all known sphere decoders, and inspires the design of more efficient decoders. In particular, an efficient decoding algorithm that resembles the well-known Fano sequential decoder is identified. The excellent performance-complexity tradeoff achieved by the proposed MMSE-DFE Fano decoder is established via simulation results and analytical arguments in several multiple-input multiple-output (MIMO) and intersymbol interference (ISI) scenarios.     

Error Performance of Rotated Phase Shift Keying Modulation over Fading Channels

In this paper, the modulation diversity is used to improve the performance of M-PSK modulation over fading channels. Modulation diversity can be achieved by rotating the signal constellation and using component interleaving. We derive symbol error probability expressions for rotated uncoded M-PSK over Ricean fading channels and obtain optimal rotation angles for M-PSK (M = 2, 4, 8). We show that rotated signal constellations with component interleaving improve the performance of M-PSK significantly as compared to the unrotated one over Rayleigh and Ricean fading channels. For example, when the ratio of the direct path power to the multipath signal power, K is 0 and 10, 8 and 1.5 dB gains are obtained, respectively, at a symbol error probability of 10⁻³ for 8PSK modulation. We also show that as K gets larger, the gain obtained by the rotation rapidly decreases. We develop a new asymmetric 8PSK signal constellation obtained from two QPSK signal constellations that are optimally rotated by different angles. This asymmetric 8PSK and also the rotated 8PSK signal constellation together with component interleaving are applied to four-state trellis-coded schemes. Simulation results show that these new schemes provide good performance improvements over the original TCM schemes and previous relevant works over Rayleigh and Ricean fading channels.     

A union bound on the error probability of binary codes over block-fading channels

Block-fading is a popular channel model that approximates the behavior of different wireless communication systems. In this paper, a union bound on the error probability of binary-coded systems over block-fading channels is proposed. The bound is based on uniform interleaving of the coded sequence prior to transmission over the channel. The distribution of error bits over the fading blocks is computed. For a specific distribution pattern, the pairwise error probability is derived. Block-fading channels modeled as Rician and Nakagami distributions are studied. We consider coherent receivers with perfect and imperfect channel side information (SI) as well as noncoherent receivers employing square-law combining. Throughout the paper, imperfect SI is obtained using pilot-aided estimation. A lower bound on the performance of iterative receivers that perform joint decoding and channel estimation is obtained assuming the receiver knows the correct data and uses them as pilots. From this, the tradeoff between channel diversity and channel estimation is investigated and the optimal channel memory is approximated analytically. Furthermore, the optimal energy allocation for pilot signals is found for different channel memory lengths.     

A Novel Lattice Reduction Precoding Method

In this work, a novel lattice reduction (LR) precoding method is proposed. The technique combines conventional LR precoding with a method of reducing the singular value coefficients of the LR-reduced basis matrix. The performance of the new technique was comparable to that of sphere encoding, while its complexity was lower than that of other sub-optimal methods.     

Diagonal algebraic space-time block codes

We construct a new family of linear space-time (ST) block codes by the combination of rotated constellations and the Hadamard transform, and we prove them to achieve the full transmit diversity over a quasi-static or fast fading channels. The proposed codes transmit at a normalized rate of 1 symbol/s. When the number of transmit antennas n=1, 2, or n is a multiple of four, we spread a rotated version of the information symbol vector by the Hadamard transform and send it over n transmit antennas and n time periods; for other values of n, we construct the codes by sending the components of a rotated version of the information symbol vector over the diagonal of an n × n ST code matrix. The codes maintain their rate, diversity, and coding gains for all real and complex constellations carved from the complex integers ring Z [i], and they outperform the codes from orthogonal design when using complex constellations for n > 2. The maximum-likelihood (ML) decoding of the proposed codes can be implemented by the sphere decoder at a moderate complexity. It is shown that using the proposed codes in a multiantenna system yields good performances with high spectral efficiency and moderate decoding complexity     

Accurate Approximation of QAM Error Probability on Quasi-Static MIMO Channels and Its Application to Adaptive Modulation

An accurate approximation for the conditional error probability on quasi-static multiple-input multiple-output (MIMO) antenna channels is proposed. For a fixed channel matrix, it is possible to accurately predict the performance of quadrature amplitude modulations (QAM) transmitted over the MIMO channel in presence of additive white Gaussian noise. The tight approximation is based on a simple Union bound for the point error probability in the n-dimensional real space. Instead of making an exhaustive evaluation of all pairwise error probabilities (intractable in many cases), a Pohst or a Schnorr-Euchner lattice enumeration is used to limit the local theta series inside a finite radius sphere. The local theta series is derived from the original lattice theta series and the point position within the finite multidimensional QAM constellation. In particular, we take into account the number of constellation facets (hyperplanes) that are crossing the sphere center. As a direct application to the accurate approximation for the conditional error probability, we describe a new adaptive QAM modulation for quasi-static multiple antenna channels     

Performance analysis of adaptive loading OFDM under Rayleigh fading

In this paper, we investigate the performance of adaptive loading orthogonal frequency-division multiplexing (OFDM) under Rayleigh fading with maximal ratio-combining (MRC) diversity at the receiver. We assume that channel-state information is available at both the transmitter and the receiver. Closed-form expressions for the lower bound on the average capacity of OFDM transmission under Rayleigh fading are provided for ideal MRC diversity. Simple approximate expressions for the average capacity of the Rayleigh-fading channel are also provided for the high signal-to-noise ratio (SNR) case. In the second part of this paper, a maximum-rate adaptive-loading strategy is derived for uncoded quadrature-amplitude-modulation modulated OFDM. Simple lower bound expressions and high-SNR approximations are provided for the average spectral efficiency of the maximum-rate adaptive-loaded uncoded OFDM under Rayleigh-fading channel conditions. According to the results, the performance of the uncoded adaptive-loading OFDM is about 8.5 dB inferior to the capacity bound at 10/sup -5/ symbol error probability under frequency-selective Rayleigh fading.     

Universal bound on the performance of lattice codes

We present a lower bound on the probability of symbol error for maximum-likelihood decoding of lattices and lattice codes on a Gaussian channel. The bound is tight for error probabilities and signal-to-noise ratios of practical interest, as opposed to most existing bounds that become tight asymptotically for high signal-to-noise ratios. The bound is also universal; it provides a limit on the highest possible coding gain that may be achieved, at specific symbol error probabilities, using any lattice or lattice code in n dimensions. In particular, it is shown that the effective coding gains of the densest known lattices are much lower than their nominal coding gains. The asymptotic (as n→∞) behavior of the new bound is shown to coincide with the Shannon (1948) limit for Gaussian channels     

Macrocell multiple-input multiple-output system analysis

We develop a semi-deterministic semi-stochastic channel model for the multiple-input multiple-output (MIMO) system under the macrocell environment with local-to-mobile and local-to-base scatterers. We show that employing closely-spaced antennas (e.g., phased array) at the base station is capable of achieving diversity via the local-to-base scatterers, which avoids impractical large aperture requirement for the spatial diversity at the base station. We evaluate the system performance in terms of ergodic capacity, average pairwise error probability (PEP), and signal-to-noise ratio (SNR); derive closed-form expressions for lower and upper bounds on the capacity and PEP; and show that the capacity, multiplexing and diversity gains are limited by the number of multipaths around the base station. The base-station array affects the lower bound on the capacity and the upper bound on the error probability through the same metric; thus, optimal design of the base station array based on this metric will optimize the two different information theoretic measures simultaneously. The fading correlation matrix also appears in the two bounds in the same form. To improve the performance of the macrocell MIMO system, we propose using artificial scatterers and discuss optimal design issues. Numerical examples demonstrate the accuracy of our analytical results and tightness of performance bounds.     

On further reduction of complexity in tree pruning based sphere search

In this letter, we propose an extension of the probabilistic tree pruning sphere decoding (PTP-SD) algorithm that provides further improvement of the computational complexity with minimal extra cost and negligible performance penalty. In contrast to the PTP-SD that considers the tightening of necessary conditions in the sphere search using per-layer radius adjustment, the proposed method focuses on the sphere radius control strategy when a candidate lattice point is found. For this purpose, the dynamic radius update strategy depending on the lattice point found as well as the lattice independent radius selection scheme are jointly exploited. As a result, while maintaining the effectiveness of the PTP-SD, further reduction of the computational complexity, in particular for high SNR regime, can be achieved. From simulations in multiple-input and multiple-output (MIMO) channels, it is shown that the proposed method provides a considerable improvement in complexity with near-ML performance.     

Comparison of iterative decoder performance with union bounds for short frame turbo codes

We consider short frame turbo codes, suitable for delay-sensitive services such as conversational speech, or for encoding single ATM cells. We compare the uniform interleaver bound of Benedetto and Montorsi, and a union bound obtained by estimating the weight distribution due to the actual pseudo-random interleaver, with the simulated BER using an iterative decoder. We show that the uniform interleaver bound is significantly pessimistic at high SNR, where the random interleaver union bound is quite close. However, at lower SNR the ber exceeds the union bound, showing that it does not achieve ml decoding. We also consider half rate turbo codes formed by puncturing various proportions of the data and parity sequences, and adapt the uniform interleaver bounds for these codes. We show that while the union bounds predict better performance for data-punctured codes, in practice they perform better only at high snr and for limited proportions of data puncturing.