Channel estimation for two-way MIMO relay systems in frequency-selective fading environments

In this paper, we investigate the channel estimation problem for two-way multiple-input multiple-output(MIMO) relay communication systems in frequency-selective fading environments. We apply themethod of superimposed channel training to estimate the individual channel state information (CSI) ofthe first-hop and second-hop links for two-way MIMO relay systems with frequency-selective fadingchannels. In this algorithm, a relay training sequence is superimposed on the received signals at the relay node to assist the estimation of the second-hop channel matrices. The optimal structure of the source and relay training sequences is derived to minimize the mean-squared error (MSE) of channel estimation. Moreover, the optimal power allocation between the source and relay training sequences is derived to improve the performance of channel estimation. Numerical examples are shown to demonstrate the performance of the proposed superimposed channel training algorithm for two-way MIMO relay systems in frequency-selective fading environments

Opportunities and Challenges for Error Correction Scheme for Wireless Body Area Network: A Survey

This paper offers a review of different types of Error Correction Scheme (ECS) used in communication systems in general, which is followed by a summary of the IEEE standard for Wireless Body Area Network (WBAN). The possible types of channels and network models for WBAN are presented that are crucial to the design and implementation of ECS. Following that, a literature review on the proposed ECSs for WBAN is conducted based on different aspects. One aspect of the review is to examine what type of parameters are considered during the research work. The second aspect of the review is to analyse how the reliability is measured and whether the research works consider the different types of reliability and delay requirement for different data types or not. The review indicates that the current literatures do not utilize the constraints that are faced by WBAN nodes during ECS design. Subsequently, we put forward future research challenges and opportunities on ECS design and the implementation for WBAN when considering computational complexity and the energy-constrained nature of nodes

Information Theoretic Limits of State-dependent Networks

We investigate the information theoretic limits of two types of state-dependent models in this dissertation. These models capture a wide range of wireless communication scenarios where there are interference cognition among transmitters. Hence, information theoretic studies of these models provide useful guidelines for designing new interference cancellation schemes in practical wireless networks. In particular, we first study the two-user state-dependent Gaussian multiple access channel (MAC) with a helper. The channel is corrupted by an additive Gaussian state sequence known to neither the transmitters nor the receiver, but to a helper noncausally, which assists state cancellation at the receiver. Inner and outer bounds on the capacity region are first derived, which improve the state-of-the-art bounds given in the literature. Further comparison of these bounds yields either segments on the capacity region boundary or the full capacity region by considering various regimes of channel parameters. We then study the two-user Gaussian state-dependent Z-interference channel (Z-IC), in which two receivers are corrupted respectively by two correlated states that are noncausally known to transmitters, but unknown to receivers. Three interference regimes are studied, and the capacity region or the sum capacity boundary is characterized either fully or partially under various channel parameters. The impact of the correlation between the states on the cancellation of state and interference as well as the achievability of the capacity is demonstrated via numerical analysis. Finally, we extend our results on the state-dependent Z-IC to the state-dependent regular IC. As both receivers in the regular IC are interfered, more sophisticated achievable schemes are designed. For the very strong regime, the capacity region is achieved by a scheme where the two transmitters implement a cooperative dirty paper coding. For the strong but not very strong regime, the sum-rate capacity is characterized by rate splitting, layered dirty paper coding and successive cancellation. For the weak regime, the sum-rate capacity is achieved via dirty paper coding individually at two receivers as well as treating interference as noise. Numerical investigation indicates that for the regular IC, the correlation between states impacts the achievability of the channel capacity in a different way from that of the Z-IC

Automatic Search of Bit-Based Division Property for ARX Ciphers and Word-Based Division Property

Division property is a generalized integral property proposed by Todo at Eurocrypt 2015. Previous tools for automatic searching are mainly based on the Mixed Integer Linear Programming (MILP) method and trace the division property propagation at the bit level. In this paper, we propose automatic tools to detect ARX ciphers\u27 division property at the bit level and some specific ciphers\u27 division property at the word level. For ARX ciphers, we construct the automatic searching tool relying on Boolean Satisfiability Problem (SAT) instead of MILP, since SAT method is more suitable in the search of ARX ciphers\u27 differential/linear characteristics. The propagation of division property is translated into a system of logical equations in Conjunctive Normal Form (CNF). Some logical equations can be dynamically adjusted according to different initial division properties and stopping rule, while the others corresponding to r-round propagations remain the same. Moreover, our approach can efficiently identify some optimized distinguishers with lower data complexity. As a result, we obtain a 17-round distinguisher for SHACAL-2, which gains four more rounds than previous work, and an 8-round distinguisher for LEA, which covers one more round than the former one. For word-based division property, we develop the automatic search based on Satisfiability Modulo Theories (SMT), which is a generalization of SAT. We model division property propagations of basic operations and S-boxes by logical formulas, and turn the searching problem into an SMT problem. With some available solvers, we achieve some new distinguishers. For CLEFIA, 10-round distinguishers are obtained, which cover one more round than the previous work. For the internal block cipher of Whirlpool, the data complexities of 4/5-round distinguishers are improved. For Rijndael-192 and Rijndael-256, 6-round distinguishers are presented, which attain two more rounds than the published ones. Besides, the integral attacks for CLEFIA are improved by one round with the newly obtained distinguishers