Learn More
LDPC lattices were the first family of lattices that equipped with iterative decoding algorithms under which they perform very well in high dimensions. In this paper, we introduce quasi cyclic low density parity check (QC-LDPC) lattices as a special case of LDPC lattices with one binary QC-LDPC code as their underlying code. These lattices are obtained from(More)
Integer-forcing (IF) linear receiver has been recentl y introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear com­ bination of the s y mbols as a part of the decoding process. In particular, the integer coefficients have to be chosen based on the channel realizations, and the choice of such(More)
—A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multiple-output (MIMO) fading channels, wherein an appropriate integer linear combination of the received symbols has to be computed as a part of the decoding process. In this paper, we propose a method based on Hermite-Korkine-Zolotareff (HKZ) and(More)
—A key issue in compute-and-forward for physical layer network coding scheme is to determine a good function of the received messages to be reliably estimated at the relay nodes. We show that this optimization problem can be viewed as the problem of finding the closest point of Z[i] n to a line in the n-dimensional complex Euclidean space, within a bounded(More)
In this work, we propose phase precoding for the compute-and-forward (CoF) protocol. We derive the phase precoded computation rate and show that it is greater than the original computation rate of CoF protocol without precoder. To maximize the phase precoded computation rate, we need to 'jointly' find the optimum phase precoding matrix and the cor­(More)
—We introduce the concepts of weighted ambiguity and deficiency for a mapping between two finite Abelian groups of the same size. Then, we study the optimum lower bounds of these measures for permutations of an Abelian group. A construction of permutations, by modifying some permutation functions over finite fields, is given. Their ambiguity and deficiency(More)
—The compute-and-forward (CoF) is a relaying protocol , which uses algebraic structured codes to harness the interference and remove the noise in wireless networks. We propose the use of phase precoders at the transmitters of a network, where relays apply CoF strategy. Firstly, we define the phase precoded computation rate and show that it is greater than(More)
—In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers (block(More)
—In this paper a new class of lattices called turbo lattices is introduced and established. We use the lattice Construction D to produce turbo lattices. This method needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our basis codes. Therefore, a set of nested turbo codes based on nested interleavers and nested(More)