Search

Bayesian neural networks (BayesNNs) have demonstrated their advantages in various safety-critical applications, such as autonomous driving or healthcare, due to their ability to capture and represent model uncertainty. However, standard BayesNNs require to be repeatedly run because of Monte Carlo sampling to quantify their uncertainty, which puts a burden on their real-world hardware performance. To address this performance issue, this paper systematically exploits the extensive structured sparsity and redundant computation in BayesNNs. Different from the unstructured or structured sparsity in standard convolutional NNs, the structured sparsity of BayesNNs is introduced by Monte Carlo Dropout and its associated sampling required during uncertainty estimation and prediction, which can be exploited through both algorithmic and hardware optimizations. We first classify the observed sparsity patterns into three categories: channel sparsity, layer sparsity and sample sparsity. On the algorithmic side, a framework is proposed to automatically explore these three sparsity categories without sacrificing algorithmic performance. We demonstrated that structured sparsity can be exploited to accelerate CPU designs by up to 49 times, and GPU designs by up to 40 times. On the hardware side, a novel hardware architecture is proposed to accelerate BayesNNs, which achieves a high hardware performance using the runtime adaptable hardware engines and the intelligent skipping support. Upon implementing the proposed hardware design on an FPGA, our experiments demonstrated that the algorithm-optimized BayesNNs can achieve up to 56 times speedup when compared with unoptimized Bayesian nets. Comparing with the optimized GPU implementation, our FPGA design achieved up to 7.6 times speedup and up to 39.3 times higher energy efficiency.

Lattices are a popular field of study in mathematical research, but also in more practical areas like cryptology or multiple-input/multiple-output (MIMO) transmission. In mathematical theory, most often lattices over real numbers are considered. However, in communications, complex-valued processing is usually of interest. Besides, by the use of dual-polarized transmission as well as by the combination of two time slots or frequencies, four-dimensional (quaternion-valued) approaches become more and more important. Hence, to account for this fact, well-known lattice algorithms and related concepts are generalized in this work. To this end, a brief review of complex arithmetic, including the sets of Gaussian and Eisenstein integers, and an introduction to quaternion-valued numbers, including the sets of Lipschitz and Hurwitz integers, are given. On that basis, generalized variants of two important algorithms are derived: first, of the polynomial-time LLL algorithm, resulting in a reduced basis of a lattice by performing a special variant of the Euclidean algorithm defined for matrices, and second, of an algorithm to calculate the successive minima - the norms of the shortest independent vectors of a lattice - and its related lattice points. Generalized bounds for the quality of the particular results are established and the asymptotic complexities of the algorithms are assessed. These findings are extensively compared to conventional real-valued processing. It is shown that the generalized approaches outperform their real-valued counterparts in complexity and/or quality aspects. Moreover, the application of the generalized algorithms to MIMO communications is studied, particularly in the field of lattice-reduction-aided and integer-forcing equalization.

We propose a novel formulation of the “effectiveness problem” in communications, put forth by Shannon and Weaver in their seminal work “ The Mathematical Theory of Communication ”, by considering multiple agents communicating over a noisy channel in order to achieve better coordination and cooperation in a multi-agent reinforcement learning (MARL) framework. Specifically, we consider a multi-agent partially observable Markov decision process (MA-POMDP), in which the agents, in addition to interacting with the environment, can also communicate with each other over a noisy communication channel. The noisy communication channel is considered explicitly as part of the dynamics of the environment, and the message each agent sends is part of the action that the agent can take. As a result, the agents learn not only to collaborate with each other but also to communicate “effectively” over a noisy channel. This framework generalizes both the traditional communication problem, where the main goal is to convey a message reliably over a noisy channel, and the “learning to communicate” framework that has received recent attention in the MARL literature, where the underlying communication channels are assumed to be error-free. We show via examples that the joint policy learned using the proposed framework is superior to that where the communication is considered separately from the underlying MA-POMDP. This is a very powerful framework, which has many real world applications, from autonomous vehicle planning to drone swarm control, and opens up the rich toolbox of deep reinforcement learning for the design of multi-user communication systems.

