Search

The C-RAN architecture has been prevailing in mobile networks for 5G and beyond. Along with the significant increase in the amount of mobile data, network operators must consider the spatio-temporal pattern of traffi c demand due to human mobility and lifestyles. It has been an important problem to efficiently deploy mobile networks avoiding the underutilization of cell capacities in off -peak times. To address this problem, in this paper we propose a concept of an adaptive C-RAN architecture toward the beyond 5G era. The proposed architecture enables flexible reconfi guration of the radio unit (RU) states and movable DU locations considering the changes in demand distribution. The DUs and RUs compose wireless relay fronthaul networks to forward fronthaul streams satisfying the strict latency requirements. This paper also proposes the joint scheduling algorithm to activate RUs, relocate DUs, and determine forwarding paths of fronthaul streams. It was confi rmed with computer simulations that mobile networks can be efficiently reconstructed with the proposed idea by activating/deactivating RUs and relocating/ migrating DUs. [ABSTRACT FROM AUTHOR]

In this paper, a novel demapper for 2-D non-uniform constellations (2D-NUCs) is proposed, exploiting the characteristics of these constellations. It represents the combination of two underlying demapping techniques targeting the ATSC 3.0 compliant OFDM transceiver. On the one hand, for low code rates, we define a metric to perform condensed demapping. On the other hand, for high code rates, adaptive sub-region demapping is proposed. In this paper, a combination of both demapping methods is designed showing comparable performance to the classical ML demapper. The gap does not exceed 0.1 dB for all code rates of the ATSC 3.0 standard. Higher complexity reduction, from 79.2% to 95.4%, than state of art 2D-NUC demappers is obtained for 2D-256NUCs. These results are validated for ideal and non-ideal channel state information over additive white noise Gaussian and Rayleigh independently and identically distributed channels. Results are extended to 2D-1kNUCs and 2D-4kNUCs showing demapping complexity reduction from 96% to 99.7% with a negligible impact on performance. [ABSTRACT FROM AUTHOR]

In this paper, we derive an algorithm for enabling a single robotic unmanned aerial vehicle to herd a flock of birds away from a designated volume of space, such as the air space around an airport. The herding algorithm, referred to as the $m$ -waypoint algorithm, is designed using a dynamic model of bird flocking based on Reynolds’ rules. We derive bounds on its performance using a combination of reduced-order modeling of the flock's motion, heuristics, and rigorous analysis. A unique contribution of the paper is the experimental demonstration of several facets of the herding algorithm on flocks of live birds reacting to a robotic pursuer. The experiments allow us to estimate several parameters of the flocking model, and especially the interaction between the pursuer and the flock. The herding algorithm is also demonstrated using numerical simulations. [ABSTRACT FROM AUTHOR]

Sparse subspace clustering (SSC) relies on sparse regression for accurate neighbor identification. Inspired by recent progress in compressive sensing, this paper proposes a new sparse regression scheme for SSC via two-step reweighted $\ell _{1} $ -minimization, which also generalizes a two-step $\ell _{1} $ -minimization algorithm introduced by E. J. Candès et al. in [The Annals of Statistics, vol. 42, no. 2, pp. 669–699, 2014] without incurring extra algorithmic complexity. To fully exploit the prior information offered by the computed sparse representation vector in the first step, our approach places a weight on each component of the regression vector, and solves a weighted LASSO in the second step. We propose a data weighting rule suitable for enhancing neighbor identification accuracy. Then, under the formulation of the dual problem of weighted LASSO, we study in depth the theoretical neighbor recovery rates of the proposed scheme. Specifically, an interesting connection between the locations of nonzeros of the optimal sparse solution to the weighted LASSO and the indexes of the active constraints of the dual problem is established. Afterwards, under the semi-random model, analytic probability lower/upper bounds for various neighbor recovery events are derived. Our analytic results confirm that, with the aid of data weighting and if the prior neighbor information is accurate enough, the proposed scheme with a higher probability can produce many correct neighbors and few incorrect neighbors as compared to the solution without data weighting. Computer simulations are provided to validate our analytic study and evidence the effectiveness of the proposed approach. [ABSTRACT FROM AUTHOR]

Force estimation methods enable robots to interact with the environment or humans compliantly and safely without additional sensing device. In this paper, we present a novel method for estimating unknown contact forces exerted on a robot manipulator. The force estimation method is divided into two steps. The first step is to identify a robot dynamics model. A parametric model is derived first based on rigid-body dynamic (RBD) theory. To improve the model accuracy, a nonparametric compensator trained with multilayer perception (MLP) is added to compensate for errors of the RBD model. The result is a semiparametric model that provides better model accuracy than either the RBD model or the MLP model alone. The second step is to construct a force estimation observer. A novel estimation method called disturbance Kalman filter (DKF) is developed in this paper. The design of DKF based on a time-invariant composite system model is presented. DKF can take both manipulator's dynamics model and disturbance's dynamics model into account. As with Kalman filter, it can provide robust and accurate estimation against uncertainty. Simulation and experimental results, obtained using a six-degrees-of-freedom Kinova Jaco2 manipulator, demonstrate the effectiveness of the proposed method. [ABSTRACT FROM AUTHOR]

