The Experts below are selected from a list of 48033 Experts worldwide ranked by ideXlab platform
Shlomo Shamai - One of the best experts on this subject based on the ideXlab platform.
-
on the sum rate capacity of non symmetric poisson Multiple Access Channel
International Symposium on Information Theory, 2016Co-Authors: Ain-ul Aisha, Yingbin Liang, Shlomo ShamaiAbstract:In this paper, we characterize the sum-rate capacity of the non-symmetric Poisson Multiple Access Channel (MAC). While the sum-rate capacity of the symmetric Poisson MAC has been characterized in the literature, the special property exploited in the existing method for the symmetric case does not hold for the non-symmetric Channel anymore. We obtain the optimal input that achieves the sum-rate capacity by solving a non-convex optimization problem. We show that, for certain Channel parameters, it is optimal for a single user to transmit to achieve the sum-rate capacity. This is in sharp contrast to the Gaussian MAC, in which all users must transmit, either simultaneously or at different times, in order to achieve the sum-rate capacity.
-
ISIT - On the sum-rate capacity of non-symmetric Poisson Multiple Access Channel
2016 IEEE International Symposium on Information Theory (ISIT), 2016Co-Authors: Ain-ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo ShamaiAbstract:In this paper, we characterize the sum-rate capacity of the non-symmetric Poisson Multiple Access Channel (MAC). While the sum-rate capacity of the symmetric Poisson MAC has been characterized in the literature, the special property exploited in the existing method for the symmetric case does not hold for the non-symmetric Channel anymore. We obtain the optimal input that achieves the sum-rate capacity by solving a non-convex optimization problem. We show that, for certain Channel parameters, it is optimal for a single user to transmit to achieve the sum-rate capacity. This is in sharp contrast to the Gaussian MAC, in which all users must transmit, either simultaneously or at different times, in order to achieve the sum-rate capacity.
-
a low delay algorithm for the Multiple Access Channel with rayleigh fading
Personal Indoor and Mobile Radio Communications, 1998Co-Authors: I Bettesh, Shlomo ShamaiAbstract:A new algorithm is proposed for the Multiple Access Channel with flat Rayleigh fading in a single cell. It is assumed the fading values are known to both the receiver and transmitter. Unlike previous algorithms, this algorithm considers the throughput under constraints of outage and delay. This is done by combining the advantages of TDMA (low delay, small outage) with the advantages of the optimized throughput algorithm. In the proposed algorithm only one user transmits at any moment making successive decoding and/or rate splitting unnecessary. A single parameter controls the similarity of the algorithm to TDMA vs. the similarity to the optimized throughput algorithm. The algorithm's performance is a continuous function of the parameter i.e., if the algorithm is more TDMA like, its performance (throughput, delay, outage) are also similar to TDMA and vice versa.
Yossef Steinberg - One of the best experts on this subject based on the ideXlab platform.
-
On the Multiple-Access Channel With Common Rate-Limited Feedback
IEEE Transactions on Information Theory, 2013Co-Authors: Dor Shaviv, Yossef SteinbergAbstract:This paper studies the Multiple-Access Channel (MAC) with rate-limited feedback. The Channel output is encoded into one stream of bits, which is provided causally to the two users at the Channel input. An achievable rate region for this setup is derived, based on superposition of information, block Markov coding, and coding with various degrees of side information for the feedback link. The suggested region coincides with the Cover-Leung inner bound for large feedback rates. The result is then extended for cases where there is only a feedback link to one of the transmitters, and for a more general case where there are two separate feedback links to both transmitters. We compute achievable regions for the Gaussian MAC and for the binary erasure MAC. The Gaussian region is computed for the case of common rate-limited feedback, whereas the region for the binary erasure MAC is computed for one-sided feedback. It is known that for the latter, the Cover-Leung region is tight, and we obtain results that coincide with the feedback capacity region for high feedback rates.
-
the Multiple Access Channel with causal side information common state
IEEE Transactions on Information Theory, 2013Co-Authors: Amos Lapidoth, Yossef SteinbergAbstract:We show that if a memoryless Multiple-Access Channel (MAC) is governed by an independent and identically distributed state sequence, then-unlike the single-user case-the capacity region is typically increased if the state is revealed to the encoders in a strictly causal way. For this scenario, we derive inner and outer bounds on the capacity region. For the Gaussian MAC whose state sequence comprises the Channel noise, we compute the capacity region and propose a variation on the Schalkwijk-Kailath scheme that achieves capacity with a double-exponential decay of the maximal probability of error. We also study the causal case for which we derive an achievable region, which is typically strictly larger than the region achievable with naive Shannon strategies.
-
On the Multiple-Access Channel with Common Rate-Limited Feedback
2008 IEEE International Zurich Seminar on Communications, 2008Co-Authors: Dor Shaviv, Yossef SteinbergAbstract:This work studies the Multiple Access Channel (MAC) with rate-limited feedback. The Channel output is encoded into one stream of bits, which is provided causally to the two users at the Channel input. An achievable rate region for this setup is derived, based on superposition of information, block Markov coding, and coding with various degrees of side information, for the feedback link. The suggested region coincides with the Cover-Leung inner bound for large feedback rates.
-
the Multiple Access Channel with partial state information at the encoders
IEEE Transactions on Information Theory, 2005Co-Authors: Y Cemal, Yossef SteinbergAbstract:This work studies the Multiple-Access Channel (MAC) controlled by random parameters, with full side information at the decoder, and partial, rate limited, side information (SI) at the encoders. A single-letter characterization of the capacity region is derived, for the special case where the SI is degraded. Here degraded SI refers to the case where the SI available at one of the encoders is a subset of the SI available at the other encoder. Inner and outer bounds are derived on the capacity region of that Channel for the general case where there are no restrictions on the structure of the SI at the two encoders. The techniques employed for coding the rate-limited SI, and the achievable regions so obtained, are closely related to the problems of hierarchical source coding, and Multiple descriptions.
-
Resolvability theory for the Multiple-Access Channel
IEEE Transactions on Information Theory, 1998Co-Authors: Yossef SteinbergAbstract:We study the randomness needed for approximating the output distribution of a Multiple-Access Channel, where the original input processes are independent of each other. The approximation is achieved by simulating (possibly alternative) input processes at each of the entries, where the sources of randomness available for the simulators are independent of each other, and the simulators do not cooperate. The resolvability region of a Multiple-Access Channel is defined as the set of all random-bit rate pairs at which accurate output approximation is possible, where the simulation accuracy is measured by the variational distance between finite-dimensional output distributions. Inner and outer bounds on the resolvability region are derived, and close relations between the concepts of resolvability region and capacity region are demonstrated.
Sandeep S Pradhan - One of the best experts on this subject based on the ideXlab platform.
-
on the reliability function of discrete memoryless Multiple Access Channel with feedback
Information Theory Workshop, 2018Co-Authors: Mohsen Heidari, Achilleas Anastasopoulos, Sandeep S PradhanAbstract:We derive a lower and upper bounds on the reliability function of discrete memoryless Multiple-Access Channel (MAC) with noiseless feedback and variable-length codes (VLCs). For the upper-bound, we use proof techniques of Burnashev for the point-to-point case. Also, we adopt the techniques used to prove the converse for the feedback-capacity of MAC. For the lower-bound on the error exponent, we present a coding scheme consisting of a data and a confirmation stage. In the data stage, any arbitrary feedback capacity-achieving code is used. In the confirmation stage, each transmitter sends one bit of information to the receiver using a pair of codebooks of size two, one for each transmitter. The codewords at this stage are selected randomly according to an appropriately optimized joint probability distribution. The bounds increase linearly with respect to a specific Euclidean distance measure defined between the transmission rate pair and the capacity boundary. The lower and upper bounds match for a class of MACs.
-
on the reliability function of discrete memoryless Multiple Access Channel with feedback
arXiv: Information Theory, 2018Co-Authors: Mohsen Heidari, Achilleas Anastasopoulos, Sandeep S PradhanAbstract:We derive a lower and upper bound on the reliability function of discrete memoryless Multiple-Access Channel (MAC) with noiseless feedback and variable-length codes (VLCs). The bounds are similar to the one for point-to-point Channels, increasing linearly with respect to an appropriate distance between the rate pair and the capacity boundary. For the lower bound on the error exponent, we adapt Yamamoto and Itoh's coding scheme consisting of a data and a confirmation stage. In the data stage we use arbitrary feedback capacity-achieving codes. In the confirmation stage, each transmitter sends one bit of information to the receiver using a pair of codebooks of size two, one for each transmitter. The codewords at this stage are selected randomly according to an appropriately optimized joint probability distribution. For the upper bound on the error exponent, we adopt the proof techniques of Burnashev for the reliability function of the point-to-point case. The upper bound is derived by studying the rate of decrease of appropriate message entropies.
-
a new achievable rate region for Multiple Access Channel with states
International Symposium on Information Theory, 2017Co-Authors: Mohsen Heidari, Farhad Shirani, Sandeep S PradhanAbstract:The problem of reliable communication over the Multiple-Access Channel (MAC) with states is investigated. We propose a new coding scheme for this problem which uses quasi-group codes (QGC). We derive a new computable single-letter characterization of the achievable rate region. As an example, we investigate the problem of doubly-dirty MAC with modulo-4 addition. It is shown that the sum rate R 1 + R 2 =1 bits per Channel use is achievable using the new scheme. Whereas, the natural extension of the Gel'fand-Pinsker scheme, sum-rates greater than 0.32 are not achievable.
-
new sufficient conditions for Multiple Access Channel with correlated sources
arXiv: Information Theory, 2016Co-Authors: Mohsen Heidari, Farhad Shirani, Sandeep S PradhanAbstract:The problem of three-user Multiple-Access Channel (MAC) with correlated sources is investigated. An extension to the Cover-El Gamal-Salehi (CES) scheme is introduced. We use a combination of this scheme with linear codes and propose a new coding strategy. We derive new sufficient conditions to transmit correlated sources reliably. We consider an example of three-user MAC with binary inputs. Using this example, we show strict improvements over the CES scheme.
-
new sufficient conditions for Multiple Access Channel with correlated sources
International Symposium on Information Theory, 2016Co-Authors: Mohsen Heidari, Farhad Shirani, Sandeep S PradhanAbstract:The problem of three-user Multiple-Access Channel (MAC) with correlated sources is investigated. An extension to the Cover-El Gamal-Salehi (CES) scheme is introduced. We argue that if the sources impose certain algebraic structures, then the application of structured codes improves upon the CES scheme. Based on this notion, we use a combination of the CES scheme with linear codes, and propose a new coding strategy. We derive new sufficient conditions to transmit correlated sources reliably. We consider an example of a three-user MAC with binary inputs. Using this example, we show strict improvements over the CES scheme.
Ain-ul Aisha - One of the best experts on this subject based on the ideXlab platform.
-
on the sum rate capacity of non symmetric poisson Multiple Access Channel
International Symposium on Information Theory, 2016Co-Authors: Ain-ul Aisha, Yingbin Liang, Shlomo ShamaiAbstract:In this paper, we characterize the sum-rate capacity of the non-symmetric Poisson Multiple Access Channel (MAC). While the sum-rate capacity of the symmetric Poisson MAC has been characterized in the literature, the special property exploited in the existing method for the symmetric case does not hold for the non-symmetric Channel anymore. We obtain the optimal input that achieves the sum-rate capacity by solving a non-convex optimization problem. We show that, for certain Channel parameters, it is optimal for a single user to transmit to achieve the sum-rate capacity. This is in sharp contrast to the Gaussian MAC, in which all users must transmit, either simultaneously or at different times, in order to achieve the sum-rate capacity.
-
ISIT - On the sum-rate capacity of non-symmetric Poisson Multiple Access Channel
2016 IEEE International Symposium on Information Theory (ISIT), 2016Co-Authors: Ain-ul Aisha, Lifeng Lai, Yingbin Liang, Shlomo ShamaiAbstract:In this paper, we characterize the sum-rate capacity of the non-symmetric Poisson Multiple Access Channel (MAC). While the sum-rate capacity of the symmetric Poisson MAC has been characterized in the literature, the special property exploited in the existing method for the symmetric case does not hold for the non-symmetric Channel anymore. We obtain the optimal input that achieves the sum-rate capacity by solving a non-convex optimization problem. We show that, for certain Channel parameters, it is optimal for a single user to transmit to achieve the sum-rate capacity. This is in sharp contrast to the Gaussian MAC, in which all users must transmit, either simultaneously or at different times, in order to achieve the sum-rate capacity.
Bixio Rimoldi - One of the best experts on this subject based on the ideXlab platform.
-
a rate splitting approach to the gaussian Multiple Access Channel
IEEE Transactions on Information Theory, 1996Co-Authors: Bixio Rimoldi, Rudiger UrbankeAbstract:It is shown that any point in the capacity region of a Gaussian Multiple-Access Channel is achievable by single-user coding without requiring synchronization among users, provided that each user "splits" data and signal into two parts. Based on this result, a new Multiple-Access technique called rate-splitting Multiple Accessing (RSMA) is proposed. RSMA is a code-division Multiple-Access scheme for the M-user Gaussian Multiple-Access Channel for which the effort of finding the codes for the M users, of encoding, and of decoding is that of at most 2M-1 independent point-to-point Gaussian Channels. The effects of bursty sources, multipath fading, and inter-cell interference are discussed and directions for further research are indicated.
-
ISIT - On the structure of the capacity region of the Gaussian Multiple Access Channel
International Symposium onInformation Theory 2004. ISIT 2004. Proceedings., 1Co-Authors: Ninoslav Marina, Bixio RimoldiAbstract:It is well-known that the capacity region of an M-user Gaussian Multiple Access Channel is an M-dimensional polytope and the capacity region of a general discrete memoryless Multiple-Access Channel contains a union of such polytopes. An expression for the number of vertices, edges, and more generally faces of any dimension D, of the capacity region of a Gaussian Multiple Access Channel is derived in this paper.
-
Single user coding for the discrete memoryless Multiple Access Channel
Proceedings of 1995 IEEE International Symposium on Information Theory, 1Co-Authors: Alex Grant, Bixio Rimoldi, R. Urbanke, Phil WhitingAbstract:We show that the coding problem of any m-user asynchronous discrete Multiple Access Channel can be reduced to at most 2m-1 single user coding problems. This extends previous results for the Gaussian Channel.
-
On single-user decodable codes for the Gaussian Multiple Access Channel
Proceedings of 1994 IEEE International Symposium on Information Theory, 1Co-Authors: Bixio Rimoldi, Rudiger UrbankeAbstract:It is shown that any rate tuple R contained in the capacity region of the Gaussian Multiple Access Channel can be achieved by means of Multiple Access codes with decoding complexity equivalent to that of at most 2m-1 single-user codes. >