Monitoring infrastructure offers functional optimisation, lower maintenance cost, security, stability and data analysis benefits. Sensor nodes require some level of energy autonomy for reliable and cost-effective operation, and energy harvesting methods have been developed in the last two decades for this purpose. Here, a power supply that collects, stores and delivers regulated power from the stray magnetic field of currentcarrying structures is presented. In cm-scale structures the skin effect concentrates current at edges at frequencies even below 1 kHz. A coil-core inductive transducer is designed. A fluxfunnelling soft magnetic core shape is used, multiplying power density by the square of funnelling ratio. A power management circuit combining reactance cancellation, voltage doubling, rectification, super-capacitor storage and switched inductor voltage boosting and regulation is introduced. The power supply is characterised in house and on a full-size industrial setup, demonstrating a power reception density of 0.36 mW/cm3, 0.54 mW/cm3 and 0.73 mW/cm3 from a 25 A RMS structural current at 360 Hz, 500 Hz and 800 Hz respectively, corresponding to the frequency range of aircraft currents. The regulated output is tested under various loads and cold starting is demonstrated. The introduced method may enable power autonomy to wireless sensors deployed in current-carrying infrastructure.

Intelligent task placement and management of tasks in large-scale fog platforms is challenging due to the highly volatile nature of modern workload applications and sensitive user requirements of low energy consumption and response time. Container orchestration platforms have emerged to alleviate this problem with prior art either using heuristics to quickly reach scheduling decisions or AI driven methods like reinforcement learning and evolutionary approaches to adapt to dynamic scenarios. The former often fail to quickly adapt in highly dynamic environments, whereas the latter have run-times that are slow enough to negatively impact response time. Therefore, there is a need for scheduling policies that are both reactive to work efficiently in volatile environments and have low scheduling overheads. To achieve this, we propose a Gradient Based Optimization Strategy using Back-propagation of gradients with respect to Input (GOBI). Further, we leverage the accuracy of predictive digital-twin models and simulation capabilities by developing a Coupled Simulation and Container Orchestration Framework (COSCO). Using this, we create a hybrid simulation driven decision approach, GOBI*, to optimize Quality of Service (QoS) parameters. Co-simulation and the back-propagation approaches allow these methods to adapt quickly in volatile environments. Experiments conducted using real-world data on fog applications using the GOBI and GOBI* methods, show a significant improvement in terms of energy consumption, response time, Service Level Objective and scheduling time by up to 15, 40, 4, and 82 percent respectively when compared to the state-of-the-art algorithms., Comment: Accepted in IEEE Transactions on Parallel and Distributed Systems, 2021

Enhancing information security via reliable user authentication in wireless body area network (WBAN)-based Internet-of-Things (IoT) applications has attracted increasing attention. The noncancelability of traditional biometrics (e.g., fingerprint) for user authentication increases the privacy disclosure risks once the biometric template is exposed, because users cannot volitionally create a new template. In this work, we propose a cancelable biometric modality based on high-density surface electromyogram (HD-sEMG) encoded by hand gesture password, for user authentication. HD-sEMG signals (256 channels) were acquired from the forearm muscles when users performed a prescribed gesture password, forming their biometric token. Thirty four alternative hand gestures in common daily use were studied. Moreover, to reduce the data acquisition and transmission burden in IoT devices, an automatically generated password-specific channel mask was employed to reduce the number of active channels. HD-sEMG biometrics were also robust with reduced sampling rate, further reducing power consumption. HD-sEMG biometrics achieved a low equal error rate (EER) of 0.0013 when impostors entered a wrong gesture password, as validated on 20 subjects. Even if impostors entered the correct gesture password, the HD-sEMG biometrics still achieved an EER of 0.0273. If the HD-sEMG biometric template was exposed, users could cancel it by simply changing it to a new gesture password, with an EER of 0.0013. To the best of our knowledge, this is the first study to employ HD-sEMG signals under common daily hand gestures as biometric tokens, with training and testing data acquired on different days.

