Search

With the increasing number of wireless communication standards flexibility has gained more and more importance which has lead to the software defined radio (SDR) concept. However, SDR development has to face many challenges, among them are the questions how SDR systems can be designed to achieve flexibility, architectural efficiency, energy efficiency and portability at the same time. These requirements result in very elaborate architectures and a highly increased design complexity. To cope with such complexity, we proposed an SDR development flow. During the development of such SDR, debugging becomes more efficient on a prototype hardware implementation than on a simulation model. However, error analysis on a prototype suffers from strong limitations like a reduced state visibility. In this paper, an extension to the SDR development flow is presented and successfully applied to an example SDR. It allows for an efficient error analysis with the SDR simulation model by the feedback of stimulus data from the prototype.

Abstract The aim of this work was to develop and evaluate the reinforcement learning algorithm VentAI, which is able to suggest a dynamically optimized mechanical ventilation regime for critically-ill patients. We built, validated and tested its performance on 11,943 events of volume-controlled mechanical ventilation derived from 61,532 distinct ICU admissions and tested it on an independent, secondary dataset (200,859 ICU stays; 25,086 mechanical ventilation events). A patient “data fingerprint” of 44 features was extracted as multidimensional time series in 4-hour time steps. We used a Markov decision process, including a reward system and a Q-learning approach, to find the optimized settings for positive end-expiratory pressure (PEEP), fraction of inspired oxygen (FiO2) and ideal body weight-adjusted tidal volume (Vt). The observed outcome was in-hospital or 90-day mortality. VentAI reached a significantly increased estimated performance return of 83.3 (primary dataset) and 84.1 (secondary dataset) compared to physicians’ standard clinical care (51.1). The number of recommended action changes per mechanically ventilated patient constantly exceeded those of the clinicians. VentAI chose 202.9% more frequently ventilation regimes with lower Vt (5–7.5 mL/kg), but 50.8% less for regimes with higher Vt (7.5–10 mL/kg). VentAI recommended 29.3% more frequently PEEP levels of 5–7 cm H2O and 53.6% more frequently PEEP levels of 7–9 cmH2O. VentAI avoided high (>55%) FiO2 values (59.8% decrease), while preferring the range of 50–55% (140.3% increase). In conclusion, VentAI provides reproducible high performance by dynamically choosing an optimized, individualized ventilation strategy and thus might be of benefit for critically ill patients.

ConvAix is an application-specific instruction-set processor (ASIP) that enables the energy-efficient processing of convolutional neural networks (CNNs) while retaining substantial flexibility through its instruction-set architecture (ISA) based design. By utilizing a combination of data-level parallelism (DLP), instruction-level parallelism (ILP), and subword parallelism, the proposed design offers sufficient processing power for the execution of state-of-the-art CNNs in real-time. ConvAix's arithmetic logic units (ALUs) are C-programmable, thereby offering the degree of flexibility required to implement many different convolution layer types, e.g., depthwise-separable convolutions and residual blocks, as well as fully-connected and pooling layers. It comprises a total of 256 ALUs and leverages low-precision computations down to 4 bits. Furthermore, it exploits sparsity in feature maps and weights via zero-guarding of redundant computations to maximize its energy efficiency. The processor was implemented in a modern 28 nm CMOS technology operating at 1V supply voltage with a resulting clock frequency of 513 MHz. The final design offers a precision-dependent peak throughput between 263 GOP/s (int16) and 1.1 TOP/s (int4), while consuming between 972mW and 340mW of power, resulting in effective energy-efficiencies ranging from 176 GOP/s/W to 2 TOP/s/W. Well-known CNNs, such as AlexNet, MobileNet, and ResNet-18, are simulated based on the placed and routed netlist, achieving between 233 (AlexNet) and 69 (ResNet-18) frames-per-second for a batch-size of 1, including times for off-chip transfers.

Abstract Continuous miniaturization of circuitry has open the door for various novel application scenarios of millimeter-sized wireless agents such as for the exploration of difficult-to-access fluid environments. In this context, agents are envisioned to be employed, e.g., for pipeline inspection or groundwater analysis. In either case, the demand for miniature sensors is incompatible with propulsion capabilities. Consequently, the agents are condemned to be kinetically passive and are, thus, subject to the fluid dynamics present in the environment. In these situations, the localization is complicated by the fact that unknown external forces (e.g., from the fluid) govern the motion of the agents. In this work, a comprehensive framework is presented that targets the simultaneous estimation of the external forces stemming from the fluid and the agents’ positions which are traversing the environment. More precisely, a Bayesian hierarchical model is proposed that models’ relevant characteristics of the fluid via a spatial random field and incorporates this as control input into the motion model. The random field model facilitates the consideration of spatial correlation among the agents’ trajectories and, thereby, improves the localization significantly. Additionally, this is combined with multiple particle filtering to account for the fact that within such underground fluid environments, only a localization based on distance and/or bearing measurements is feasible. In the results provided in this work, which are based on realistic computational fluid dynamics simulations, it is shown that—via the proposed spatial model—significant improvements in terms of localization accuracy can be achieved.

