Bit-Interleaved Coded Multiple Beamforming with Perfect Coding

When the Channel State Information (CSI) is known by both the transmitter and the receiver, beamforming techniques employing Singular Value Decomposition (SVD) are commonly used in Multiple-Input Multiple-Output (MIMO) systems. Without channel coding, there is a trade-off between full diversity and full multiplexing. When channel coding is added, both of them can be achieved as long as the code rate Rc and the number of employed subchannels S satisfy the condition RcS<=1. By adding a properly designed constellation precoder, both full diversity and full multiplexing can be achieved for both uncoded and coded systems with the trade-off of a higher decoding complexity, e.g., Fully Precoded Multiple Beamforming (FPMB) and Bit-Interleaved Coded Multiple Beamforming with Full Precoding (BICMB-FP) without the condition RcS<=1. Recently discovered Perfect Space-Time Block Code (PSTBC) is a full-rate full-diversity space-time code, which achieves efficient shaping and high coding gain for MIMO systems. In this paper, a new technique, Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), is introduced. BICMB-PC transmits PSTBCs through convolutional coded SVD systems. Similar to BICMB-FP, BICMB-PC achieves both full diversity and full multiplexing, and its performance is almost the same as BICMB-FP. The advantage of BICMB-PC is that it can provide a much lower decoding complexity than BICMB-FP, since the real and imaginary parts of the received signal can be separated for BICMB-PC of dimensions 2 and 4, and only the part corresponding to the coded bit is required to acquire one bit metric for the Viterbi decoder.Comment: accepted to conference; Proc. IEEE ICC 201

Multiple Beamforming with Perfect Coding

Perfect Space-Time Block Codes (PSTBCs) achieve full diversity, full rate, nonvanishing constant minimum determinant, uniform average transmitted energy per antenna, and good shaping. However, the high decoding complexity is a critical issue for practice. When the Channel State Information (CSI) is available at both the transmitter and the receiver, Singular Value Decomposition (SVD) is commonly applied for a Multiple-Input Multiple-Output (MIMO) system to enhance the throughput or the performance. In this paper, two novel techniques, Perfect Coded Multiple Beamforming (PCMB) and Bit-Interleaved Coded Multiple Beamforming with Perfect Coding (BICMB-PC), are proposed, employing both PSTBCs and SVD with and without channel coding, respectively. With CSI at the transmitter (CSIT), the decoding complexity of PCMB is substantially reduced compared to a MIMO system employing PSTBC, providing a new prospect of CSIT. Especially, because of the special property of the generation matrices, PCMB provides much lower decoding complexity than the state-of-the-art SVD-based uncoded technique in dimensions 2 and 4. Similarly, the decoding complexity of BICMB-PC is much lower than the state-of-the-art SVD-based coded technique in these two dimensions, and the complexity gain is greater than the uncoded case. Moreover, these aforementioned complexity reductions are achieved with only negligible or modest loss in performance.Comment: accepted to journa

Near-Optimal Energy-Efficient Joint Resource Allocation for Multi-Hop MIMO-AF Systems

Energy efficiency (EE) is becoming an important performance indicator for ensuring both the economical and environmental sustainability of the next generation of communication networks. Equally, cooperative communication is an effective way of improving communication system performances. In this paper, we propose a near-optimal energy-efficient joint resource allocation algorithm for multi-hop multiple-input-multiple-output (MIMO) amplify-and-forward (AF) systems. We first show how to simplify the multivariate unconstrained EE-based problem, based on the fact that this problem has a unique optimal solution, and then solve it by means of a low-complexity algorithm. We compare our approach with classic optimization tools in terms of energy efficiency as well as complexity, and results indicate the near-optimality and low-complexity of our approach. As an application, we use our approach to compare the EE of multi-hop MIMO-AF with MIMO systems and our results show that the former outperforms the latter mainly when the direct link quality is poor

Recent advances in wireless sensor networks with environmental energy harvesting

Shu, L.; Liao, W.; Lloret, J.; Wang, L. (2016). Recent advances in wireless sensor networks with environmental energy harvesting. International Journal of Sensor Networks. 21(4):205-207. http://hdl.handle.net/10251/18736720520721

Reduced Complexity Sphere Decoding