Precise positioning of a robot plays an very important role in advanced industrial applications, and this paper presents a new kinematic calibration method based on the extended Kalman filter (EKF) and particle filter (PF) algorithm that can significantly improves the positioning accuracy of the robot. Kinematic and its error models of a robot are established, and its kinematic parameters are identified by using the EKF algorithm first. But the EKF algorithm has a kind of linear truncation error and it is useful for the Gauss noise system in general, so its identified accuracy will be affected for the highly nonlinear robot kinematic system with a non-Gauss noise system. The PF algorithm can solve this with non-Gauss noise and a high nonlinear problem well, but its calibration accuracy and efficiency are affected by the prior distribution of the initial values. Therefore, this paper proposes to use the calibration value of the EKF algorithm as the prior value of the PF algorithm, and then, the PF algorithm is used further to calibrate the kinematic parameters of the robot. Enough experiments have been carried out, and the experimental results validated the viability of the proposed method with the robot positioning accuracy improved significantly. [ABSTRACT FROM AUTHOR]

In this paper, a novel augmented complex-valued least-mean kurtosis (ACLMK) algorithm is proposed for processing complex-valued signals. The negated kurtosis of the complex-valued error signal is defined as a cost function by using augmented statistics. As a result of the minimization of this cost function, the ACLMK algorithm containing all second-order statistical properties is obtained for processing noncircular complex-valued signals. Moreover, in this paper, convergence and misadjustment conditions of the proposed ACLMK algorithm are derived from the steady-state analysis. The simulation results on complex-valued system identification, prediction, and adaptive noise cancelling problems show that the use of the cost function defined by the negated kurtosis of the complex-valued error signal based on augmented statistics enables the processing of the noncircular complex-valued signals, and significantly improves the performance of the proposed ACLMK algorithm in terms of the mean square deviation, the mean square error, the prediction gain and the convergence rate when compared to other algorithms. [ABSTRACT FROM AUTHOR]

The Probability Hypothesis Density (PHD) and Cardinalized PHD (CPHD) filters are popular solutions to the multitarget tracking problem due to their low complexity and ability to estimate the number and states of targets in cluttered environments. The PHD filter propagates the first-order moment (i.e. mean) of the number of targets while the CPHD propagates the cardinality distribution in the number of targets, albeit for a greater computational cost. Introducing the Panjer point process, this paper proposes a Second-Order PHD (SO-PHD) filter, propagating the second-order moment (i.e., variance) of the number of targets alongside its mean. The resulting algorithm is more versatile in the modeling choices than the PHD filter, and its computational cost is significantly lower compared to the CPHD filter. This paper compares the three filters in statistical simulations which demonstrate that the proposed filter reacts more quickly to changes in the number of targets, i.e., target births and target deaths, than the CPHD filter. In addition, a new statistic for multiobject filters is introduced in order to study the correlation between the estimated number of targets in different regions of the state space, and propose a quantitative analysis of the spooky effect for the three filters. [ABSTRACT FROM PUBLISHER]

Accurate location information is essential for mobile systems such as wireless sensor networks. A location-aware sensor network generally includes two types of nodes: Sensors whose locations to be determined and anchors whose locations are known a priori. For range-based cooperative positioning, sensors’ locations are deduced from anchor-to-sensor and sensor-to-sensor range measurements. Positioning accuracy depends on the network parameters such as network connectivity and size. This paper provides a generalized theory that quantitatively characterizes such a relation between network parameters and positioning accuracy. We use the average degree as a connectivity metric and use geometric dilution of precision (DOP) to quantify positioning accuracy. Under the assumption that nodes are randomly deployed, we prove a novel lower bound on expectation of average geometric DOP (LB-E-AGDOP) and derives a closed-form formula that relates LB-E-AGDOP to only three parameters: Average anchor degree, average sensor degree, and number of sensor nodes. The formula shows that positioning accuracy is approximately inversely proportional to the average degree, and a higher ratio of average anchor degree to average sensor degree yields better positioning accuracy. Furthermore, the paper shows a strong connection between LB-E-AGDOP and the best achievable accuracy. Finally, we demonstrate the theory via numerical simulations with three different random graph models. [ABSTRACT FROM PUBLISHER]

Recent studies reveal that both phase aberration and reverberation play a major role in degrading ultrasound image quality. We previously developed an algorithm for suppressing clutter, but we have not yet tested it in the context of aberrated wavefronts. In this paper, we evaluate our previously reported algorithm, called aperture domain model image reconstruction (ADMIRE), in the presence of phase aberration and in the presence of multipath scattering and phase aberration. We use simulations to investigate phase aberration corruption and correction in the presence of reverberation. As part of this paper, we observed that ADMIRE leads to suppressed levels of aberration. In order to accurately characterize aberrated signals of interest, we introduced an adaptive component to ADMIRE to account for aberration, referred to as adaptive ADMIRE. We then use ADMIRE, adaptive ADMIRE, and conventional filtering methods to characterize aberration profiles on in vivo liver data. These in vivo results suggest that adaptive ADMIRE could be used to better characterize a wider range of aberrated wavefronts. The aberration profiles’ full-width at half-maximum of ADMIRE, adaptive ADMIRE, and postfiltered data with 0.4- mm^-1 spatial cutoff frequency are 4.0 ± 0.28 mm, 2.8 ± 1.3 mm, and 2.8 ± 0.57 mm, respectively, while the average root-mean square values in the same order are 16 ± 5.4 ns, 20 ± 6.3 ns, and 19 ± 3.9 ns, respectively. Finally, because ADMIRE suppresses aberration, we perform a limited evaluation of image quality using simulations and in vivo data to determine how ADMIRE and adaptive ADMIRE perform with and without aberration correction. [ABSTRACT FROM AUTHOR]

