Related papers: On the Sphere Decoding Complexity of STBCs for Asy…
The 3D MIMO code is a robust and efficient space-time coding scheme for the distributed MIMO broadcasting. However, it suffers from the high computational complexity if the optimal maximum-likelihood (ML) decoding is used. In this paper we…
Design of Space-Time Block Codes (STBCs) for Maximum Likelihood (ML) reception has been predominantly the main focus of researchers. However, the ML decoding complexity of STBCs becomes prohibitive large as the number of transmit and…
The new generation of telecommunication systems must provide acceptable data rates and spectral efficiency for new applications. Recently massive MIMO has been introduced as a key technique for the new generation of telecommunication…
For a family/sequence of STBCs $\mathcal{C}_1,\mathcal{C}_2,\dots$, with increasing number of transmit antennas $N_i$, with rates $R_i$ complex symbols per channel use (cspcu), the asymptotic normalized rate is defined as $\lim_{i \to…
Recent work by Polyanskiy et al. and Chen et al. has excited new interest in using feedback to approach capacity with low latency. Polyanskiy showed that feedback identifying the first symbol at which decoding is successful allows capacity…
Motivated by the recent developments in the Space Shift Keying (SSK) and Spatial Modulation (SM) systems which employ Time-Orthogonal Pulse Shaping (TOPS) filters to achieve transmit diversity gains, we propose TOPS for Space-Time Block…
In this paper, we consider a quasi-orthogonal (QO) space-time block code (STBC) with minimum decoding complexity (MDC-QO-STBC). We formulate its algebraic structure and propose a systematic method for its construction. We show that a…
Sphere decoding (SD) is a low complexity maximum likelihood (ML) detection algorithm, which has been adapted for different linear channels in digital communications. The complexity of the SD has been shown to be exponential in some cases,…
Supporting ultra-reliable and low-latency communication (URLLC) is a challenge in current wireless systems. Channel codes that generate large codewords improve reliability but necessitate the use of interleavers, which introduce undesirable…
For an $n_t$ transmit, $n_r$ receive antenna system ($n_t \times n_r$ system), a {\it{full-rate}} space time block code (STBC) transmits $n_{min} = min(n_t,n_r)$ complex symbols per channel use. The well known Golden code is an example of a…
The use of Space-Time Block Codes (STBCs) increases significantly the optimal detection complexity at the receiver unless the low-complexity decodability property is taken into consideration in the STBC design. In this paper we propose a…
Precoding for multiple-input, multiple-output (MIMO) antenna systems is considered with perfect channel knowledge available at both the transmitter and the receiver. For 2 transmit antennas and QAM constellations, an approximately optimal…
Construction of high rate Space Time Block Codes (STBCs) with low decoding complexity has been studied widely using techniques such as sphere decoding and non Maximum-Likelihood (ML) decoders such as the QR decomposition decoder with M…
In the presence of multiple senders, one of the simplest decoding strategies that can be employed by a receiver is successive decoding. In a successive decoding strategy, the receiver decodes the messages one at a time using the knowledge…
Perfect Space-Time Block Codes (PSTBCs) achieve full diversity, full rate, nonvanishing constant minimum determinant, uniform average transmitted energy per antenna, and good shaping. However, the high decoding complexity is a critical…
The work identifies the first lattice decoding solution that achieves, in the general outage-limited MIMO setting and in the high-rate and high-SNR limit, both a vanishing gap to the error-performance of the (DMT optimal) exact solution of…
Full-rate space time codes (STC) with rate = number of transmit antennas have high multiplexing gain, but high decoding complexity even when decoded using reduced-complexity decoders such as sphere or QRDM decoders. In this paper, we…
Space Time Block Codes (STBCs) from orthogonal designs have attracted significant interest in recent years. However, with the growing demand for higher capacity schemes, the multiantenna transmission techniques must support and achieve…
We derive a sphere-packing error exponent for coded transmission over discrete memoryless channels with a fixed decoding metric. By studying the error probability of the code over an auxiliary channel, we find a lower bound to the…
Reliable and low latency multicast communication is important for future vehicular communication. Sparse random linear network coding approach used to ensure the reliability of multicast communication has been widely investigated. A…