In Multiple-Input Multiple-Output (MIMO) systems, Sphere Decoding (SD) can achieve performance equivalent to full search Maximum Likelihood (ML) decoding, with reduced complexity. Several researchers reported techniques that reduce the complexity of SD further. In this paper, a new technique is introduced which decreases the computational complexity of SD substantially, without sacrificing performance. The reduction is accomplished by deconstructing the decoding metric to decrease the number of computations and exploiting the structure of a lattice representation. Furthermore, an application of SD, employing a proposed smart implementation with very low computational complexity is introduced. This application calculates the soft bit metrics of a bit-interleaved convolutional-coded MIMO system in an efficient manner. Based on the reduced complexity SD, the proposed smart implementation employs the initial radius acquired by Zero-Forcing Decision Feedback Equalization (ZF-DFE) which ensures no empty spheres. Other than that, a technique of a particular data structure is also incorporated to efficiently reduce the number of executions carried out by SD. Simulation results show that these approaches achieve substantial gains in terms of the computational complexity for both uncoded and coded MIMO systems.Comment: accepted to Journal. arXiv admin note: substantial text overlap with arXiv:1009.351

Achieve Secure Handover Session Key Management via Mobile Relay in LTE-Advanced Networks

Internet of Things is increasing the network by group action immense quantity of close objects which needs the secure and reliable transmission of the high volume knowledge generation, and also the mobile relay technique is one among the economical ways in which to satisfy the on-board knowledge explosion in LTE-Advanced (LTE-A) networks. However, the observe of the mobile relay can cause potential threats to the knowledge security throughout the relinquishing method. Therefore, to handle this challenge, during this paper, we have a tendency to propose a secure relinquishing session key management theme via mobile relay in LTE-A networks. Specifically, within the planned theme, to realize forward and backward key separations, the session key shared between the on-board user instrumentality (UE) and also the connected donor evolved node B (DeNB) is initial generated by the on-board UE then firmly distributed to the DeNB. moreover, to cut back the communication overhead and also the process complexness, a unique proxy re-encryption technique is used, wherever the session keys at the start encrypted with the general public key of the quality management entity (MME) are going to be re-encrypted by a mobile relay node (MRN), so alternative DeNB will later rewrite the session keys with their own non-public keys whereas while not the direct involvement of the MME. elaborated security analysis shows that the planned theme will with success establish session keys between the on-board UEs and their connected DeNB, achieving backward and forward key separations, and resisting against the collusion between the MRN and also the DeNB because the same time. Additionally, performance evaluations via in depth simulations area unit applied to demonstrate the potency and effectiveness of the planned theme

Efficient Support for Video Communications in Wireless Home Networks

This paper investigates the performance of video communications over wireless networks employing the recently proposed Time-Division Unbalanced Carrier Sense Multiple access (TDuCSMA) coordination function. TDuCSMA is fully IEEE 802.11 standard compliant but offers novel bandwidth management capabilities. In this work the peculiar characteristics of TDuCSMA are configured and exploited to maximize the performance of video communications in a realistic home networking scenario. Simulation results show significant performance improvements with respect to legacy IEEE 802.11 network. The video quality gains are up to 13 dB PSNR with 500 ms playout buffer, while the average delay of the video packets is much lower, for the same amount of video traffic offered to the network. These results significantly contribute to enhance the quality of experience of the users of the video communicatio

Supporting Triple-Play Communications with TDuCSMA and First Experiments

This work addresses the implications of using the Time-Division Unbalanced Carrier Sense Multiple Access (TDuCSMA) coordination function to support triple-play services. Firstly, the theoretical background of TDuCSMA is reported, presenting its advantages and discussing its full compliance with the IEEE 802.11 standard. Secondly, a prototype of TDuCSMA is discussed in details. Then, a set of experiments with the prototype implementation of TDuCSMA is presented, showing for the first time the advantages of TDuCSMA in a realistic setting with audio, video and elastic data applications. Experimental results show the superiority of TDuCSMA over the legacy 802.11 Medium Access Control (MAC) in terms of both channel utilization and Quality of Experience (QoE) as measured at the application leve

Delay Minimization for Instantly Decodable Network Coding in Persistent Channels with Feedback Intermittence

In this paper, we consider the problem of minimizing the multicast decoding delay of generalized instantly decodable network coding (G-IDNC) over persistent forward and feedback erasure channels with feedback intermittence. In such an environment, the sender does not always receive acknowledgement from the receivers after each transmission. Moreover, both the forward and feedback channels are subject to persistent erasures, which can be modelled by a two state (good and bad states) Markov chain known as Gilbert-Elliott channel (GEC). Due to such feedback imperfections, the sender is unable to determine subsequent instantly decodable packets combination for all receivers. Given this harsh channel and feedback model, we first derive expressions for the probability distributions of decoding delay increments and then employ these expressions in formulating the minimum decoding problem in such environment as a maximum weight clique problem in the G-IDNC graph. We also show that the problem formulations in simpler channel and feedback models are special cases of our generalized formulation. Since this problem is NP-hard, we design a greedy algorithm to solve it and compare it to blind approaches proposed in literature. Through extensive simulations, our adaptive algorithm is shown to outperform the blind approaches in all situations and to achieve significant improvement in the decoding delay, especially when the channel is highly persisten