Simulated ultrasound data is a valuable tool for development and validation of quantitative image analysis methods in echocardiography. Unfortunately, simulation time can become prohibitive for phantoms consisting of a large number of point scatterers. The COLE algorithm by Gao et al. is a fast convolution-based simulator that trades simulation accuracy for improved speed. We present highly efficient parallelized CPU and GPU implementations of the COLE algorithm with an emphasis on dynamic simulations involving moving point scatterers. We argue that it is crucial to minimize the amount of data transfers from the CPU to achieve good performance on the GPU. We achieve this by storing the complete trajectories of the dynamic point scatterers as spline curves in the GPU memory. This leads to good efficiency when simulating sequences consisting of a large number of frames, such as B-mode and tissue Doppler data for a full cardiac cycle. In addition, we propose a phase-based subsample delay technique that efficiently eliminates flickering artifacts seen in B-mode sequences when COLE is used without enough temporal oversampling. To assess the performance, we used a laptop computer and a desktop computer, each equipped with a multicore Intel CPU and an NVIDIA GPU. Running the simulator on a high-end TITAN X GPU, we observed two orders of magnitude speedup compared to the parallel CPU version, three orders of magnitude speedup compared to simulation times reported by Gao et al. in their paper on COLE, and a speedup of 27000 times compared to the multithreaded version of Field II, using numbers reported in a paper by Jensen. We hope that by releasing the simulator as an open-source project we will encourage its use and further development. [ABSTRACT FROM AUTHOR]

Layered transmission is studied in this paper to accommodate various device capabilities and channel conditions. The problem of efficiently broadcasting a common set of layer-encoded data from a single base station to multiple users over quasi-static fading channels is examined. Considering the maximum tolerable delay, a block-level utility is defined in terms of average probability of successful reception of each layer. Based on non-orthogonal multiple access scheme, we propose a complete algorithm to jointly optimize power allocation and transmission rates. By utilizing the idea of opportunistic scheduling, we first derive the success probability of one single layer in homogeneous scenarios, then extend the results to heterogeneous scenarios where users are subject to different channel statistics. The multi-layer optimization is realized by iteratively repeating the single-layer operations. Starting from the base layer, we first choose an optimal subset of users as the corresponding target group, then apply the single-layer allocation process until no power resources are left. Computer simulation and discussion confirm that our method maximizes the block-level utility at the same time balances the tradeoff between multiuser diversity gain and multicast gain. [ABSTRACT FROM AUTHOR]

Of the wide palette of 5G features, ultra-wide bandwidth and large-scale antenna configuration are regarded as the essential enabling technology components for millimeter wave (mmWave) communication. Accurate knowledge of delay and angle information of multipath components is essential for many applications in mmWave systems. There is a strong need for a low computation-cost channel estimation algorithm for such systems, where typically adopted far-field and narrowband assumptions might be violated. In this paper, a generic yet novel beamspace uniform circular array (UCA) beamforming algorithm with successive cancellation scheme is proposed to jointly detect the impinging azimuth angle and delay of each multipath component. The proposed algorithm is computationally cheap and it works for ultra-wideband UCA systems in the near-field conditions as well as the traditional narrowband systems in the far-field conditions. Both numerical simulations and experimental validation results are provided to demonstrate the effectiveness and robustness of the proposed algorithm, compared to the state-of-art works. [ABSTRACT FROM AUTHOR]

A hybrid analytical/numerical conducted an electromagnetic interference (EMI) modeling approach, which adopts both numerical method and analytical method, is proposed in this paper. In this model, the noise source is calculated directly with the original data from oscilloscopes. The noise path at different operating status is extracted from the original converter topology and its analytical expression is then derived. Also, according to the EMI receiver detector mode, the algorithm of the EMI receiver is proposed in this paper. Peak (PK), average (AV), and quasipeak (QP) values of the EMI can then be calculated to analyze the impact of each relevant component. The analytical method is provided to carry out PK, AV, and QP simulations accurately and fast. The simulation and experimental results for common mode leakage currents validate this EMI model. Furthermore, two analysis examples are given to illustrate how this model is applied for engineers. [ABSTRACT FROM AUTHOR]

This paper presents an optimal battery management algorithm for photovoltaic (PV) stations capacity firming using dynamic programming-based optimization and control architecture. The objective is to manage the output of battery energy storage system (BESS) so that PV station output swings are reduced significantly. First, BESS and PV station located in a medium-voltage distribution network on a North American power grid is modeled along with the reduced-order feeder model. Then, the proposed algorithm is designed and implemented on the power grid distribution feeder based on the feeder data streamed through utility communication infrastructure to the research laboratory. The theoretical formulation, simulation, and implementation results are discussed in detail in this paper. [ABSTRACT FROM AUTHOR]

