1,870 research outputs found
Spatial Coordination Strategies in Future Ultra-Dense Wireless Networks
Ultra network densification is considered a major trend in the evolution of
cellular networks, due to its ability to bring the network closer to the user
side and reuse resources to the maximum extent. In this paper we explore
spatial resources coordination as a key empowering technology for next
generation (5G) ultra-dense networks. We propose an optimization framework for
flexibly associating system users with a densely deployed network of access
nodes, opting for the exploitation of densification and the control of overhead
signaling. Combined with spatial precoding processing strategies, we design
network resources management strategies reflecting various features, namely
local vs global channel state information knowledge exploitation, centralized
vs distributed implementation, and non-cooperative vs joint multi-node data
processing. We apply these strategies to future UDN setups, and explore the
impact of critical network parameters, that is, the densification levels of
users and access nodes as well as the power budget constraints, to users
performance. We demonstrate that spatial resources coordination is a key factor
for capitalizing on the gains of ultra dense network deployments.Comment: An extended version of a paper submitted to ISWCS'14, Special Session
on Empowering Technologies of 5G Wireless Communication
Minimum Bit-Error Rate Design for Space-Time Equalisation-Based Multiuser Detection
A novel minimum bit-error rate (MBER) spaceâtime equalization (STE)-based multiuser detector (MUD) is proposed for multiple-receive-antenna-assisted space-division multiple-access systems. It is shown that the MBER-STE-aided MUD significantly outperforms the standard minimum mean-square error design in terms of the achievable bit-error rate (BER). Adaptive implementations of the MBER STE are considered, and both the block-data-based and sample-by-sample adaptive MBER algorithms are proposed. The latter, referred to as the least BER (LBER) algorithm, is compared with the most popular adaptive algorithm, known as the least mean square (LMS) algorithm. It is shown that in case of binary phase-shift keying, the computational complexity of the LBER-STE is about half of that required by the classic LMS-STE. Simulation results demonstrate that the LBER algorithm performs consistently better than the classic LMS algorithm, both in terms of its convergence speed and steady-state BER performance. Index TermsâAdaptive algorithm, minimum bit-error rate (MBER), multiuser detection (MUD), spaceâtime processing
- âŠ