相关论文: Algebraic Distributed Space-Time Codes with Low ML…

We propose a new class of space-time block codes based on finite-field rank-metric codes in combination with a rank-metric-preserving mapping to the set of Eisenstein integers. It is shown that these codes achieve maximum diversity order…

We consider the wireless two-way relay channel, in which two-way data transfer takes place between the end nodes with the help of a relay. For the Denoise-And-Forward (DNF) protocol, it was shown by Koike-Akino et. al. that adaptively…

An adaptive randomized distributed space-time coding (DSTC) scheme is proposed for two-hop cooperative MIMO networks. Linear minimum mean square error (MMSE) receiver filters and randomized matrices subject to a power constraint are…

High-rate space-time block codes (STBC with code rate > 1) in multi-input multi-output (MIMO) systems are able to provide both spatial multiplexing gain and diversity gain, but have high maximum likelihood (ML) decoding complexity. Since…

In this paper we consider the diversity-multiplexing gain tradeoff (DMT) of so-called minimum delay asymmetric space-time codes. Such codes are less than full dimensional lattices in their natural ambient space. Apart from the multiple…

Two new rate-one full-diversity space-time block codes (STBC) are proposed. They are characterized by the \emph{lowest decoding complexity} among the known rate-one STBC, arising due to the complete separability of the transmitted symbols…

Low density parity check (LDPC) lattices are obtained from Construction D' and a family of nested binary LDPC codes. We consider an special case of these lattices with one binary LDPC code as underlying code. This special case of LDPC…

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach…

We demonstrate a decoding scheme for nested lattice codes which is able to decode a list of a particular size which contains the transmitted codeword with high probability. This list decoder is analogous to that used in random coding…

We propose two coded schemes for the distributed computing problem of multiplying a matrix by a set of vectors. The first scheme is based on partitioning the matrix into submatrices and applying maximum distance separable (MDS) codes to…

In this paper we consider space-time codes where the code-words are restricted to either real or quaternion matrices. We prove two separate diversity-multiplexing gain trade-off (DMT) upper bounds for such codes and provide a criterion for…

In this work, a new fast-decodable space-time block code (STBC) is proposed. The code is full-rate and full-diversity for 4x2 multiple-input multiple-output (MIMO) transmission. Due to the unique structure of the codeword, the proposed code…

Distributed space time coding for wireless relay networks when the source, the destination and the relays have multiple antennas have been studied by Jing and Hassibi. In this set-up, the transmit and the receive signals at different…

We focus on full-rate, fast-decodable space-time block codes (STBCs) for 2x2 and 4x2 multiple-input multiple-output (MIMO) transmission. We first derive conditions for reduced-complexity maximum-likelihood decoding, and apply them to a…

This paper considers the multi-antenna multiple access relay channel (MARC), in which multiple users transmit messages to a common destination with the assistance of a relay. In a variety of MARC settings, the dynamic decode and forward…

In this paper, we give a new framework for constructing low ML decoding complexity Space-Time Block Codes (STBCs) using codes over the finite field $\mathbb{F}_4$. Almost all known low ML decoding complexity STBCs can be obtained via this…

In this work, we present a construction of a family of space-time block codes for a Multi-Access Amplify-and- Forward Relay channel with two users and a single half-duplex relay. It is assumed that there is no Channel Side Information at…

Binary LDPC coded relay systems have been well studied previously with the assumption of infinite codeword length. In this paper, we deal with non-binary LDPC codes which can outperform their binary counterpart especially for practical…

We construct a class of linear space-time block codes for any number of transmit antennas that have controllable ML decoding complexity with a maximum rate of 1 symbol per channel use. The decoding complexity for $M$ transmit antennas can…

We consider a special family of SC-LDPC codes, that is, time-invariant LDPCC codes, which are known in the literature for a long time. Codes of this kind are usually designed by starting from QC block codes, and applying suitable unwrapping…