Linear Precoding Based on Sub-Channel Permutation in Post-Combining MIMO-HARQ Systems
A powerful HARQ-based linear precoding scheme is proposed to utilize the flexibility of post-combining HARQ strategy in MIMO communications systems. The scheme selects the appropriate symbols and transmit powers for each eigen-mode to acquire more performance gains. Simulation results show that the proposed scheme achieves about 5.5dB signal-to-noise ratio gains over original spatial multiplexing scheme at an average bit error rate of 10 -4 . Furthermore, the gap between the two schemes increases with the number of transmissions.

title: Iterative Turbo Channel Estimation for OFDM System over Rapid Dispersive Fading Channel
abstract: Coherent OFDM detection requires accurate channel state information (CSI). Mobile radio channels are both time and frequency dispersive, especially at high vehicular speeds, which makes channel estimation a challenging problem in system design. Conventional preamble-based and pilot-aided channel estimation require numerous reference signals, which significantly compromises the system throughput. This paper proposes a novel low complexity iterative turbo channel estimation technique which makes use of preamble, pilots and soft decoded data information in an iterative fashion to improve the system performance over the time and frequency selective fading channel while maintaining the system throughput. The numerical and analytical results show that the proposed technique can approach the performance of systems with perfect CSI with much fewer preamble and pilots symbols compared to existing channel estimation methods.

title: Linear Precoding for V-BLAST Systems in the Presence of Fading Correlations
abstract: This letter proposed a linear precoding scheme for the V-BLAST system that requires only knowledge of the statistical CSI; the transmitter does not need the instantaneous CSI. Power allocation on the eigenmodes of the transmit correlation matrix is one way to minimize bit error rate (BER). Simulation results show that the proposed precoding V-BLAST system provides a significant reduction in the BER compared with the conventional V-BLAST systems.

title: A Novel Evaluation Method for the Downlink Capacity of Distributed Antenna Systems
abstract: This letter focuses on the simplified capacity evaluation for the downlink of a distributed antenna system (DAS) with random antenna layout. Based on system scale-up, we derive a good approximation of the downlink capacity by developing the results from random matrix theory. We also propose an iterative method to calculate the unknown parameters in the approximated expression of the downlink capacity. The approximation is illustrated to be quite accurate and the iterative method is shown to be quite efficient by Monte Carlo simulations.

title: Relaying Schemes for MIMO Broadcast Channels: Coexistence of Direct-Link and Relay-Link Users
abstract: The combination of relay and Multiple-Input Multiple-Output (MIMO) techniques can significantly benefit the signal transmission in cellular networks. In this work, we propose a novel relaying scheme for the relay assisted MIMO broadcast channel including user classification and precoding. The users are firstly classified as Direct Link (DL) users and Relay Link (RL) users according to their channel conditions. After classification, both DL and RL users may coexist in the system, and Zero-Forcing (ZF) precoding is employed at both the BS and the relay for interference cancellation. Analysis and simulation results show that the proposed relaying scheme can effectively combat the large scale fading of the channels and provide significant performance gain compared with the conventional MIMO relaying schemes without user classification.

title: The Impacts of Radio Channels and Node Mobility on Link Statistics in Mobile Ad Hoc Networks
abstract: Understanding link statistics in mobile ad hoc networks (MANETs) is essential to design adaptive routing protocols and achieve desired network performance. While much attention has been given to the node mobility impacts, little has been done to investigate the influence of dynamic channel fadings and the joint effects of the interactions among radio channels, transmission range, node mobility and node-pair distance on link statistics. In this paper, we investigate the link stability and availability by using a distance transition probability matrix of a relative distance between two nodes. Our analysis takes the node effective transmission range Re into account. The relative node movement is based on the Semi-Markov Smooth (SMS) mobility model  which captures the smooth node speed (V) transition and the radio channel variations in a small time- scale. We show that the PDF of link lifetime in MANETs can be effectively approximated by the exponential distribution characterized by the parameter V/Re. Moreover, we And that the impacting factors on residual link lifetime are in the decreasing order of node speed, transmission range, node-pair distance. The analytical results are validated by extensive simulations.