The protection characteristics used for the detection of power systems’ oscillations are adjusted according to the recommendations of the equipment manuals and validated through transient stability studies. Once the characteristics are adjusted, the parameters do not change when topological changes occur in the system, which opens up the possibility of malfunction of the protection equipment, either by not considering special cases of failure during the study or by errors in the system. This paper describes the modeling and implementation of a virtual out-of-step protection algorithm based on traditional, unconventional methods. The proposed framework allows the user to implement a customized out-of-step protection algorithm and analyze a real fault event recorded in a COMTRADE file. Furthermore, the programming advantages include the possibility to import COMTRADE files from specific simulations and assess the adequate settings of the protective relay. The result brings a computational tool compatible with different simulation programs capable of reproducing stable and unstable power swing events through playback techniques. By assessing critical cases in which the omission of the tripping is reflected in a generator slip condition, this study proposes an alternative with the instantaneous power theory to analyze the oscillation conditions in the definite time frame. [ABSTRACT FROM AUTHOR]

A synchronous reluctance motor drive exhibits an inherent unlimited speed range capability; in fact, the maximum speed of this kind of machine is bounded only by mechanical limits. In order to exploit this peculiar characteristic of the drive while assuring the lowest power losses, a proper control algorithm has to be used. In particular, while the working speed is increasing, the control must be able to command the reluctance motor under the maximum torque per ampere condition at first, into the flux-weakening region, and then on the maximum torque per voltage trajectory. To this purpose, a novel voltage control loop is presented in this paper. It is combined with a field-oriented current control and profitably exploits a polar coordinate representation of the current reference to operate the reluctance machine in compliance with current and voltage rating constraints in all the different operating conditions. Additional merits of the proposed scheme are the ease of implementation and the simple design. The stability of the proposed control algorithm is proved through a small signal analysis and simulations and experimental tests confirm its effectiveness. [ABSTRACT FROM AUTHOR]

Hybrid analog and digital beamforming (HBF) has recently emerged as an attractive technique for millimeter-wave (mmWave) communication systems. It well balances the demand for sufficient beamforming gains to overcome the propagation loss and the desire to reduce the hardware cost and power consumption. In this paper, the mean square error (MSE) is chosen as the performance metric to characterize the transmission reliability. Using the minimum sum-MSE criterion, we investigate the HBF design for broadband mmWave transmissions. To overcome the difficulty of solving the multi-variable design problem, the alternating minimization method is adopted to optimize the hybrid transmit and receive beamformers alternatively. Specifically, a manifold optimization-based HBF algorithm is first proposed, which directly handles the constant modulus constraint of the analog component. Its convergence is then proved. To reduce the computational complexity, we then propose a low-complexity general eigenvalue decomposition-based HBF algorithm in the narrowband scenario and three algorithms via the eigenvalue decomposition and orthogonal matching pursuit methods in the broadband scenario. A particular innovation in our proposed alternating minimization algorithms is a carefully designed initialization method, which leads to a faster convergence. Furthermore, we extend the sum-MSE-based design to that with weighted sum-MSE, which is then connected to the spectral efficiency-based design. Simulation results show that the proposed HBF algorithms achieve a significant performance improvement over existing ones and perform close to full-digital beamforming. [ABSTRACT FROM AUTHOR]

In this paper, a novel scheme is proposed to optimize the effectiveness of the device-to-device (D2D) enabled vehicular communications (D2D-V), which are underlaid in cellular networks, where the uplink channel allocated to one cellular user (CU) is reused by the multiple D2D-V links. To develop a well-functioning D2D-V system, the sum rate of all D2D-V links is necessary to be maximized, and also the reliability of the co-channel CU to infrastructure has to be guaranteed with the CU interference constraint. Unlike the traditional statical D2D systems, the D2D-V system suffers with high mobility and channel uncertainty. Therefore, the CU interference constraint is formulated as a probabilistic function by the Bernstein approximation, the constraint attempts to address the mobile channel fluctuations. Besides, the tractable approximate constraint is reformulated as two separable structure, this reformulated constraint attempts to determine the near-optimal solutions more efficiently. Since the objective function with a logarithmic form is nonconvex, successive convex approximation is applied to transform the nonconvex problem into the convex problem. The dual decomposition is used to determine the near-optimal solutions. After the problem is reformulated, a distributed robust power control algorithm is proposed to perform the chance-constrained optimization. Numerical simulations are used to evaluate the performance of the proposed scheme. The simulation results show the impacts of system performance when applying the proposed scheme in vehicular environments with high mobility. The proposed optimization schemes are further verified by comparing with the existing methods. [ABSTRACT FROM AUTHOR]

The detection of groups of individuals is attracting the attention of many researchers in diverse fields, from automated surveillance to human-computer interaction, with a growing number of approaches published every year. Unexpectedly, the evaluation metrics for this problem are not consolidated, with some measures inherited from the people detection field, other from clustering, other designed specifically for a particular approach, thus lacking in generalization and making the comparisons between different approaches hard to be carried out. Moreover, most of the existent metrics are scarcely expressive, addressing groups as they are atomic entities, ignoring that they may have different cardinalities, and that group detection approaches may fail in capturing the exact number of individuals that compose it. This paper fills this gap presenting the GROup DEtection (GRODE) metrics, which formally define precision and recall on the groups, including the group cardinality as a variable. This gives the possibility to investigate aspects never considered so far, such as the tendency of a method of over- or under-segmenting, or of better dealing with specific group cardinalities. The GRODE metrics have been evaluated first on controlled scenarios, where the differences with alternative metrics are evident. Then, the metrics have been applied to eight approaches of group detection, on eight public datasets, providing a fresh-new panorama of the state-of-the-art, discovering interesting strengths and pitfalls of the recent approaches. [ABSTRACT FROM AUTHOR]

