Sharif Digital Repository

In this paper, a new scheme for adaptiva subcarrier, bit and power allocation for downlink transmission of multiuser orthogonal frequency division multiplexing (OFDM) systems is presented. An adaptive algorithm is introduced to achieve the desired bit rate and BER for QoS (quality of service) of different users in a frequency selective fading channel, while the total transmit power is minimized. The performance and complexity of the proposed scheme is also thoroughly compared with the other existing methods. As the simulation results show, the proposed algorithm outperforms all prior sub-optimum schemes, while offering comparable computational complexity. © 2003 IEEE  

We derive some bounds on the Optimum Asymptotic Multiuser Efficiency (OAME) of randomly spread CDMA as extensions of the result by Tse and Verdú. To this end, random Gaussian and random binary antipodal spreading are considered. Furthermore, the input signal is assumed to be Binary Phase Shift Keying (BPSK). It is shown that in a CDMA system with K-user and N chips when K and N → 8 and the loading factor, K over N, grows logarithmically with K, the OAME converges to 1 almost surely under some condition. It is also shown that a Gaussian randomly spread CDMA system has a performance close to the single user system at high Signal to Noise Ratio (SNR) when the loading factor is kept less than... 

Communication networks with highly mobile users are emerging rapidly. Autonomous vehicular communication is an interesting example of such systems. High mobility speed causes drastic change in channel states, and consequently a doubly selective fading scenario is a proper model for such channels. In this paper, by considering this proper model, we introduce a multiuser system based on orthogonal signal division multiplexing in a cognitive radio scenario. Carrier interferometry codes are also utilized in this system. By designing the transmitter and receiver, the performance of such system is investigated. We show that this system works properly when users are moving rapidly, and moreover the... 

As massively multiuser virtual environments (MMVEs) expand in terms of size and user population, they tend toward using P2P architectures as a way to provide scalability without the need for large centralized resources. Distributed hash table (DHT)-based networks have been introduced as a promising option for overlay-based distributed massively multiuser virtual environment applications. However, overlay latency stretch seriously affects MMVE performance where QoS is crucial for real-time user collaboration. This work includes a series of efforts in the alleviation of such undesired latency. Our approach to latency mitigation consists of two phases. First, we propose a position-based ID... 

In this paper, we introduce new unblind and blind multiuser detectors for an optical code-division multiple-access system. The detectors have two soft and hard stages. In the soft stage, a soft estimation of the interference is obtained by solving an unconstrained maximum-likelihood problem via the iterative expectation-maximization (EM) algorithm. Then, the hard stage detects the user information bit by solving a one-dimensional Boolean constrained problem conditioned on knowing the interference. Our results reveal that the proposed detectors have very low complexity, and are robust against changes in parameters. Moreover, the numerical results illustrate that despite of their simplicities,... 

A receiver structure, which has linear computational complexity with the number of users, is proposed for decoding multiuser information data in a convolutionally coded asynchronous DS-CDMA system in multipath fading channels. The proposed receiver architecture consists of a multiuser likelihood calculator followed by a bank of soft-input soft-output (SISO) channel decoders. Information is fed back from SISO channel decoders to multiuser likelihood calculator, and the processing proceeds in an iterative fashion analogous to the decoding of turbo codes. A simplification to the above receiver structure is given too. Simulation results demonstrate that for both receiver structures at high... 

A receiver structure, which has linear computational complexity with the number of users, is proposed for decoding multiuser information data in a convolutionally coded asynchronous DS-CDMA system in multipath fading channels. The proposed receiver architecture consists of a multiuser likelihood calculator followed by a bank of soft-input soft-output (SISO) channel decoders. Information is fed back from SISO channel decoders to multiuser likelihood calculator, and the processing proceeds in an iterative fashion analogous to the decoding of turbo codes. A simplification to the above receiver structure is given also. Simulation results demonstrate that, for both receiver structures, at high... 

In this paper, we obtain a family of lower bounds for the sum capacity of code-division multiple-access (CDMA) channels assuming binary inputs and binary signature codes in the presence of additive noise with an arbitrary distribution. The envelope of this family gives a relatively tight lower bound in terms of the number of users, spreading gain, and the noise distribution. The derivation methods for the noiseless and the noisy channels are different but when the noise variance goes to zero, the noisy channel bound approaches the noiseless case. The behavior of the lower bound shows that for small noise power, the number of users can be much more than the spreading gain without any... 

We extend the result by Tse and Verdú on the optimum asymptotic multiuser efficiency of randomly spread code division multiple access (CDMA) with binary phase shift keying input. Random Gaussian and random binary antipodal spreading are considered. We obtain the optimum asymptotic multiuser efficiency of a K-user system with spreading gain N when K and N → ∞ and the loading factor, (K/N) , grows logarithmically with K under some conditions. It is shown that the optimum detector in a Gaussian randomly spread CDMA system has a performance close to the single user system at high signal-to-noise ratio when K and N → ∞ and the loading factor, (K/N), is kept less than (log3 K/2). Random binary... 

In this paper, we will address the issue of power distribution and decoding order in the uplink side of a multirate code division multiple access (CDMA) system based on linear successive interference cancellation (SIC). First, the closed form expressions for the required received powers at the base station, in order to achieve the users bit rate and Quality of Service (QoS) requirements, will be derived. Then, we will investigate the problem of optimal decoding order of the users under imperfect interference cancellation condition and will show that optimum decoding order of users, unlike the case of perfect SIC, is a function of their requested SINR values in addition to their path gains.... 

In this paper, we consider the problem of multiuser detection in the presence of users with unknown signature codes for a synchronous coded CDMA system. Interference suppression for unknown users is done by projecting the received signal on the null space of known users and then using eigenvalue decomposition and subspace techniques to derive a detector that cancels the known interference and successfully mitigates the unknown interference. Significant performance gains over detectors that ignore unknown users and treats them as noise is achieved. © 2001 IEEE  

Marton's inner bound is the tightest known inner bound on the capacity region of the broadcast channel. It is not known, however, if this bound is tight in general. One approach to settle this key open problem in network information theory is to investigate the multiletter extension of Marton's bound, which is known to be tight in general. This approach has become feasible only recently through the development of a new method for bounding cardinalities of auxiliary random variables by Gohari and Anantharam. This paper undertakes this long overdue approach to establish several new results, including 1) establishing the optimality of Marton's bound for new classes of product broadcast... 

As massively multiuser virtual environments (MMVEs) expand in terms of size and user population, they tend toward using P2P architectures as a way to provide scalability without the need for large centralized resources. Distributed hash table (DHT)-based networks have been introduced as a promising option for overlay-based distributed massively multiuser virtual environment applications. However, overlay latency stretch seriously affects MMVE performance where QoS is crucial for real-time user collaboration. This work includes a series of efforts in the alleviation of such undesired latency. Our approach to latency mitigation consists of two phases. First, we propose a position-based ID... 

Online games seem to become major contributors to Internet traffic. Therefore a great deal of effort is being devoted to the analysis and modeling of network game traffic. However the results from the previous measurements have not been unified into a single frame work while gaming traffic model is of high importance to network designers. Considering the fact that Gaming traffic is generated by the player's interaction during game sessions, we propose to model the player's activities and later use this model to extract the traffic pattern. We will propose a model for the gaming player behavior regarding traffic generation based on hierarchical hidden markov model. Player activities are...