Related papers: Diversity of Low-Density Lattices
This thesis considers infinite constellations in fading channels, without power constraint and with perfect channel state information available at the receiver. Infinite constellations are the framework, proposed by Poltyrev, for analyzing…
We consider explicit constructions of multi-level lattice codes that universally approach the capacity of the compound block-fading channel. Specifically, building on algebraic partitions of lattices, we show how to construct codes with…
In this paper, we design polar codes and polar lattices for i.i.d. fading channels when the channel state information is only available to the receiver. For the binary input case, we propose a new design of polar codes through single-stage…
Block-fading channel (BF) is a useful model for various wireless communication channels in both indoor and outdoor environments. The design of lattices for BF channels offers a challenging problem, which differs greatly from its…
LDPC lattices were the first family of lattices which have an efficient decoding algorithm in high dimensions over an AWGN channel. Considering Construction D' of lattices with one binary LDPC code as underlying code gives the well known…
We study Low-Density Parity-Check (LDPC) codes with iterative decoding on block-fading (BF) Relay Channels. We consider two users that employ coded cooperation, a variant of decode-and-forward with a smaller outage probability than the…
In this work we extend the setting of communication without power constraint, proposed by Poltyrev, to fast fading channels with channel state information (CSI) at the receiver. The optimal codewords density, or actually the optimal…
This paper deals with Low-Density Construction-A (LDA) lattices, which are obtained via Construction A from non-binary Low-Density Parity-Check codes. More precisely, a proof is provided that Voronoi constellations of LDA lattices achieve…
We solve the problem of designing powerful low-density parity-check (LDPC) codes with iterative decoding for the block-fading channel. We first study the case of maximum-likelihood decoding, and show that the design criterion is rather…
Slow fading broadcast channels can model a wide range of applications in wireless networks. Due to delay requirements and the unavailability of the channel state information at the transmitter (CSIT), these channels for many applications…
This paper introduces a novel framework for constructing algebraic lattices based on Construction-D, leveraging nested linear codes and prime ideals from algebraic number fields. We focus on the application of these lattices in block-fading…
This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. A design criterion based on the normalized minimum determinant is proposed…
We propose a coding scheme that achieves the capacity of the compound MIMO channel with algebraic lattices. Our lattice construction exploits the multiplicative structure of number fields and their group of units to absorb ill-conditioned…
We construct explicit rate-one, full-diversity, geometrically dense matrix lattices with large, non-vanishing determinants (NVD) for four transmit antenna multiple-input single-output (MISO) space-time (ST) applications. The constructions…
The outage probability limit is a fundamental and achievable lower bound on the word error rate of coded communication systems affected by fading. This limit is mainly determined by two parameters: the diversity order and the coding gain.…
We consider the problem of using polar codes over slow fading wireless channels. For design, we focus on a parallel slow fading channel with 2 blocks, and polar codes with rate <= 1/2. Motivated by Arikan's systematic polar code…
Due to the advantage of capacity-achieving, polar codes have been extended to the block fading channel whereas most constructions involve complex iterative-calculation. In this paper, we establish a systematic framework to analyze the error…
This paper addresses point-to-point communication over block-fading channels with independent fading blocks. When both channel state information at the transmitter (CSIT) and receiver (CSIR) are available, most achievable schemes use…
This work addresses the question of achieving capacity with lattice codes in multi-antenna block fading channels when the number of fading blocks tends to infinity. In contrast to the standard approach in the literature which employs random…
The fundamental and natural connection between the infinite constellation (IC) dimension and the best diversity order it can achieve is investigated in this paper. In the first part of this work we develop an upper bound on the diversity…