Sensor installation on water infrastructure is challenging due to requirements for service interruption, specialised personnel, regulations and reliability as well as the resultant high costs. Here, a minimally invasive installation method is introduced based on hot-tapping and immersion of a sensor probe. A modular architecture is developed that enables the use of interchangeable multi-sensor probes, non-specialist installation and servicing, low-power operation and configurable sensing and connectivity. A prototype implementation with a temperature, pressure, conductivity and flow multi-sensor probe is presented and tested on an evaluation rig. This paper demonstrates simple installation, reliable and accurate sensing capability as well as remote data acquisition. The demonstrated minimally invasive multi-sensor probes provide an opportunity for the deployment of water quality sensors that typically require immersion such as pH and spectroscopic composition analysis. This design allows dynamic deployment on existing water infrastructure with expandable sensing capability and minimal interruption, which can be key to addressing important sensing parameters such as optimal sensor network density and topology.

Network and Service analytics can harness the immense stream of operational data from clouds, to services, to social and communication networks. In the era of big data and connected devices of all varieties, analytics and machine learning have found ways to improve reliability, configuration, performance, fault and security management. In particular, we see a growing trend towards using machine learning, artificial intelligence and data analytics to improve operations and management of information technology services, systems and networks.

Mobile and ubiquitous sensing of urban air quality (AQ) has received increased attention as an economically and operationally viable means to survey atmospheric environment with high spatial–temporal resolution. This article proposes a machine-learning-based mobile air pollution sensing framework, coined Deep-MAPS, and demonstrates its scientific and financial values in the following aspects: 1) based on a combination of fixed and mobile AQ sensors, we perform spatial inference of PM2.5 concentrations in Beijing (3025 km2, June 19–July 16, 2018) for a spatial–temporal resolution of 1 km $\times $ 1 km and 1 h, with under 15% SMAPE; 2) we leverage urban big data to generate insights regarding the potential cause of pollution, which facilitates evidence-based sustainable urban management; and 3) to achieve such spatial–temporal coverage and accuracy, Deep-MAPS can save up to 90% hardware investment, compared with ubiquitous sensing that relies primarily on fixed sensors.

Many mission-critical and latency-sensitive applications require ultra-reliable and low-latency communications(URLLC), which has been listed as a new service category of 5GNew Radio (NR). To guarantee stringent latency and reliability constraints, URLLC services always exclusively occupy the spectrum and have priority over enhanced mobile broadband (eMBB)communications in the current coexistence scenario, which will greatly affect the performance of eMBB services and degrade the utilization efficiency of the spectrum resource. On the other hand, millimeter-wave (mmWave) communications can fulfill thee normous throughput requirements of 5G cellular communications. In this paper, we introduce mmWave communications into URLLC systems to provide a more efficient coexistence for eMBB and URLLC. A novel mmWave URLLC system is first developed, where URLLC users are allowed to share the spectrum resources with eMBB users. Besides, multi-connectivity technology, which enables users to access multiple base stations simultaneously, is introduced to the mmWave URLLC system to enhance the reliability. Then, a resource management problem is formulated, which maximizes the throughput of eMBB users while guaranteeing the latency and reliability requirements of URLLC users. To obtain optimal solutions, we first divide it into three subproblems, i.e., power allocation, resource matching, and user paring, and then solve them respectively. Simulation results demonstrate the data rate improvement compared against the traditional coexistence scenario without reusing strategy. Moreover, the multi-connectivity functionality poses a great effect on guaranteeing the latency and reliability requirements for URLLC users.

The capacity of noisy quantum channels characterizes the highest rate at which information can be reliably transmitted and it is therefore of practical as well as fundamental importance. Capacities of classical channels are computed using alternating optimization schemes, called Blahut-Arimoto algorithms. In this work, we generalize classical Blahut-Arimoto algorithms to the quantum setting. In particular, we give efficient iterative schemes to compute the capacity of channels with classical input and quantum output, the quantum capacity of less noisy channels, the thermodynamic capacity of quantum channels, as well as the entanglement-assisted capacity of quantum channels. We give rigorous a priori and a posteriori bounds on the estimation error by employing quantum entropy inequalities and demonstrate fast convergence of our algorithms in numerical experiments., Comment: v4: 22 pages, 4 figures, new title

Cloud and network analytics can harness the immense stream of operational data from clouds and networks, and can perform analytics processing to improve reliability, configuration, performance, fault and security management. In particular, we see a growing trend towards using statistical analysis, Artificial Intelligence (AI) and machine learning to improve operations and management of IT systems and networks.