This paper proposes a new algorithm to evaluate the performance of the mobile edge computing system. Specifically, a new metric called computation efficiency is defined as the number of calculated data bits divided by the corresponding energy consumption. In order to compute the required data timely, we combine two schemes, local computing and data offloading, into a joint computation algorithm. An optimization problem is formulated with the objective to maximize the sum of computation efficiency among users with weighting factors. With iterative and gradient descent methods, the problem can be solved efficiently. Simulation results show that the proposed scheme outperforms traditional approaches. In addition, the tradeoff study between local computing and data offloading reveals that when data size is small, local computing plays a more important role, but when the size grows, data offloading becomes preferable. [ABSTRACT FROM AUTHOR]

This paper is devoted to the terrain aided navigation (TAN) systems based on the state estimation algorithms. In particular, the emphasis is laid on the design of the Bayesian Rao–Blackwellized point-mass filter for nonlinear state-space models of a specific structure typically used in the terrain aided navigation. The proposed filter preserves advantages of the point-mass filter, including the high estimation accuracy, robust initialization, deterministic nature of the algorithm, and predictable computational complexity, while the computational complexity is significantly reduced. The performance of the Rao–Blackwellized point-mass filter is illustrated using a simulated numerical example and a TAN system based on the real data. [ABSTRACT FROM AUTHOR]

Non-orthogonal multiple access (NOMA) is a promising scheme for the fifth generation (5G) of mobile communication systems. In this scheme, transmission to multiple users is performed on the same subchannel using superposition coding and successive interference cancellation. In this paper, we focus on a multi-cell network with two users’ data traffic models, namely elastic and streaming. We exploit the NOMA scheme in order to maximize the download elastic traffic rate at cells, without degrading the download streaming traffic rates. Since elastic traffic rates at different cells are interactive, we maximize the total elastic traffic rates assuming either perfect or partial channel state information available at each base station subject to a target rate for streaming users. Because of the interference due to NOMA as well as the interference among different cells, subchannel assignment and power allocation affect the system performance significantly. For this reason, we propose an iterative algorithm to jointly solve the subchannel assignment and the power allocation problem via the Hungarian algorithm and successive convex approximation, respectively. Finally, our simulation results show the efficiency of the proposed algorithm. [ABSTRACT FROM AUTHOR]

In this paper, we propose a generalized channel decoding scheme for nonbinary physical-layer network coding (CD-NC) in two-way relay channels (TWRCs), where two source nodes A and B exchange their nonbinary symbols via a relay. The two sources use the same nonbinary low-density parity-check (LDPC) channel code over the integer ring $\mathbb {Z}_M$ and $M$ -pulse-amplitude modulation, respectively. The existing channel decoding schemes for nonbinary network coding suffer severe rate loss compared with the cut-set bound of TWRC, especially in the low-to-medium signal-to-noise ratio regime. The proposed CD-NC can decrease the rate loss. Our contributions are as follows: 1) We develop a generalized nonbinary sum product algorithm (G-SPA) for CD-NC according to the principle of virtual encoding of the superimposed symbols. Simulation results show that our CD-NC can achieve significant performance gains over the conventional nonbinary network coding for both additive white Gaussian noise and fading channels; and 2) We exploit two-dimensional fast-Fourier-transform-based belief propagation (2-D-FFT-BP) and extended min-sum (EMS) decoding algorithms to reduce the decoding complexity of G-SPA. Simulation results show that the 2-D-FFT-BP has the same performance as G-SPA, while EMS can greatly reduce the decoding complexity of G-SPA at the cost of slight performance degradation. [ABSTRACT FROM AUTHOR]

In this correspondence paper, we study the application of approximate message passing (AMP) algorithm in the signal detection of index modulation (IM) with multiple active resources (antennas or subcarriers). First, for uplink generalized spatial modulation (GSM), AMP detectors in both spatially uncorrelated and correlated channels are proposed. Specifically, an effective method to utilize the activation pattern constraint of GSM signal vector per user in the posterior probability computation of scalar symbol node is derived. Furthermore, a simple while effective damping strategy is introduced in AMP detector to guarantee convergence in correlated channels. Second, for orthogonal frequency division multiplexing with IM in rapidly time-varying channels, the damped AMP detector is further studied. In addition, the convergence of proposed detectors is analyzed by state evolution. Finally, the effectiveness of proposed AMP detectors is verified by simulations. [ABSTRACT FROM AUTHOR]

