21,232 research outputs found
Multiuser MIMO-OFDM for Next-Generation Wireless Systems
This overview portrays the 40-year evolution of orthogonal frequency division multiplexing (OFDM) research. The amelioration of powerful multicarrier OFDM arrangements with multiple-input multiple-output (MIMO) systems has numerous benefits, which are detailed in this treatise. We continue by highlighting the limitations of conventional detection and channel estimation techniques designed for multiuser MIMO OFDM systems in the so-called rank-deficient scenarios, where the number of users supported or the number of transmit antennas employed exceeds the number of receiver antennas. This is often encountered in practice, unless we limit the number of users granted access in the base station’s or radio port’s coverage area. Following a historical perspective on the associated design problems and their state-of-the-art solutions, the second half of this treatise details a range of classic multiuser detectors (MUDs) designed for MIMO-OFDM systems and characterizes their achievable performance. A further section aims for identifying novel cutting-edge genetic algorithm (GA)-aided detector solutions, which have found numerous applications in wireless communications in recent years. In an effort to stimulate the cross pollination of ideas across the machine learning, optimization, signal processing, and wireless communications research communities, we will review the broadly applicable principles of various GA-assisted optimization techniques, which were recently proposed also for employment inmultiuser MIMO OFDM. In order to stimulate new research, we demonstrate that the family of GA-aided MUDs is capable of achieving a near-optimum performance at the cost of a significantly lower computational complexity than that imposed by their optimum maximum-likelihood (ML) MUD aided counterparts. The paper is concluded by outlining a range of future research options that may find their way into next-generation wireless systems
Reduced-Complexity Maximum-Likelihood Detection in Downlink SDMA Systems
The literature of up-link SDMA systems is rich, but at the time of writing there is a paucity of information on the employment of SDMA techniques in the down-link. Hence, in this paper a Space Division Multiple Access (SDMA) down-link (DL) multi-user communication system invoking a novel low-complexity Maximum Likelihood (ML) space-time detection technique is proposed, which can be regarded as an advanced extension of the Complex Sphere Decoder (CSD). We demonstrate that as opposed to the previously published variants of the CSD, the proposed technique may be employed for obtaining a high effective throughput in the so-called “over-loaded” scenario, where the number of transmit antennas exceeds that of the receive antennas. The proposed method achieves the optimum performance of the ML detector even in heavily over-loaded scenarios, while the associated computational complexity is only moderately increased. As an illustrative example, the required Eb/N0 increased from 2 dB to 9 dB, when increasing the normalized system load from unity, representing the fully loaded system, to a normalized load of 1.556
Outage and Local Throughput and Capacity of Random Wireless Networks
Outage probabilities and single-hop throughput are two important performance
metrics that have been evaluated for certain specific types of wireless
networks. However, there is a lack of comprehensive results for larger classes
of networks, and there is no systematic approach that permits the convenient
comparison of the performance of networks with different geometries and levels
of randomness.
The uncertainty cube is introduced to categorize the uncertainty present in a
network. The three axes of the cube represent the three main potential sources
of uncertainty in interference-limited networks: the node distribution, the
channel gains (fading), and the channel access (set of transmitting nodes). For
the performance analysis, a new parameter, the so-called {\em spatial
contention}, is defined. It measures the slope of the outage probability in an
ALOHA network as a function of the transmit probability at . Outage is
defined as the event that the signal-to-interference ratio (SIR) is below a
certain threshold in a given time slot. It is shown that the spatial contention
is sufficient to characterize outage and throughput in large classes of
wireless networks, corresponding to different positions on the uncertainty
cube. Existing results are placed in this framework, and new ones are derived.
Further, interpreting the outage probability as the SIR distribution, the
ergodic capacity of unit-distance links is determined and compared to the
throughput achievable for fixed (yet optimized) transmission rates.Comment: 22 pages, 6 figures. Submitted to IEEE Trans. Wireles
Real Interference Alignment: Exploiting the Potential of Single Antenna Systems
In this paper, the available spatial Degrees-Of-Freedoms (DOF) in single
antenna systems is exploited. A new coding scheme is proposed in which several
data streams having fractional multiplexing gains are sent by transmitters and
interfering streams are aligned at receivers. Viewed as a field over rational
numbers, a received signal has infinite fractional DOFs, allowing simultaneous
interference alignment of any finite number of signals at any finite number of
receivers. The coding scheme is backed up by a recent result in the field of
Diophantine approximation, which states that the convergence part of the
Khintchine-Groshev theorem holds for points on non-degenerate manifolds. The
proposed coding scheme is proved to be optimal for three communication
channels, namely the Gaussian Interference Channel (GIC), the uplink channel in
cellular systems, and the channel. It is proved that the total DOF of the
-user GIC is almost surely, i.e. each user enjoys half of its
maximum DOF. Having cells and users within each cell in a cellular
system, the total DOF of the uplink channel is proved to be .
Finally, the total DOF of the channel with transmitters and
receivers is shown to be .Comment: Submitted to IEEE Transaction on Information Theory. The first
version was uploaded on arxiv on 17 Aug 2009 with the following title:
Forming Pseudo-MIMO by Embedding Infinite Rational Dimensions Along a Single
Real Line: Removing Barriers in Achieving the DOFs of Single Antenna System
Access Policy Design for Cognitive Secondary Users under a Primary Type-I HARQ Process
In this paper, an underlay cognitive radio network that consists of an
arbitrary number of secondary users (SU) is considered, in which the primary
user (PU) employs Type-I Hybrid Automatic Repeat Request (HARQ). Exploiting the
redundancy in PU retransmissions, each SU receiver applies forward interference
cancelation to remove a successfully decoded PU message in the subsequent PU
retransmissions. The knowledge of the PU message state at the SU receivers and
the ACK/NACK message from the PU receiver are sent back to the transmitters.
With this approach and using a Constrained Markov Decision Process (CMDP) model
and Constrained Multi-agent MDP (CMMDP), centralized and decentralized optimum
access policies for SUs are proposed to maximize their average sum throughput
under a PU throughput constraint. In the decentralized case, the channel access
decision of each SU is unknown to the other SU. Numerical results demonstrate
the benefits of the proposed policies in terms of sum throughput of SUs. The
results also reveal that the centralized access policy design outperforms the
decentralized design especially when the PU can tolerate a low average long
term throughput. Finally, the difficulties in decentralized access policy
design with partial state information are discussed
- …