Yair Yona

Learn More
A new efficient parametric algorithm for implementing the low density lattice codes belief propagation decoder is presented. In the new algorithm the messages passed over the edges are represented by Gaussian parameters lists, and the decoding algorithm uses the low density lattice codes propagation properties in order to group lists efficiently according(More)
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 paper, we develop an upper bound on the diversity order of ICs for any dimension and any number of transmit and receive antennas. By choosing the right dimensions, we(More)
Embedded sensing systems are pervasively used in life- and security-critical systems such as those found in airplanes, automobiles, and healthcare. Traditional security mechanisms for these sensors focus on data encryption and other post-processing techniques, but the sensors themselves often remain vulnerable to attacks in the physical/analog domain. If an(More)
Stability has always been one of the major limitations that constraints Physical Unclonable Function (PUF) from being put in widespread practical use. In this paper, we propose a weak PUF and a strong PUF that are both completely stable with 0% intra-distance. These PUFs are called Locally Enhanced Defectivity Physical Unclonable Function (LEDPUF). A LEDPUF(More)
An extension of the class of low density lattice codes (LDLC's) to the complex case (i.e. complex lattices) is presented. We propose an extended belief-propagation decoding algorithm and present a complex parametric decoder. The complex decoder attains better performance for small dimensions, and for LDLC's with small degrees. This extension is also(More)
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 order of IC for any dimension and any number of transmit and receive antennas. In the second part of this work we prove(More)
A max-product algorithm for approximating maximum-likelihood lattice decoding of low density lattice codes is derived, operating directly in the Euclidean space. First we derive the max-product algorithm for continuous channels by taking a factor graph based approach. Then, for the additive white Gaussian noise channel we show the relation between the(More)
In this paper, the optimal diversity-multiplexing tradeoff (DMT) is investigated for the multiple-input multiple-output fading multiple-access channel with no power constraints (infinite constellations). For K users (K > 1), M transmit antennas for each user, and N receive antennas, infinite constellations in general and lattices in particular are shown(More)
A long-standing question in coding theory is whether code ensembles having a low-density parity check (LDPC) matrix can attain capacity under belief propagation (BP) decoding. An affirmative answer to this problem was recently given by the special class of spatially-coupled LDPC code ensemble. In this work, we provide a simple derivation of a different LDPC(More)