Most results on coded caching focus on a static scenario, in which a fixed number of users synchronously place their requests from a content library, and the performance is measured in terms of the latency in satisfying all of these demands. In practice, however, users start watching an online video content asynchronously over time, and often abort watching a video before it is completed. The latter behaviour is captured by the notion of audience retention rate, which measures the portion of a video content watched on average. In order to bring coded caching one step closer to practice, asynchronous user demands are considered in this paper, by allowing user demands to arrive randomly over time, and both the popularity of video files, and the audience retention rates are taken into account. A decentralized partial coded caching (PCC) scheme is proposed, together with two cache allocation schemes; namely the optimal cache allocation (OCA) and the popularity-based cache allocation (PCA), which allocate users' caches among different chunks of the video files in the library. Numerical results validate that the proposed PCC scheme, either with OCA or PCA, outperforms conventional uncoded caching as well as the state-of-the-art decentralized caching schemes, which consider only the file popularities, and are designed for synchronous demand arrivals. An information-theoretical lower bound on the average delivery rate is also presented., Comment: 30 pages, 5 figures

This paper describes the design, implementation and evaluation of a first of its kind cross-layer protocol for wireless communication between flying agents and terrestrial wireless sensors. The protocol is composed of three layers: a new application layer built upon a modified implementation of ContikiMAC over the IEEE 802.15.4 2.4 GHz physical layer. The experimental evaluation shows the protocol to have excellent energy efficiency, low latency and high reliability—approaching 100% for certain parameter settings and operational conditions. The effects of speed, altitude, and direction of approach are also experimentally evaluated, demonstrating that it is of critical importance to take these into account when planning mobile aerial data collection campaigns.

Distributed software-defined networks (SDN), consisting of multiple inter-connected network domains, each managed by one SDN controller, is an emerging networking architecture that offers balanced centralized control and distributed operations. Under such a networking paradigm, most existing works focus on designing sophisticated controller-synchronization strategies to improve joint controller-decision-making for inter-domain routing. However, there is still a lack of fundamental understanding of how the performance of distributed SDN is related to network attributes, thus it is impossible to justify the necessity of complicated strategies. In this regard, we analyze and quantify the performance enhancement of distributed SDN architectures, which is influenced by intra-/inter-domain synchronization levels and network structural properties. Based on a generic network model, we establish analytical methods for performance estimation under four canonical inter-domain synchronization scenarios. Specifically, we first derive an asymptotic expression to quantify how dominating structural and synchronization-related parameters affect the performance metric. We then provide performance analytics for an important family of networks, where all links are of equal preference for path constructions. Finally, we establish fine-grained performance metric expressions for networks with dynamically adjusted link preferences. Our theoretical results reveal how network performance is related to synchronization levels and intra-/inter-domain connections, the accuracy of which is confirmed by simulations based on both real and synthetic networks. To the best of our knowledge, this is the first work quantifying the performance of distributed SDN in terms of network structural properties and synchronization levels.

Indoor localization has recently witnessed an increase in interest, due to the potential wide range of services it can provide by leveraging Internet of Things (IoT), and ubiquitous connectivity. Different techniques, wireless technologies and mechanisms have been proposed in the literature to provide indoor localization services in order to improve the services provided to the users. However, there is a lack of an up-to-date survey paper that incorporates some of the recently proposed accurate and reliable localization systems. In this paper, we aim to provide a detailed survey of different indoor localization techniques such as Angle of Arrival (AoA), Time of Flight (ToF), Return Time of Flight (RTOF), Received Signal Strength (RSS); based on technologies such as WiFi, Radio Frequency Identification Device (RFID), Ultra Wideband (UWB), Bluetooth and systems that have been proposed in the literature. The paper primarily discusses localization and positioning of human users and their devices. We highlight the strengths of the existing systems proposed in the literature. In contrast with the existing surveys, we also evaluate different systems from the perspective of energy efficiency, availability, cost, reception range, latency, scalability and tracking accuracy. Rather than comparing the technologies or techniques, we compare the localization systems and summarize their working principle. We also discuss remaining challenges to accurate indoor localization., This work has been submitted to the IEEE for possible publication

