527 research outputs found
Wireless Cellular Networks
When aiming for achieving high spectral efficiency in wireless cellular networks, cochannel interference (CCI) becomes the dominant performancelimiting factor. This article provides a survey of CCI mitigation techniques, where both active and passive approaches are discussed in the context of both open- and closed-loop designs.More explicitly, we considered both the family of flexible frequency-reuse (FFR)-aided and dynamic channel allocation (DCA)-aided interference avoidance techniques as well as smart antenna-aided interference mitigation techniques, which may be classified as active approach
Delay Considerations for Opportunistic Scheduling in Broadcast Fading Channels
We consider a single-antenna broadcast block fading
channel with n users where the transmission is packetbased.
We define the (packet) delay as the minimum number of channel uses that guarantees all n users successfully receive m packets. This is a more stringent notion of delay than average delay and is the worst case (access) delay among the users. A delay optimal scheduling scheme, such as round-robin, achieves the delay of mn. For the opportunistic scheduling (which is throughput optimal) where the transmitter sends the packet to the user with the best channel conditions at each channel use, we derive the mean and variance of the delay for any m and n. For large n and in a homogeneous network, it is proved that the expected delay in receiving one packet by all the receivers scales as n log n, as opposed to n for the round-robin scheduling. We also show that when m grows faster than (log n)^r, for some r > 1, then the delay scales as mn. This roughly determines the timescale required for the system to behave fairly in a homogeneous network. We then propose a scheme to significantly reduce the delay at the expense of a small throughput hit. We further look into the advantage of multiple transmit antennas on the delay. For a system with M antennas in the transmitter where at each channel use packets are sent to M different users, we obtain the expected delay in receiving one packet by all the users
How Much Multiuser Diversity is Required for Energy Limited Multiuser Systems?
Multiuser diversity (MUDiv) is one of the central concepts in multiuser (MU)
systems. In particular, MUDiv allows for scheduling among users in order to
eliminate the negative effects of unfavorable channel fading conditions of some
users on the system performance. Scheduling, however, consumes energy (e.g.,
for making users' channel state information available to the scheduler). This
extra usage of energy, which could potentially be used for data transmission,
can be very wasteful, especially if the number of users is large. In this
paper, we answer the question of how much MUDiv is required for energy limited
MU systems. Focusing on uplink MU wireless systems, we develop MU scheduling
algorithms which aim at maximizing the MUDiv gain. Toward this end, we
introduce a new realistic energy model which accounts for scheduling energy and
describes the distribution of the total energy between scheduling and data
transmission stages. Using the fact that such energy distribution can be
controlled by varying the number of active users, we optimize this number by
either (i) minimizing the overall system bit error rate (BER) for a fixed total
energy of all users in the system or (ii) minimizing the total energy of all
users for fixed BER requirements. We find that for a fixed number of available
users, the achievable MUDiv gain can be improved by activating only a subset of
users. Using asymptotic analysis and numerical simulations, we show that our
approach benefits from MUDiv gains higher than that achievable by generic
greedy access algorithm, which is the optimal scheduling method for energy
unlimited systems.Comment: 28 pages, 9 figures, submitted to IEEE Trans. Signal Processing in
Oct. 200
Collaborative modulation multiple access for single hop and multihop networks
While the bandwidth available for wireless networks is limited, the world has seen an unprecedented growth in the number of mobile subscribers and an ever increasing demand for high data rates. Therefore efficient utilisation of bandwidth to maximise link spectral efficiency and number of users that can be served simultaneously are primary goals in the design of wireless systems. To achieve these goals, in this thesis, a new non-orthogonal uplink multiple access scheme which combines the functionalities of adaptive modulation and multiple access called collaborative modulation multiple access (CMMA) is proposed. CMMA enables multiple users to access the network simultaneously and share the same bandwidth even when only a single receive antenna is available and in the presence of high channel correlation.
Instead of competing for resources, users in CMMA share resources collaboratively by employing unique modulation sets (UMS) that differ in phase, power, and/or mapping structure. These UMS are designed to insure that the received signal formed from the superposition of all usersâ signals belongs to a composite QAM constellation (CC) with a rate equal to the sum rate of all users. The CC and its constituent UMSs are designed centrally at the BS to remove ambiguity, maximize the minimum Euclidian distance (dmin) of the CC and insure a minimum BER performance is maintained. Users collaboratively precode their transmitted signal by performing truncated channel inversion and phase rotation using channel state information (CSI ) obtained from a periodic common pilot to insure that their combined signal at the BS belongs to the CC known at the BS which in turn performs a simple joint maximum likelihood detection without the need for CSI. The coherent addition of usersâ power enables CMMA to achieve high link spectral efficiency at any time without extra power or bandwidth but on the expense of graceful degradation in BER performance.
To improve the BER performance of CMMA while preserving its precoding and detection structure and without the need for pilot-aided channel estimation, a new selective diversity combining scheme called SC-CMMA is proposed. SC-CMMA optimises the overall group performance providing fairness and diversity gain for various users with different transmit powers and channel conditions by selecting a single antenna out of a group of L available antennas that minimises the total transmit power required for precoding at any one time.
A detailed study of capacity and BER performance of CMMA and SC-CMMA is carried out under different level of channel correlations which shows that both offer high capacity gain and resilience to channel correlation. SC-CMMA capacity even increase with high channel correlation between usersâ channels.
CMMA provides a practical solution for implementing the multiple access adder channel (MAAC) in fading environments hence a hybrid approach combining both collaborative coding and modulation referred to as H-CMMA is investigated. H-CMMA divides users into a number of subgroups where users within a subgroup are assigned the same modulation set and different multiple access codes. H-CMMA adjusts the dmin of the received CC by varying the number of subgroups which in turn varies the number of unique constellation points for the same number of users and average total power. Therefore H-CMMA can accommodate many users with different rates while flexibly managing the complexity, rate and BER performance depending on the SNR.
Next a new scheme combining CMMA with opportunistic scheduling using only partial CSI at the receiver called CMMA-OS is proposed to combine both the power gain of CMMA and the multiuser diversity gain that arises from usersâ channel independence. To avoid the complexity and excessive feedback associated with the dynamic update of the CC, the BS takes into account the independence of usersâ channels in the design of the CC and its constituent UMSs but both remain unchanged thereafter. However UMS are no longer associated with users, instead channel gainâs probability density function is divided into regions with identical probability and each UMS is associated with a specific region. This will simplify scheduling as users can initially chose their UMS based on their CSI and the BS will only need to resolve any collision when the channels of two or more users are located at the same region.
Finally a high rate cooperative communication scheme, called cooperative modulation (CM) is proposed for cooperative multiuser systems. CM combines the reliability of the cooperative diversity with the high spectral efficiency and multiple access capabilities of CMMA. CM maintains low feedback and high spectral efficiency by restricting relaying to a single route with the best overall channel. Two possible variations of CM are proposed depending on whether CSI available only at the users or just at the BS and the selected relay. The first is referred to Precode, Amplify, and Forward (PAF) while the second one is called Decode, Remap, and Forward (DMF). A new route selection algorithm for DMF based on maximising dmin of random CC is also proposed using a novel fast low-complexity multi-stage sphere based algorithm to calculate the dmin at the relay of random CC that is used for both relay selection and detection
Multiuser Random Beamforming in Millimetre-Waves Channels
This thesis aims to show that in mmWaves channels, schemes based on randomly-directional beamforming allow to harness both the spatial multiplexing and multi-user diversity characterizing the broadcast channel by using only limited feedback and a simple transmitter architecture. The number of necessary users with respect to the number of transmitting antennas for optimal performances is investigated as well as the fairness issue, for which the use of NOMA is shown to be advantageous w.r.t. OMA
SYNCHRONIZATION AND RESOURCE ALLOCATION IN DOWNLINK OFDM SYSTEMS
The next generation (4G) wireless systems are expected to provide
universal personal and multimedia communications with seamless connection
and very high rate transmissions and without regard to the usersâ mobility and
location. OFDM technique is recognized as one of the leading candidates to
provide the wireless signalling for 4G systems. The major challenges in
downlink multiuser OFDM based 4G systems include the wireless channel, the
synchronization and radio resource management. Thus algorithms are required
to achieve accurate timing and frequency offset estimation and the efficient
utilization of radio resources such as subcarrier, bit and power allocation.
The objectives of the thesis are of two fields. Firstly, we presented the
frequency offset estimation algorithms for OFDM systems. Building our work
upon the classic single user OFDM architecture, we proposed two FFT-based
frequency offset estimation algorithms with low computational complexity.
The computer simulation results and comparisons show that the proposed
algorithms provide smaller error variance than previous well-known algorithm.
Secondly, we presented the resource allocation algorithms for OFDM
systems. Building our work upon the downlink multiuser OFDM architecture,
we aimed to minimize the total transmit power by exploiting the system
diversity through the management of subcarrier allocation, adaptive
modulation and power allocation. Particularly, we focused on the dynamic
resource allocation algorithms for multiuser OFDM system and multiuser
MIMO-OFDM system. For the multiuser OFDM system, we proposed a lowiv
complexity channel gain difference based subcarrier allocation algorithm. For
the multiuser MIMO-OFDM system, we proposed a unit-power based
subcarrier allocation algorithm. These proposed algorithms are all combined
with the optimal bit allocation algorithm to achieve the minimal total transmit
power. The numerical results and comparisons with various conventional nonadaptive
and adaptive algorithmic approaches are provided to show that the
proposed resource allocation algorithms improve the system efficiencies and
performance given that the Quality of Service (QoS) for each user is
guaranteed.
The simulation work of this project is based on hand written codes in the
platform of the MATLAB R2007b
- âŠ