Related papers: Lattice Sequential Decoding for LAST Coded MIMO Ch…
Lattice reduction algorithms, such as the LLL algorithm, have been proposed as preprocessing tools in order to enhance the performance of suboptimal receivers in MIMO communications. In this paper we introduce a new kind of lattice…
In a broadcast channel with random packet arrival and transmission queues, the stability of the system is achieved by maximizing a weighted sum rate capacity with suitable weights that depend on the queue size. The weighted sum rate…
Diversity-multiplexing tradeoff (DMT) was characterized asymptotically (SNR-> infinity) for i.i.d. Rayleigh fading channel by Zheng and Tse [1]. The SNR-asymptotic DMT overestimates the finite-SNR one [2]. This paper outlines a number of…
Diversity-Multiplexing tradeoff (DMT) is a coarse high SNR approximation of the fundamental tradeoff between data rate and reliability in a slow fading channel. In this paper, we characterize the fundamental DMT of the two user single…
A family of low-complexity detection schemes based on channel matrix puncturing targeted for large multiple-input multiple-output (MIMO) systems is proposed. It is well-known that the computational cost of MIMO detection based on QR…
This paper re-examines the well-known fundamental tradeoffs between rate and reliability for the multi-antenna, block Rayleigh fading channel in the high signal to noise ratio (SNR) regime when (i) the transmitter has access to (noiseless)…
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 article, the first general constructions of fast-decodable, more specifically (conditionally) $g$-group decodable, space-time block codes for the Nonorthogonal Amplify and Forward (NAF) Multiple-Input Multiple-Output (MIMO) relay…
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…
We study variable-length feedback (VLF) codes over binary-input memoryless symmetric (BMS) channels using posterior matching with small-enough-difference (SED) partitioning. Prior analyses of SED-based schemes rely on bounded log-likelihood…
In this paper, a derandomized algorithm for sampling decoding is proposed to achieve near-optimal performance in lattice decoding. By setting a probability threshold to sample candidates, the whole sampling procedure becomes deterministic,…
Spinal codes are a type of capacity-achieving rateless codes that have been proved to approach the Shannon capacity over the additive white Gaussian noise (AWGN) channel and the binary symmetric channel (BSC). In this paper, we aim to…
This work explores the rate-reliability-complexity limits of the quasi-static K-user multiple access channel (MAC), with or without feedback. Using high-SNR asymptotics, the work first derives bounds on the computational resources required…
In this paper, we consider the information-theoretic characterization of the set of achievable rates and distortions in a broad class of multiterminal communication scenarios with general continuous-valued sources and channels. A framework…
We consider channel coding for discrete memoryless channels (DMCs) with a novel cost constraint that constrains both the mean and the variance of the cost of the codewords. We show that the maximum (asymptotically) achievable rate under the…
Rate and diversity impose a fundamental trade-off in communications. This trade-off was investigated for flat-fading channels in [15] as well as for Inter-symbol Interference (ISI) channels in [1]. A different point of view was explored in…
In this paper, we address the finite Signal-to-Noise Ratio (SNR) Diversity-Multiplexing Tradeoff (DMT) of the Multiple Input Multiple Output (MIMO) wiretap channel, where a Zero-Forcing (ZF) transmit scheme, that intends to send the secret…
An adaptive delay-tolerant distributed space-time coding (DSTC) scheme that exploits feedback is proposed for two-hop cooperative MIMO networks. Maximum likelihood (ML) receivers and adjustable code matrices are considered subject to a…
According to some standards for satellite communications, the transmitted stream is divided into transmission units with variable length, for which detecting the termination is particularly relevant. This is the case of space TeleCommands…
We study the following semi-deterministic setting of the joint source-channel coding problem: a deterministic source sequence (a.k.a. individual sequence) is transmitted via a memoryless channel, using delay-limited encoder and decoder,…