Application partitioning that splits the executions into local and remote parts, plays a critical role in high-performance mobile offloading systems. Optimal partitioning will allow mobile devices to obtain the highest benefit from Mobile Cloud Computing (MCC) or Mobile Edge Computing (MEC). Due to unstable resources in the wireless network (network disconnection, bandwidth fluctuation, network latency, etc.) and at the service nodes (different speeds of mobile devices and cloud/edge servers, memory, etc.), static partitioning solutions with fixed bandwidth and speed assumptions are unsuitable for offloading systems. In this paper, we study how to dynamically partition a given application effectively into local and remote parts while reducing the total cost to the degree possible. For general tasks (represented in arbitrary topological consumption graphs), we propose a Min-Cost Offloading Partitioning (MCOP) algorithm that aims at finding the optimal partitioning plan (i.e., to determine which portions of the application must run on the mobile device and which portions on cloud/edge servers) under different cost models and mobile environments. Simulation results show that the MCOP algorithm provides a stable method with low time complexity which significantly reduces execution time and energy consumption by optimally distributing tasks between mobile devices and servers, besides it adapts well to mobile environmental changes.

The growth of Internet of Things (IoT) devices with multiple radio interfaces has resulted in a number of urban-scale deployments of IoT multinetworks, where heterogeneous wireless communication solutions coexist (e.g., WiFi, Bluetooth, Cellular). Managing the multinetworks for seamless IoT access and handover, especially in mobile environments, is a key challenge. Software-defined networking (SDN) is emerging as a promising paradigm for quick and easy configuration of network devices, but its application in urban-scale multinetworks requiring heterogeneous and frequent IoT access is not well studied. In this paper we present UbiFlow, the first software-defined IoT system for combined ubiquitous flow control and mobility management in urban heterogeneous networks. UbiFlow adopts multiple controllers to divide urban-scale SDN into different geographic partitions (assigning one controller per partition) and achieve distributed control of IoT flows. A distributed hashing based overlay structure is proposed to maintain network scalability and consistency. Based on this UbiFlow overlay structure, the relevant issues pertaining to mobility management such as scalable control, fault tolerance, and load balancing have been carefully examined and studied. The UbiFlow controller differentiates flow scheduling based on per-device requirements and whole-partition capabilities. Therefore, it can present a network status view and optimized selection of access points in multinetworks to satisfy IoT flow requests, while guaranteeing network performance for each partition. Simulation and realistic testbed experiments confirm that UbiFlow can successfully achieve scalable mobility management and robust flow scheduling in IoT multinetworks; e.g., 67.21 percent throughput improvement, 72.99 percent reduced delay, and 69.59 percent jitter improvements, compared with alternative SDN systems.

The Software-Defined Networking (SDN) paradigm can allow network management solutions to automatically and frequently reconfigure network resources. When developing SDN- based management architectures, it is of paramount importance to design a monitoring system that can provide timely and consistent updates to heterogeneous management applications. To support such applications operating with low latency re- quirements, the monitoring system should scale with increasing network size and provide precise network views with minimum overhead on the available resources. In this paper we present a novel, self-adaptive, decentralized framework for resource monitoring in SDN. Our framework enables accurate statistics to be collected with limited burden on the network resources. This is realized through a self-tuning, adaptive monitoring mechanism that automatically adjusts its settings based on the traffic dy- namics. We evaluate our proposal based on a realistic use case scenario, where a content distribution service and an on-demand gaming platform are deployed within an ISP network. The results show that reduced monitoring latencies are obtained with the proposed framework, thus enabling shorter reconfiguration control loops. In addition, the proposed adaptive monitoring method achieves significant gain in terms of monitoring overhead, while preserving the performance of the services considered.

In this paper we show that any sequence of infinite lattice constellations which is good for the unconstrained Gaussian channel can be shaped into a capacity-achieving sequence of codes for the power-constrained Gaussian channel under lattice decoding and non-uniform signalling. Unlike previous results in the literature, our scheme holds with no extra condition on the lattices (e.g. quantization-goodness or vanishing flatness factor), thus establishing a direct implication between AWGN-goodness, in the sense of Poltyrev, and capacity-achieving codes. Our analysis uses properties of the discrete Gaussian distribution in order to obtain precise bounds on the probability of error and achievable rates. In particular, we obtain a simple characterization of the finite-blocklength behavior of the scheme, showing that it approaches the optimal dispersion coefficient for \textit{high} signal-to-noise ratio. We further show that for \textit{low} signal-to-noise ratio the discrete Gaussian over centered lattice constellations can not achieve capacity, and thus a shift (or "dither") is essentially necessary., Comment: 20 pages, 2 figures - added two sections (IV-C and IV-D) on finite dithers and reduced peak power

