Ephraim Zehavi

Learn More
Generating function techniques for analyzing the error event and the bit-error probabilities for trellis codes are considered. The conventional state diagram approach for linear codes where the number of states is equal to the number of trellis states cannot be applied directly to arbitrary trellis codes, and instead, a state diagram where the number of(More)
In this paper we analyze the interference channel as a conflict situation. This viewpoint implies that certain points in the rate region are unreasonable to one of the players. Therefore these points cannot be considered achievable based on game theoretic considerations. We then propose to use Nash bargaining solution as a tool that provides preferred(More)
Performance of a wideband multipath-fading terrestrial digital coded communication system is treated. The analysis has applications to a cellular system employing direct sequence spread spectrum CDMA with M-ary orthogonal modulation on the many-to-one reverse (user-to-base station) link. For these links, pqwer control of each multiple access user by the(More)
AT IS CURRENTLY WIDELY ACCEPTED THAT Forward Error Correcting (FEC) coding is a practical technique for increasing the transmission efficiency of virtually all digital communication channels. whatever their power or bandwidth limitations. Efficiency then applies to both the power and the bandwidth required to support a given information rate. or conversely(More)
In this paper we discuss the use of cooperative game theory for analyzing interference channels. We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. We show that the Nash bargaining solution can be computed using convex optimization techniques. We also show that the same results are(More)
In this paper we propose to use the well known game theoretic Gale-Shapley stable marriage theorem from game theory as a basis for spectrum allocation in cognitive radio networks. We analyze the performance of the proposed solution and provide tight lower and upper bounds on both the stable allocation and the optimal allocation performance. Then we present(More)