3,919 research outputs found
DMT Optimality of LR-Aided Linear Decoders for a General Class of Channels, Lattice Designs, and System Models
The work identifies the first general, explicit, and non-random MIMO
encoder-decoder structures that guarantee optimality with respect to the
diversity-multiplexing tradeoff (DMT), without employing a computationally
expensive maximum-likelihood (ML) receiver. Specifically, the work establishes
the DMT optimality of a class of regularized lattice decoders, and more
importantly the DMT optimality of their lattice-reduction (LR)-aided linear
counterparts. The results hold for all channel statistics, for all channel
dimensions, and most interestingly, irrespective of the particular lattice-code
applied. As a special case, it is established that the LLL-based LR-aided
linear implementation of the MMSE-GDFE lattice decoder facilitates DMT optimal
decoding of any lattice code at a worst-case complexity that grows at most
linearly in the data rate. This represents a fundamental reduction in the
decoding complexity when compared to ML decoding whose complexity is generally
exponential in rate.
The results' generality lends them applicable to a plethora of pertinent
communication scenarios such as quasi-static MIMO, MIMO-OFDM, ISI,
cooperative-relaying, and MIMO-ARQ channels, in all of which the DMT optimality
of the LR-aided linear decoder is guaranteed. The adopted approach yields
insight, and motivates further study, into joint transceiver designs with an
improved SNR gap to ML decoding.Comment: 16 pages, 1 figure (3 subfigures), submitted to the IEEE Transactions
on Information Theor
Iterative decoding for MIMO channels via modified sphere decoding
In recent years, soft iterative decoding techniques have been shown to greatly improve the bit error rate performance of various communication systems. For multiantenna systems employing space-time codes, however, it is not clear what is the best way to obtain the soft information required of the iterative scheme with low complexity. In this paper, we propose a modification of the Fincke-Pohst (sphere decoding) algorithm to estimate the maximum a posteriori probability of the received symbol sequence. The new algorithm solves a nonlinear integer least squares problem and, over a wide range of rates and signal-to-noise ratios, has polynomial-time complexity. Performance of the algorithm, combined with convolutional, turbo, and low-density parity check codes, is demonstrated on several multiantenna channels. The results for systems that employ space-time modulation schemes seem to indicate that the best performing schemes are those that support the highest mutual information between the transmitted and received signals, rather than the best diversity gain
Thermalization, Error-Correction, and Memory Lifetime for Ising Anyon Systems
We consider two-dimensional lattice models that support Ising anyonic
excitations and are coupled to a thermal bath. We propose a phenomenological
model for the resulting short-time dynamics that includes pair-creation,
hopping, braiding, and fusion of anyons. By explicitly constructing topological
quantum error-correcting codes for this class of system, we use our
thermalization model to estimate the lifetime of the quantum information stored
in the encoded spaces. To decode and correct errors in these codes, we adapt
several existing topological decoders to the non-Abelian setting. We perform
large-scale numerical simulations of these two-dimensional Ising anyon systems
and find that the thresholds of these models range between 13% to 25%. To our
knowledge, these are the first numerical threshold estimates for quantum codes
without explicit additive structure.Comment: 34 pages, 9 figures; v2 matches the journal version and corrects a
misstatement about the detailed balance condition of our Metropolis
simulations. All conclusions from v1 are unaffected by this correctio
- …