Cloud and network analytics can harness the immense stream of operational data from clouds and networks, and can perform analytics processing to improve reliability, automated configuration, performance, and optimized network management in general. In this area, we have witnessed a growing trend towards using statistical analysis and machine learning techniques to improve operations and management of IT systems and networks.

In this work, an explicit wiretap coding scheme based on polar lattices is proposed to achieve the secrecy capacity of the additive white Gaussian noise (AWGN) wiretap channel. Firstly, polar lattices are used to construct secrecy-good lattices for the mod-$\Lambda_s$ Gaussian wiretap channel. Then we propose an explicit shaping scheme to remove this mod-$\Lambda_s$ front end and extend polar lattices to the genuine Gaussian wiretap channel. The shaping technique is based on the lattice Gaussian distribution, which leads to a binary asymmetric channel at each level for the multilevel lattice codes. By employing the asymmetric polar coding technique, we construct an AWGN-good lattice and a secrecy-good lattice with optimal shaping simultaneously. As a result, the encoding complexity for the sender and the decoding complexity for the legitimate receiver are both O(N logN log(logN)). The proposed scheme is proven to be semantically secure., Comment: Submitted to IEEE Trans. Information Theory, revised. This is the authors' own version of the paper

Waveform design is a key technique to jointly exploit a beamforming gain, the channel frequency-selectivity and the rectifier nonlinearity, so as to enhance the end-to-end power transfer efficiency of Wireless Power Transfer (WPT). Those waveforms have been designed assuming perfect channel state information at the transmitter. This paper proposes two waveform strategies relying on limited feedback for multi-antenna multi-sine WPT over frequency-selective channels. In the waveform selection strategy, the Energy Transmitter (ET) transmits over multiple timeslots with every time a different waveform precoder within a codebook, and the Energy Receiver (ER) reports the index of the precoder in the codebook that leads to the largest harvested energy. In the waveform refinement strategy, the ET sequentially transmits two waveforms in each stage, and the ER reports one feedback bit indicating an increase/decrease in the harvested energy during this stage. Based on multiple one-bit feedback, the ET successively refines waveform precoders in a tree-structured codebook over multiple stages. By employing the framework of the generalized Lloyd's algorithm, novel algorithms are proposed for both strategies to optimize the codebooks in both space and frequency domains. The proposed limited feedback-based waveform strategies are shown to outperform a set of baselines, achieving higher harvested energy., Accepted to IEEE Transactions on Wireless Communications

Zero-delay transmission of a Gaussian source over an additive white Gaussian noise (AWGN) channel is considered with a one-bit analog-to-digital converter (ADC) front end and a correlated side information at the receiver. The design of the optimal encoder and decoder is studied for two different performance criteria, namely the mean squared error (MSE) distortion and the distortion outage probability (DOP), under an average power constraint on the channel input. For both criteria, necessary optimality conditions for the encoder and the decoder are derived, which are then used to numerically obtain encoder and decoder mappings that satisfy these conditions. Using these conditions, it is observed that the numerically optimized encoder (NOE) under the MSE distortion criterion is periodic, and its period increases with the correlation between the source and the receiver side information. For the DOP, it is instead seen that the NOE mappings periodically acquire positive and negative values, which decay to zero with increasing source magnitude, and the interval over which the mapping takes non-zero values becomes wider with the correlation between the source and the side information. Finally, inspired by the mentioned properties of the NOE mappings, parameterized encoder mappings with a small number of degrees of freedom are proposed for both distortion criteria, and their performance is compared with that of the NOE mappings.

