Assadallah Sahebalam

Learn More
— In this paper, we investigate the capacity problem of Gaussian fading multiple access relay channel with orthogonal components from the senders to the relay receiver and from the senders and relay to the receiver. This model is motivated by the practical constraint that a node cannot send and receive at the same time or in the same frequency band. We(More)
In this paper, we describe the Spectrum Sharing methods for Cognitive Radio Networks in communications for ad hoc networks in general having Scale-Free and Random topology. Power-law distribution of node degree in scale-free networks is important for considering the traffic distribution and resource management. Competitive Indexing Algorithm (CIF) is(More)
In this paper, we derive an inner bound for two-user state-dependent multiple-access relay channel (MARC) via decode and forward strategy (DF) in which the states of channel are known non-causally at the relay. The inner bound is obtained by using a combination of binning scheme and codeword splitting. Codeword splitting at the relay is applied to(More)
— In this paper, Ultra-wideband (UWB) multiple access relay channel with correlated noises at the relay and receiver is investigated. We obtain outer and inner bounds for the IEEE 802.15.3a UWB multiple access relay channel, and also, a diversity gain bound. Finally, we evaluate some results numerically and show that noise correlation coefficients play(More)
²Capacity analysis and computation for communication channels with side information at the receiver is an important area of research. Cover-Chiang have proved the increment of capacity with non-causal information at the receiver. We investigate this capacity increment for the channel with causal side information and proposed an efficient algorithm for(More)
—In this paper, we obtain a general achievable rate region and some certain capacity theorems for multiple-access relay channel (MARC), using decode and forward (DAF) strategy at the relay, superposition coding at the transmitters. Our general rate region (i) generalizes the achievability part of Slepian-Wolf multiple-access capacity theorem to the MARC,(More)
The computation of capacity for discrete memoryless channels can be efficiently solved using the Arimoto-Blahut (AB) iterative algorithm. However, the extension of this algorithm to compute the capacity for channels with causal side information (SI) at the transmitter is not straightforward, because generally it is hard to evaluate the rates and capacities(More)
  • 1