Approximate minimum BER power allocation for MIMO-THP system

This paper proposes a transmit power allocation (TPA) scheme based on multiple-input multiple-output (MIMO) Tomlinson-Harashima precoding (THP) structure, where a TPA matrix is introduced to the conventional MIMO-THP. We analyze the influence of the introduced TPA matrix on the performance of MIMO-THP. The proposed TPA scheme invokes the minimum average uncoded bit-error rate (BER) criterion subjected to a sum-power constraint. During the derivation, we consider the effects of precoding loss factor on the TPA scheme and obtain a closed-form expression of the TPA. Compared to existing TPA methods for MIMO-THP systems, the proposed scheme reduces processing complexity and improves the BER performance

Multi-group frequency hopping OFDMA based on statistical multiplexing

In this paper, the multi-group frequency hopping OFDMA (MG-FH OFDMA) based on the statistical multiplexing is proposed for the downlink cellular system. Compared with the existed random frequency hopping OFDMA (RFH-OFDMA) system utilizing the statistical multiplexing, the proposed MG-FH OFDMA invokes the deterministic hopping pattern to reduce the number of subcarrier collisions. By dividing all users into different groups, the subcarriers are utilized sufficiently. Latin Square hopping pattern and user index updating scheme are applied to randomize the subcarrier collisions among users. The user capacity, defined as the maximum number of users served with a basic data-rate in a cell, is calculated with the consideration of intra-cell capacity and the other cell interference (OCI). Results show that the proposed MG-FH OFDMA achieves higher user capacity than that of the RFH-OFDMA

Mobile Communication with Virtual Network Address Translation

Virtual Network Address Translation (VNAT) is a novel architecture that allows transparent migration of end-to-end live network connections associated with various computation units. Such computation units can be either a single process, or a group of processes of an application, or an entire host. VNAT virtualizes network connections perceived by transport protocols so that identification of network connections is decoupled from stationary hosts. Such virtual connections are then remapped into physical connections to be carried on the physical network using network address translation. VNAT requires no modification to existing applications, operating systems, or protocol stacks. Furthermore, it is fully compatible with the existing communication infrastructure; virtual and normal connections can coexist without interfering each other. VNAT functions entirely within end systems and requires no third party proxies. We have implemented a VNAT prototype with the Linux 2.4 kernel and demonstrated its functionality on a wide range of popular real-world network applications. Our performance results show that VNAT has essentially no overhead except when connections are migrated, in which case the overhead of our Linux prototype is less than 7 percent