The management of network infrastructures has become increasingly complex over time, which is mainly attributed to the introduction of new functionality to support emerging services and applications. To address this important issue, research efforts in the last few years focused on developing software-defined networking solutions. While initial work proposed centralized architectures, their scalability limitations have led researchers to investigate a distributed control plane. Controller placement algorithms and mechanisms for building a logically centralized network view are some examples of challenges addressed in this context. A critical issue that requires specific attention concerns the communication between distributed entities involved in decision-making processes. To this end, we propose SigMA, a signaling framework that supports communication between the different entities of a decentralized management and control system. We also define the communication primitives and interfaces involved in such a decentralized environment. The benefits of SigMA are illustrated through three realistic network resource management use cases with different communication requirements. Based on simulation, we demonstrate the flexibility and extensibility of our solution in satisfying these requirements, thus effectively supporting advanced decentralized decision-making processes.

We propose several low-complexity transmit antenna selection (TAS) and precoding schemes for massive multi-input multi-output (M-MIMO). It is well established that large antenna arrays in M-MIMO lead to particularly high hardware overheads as they require an equally large number of radio-frequency chains, and antenna selection is envisaged as a solution to reducing this hardware complexity. Accordingly, in the proposed schemes, both hardware and computational complexity of M-MIMO systems are addressed by jointly optimizing TAS and precoding. We first introduce a mixed-integer programming approach that simultaneously identifies the transmitting antennas subset and solves the precoding problem, by employing a unified metric based on constructive interference (CI) concept. We then propose three sub-optimal techniques that allow a reduction of the computational complexity required to solve the joint optimization. Our analyses and results prove that the proposed joint TAS and precoding schemes based on CI exploitation are able to outperform the state-of-the-art, while providing a favorable performance-complexity tradeoff.

The capacity of a deterministic multiple-input multiple-output (MIMO) channel under the peak and average power constraints is investigated. For the identity channel matrix, the approach of Shamai et al. is generalized to the higher dimension settings to derive the necessary and sufficient conditions for the optimal input probability density function. This approach prevents the usage of the identity theorem of the holomorphic functions of several complex variables which seems to fail in the multi-dimensional scenarios. It is proved that the support of the capacity-achieving distribution is a finite set of hyper-spheres with mutual independent phases and amplitude in the spherical domain. Subsequently, it is shown that when the average power constraint is relaxed, if the number of antennas is large enough, the capacity has a closed form solution and constant amplitude signaling at the peak power achieves it. Moreover, it will be observed that in a discrete-time memoryless Gaussian channel, the average power constrained capacity, which results from a Gaussian input distribution, can be closely obtained by an input where the support of its magnitude is a discrete finite set. Finally, we investigate some upper and lower bounds for the capacity of the non-identity channel matrix and evaluate their performance as a function of the condition number of the channel., 20 pages, 12 figures, accepted for publication in IEEE Trans. on Information Theory

With requirements of spiraling data rates and limited spectrum availability, there is an increased interest in mm-wave beamformer-based communications for 5G. For upcoming cellular networks, the critical point is to exploit the increased number of employable antennas at both Tx and Rx to: 1) combat increased path loss; 2) tackle higher interference due to higher user density; and 3) handle multipath effects in frequency selective channels. Toward this, a multi-beam spatiotemporal superresolution beamforming framework is proposed in this paper as a promising candidate to design beampatterns that mitigate/suppress co-channel interference and deliver massive gain in the desired directions. Initially, channel and signal models suitable for the mm-wave MIMO system are presented using the manifold vectors of both Tx and Rx antenna arrays. Based on these models, a novel subspace-based channel estimator is employed, which estimates delays, directions, velocities, and fading coefficients of the desired signal paths. This information is then exploited by the proposed spatiotemporal beamformer to provide a massive array gain that combats path loss without increasing the number of antenna array elements and to be tolerant to the near-far problem in a high interference environment. The performance of the proposed channel estimator and beamformer is examined using computer simulation studies.

Fawzi and Renner [Commun. Math. Phys. 340(2):575, 2015] recently established a lower bound on the conditional quantum mutual information (CQMI) of tripartite quantum states $ABC$ in terms of the fidelity of recovery (FoR), i.e. the maximal fidelity of the state $ABC$ with a state reconstructed from its marginal $BC$ by acting only on the $C$ system. The FoR measures quantum correlations by the local recoverability of global states and has many properties similar to the CQMI. Here we generalize the FoR and show that the resulting measure is multiplicative by utilizing semi-definite programming duality. This allows us to simplify an operational proof by Brandao et al. [Phys. Rev. Lett. 115(5):050501, 2015] of the above-mentioned lower bound that is based on quantum state redistribution. In particular, in contrast to the previous approaches, our proof does not rely on de Finetti reductions., Comment: v2: 9 pages, published version

