Transmit Power Minimization for MIMO Systems of Exponential Average BER with Fixed Outage Probability

This document is the Accepted Manuscript version of the following article: Dian-Wu Yue, and Yichuang Sun, ‘Transmit Power Minimization for MIMO Systems of Exponential Average BER with Fixed Outage Probability’, Wireless Personal Communications, Vol. 90 (4): 1951-1970, first available online on 20 June 2016. Under embargo. Embargo end date: 20 June 2017. The final publication is available at Springer via https://link.springer.com/article/10.1007%2Fs11277-016-3432-4This paper is concerned with a wireless multiple-antenna system operating in multiple-input multiple-output (MIMO) fading channels with channel state information being known at both transmitter and receiver. By spatiotemporal subchannel selection and power control, it aims to minimize the average transmit power (ATP) of the MIMO system while achieving an exponential type of average bit error rate (BER) for each data stream. Under the constraints on each subchannel that individual outage probability and average BER are given, based on a traditional upper bound and a dynamic upper bound of Q function, two closed-form ATP expressions are derived, respectively, which can result in two different power allocation schemes. Numerical results are provided to validate the theoretical analysis, and show that the power allocation scheme with the dynamic upper bound can achieve more power savings than the one with the traditional upper bound.Peer reviewe

Cyclic division algebras: a tool for space-time coding

Multiple antennas at both the transmitter and receiver ends of a wireless digital transmission channel may increase both data rate and reliability. Reliable high rate transmission over such channels can only be achieved through Space–Time coding. Rank and determinant code design criteria have been proposed to enhance diversity and coding gain. The special case of full-diversity criterion requires that the difference of any two distinct codewords has full rank. Extensive work has been done on Space–Time coding, aiming at finding fully diverse codes with high rate. Division algebras have been proposed as a new tool for constructing Space–Time codes, since they are non-commutative algebras that naturally yield linear fully diverse codes. Their algebraic properties can thus be further exploited to improve the design of good codes. The aim of this work is to provide a tutorial introduction to the algebraic tools involved in the design of codes based on cyclic division algebras. The different design criteria involved will be illustrated, including the constellation shaping, the information lossless property, the non-vanishing determinant property, and the diversity multiplexing trade-off. The final target is to give the complete mathematical background underlying the construction of the Golden code and the other Perfect Space–Time block codes

Secure and Private Cloud Storage Systems with Random Linear Fountain Codes

An information theoretic approach to security and privacy called Secure And Private Information Retrieval (SAPIR) is introduced. SAPIR is applied to distributed data storage systems. In this approach, random combinations of all contents are stored across the network. Our coding approach is based on Random Linear Fountain (RLF) codes. To retrieve a content, a group of servers collaborate with each other to form a Reconstruction Group (RG). SAPIR achieves asymptotic perfect secrecy if at least one of the servers within an RG is not compromised. Further, a Private Information Retrieval (PIR) scheme based on random queries is proposed. The PIR approach ensures the users privately download their desired contents without the servers knowing about the requested contents indices. The proposed scheme is adaptive and can provide privacy against a significant number of colluding servers.Comment: 8 pages, 2 figure

Information decomposition of multichannel EMG to map functional interactions in the distributed motor system

The central nervous system needs to coordinate multiple muscles during postural control. Functional coordination is established through the neural circuitry that interconnects different muscles. Here we used multivariate information decomposition of multichannel EMG acquired from 14 healthy participants during postural tasks to investigate the neural interactions between muscles. A set of information measures were estimated from an instantaneous linear regression model and a time-lagged VAR model fitted to the EMG envelopes of 36 muscles. We used network analysis to quantify the structure of functional interactions between muscles and compared them across experimental conditions. Conditional mutual information and transfer entropy revealed sparse networks dominated by local connections between muscles. We observed significant changes in muscle networks across postural tasks localized to the muscles involved in performing those tasks. Information decomposition revealed distinct patterns in task-related changes: unimanual and bimanual pointing were associated with reduced transfer to the pectoralis major muscles, but an increase in total information compared to no pointing, while postural instability resulted in increased information, information transfer and information storage in the abductor longus muscles compared to normal stability. These findings show robust patterns of directed interactions between muscles that are task-dependent and can be assessed from surface EMG recorded during static postural tasks. We discuss directed muscle networks in terms of the neural circuitry involved in generating muscle activity and suggest that task-related effects may reflect gain modulations of spinal reflex pathways