This paper considers the reconstruction of a discrete-valued random vector from possibly underdetermined linear measurements using sum-of-absolute-value (SOAV) optimization. The proposed algorithm, referred to as discreteness-aware approximate message passing (DAMP), is based on the idea of approximate message passing (AMP), which has been originally proposed for compressed sensing. The DAMP algorithm has low computational complexity and its performance in the large system limit can be predicted analytically via state evolution framework, where we provide a condition for the exact reconstruction with DAMP in the noise-free case. From the analysis, we also propose a method to determine the parameters of the SOAV optimization. Moreover, based on the state evolution, we provide Bayes optimal DAMP, which has the minimum mean-square-error at each iteration of the algorithm. Simulation results show that the DAMP algorithms can reconstruct the discrete-valued vector from underdetermined linear measurements and the empirical performance agrees with our theoretical results in large-scale systems. When the problem size is not large enough, the SOAV optimization with the proposed parameters can achieve better performance than the DAMP algorithms for high signal-to-noise ratio. [ABSTRACT FROM AUTHOR]

In pulsed Doppler radars, subsampling causes incorrect estimates of the radial velocity of the detected targets whenever its related Doppler frequency is greater than the pulse repetition frequency of the radar. The classic Chinese remainder theorem is a well-known method to overcome this problem. On the other hand, the robust Chinese remainder theorem is a search-based algorithm that, under some conditions, can guarantee the correct estimation of the Doppler frequency. In this paper, we have derived the exact probability of detection for both methods applied in a pulsed Doppler radar. Simulations have been compared to the analytical results and have shown an excellent agreement. [ABSTRACT FROM AUTHOR]

The hidden terminal problem degrades the uplink system throughput of wireless local area network seriously. In this paper, we propose the optimum allocation (OA) scheme of the location-based virtual sector (VS) method, which solves the hidden terminal problem without massive overheads like request-to-send and clear-to-send (RTS/CTS) packets. The VS method forms sectors virtually to make short-distance mobile terminal (MT) groups using MTs’ location information. In the group, all MTs can sense the transmission of all other MTs. In the proposed method, rough time slot control is implemented for intersector control, which does not need a highly functional centralized controller. The proposal OA scheme of the VS method improves the fairness among MTs by optimizing active periods of VS according to the number of MTs in each VS. By computer simulations, we show that the proposed method can increase the system throughput from the RTS/CTS and improve fairness among MTs even in the condition that positioning error is 1/10 of cell radius. [ABSTRACT FROM AUTHOR]

In this paper, we proposed a coverage path (CP) planning approach for a mobile robot moving in a dynamically changing environment. Our family of algorithms begins by finding the first path around the center of interior obstacles/disks of a given target region (TR) through the Graham scan algorithm. The first path is then used as a foundational path to generate a collision free, first order differentiable, and observable CP through a complete set of input and output transformation algorithms which together form the rainbow CP planning approach. The last algorithm of the rainbow CP planning approach finds a sufficient number of observation points on the CP needed to observe the TR. The novelty of our rainbow CP planning approach is that it partitions the TR into different shapes with different properties needed to obtain complete coverage while achieving first order path differentiability. The main technical contributions of the proposed approach is to provide a holistic solution that segments any TR, uses triangulation to determine the line of sights and observation points, and computes the collision-free CP within a quadratic runtime. The proposed method can be readily generalized to address problems of higher dimensions, and it is scalable with respect to the size of TR and the number of robots. Computer simulations are used to illustrate the effectiveness and correctness of the proposed approach. [ABSTRACT FROM AUTHOR]

In this paper, an immune algorithm (IA)-based dead-time elimination PWM control strategy is proposed. For existing dead-time elimination applications, one of the major problems is the dead-time control around the zero-current-crossing points. To deal with this problem, this paper proposes a different PWM control method which first restricts the control sequence to a specified level around the zero-crossing zone. Also, the proposed method can improve the current waveform quality by using the IA approach and three-level control strategy. Compared with conventional dead-time elimination methods, this technique has the features of simple hardware requirement and adaptive control. Moreover, this control strategy effectively eliminates the effect of dead-time, while at the same time significantly reducing the total harmonic distortion of output current and improving the amplitude of output RMS value in different modulation indexes and loads conditions. To verify the analysis, an experimental platform based on DSP and field-programmable gate array is built. The simulation and experimental results are given to demonstrate the effectiveness and feasibility of this new method. [ABSTRACT FROM AUTHOR]

This paper presents a simple controller integrating a new reactive current reference algorithm for enhancing the transient performance of static synchronous compensator (STATCOM). A multilevel cascaded inverter with separated dc capacitors which is driven by carrier-based pulse width modulation is used to implement the STATCOM. The voltage across each dc-link capacitor is regulated by the rotated switching swapping scheme. In this paper, the STATCOM is controlled to provide both reactive power (VAR) compensation and grid power factor correction at the point of common coupling with a dynamically varying reactive load system. The proposed algorithm enhances the transient performance of the closed-loop system with only proportional controller and minimizes the STATCOM reactive current ripples. STATCOM based on a five-level cascaded inverter is presented in this paper and the performance of the proposed controller is investigated through various simulation studies using MATLAB/Simulink software for both steady state and transient conditions. A laboratory prototype is also developed to verify the simulation results where a good match between simulation and experimental results is achieved. [ABSTRACT FROM AUTHOR]