title: Generalized Parallel Interference Cancellation With Near-Optimal Detection Performance
abstract: The maximum-likelihood detection (MLD) algorithm is the optimal detection scheme for vertical Bell Laboratories layered space-time (V-BLAST) systems. However, it is generally infeasible to implement the MLD algorithm in practical systems because of its high computational complexity. In this paper, we used two parallel interference cancellation techniques, including precancellation and postcancellation, to simplify the MLD algorithm into a class of computationally efficient suboptimal detection algorithms, herein called the generalized parallel interference cancellation (GPIC) algorithm. Numerical analysis shows that the GPIC algorithm can approximately achieve the MLD performance with considerably low and stable computational complexity. Furthermore, it can be significantly accelerated via parallel processing methods. With near-optimal performance, low and stable complexity, and high running speed, the GPIC algorithm is very suitable for real-time communication systems.

title: Distributed File System Virtualization Techniques Supporting On-Demand Virtual Machine Environments for Grid Computing
abstract: This paper presents a data management solution which allows fast Virtual Machine (VM) instantiation and efficient run-time execution to support VMs as execution environments in Grid computing. It is based on novel distributed file system virtualization techniques and is unique in that: (1) it provides on-demand cross-domain access to VM state for unmodified VM monitors; (2) it enables private file system channels for VM instantiation by secure tunneling and session-key based authentication; (3) it supports user-level and write-back disk caches, per-application caching policies and middleware-driven consistency models; and (4) it leverages application-specific meta-data associated with files to expedite data transfers. The paper reports on its performance in wide-area setups using VMware-based VMs. Results show that the solution delivers performance over 30% better than native NFS and with warm caches it can bring the application-perceived overheads below 10% compared to a local-disk setup. The solution also allows a VM with 1.6 GB virtual disk and 320 MB virtual memory to be cloned within 160 seconds for the first clone and within 25 seconds for subsequent clones.

title: A user-level secure grid file system
abstract: A grid-wide distributed file system provides convenient data access interfaces that facilitate fine-grained cross-domain data sharing and collaboration. However, existing widely-adopted distributed file systems do not meet the security requirements for grid systems. This paper presents a Secure Grid File System (SGFS) which supports GSI-based authentication and access control, end-to-end message privacy, and integrity. It employs user-level virtualization of NFS to provide transparent grid data access leveraging existing, unmodified clients and servers. It supports user and application-tailored security customization per SGFS session, and leverages secure management services to control and configure the sessions. The system conforms to the GSI grid security infrastructure and allows for seamless integration with other grid middleware. A SGFS prototype is evaluated with both file system benchmarks and typical applications, which demonstrates that it can achieve strong security with an acceptable overhead, and substantially outperform native NFS in wide-area environments by using disk caching.

title: Subspace analysis and optimization for AAM based face alignment
abstract: Active appearance models (AAM) is very powerful for extracting objects, e.g. faces, from images. It is composed of two parts: the AAM subspace model and the AAM search. While these two parts are closely correlated, existing efforts treated them separately and had not considered how to optimize them overall. In this paper, an approach is proposed to optimize the subspace model while considering the search procedure. We first perform a subspace error analysis, and then to minimize the AAM error we propose an approach which optimizes the subspace model according to the search procedure. For the subspace error analysis, we decomposed the subspace error into two parts, which are introduced by the subspace model and the search procedure respectively. This decomposition shows that the optimal results of AAM can be achieved only by optimizing both of them jointly rather than separately. Furthermore, based on this error decomposition, we develop a method to find the optimal subspace model according to the search procedure by considering both the two decomposed errors. Experimental results demonstrate that our method can find the optimal AAM subspace model rapidly and improve the performance of AAM significantly.

title: On the Use of Virtualization and Service Technologies to Enable Grid-Computing
abstract: The In-VIGO approach to Grid-computing relies on the dynamic establishment of virtual grids on which application services are instantiated. In-VIGO was conceived to enable computational science to take place In Virtual Information Grid Organizations. Having its first version deployed on July of 2003, In-VIGO middleware is currently used by scientists from various disciplines, a noteworthy example being the computational nanoelectronics research community (http://www.nanohub.org). All components of an In-VIGO-generated virtual grid – machines, networks, applications and data – are themselves virtual and services are provided for their dynamic creation. This article reviews the In-VIGO approach to Grid-computing and overviews the associated middleware techniques and architectures for virtualizing Grid components, using services for creation of virtual grids and automatically Grid-enabling unmodified applications. The In-VIGO approach to the implementation of virtual networks and virtual application services are discussed as examples of Grid-motivated approaches to resource virtualization and Web-service creation.