EZEphraim Zehavi

Ephraim Zehavi

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article

Previous Organizations / Institutes

The organizations / institutes from the scholar's other articles in the past ten years


Ephraim Zehavi has a total of 36 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Downlink Cooperative MIMO in LEO Satellites

    by Rei Richter, Itsik Bergel, Yair Noam, Ephraim Zehavi

    We consider a communication scheme in which two low earth orbit (LEO) satellites jointly transmit (at the same time and frequency) to a multi antenna land terminal (LT). This scheme can increase the achievable terminal throughput by up to a factor of 2, depending on the channel matrices. The implementation aspects of this scheme are well-known but the usefulness of this scheme for LEO satellites has yet to be studied. Because the satellite channel is dominated by its line-of-sight (LOS) component, the terminal’s ability to separate the two streams depends critically on the system’s instantaneous-configuration; i.e., the relative location of the satellites and the terminal antennas. Since the relative locations of LEO satellites vary rapidly, the throughput characterization is not straightforward. To characterize the network performance we consider two satellites having one antenna, transmitting to a single LT having multiple antennas. We introduce a novel stochastic framework that assumes the terminal orientation as random. Using the proposed framework, we show that if the terminal antennas are close, the network throughput is nearly independent of the terminal orientation. When the terminal antennas are sufficiently separated, the result is completely different. For this case, we define an outage event and calculate the outage probability. The definition of outage in our novel stochastic framework allows us to prove that dual satellite transmission can indeed increase the downlink throughput with high probability.


  • Open Access

    On the allocation of multiple divisible assets to players with different utilities

    by Ephraim Zehavi, Amir Leshem

    When there is a dispute between players on how to divide multiple divisible assets, how should it be resolved? In this paper we introduce a multi-asset game model that enables cooperation between multiple agents who bargain on sharing K assets, when each player has a different value for each asset. It thus extends the sequential discrete Raiffa solution and the Talmud rule solution to multi-asset cases. keyword: resource allocation, game theory, Raiffa Bargaining Solution, Aumann Bankruptcy, non-transferable commodities

  • Non-asymptotic performance bounds of eigenvalue based detection of signals in non-Gaussian noise

    by Ron Heimann, Amir Leshem, Ephraim Zehavi, Anthony J. Weiss

    The core component of a cognitive radio is its detector. When a device is equipped with multiple antennas, the detection method is usually based on an eigenvalue analysis. This paper explores the performance of the most common largest eigenvalue detector, for the case of a narrowband temporally white signal and calibrated receiver noise. In contrast to popular Gaussian assumption, our performance bounds are valid for any signal and noise that belong to the wide class of sub-Gaussian random processes. Moreover, the results are given in closed-form for any finite number of observations and antennas, in contrary to the widespread asymptotic analysis approach.


  • Robust Turbo Analog Error Correcting Codes Based on Analog CRC Verification

    by Avi Zanko, Amir Leshem, Ephraim Zehavi

    In this paper, a new analog error correcting code with an iterative decoder is presented for real-valued signals corrupted by impulsive noises. In the proposed algorithm, a redundancy coding matrix is implemented as an analog version of the cyclic redundancy check (CRC) that is commonly used for data verification in digital communication. On the basis of this analog CRC, we propose an alternate decoding scheme with iterative decoding. In each iteration of the algorithm, the problem of decoding the long block code is decoupled into a set of parallel LP/LASSO subproblems. In the sparse noise model, this leads to a significant reduction in decoding complexity as compared to one-step convex programming decoding. The new code has improved correction capability compared to Zanko et al. In the almost sparse noise model, energy detectors are used to verify the decoding correctness of the inner code before transferring the result to the next iteration. In this case, the Turbo decoder shows little loss compared to the oracle bound based on least squares when the impulsive noises are perfectly known at the receiver.


  • Upper Bound on the Ergodic Rate Density of ALOHA Wireless Ad-Hoc Networks

    by Yaniv George, Itsik Bergel, Ephraim Zehavi

    We present a novel upper bound on the Ergodic Rate Density (ERD) of ALOHA wireless ad-hoc networks. Our analysis uses a proper model of the physical layer together with an abstraction of higher communication layers. The novel bound is very general and supports various system models including for example, beamforming, spatial multiplexing, different fading models and different power control schemes. We also derive a closed form expression for the maximal gap between the novel bound and a known lower bound on the ERD. This maximal gap holds for any network that operates below the optimal density. This expression is simple to evaluate and only depends on the path loss factor. For example, for a path loss factor of α = 3 the novel upper bound is proved to be at most 31% higher than the lower bound (and hence also from the actual ERD). The usefulness and the generality of the novel bound is demonstrated by applications in multiple-antenna schemes. In particular, we study the optimization of the number of transmitted spatial streams in a MIMO network and derive the scaling of the ERD as the number of antennas grows. The results are further demonstrated using extensive simulations.


  • Iterative decoding of robust analog product codes

    by Avi Zanko, Amir Leshem, Ephraim Zehavi

    In this paper, a new robust analog error correcting code with an iterative decoder is proposed for real-valued signals corrupted by impulsive noises (sparse signal) in the presence of small additive noise affecting all the entries of the received signal. In each iteration of the algorithm, the problem of decoding the long block code is decoupled into a set of parallel LASSO subproblems in order to locate the impulsive errors. Then, the information is decoded by solving the appropriate least squares (LS) problem. Under the almost sparse noise model, simulation results show that the proposed algorithm exhibits little loss compared to the ideal least squares when the impulsive noises are perfectly known at the receiver.


  • Turbo analog error correcting codes based on analog CRC

    by Avi Zanko, Amir Leshem, Ephraim Zehavi

    In this paper, a new analog error correcting code with an iterative decoder is presented for real-valued signals corrupted by impulsive noises. In the proposed algorithm, a redundancy coding matrix is used as an analog version of the cyclic redundancy check (CRC) that is commonly used for data verification in digital communication. Using this analog CRC enables an alternate decoding scheme in which iterative decoding is possible without transferring new errors between consecutive iterations. In each iteration of the algorithm, the problem of decoding the long block code is decoupled into two sets of parallel small linear programming problems. Simulation results show that this leads to a reduction in decoding complexity as compared to one-step linear programming decoding.


  • The Ergodic Rate Density of MIMO Ad-hoc Networks

    by Yaniv George, Itsik Bergel, Ephraim Zehavi

    We analyze the scaling laws of the Ergodic Rate Density (ERD) in ALOHA Wireless Ad-hoc Networks (WANETs) that utilize Multiple-In-Multiple-Out (MIMO) techniques. We present a novel lower bound that support spatial-multiplexing, interference-cancellation and beamforming. The bound is used to present expressions of the optimum system parameters as function of the number of antennas and the path-loss factor. When the density of active users can be tuned to maximize the performance, we show that the ERD scales linearly with the number of antennas and that single stream transmission optimizes the network performance. When the active users density is limited and it's below 70% of the optimal density, spatial multiplexing was shown to have better performance than single stream transmission. Simulation results show the practically of the novel bound and the accuracy of the estimated parameters.


  • The effect of imperfect CSI on the performance of random ad-hoc networks

    by Yaniv George, Itsik Bergel, Ephraim Zehavi

    The performance of Wireless Ad hoc Networks (WANETs) depends on the availability of Channel State Information (CSI) on all channels in the network. In this work we study the performance when each receiver has CSI only on the channel from its desired transmitter. We present a novel lower bound on the Ergodic Rate Density of a WANET with partial CSI. The novel bound is compared to a previously known bound and its superiority is demonstrated. We also use the novel bound to study the effect of CSI availability on the WANETs' performance. We show that for Rayleigh fading the CSI-gain of the bound can be up to 78%. But, if each network is optimized with respect to the active transmitter density, then the CSI gain of the bound is at most 13%. Simulation results show the practicality of the novel bound and the accuracy of the CSI-gain expressions.