As inverters are often used in critical applications, reliability is an important issue. In particular, the power electronic switches and gate drivers, the most essential components of the inverter, are vulnerable parts in real live operation. Therefore, this paper focuses on open-switch fault detection for multilevel inverters. When a single-switch open-circuit fault occurs in one of the power electronic switches, the algorithm can detect the fault and the switch that is causing it. The detection is worked out for both a linear resistive inductive load and an induction motor. The proposed algorithm is an extension of an already available finite-set model-based predictive control algorithm. Therefore, no extra hardware or measurements are required. This paper also discusses a suggested method for reconfiguration after fault detection. Computer simulation and experimental verifications validate the proposed methods. [ABSTRACT FROM PUBLISHER]

In string photovoltaic (PV) systems, the power–voltage (P–V) characteristic under partial shading conditions (PSC) displays multiple peaks requiring global maximum power point (GMPP) tracking (GMPPT) algorithms to identify the PV array GMPP. Several GMPPT algorithms scan wide voltage tracks to detect the GMPP, even larger than a P–V curve full scan. Moreover, many algorithms have been tested only for simple PSC that lead to three well distinct peaks at most. This paper initially presents a trapezoidal area, called the maximum power trapezium (MPT), in the P–V plane that contains all possible GMPPs for any PSC. Using the MPT and information about the minimum voltage difference between adjacent local peaks, a GMPPT algorithm is proposed, which tracks the GMPP of a string PV array under any severe PSC reducing its voltage track and so its tracking time. Simulation and experimental results show the superior performance of the proposed algorithm, in comparison to the state-of-art algorithms, in terms of tracking time, energy loss, and total voltage track during the search for the GMPP. [ABSTRACT FROM AUTHOR]

This paper proposes a simple and effective method to reduce speed ripples of permanent magnet synchronous machines (PMSMs) under low-speed working conditions. The treated issue is related to the periodic torque ripples, which induce speed oscillations that deteriorate the drive performance. The main idea of the proposed method is to modify a conventional PMSM controller by superposing an appropriate compensation signal to the quadratic-current reference. The proposed approach allows the reduction of speed ripples at low speed through a simple compensation signal and does not require a hard calculation cost. A theoretical analysis is presented, and both simulation and experimental results are presented to validate the proposed compensation method. [ABSTRACT FROM AUTHOR]

Index tracking is a popular passive portfolio management strategy that aims at constructing a portfolio that replicates or tracks the performance of a financial index. The tracking error can be minimized by purchasing all the assets of the index in appropriate amounts. However, to avoid small and illiquid positions and large transaction costs, it is desired that the tracking portfolio consists of a small number of assets, i.e., a sparse portfolio. The optimal asset selection and capital allocation can be formulated as a combinatorial problem. A commonly used approach is to use mixed-integer programming (MIP) to solve small sized problems. Nevertheless, MIP solvers can fail for high-dimensional problems while the running time can be prohibiting for practical use. In this paper, we propose efficient and fast index tracking algorithms that automatically perform asset selection and capital allocation under a set of general convex constraints. A special consideration is given to the case of the nonconvex holding constraints and to the downside risk tracking measure. Furthermore, we derive specialized algorithms with closed-form updates for particular sets of constraints. Numerical simulations show that the proposed algorithms match or outperform existing methods in terms of performance, while their running time is lower by many orders of magnitude. [ABSTRACT FROM PUBLISHER]

In this paper, we study the target tracking problem in a wireless sensor network. A sensor receives a measurement from an energy emitting target and employs binary quantization to the received measurement to generate its decision. A sinusoidal waveform with a certain duration is then used to transmit the sensor decision to the fusion center (FC). All sensor decisions are transmitted to the FC over erroneous wireless channels based on a time division multiple access scheme. We introduce the proportional time allocation (PTA) algorithm where at each time step of tracking, PTA jointly determines the sensors binary quantization thresholds and their time allocations devoted for the transmissions of binary sensor decisions. Simulation results show that, PTA optimally and dynamically distributes the available transmission time among the sensors near the target so that the decisions of such sensors become less subject to channel errors, and turns off the non-informative sensors located far away from the target. Hence, PTA both saves from the number of sensors transmitting to the FC and provides better estimation performance as compared to ad hoc equal time allocation approaches. [ABSTRACT FROM PUBLISHER]

This paper presents the posterior linearization belief propagation (PLBP) algorithm for cooperative localization in wireless sensor networks with nonlinear measurements. PLBP performs two steps iteratively: linearization and belief propagation. At the linearization step, the nonlinear functions are linearized using statistical linear regression with respect to the current beliefs. This SLR is performed in practice by using sigma-points drawn from the beliefs. In the second step, belief propagation is run on the linearized model. We show by numerical simulations how PLBP can outperform other algorithms in the literature. [ABSTRACT FROM PUBLISHER]

To improve the control performance for grid-tied power converters, the fundamental frequency and harmonics of the grid voltage should be quickly and accurately estimated even under distorted voltage condition. This paper introduces a straightforward discrete adaptive filter to observe fundamental and harmonic sequence components of the grid voltage. The proposed filter possesses a simple and straightforward implementation. Based on the newly developed filter, frequency error transmission was analyzed when the frequency of the input voltage was unequal to the center frequency of the filter. Consequently, a frequency estimation loop was designed to adapt to the frequency variation for the filter. Compared to previous algorithms, the proposed algorithm has a better dynamic performance rating for frequency estimation, robust stability, and a simpler implementation. The effectiveness of the algorithm is verified by simulations and laboratory experiments. [ABSTRACT FROM PUBLISHER]