Metallic plates with a two-dimensional (2D) periodic distribution of sub-wavelength apertures are known to exhibit extraordinary transmission of electromagnetic waves. Stacking two or more of such plates gives place to the so-called fishnet structures, which constitute a popular way of achieving an effective negative index medium at frequencies ranging from microwaves to optics. Unfortunately, a general wideband equivalent circuit has not yet been proposed to facilitate its understanding and design. This work presents this circuit model with closed-form expressions for the circuit elements, thus making it possible to obtain the electrical response for this class of structures in a very efficient way. This procedure is much faster than alternative numerical methods at the same time that it retains a high level of accuracy when compared with some other oversimplified models. The circuit model also provides a simple rationale as well as a good physical insight in order to explain the qualitative behavior of such structures, independently of the number of stacked layers. This work was supported by the Spanish Ministry of Economy and Competitiveness with European Union Feder Funds (under grants TEC2011-28664-C02-01, TEC2014-51902-C2-2-R, TEC2013-41913-P, and Consolider EMET CSD2008-00066, and by the Spanish Junta de Andalucía under Project P12-TIC-1435). The work of M. Beruete was supported by the Spanish Government via RYC-2011-08221.

With single-input single-output (SISO) SAR systems, employing a single transmitter and receiver beam, there exists a high resolution, wide swath contradiction. However, by using multiple receiver beams and employing array processing techniques, this contradiction can be overcome, allowing greater flexibility and a wider range of application requirements to be met. In this paper the use of single-input multiple-output (SIMO) SAR systems for overcoming this contradiction is of interest, and a novel beamformer is proposed for processing in the cross-range direction. In order to fully describe the system, the array manifold vector is utilized, which is a key concept in the design of the beamformer. In particular, this beamformer is a superresolution beamformer capable of forming wide nulls using subspace based approaches and allows the suppression of ambiguities in multiple sets of received undersampled SAR data in the cross-range direction and reconstruction of the Doppler spectrum to form a single unambiguous set of SAR data. Compared to the existing reconstruction algorithm, only a single weighting vector is required for a block of ambiguous Doppler frequencies compared to a weight vector required for each ambiguous Doppler frequency. The capabilities of the proposed beamformer are shown to give an improved performance in ambiguity suppression via computer simulation studies in a representative maritime environment.

The heterogeneous nature of the applications, technologies and equipment that today's networks have to support has made the management of such infrastructures a complex task. The Software-Defined Networking (SDN) paradigm has emerged as a promising solution to reduce this complexity through the creation of a unified control plane independent of specific vendor equipment. However, designing a SDN-based solution for network resource management raises several challenges as it should exhibit flexibility, scalability and adaptability. In this paper, we present a new SDN-based management and control framework for fixed backbone networks, which provides support for both static and dynamic resource management applications. The framework consists of three layers which interact with each other through a set of interfaces. We develop a placement algorithm to determine the allocation of managers and controllers in the proposed distributed management and control layer. We then show how this layer can satisfy the requirements of two specific applications for adaptive load-balancing and energy management purposes.

We consider the classical problem of finding the sparse representation of a signal in a pair of bases. When both bases are orthogonal, it is known that the sparse representation is unique when the sparsity $K$ of the signal satisfies $K

Summarization: The use of Reinforcement Learning (RL) approaches for dialogue policy optimization has been the new trend for dialogue management systems. Several methods have been proposed, which are trained on dialogue data to provide optimal system response. However, most of these approaches exhibit performance degradation in the presence of noise, poor scalability to other domains, as well as performance instabilities. To overcome these problems, we propose a novel approach based on the incremental, sample-efficient Least-Squares Policy Iteration (LSPI) algorithm, which is trained on compact, fixed-size dialogue state encodings, obtained from deep Variational Denoising Autoencoders (VDAE). The proposed scheme exhibits stable and noise-robust performance, which significantly outperforms the current state-of-the-art, even in mismatched noise environments. Presented on: IEEE Signal Processing Letters