#### Filter Results:

- Full text PDF available (22)

#### Publication Year

2010

2017

- This year (4)
- Last 5 years (24)
- Last 10 years (35)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Amin Sakzad, Emanuele Viterbo, Yi Hong, Joseph Jean Boutros
- 2012 International Symposium on Network Coding…
- 2012

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]<sup>n</sup> to a line in the n-dimensional complex Euclidean space, within a… (More)

- Amin Sakzad, J. Harshan, Emanuele Viterbo
- IEEE Trans. Wireless Communications
- 2013

A new architecture called integer-forcing (IF) linear receiver has been recently proposed for multiple-input multipleoutput (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)

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)

- Amin Sakzad, Emanuele Viterbo, Joseph Jean Boutros, Yi Hong
- 2014 IEEE International Symposium on Information…
- 2014

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 corresponding… (More)

- Daniel Panario, Amin Sakzad, Brett Stevens, Qiang Wang
- IEEE Transactions on Information Theory
- 2011

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)

- Amin Sakzad, Anna-Lena Horlemann-Trautmann, Emanuele Viterbo
- 2015 IEEE Information Theory Workshop (ITW)
- 2015

We introduce cross-packing lattices for Rician fading channels, motivated by a geometric interpretation stemming from the pairwise error probability analysis. We approximate the star bodies arising from the pairwise error probability analysis with n-dimensional crosses of radius t, consisting of 2nt + 1 unit cubes, for some positive integer t. We give a… (More)

- Dmitry Kramarev, Amin Sakzad, Emanuele Viterbo
- Trans. Emerging Telecommunications Technologies
- 2016

- Amin Sakzad, Mohammad-Reza Sadeghi, Daniel Panario
- 2010 48th Annual Allerton Conference on…
- 2010

In this work we introduce and establish the concept of turbo lattices. We employ a routine method for constructing lattices, called Construction D, to construct turbo lattices. This kind of construction needs a set of nested linear codes as its underlying structure. We benefit from turbo codes as our bases codes. Therefore, we first build a set of nested… (More)

- Amin Sakzad, J. Harshan, Emanuele Viterbo
- 2013 Australian Communications Theory Workshop…
- 2013

Integer-forcing (IF) linear receiver has been recently introduced for multiple-input multiple-output (MIMO) fading channels. The receiver has to compute an integer linear combination of the symbols 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)

- Mohammad-Reza Sadeghi, Amin Sakzad
- 2013 Iran Workshop on Communication and…
- 2013

The low-density parity-check (LDPC) lattices perform very well in high dimensions under generalized min-sum iterative decoding algorithm. In this work, we focus on 1-level LDPC lattices. We show that these lattices are the same as lattices constructed based on Construction A and low-density lattice-code (LDLC) lattices. In spite of having slightly lower… (More)