On-line monitoring and analysis of low frequency oscillation (LFO) are important for stability and security of a power system. This paper proposes a blind source separation (BSS) based method for LFO modal analysis of one-channel measured signal, which consists of a second-order blind identification (SOBI) algorithm and the Hilbert transform (HT) technique. This is the first time when a BSS technique is applied as a modal decomposition tool in this field. The proposed SOBI-HT based dominant mode identification method combines an iteration procedure with an identification procedure to determine the model order, and then identify dominant modes. The performance of the proposed method is evaluated on numerical simulation signals and a record of real data, verifying its effectiveness and accuracy. [ABSTRACT FROM PUBLISHER]

This paper deals with the stability problem of selected induction motor speed estimators in the case of the regenerating mode operation. Two effective solutions are taken into consideration: adaptive full-order observer and model reference adaptive system-type estimator based on the current flux model and stator current estimation. The two estimation algorithms are compared in detail, namely their mathematical models, theoretical stability analysis, unstable operation areas, and stability improvement methods. The speed adaptation mechanism is extended with an additional shift angle in both cases. The theoretical analysis and simulation test results are validated by wide experimental tests. [ABSTRACT FROM PUBLISHER]

In this paper, a clustering algorithm called the Reconfigurable Dominant Sequence Clustering (ReDSC), is proposed. The experiments show that ReDSC reduces the parallel run time efficiently by 30 percent. Moreover, an empirical comparison of ReDSC with its peer in the multi-processor model, i.e., DSC algorithm, is provided and the results demonstrate the 35 percent improvement of ReDSC over DSC. Then, a hardware implementation of a dynamic scheduler for run-time communication-aware scheduling of hardware tasks is proposed. The proposed scheduler makes use of the ReDSC algorithm for allocating tasks to the processing reconfigurable cores, dynamically considering the communication costs. The simulation results illustrate the benefits of the proposed scheduler as compared to that of other static and basic schedulers in the technical literature. [ABSTRACT FROM PUBLISHER]

Data Gathering is a fundamental task in Wireless Sensor Networks (WSNs). Data gathering trees capable of performing aggregation operations are also referred to as Data Aggregation Trees (DATs). Currently, most of the existing works focus on constructing DATs according to different user requirements under the Deterministic Network Model (DNM). However, due to the existence of many probabilistic lossy links in WSNs, it is more practical to obtain a DAT under the realistic Probabilistic Network Model (PNM). Moreover, the load-balance factor is neglected when constructing DATs in current literatures. Therefore, in this paper, we focus on constructing a Load-Balanced Data Aggregation Tree (LBDAT) under the PNM. More specifically, three problems are investigated, namely, the Load-Balanced Maximal Independent Set (LBMIS) problem, the Connected Maximal Independent Set (CMIS) problem, and the LBDAT construction problem. LBMIS and CMIS are well-known NP-hard problems and LBDAT is an NP-complete problem. Consequently, approximation algorithms and comprehensive theoretical analysis of the approximation factors are presented in the paper. Finally, our simulation results show that the proposed algorithms outperform the existing state-of-the-art approaches significantly. [ABSTRACT FROM AUTHOR]

In this paper, we aim to obtain the optimal tradeoff between the average delay and the average power consumption in a communication system. In our system, the arrivals occur at each timeslot according to a Bernoulli arrival process, and are buffered at the transmitter waiting to be scheduled. We consider a finite buffer and allow the scheduling decision to depend on the buffer occupancy. In order to capture the realism in communication systems, the transmission power is assumed to be an increasing and convex function of the number of packets transmitted in each timeslot. This problem is modeled as a constrained Markov decision process (CMDP). We first prove that the optimal policy of the Lagrangian relaxation of the CMDP is deterministic and threshold-based. We then show that the optimal delay-power tradeoff curve is convex and piecewise linear, and the optimal policies of the original problem are also threshold-based. Based on the results, we propose an algorithm to obtain the optimal policy and the optimal tradeoff curve. We also show that the proposed algorithm is much more efficient than using general methods. The theoretical results and the algorithm are validated by linear programming and simulations. [ABSTRACT FROM PUBLISHER]

This paper addresses the source association (SA), direction of arrival (DOA), and fading coefficients (FCs) estimation problem in multipath environment. First, we establish a rank reduction property for a multipath signal model with the existence of multiple groups of coherent signals. Subsequently, based on this property, effective algorithms for SA, DOA, and FCs estimation have been developed. The proposed DOA and FCs estimation methods exploit the multipath structure information to achieve improved accuracy. The new DOA estimation methods work well even in the case that the DOAs of the multipath signals associated with different sources are (nearly) overlapped. Meanwhile, the new methods are applicable to arbitrary array geometry while without decreasing the effective array aperture. Then, the stochastic Cramér–Rao bound on DOA and FCs estimation of multipath model (MCRB) exploiting the multipath structure information is derived in closed form. Numerical simulations have been provided to demonstrate the effectiveness of the proposed methods. [ABSTRACT FROM PUBLISHER]