Abstract The localization of multiple wireless agents via, for example, distance and/or bearing measurements is challenging, particularly if relying on beacon-to-agent measurements alone is insufficient to guarantee accurate localization. In these cases, agent-to-agent measurements also need to be considered to improve the localization quality. In the context of particle filtering, the computational complexity of tracking many wireless agents is high when relying on conventional schemes. This is because in such schemes, all agents’ states are estimated simultaneously using a single filter. To overcome this problem, the concept of multiple particle filtering (MPF), in which an individual filter is used for each agent, has been proposed in the literature. However, due to the necessity of considering agent-to-agent measurements, additional effort is required to derive information on each individual filter from the available likelihoods. This is necessary because the distance and bearing measurements naturally depend on the states of two agents, which, in MPF, are estimated by two separate filters. Because the required likelihood cannot be analytically derived in general, an approximation is needed. To this end, this work extends current state-of-the-art likelihood approximation techniques based on Gaussian approximation under the assumption that the number of agents to be tracked is fixed and known. Moreover, a novel likelihood approximation method is proposed that enables efficient and accurate tracking. The simulations show that the proposed method achieves up to 22% higher accuracy with the same computational complexity as that of existing methods. Thus, efficient and accurate tracking of wireless agents is achieved.

Abstract In the localization of wireless agents, ambiguous measurements have significant implications regarding the complexity and quality of the agents’ positioning. Ambiguous measurements occur, for example, in multiple source localization (MSL), in which the goal is to localize the sources of signals, although the signals themselves cannot be used to differentiate among their sources. The indifferentiability of the sources results in a combinatorial optimization problem that must be solved before a localization result can be obtained. Similar effects arise, for example, in the localization of highly resource-limited wireless agents that are subject to severe size and energy constraints, meaning that neither unique identification sequences (CDMA) nor unique frequency or time resources (FDMA, TMDA) can be used. This application scenario constitutes a more general and complex joint problem of localization and ambiguity resolution that also encompasses MSL. In this work, we focus on this more general problem and its corresponding application case while maintaining applicability to the MSL problem. More precisely, we prove the NP $\mathcal {NP}$-hardness of the joint localization and ambiguity resolution problem and derive a solution framework that facilitates a comprehensive and concise formulation thereof. Thereby, we derive a minimum mean square error (MMSE)-optimal algorithm based on mixed-integer nonlinear programming and propose a relaxation of the problem with the aim of reducing the computational complexity. Additionally, simplifications are derived for the case in which bidirectional measurements are available or enforced, e.g., by the applied communication or ranging protocol.

Abstract The complexity of agent localization increases significantly when unique identification of the agents is not possible. Corresponding application cases include multiple-source localization, in which the agents do not have identification sequences at all, and scenarios in which it is infeasible to send sufficiently long identification sequences, e.g., for highly resource-limited agents. The complexity increase is due to the need to solve an additional optimization problem to resolve the indifferentiability of the agents and thus to enable their localization. In this work, we present a thorough analysis of this problem and propose a maximum a posteriori (MAP)-optimal algorithm based on graph decompositions and expression trees. The proposed algorithm efficiently exploits the fixed-parameter tractability of the underlying graph-theoretical problem and employs dynamic programming and backtracking. We show that the proposed algorithm is able to reduce the run time by up to 88.3% compared with a corresponding MAP-optimal integer linear programming formulation.

Life-threatening cardiomyopathy is a severe, but common, complication associated with severe trauma or sepsis. Several signaling pathways involved in apoptosis and necroptosis are linked to trauma- or sepsis-associated cardiomyopathy. However, the underling causative factors are still debatable. Heparan sulfate (HS) fragments belong to the class of danger/damage-associated molecular patterns liberated from endothelial-bound proteoglycans by heparanase during tissue injury associated with trauma or sepsis. We hypothesized that HS induces apoptosis or necroptosis in murine cardiomyocytes. By using a novel Medical-In silico approach that combines conventional cell culture experiments with machine learning algorithms, we aimed to reduce a significant part of the expensive and time-consuming cell culture experiments and data generation by using computational intelligence (refinement and replacement). Cardiomyocytes exposed to HS showed an activation of the intrinsic apoptosis signal pathway via cytochrome C and the activation of caspase 3 (both p

Traffic routing is a central challenge in the context of urban areas, with a direct impact on personal mobility, traffic congestion, and air pollution. In the last decade, the possibilities for traffic flow control have improved together with the corresponding management systems. However, the lack of real-time traffic flow information with a city-wide coverage is a major limiting factor for an optimum operation. Smart City concepts seek to tackle these challenges in the future by combining sensing, communications, distributed information, and actuation. This paper presents an integrated approach that combines smart street lamps with traffic sensing technology. More specifically, infrastructure-based ultrasonic sensors, which are deployed together with a street light system, are used for multilane traffic participant detection and classification. Application of these sensors in time-varying reflective environments posed an unresolved problem for many ultrasonic sensing solutions in the past and therefore widely limited the dissemination of this technology. We present a solution using an algorithmic approach that combines statistical standardization with clustering techniques from the field of unsupervised learning. By using a multilevel communication concept, centralized and decentralized traffic information fusion is possible. The evaluation is based on results from automotive test track measurements and several European real-world installations.

The performance of quasiorthogonal space-time block code with relay-selection and phase-rotation techniques applied to cooperative communications for four communication nodes is investigated. Specifically, by applying relay-selection and phase-rotation techniques, a diversity gain of four can be achieved. In addition, a symbol error rate (SER) performance analysis with closed-form expression and power allocation are investigated and compared with simulation results. The results show that theoretical SER curves are close to the simulation results. In addition, a code rate of the proposed scheme is two times higher than ordinary cooperative communications. The computer simulation results also show a significant probability of error improvement of about 2.8 dB over the conventional decode-and-forward protocol.