Search

In this paper, we address scheduling methods for queue stabilization and appropriate power allocation techniques in downlink dense user-centric scalable cell-free multiple-input multiple-output (CF-MIMO) networks. Scheduling is performed by the central processing unit (CPU) scheduler using Lyapunov optimization for queue stabilization. In this process, the drift-plus-penalty is utilized, and the control parameter V serves as the weighting factor for the penalty term. The control parameter V is fixed to achieve queue stabilization. We introduce the dynamic V method, which adaptively selects the control parameter V considering the current queue backlog, arrival rate, and effective rate. The dynamic V method allows flexible scheduling based on traffic conditions, demonstrating its advantages over fixed V scheduling methods. In cases where UEs scheduled with dynamic V exceed the number of antennas at the access point (AP), the semi-orthogonal user selection (SUS) algorithm is employed to reschedule UEs with favorable channel conditions and orthogonality. Dynamic V shows the best queue stabilization performance across all traffic conditions. It shows a 10% degraded throughput performance compared to V = 10,000. Max-min fairness (MMF), sum SE maximization, and fractional power allocation (FPA) are widely considered power allocation methods. However, the power allocation method proposed in this paper, combining FPA and queue-based FPA, achieves up to 60% better queue stabilization performance compared to MMF. It is suitable for systems requiring low latency. [ABSTRACT FROM AUTHOR]

Unmanned Ground Vehicles (UGVs) and Unmanned Aerial Vehicles (UAVs) are commonly used for various purposes, and their cooperative systems have been developed to enhance their capabilities. However, tracking and interacting with dynamic UAVs poses several challenges, including limitations of traditional radar and visual systems, and the need for the real-time monitoring of UAV positions. To address these challenges, a low-cost method that uses LiDAR (Light Detection and Ranging) and RGB-D cameras to detect and track UAVs in real time has been proposed. This method relies on a learning model and a linear Kalman filter, and has demonstrated satisfactory estimation accuracy using only CPU (Central Processing Unit)- in GPS (Global Positioning System)-denied environments without any prior information. [ABSTRACT FROM AUTHOR]

SLAM (Simultaneous Localization and Mapping), primarily relying on camera or LiDAR (Light Detection and Ranging) sensors, plays a crucial role in robotics for localization and environmental reconstruction. This paper assesses the performance of two leading methods, namely ORB-SLAM3 and SC-LeGO-LOAM, focusing on localization and mapping in both indoor and outdoor environments. The evaluation employs artificial and cost-effective datasets incorporating data from a 3D LiDAR and an RGB-D (color and depth) camera. A practical approach is introduced for calculating ground-truth trajectories and during benchmarking, reconstruction maps based on ground truth are established. To assess the performance, ATE and RPE are utilized to evaluate the accuracy of localization; standard deviation is employed to compare the stability during the localization process for different methods. While both algorithms exhibit satisfactory positioning accuracy, their performance is suboptimal in scenarios with inadequate textures. Furthermore, 3D reconstruction maps established by the two approaches are also provided for direct observation of their differences and the limitations encountered during map construction. Moreover, the research includes a comprehensive comparison of computational performance metrics, encompassing Central Processing Unit (CPU) utilization, memory usage, and an in-depth analysis. This evaluation revealed that Visual SLAM requires more CPU resources than LiDAR SLAM, primarily due to additional data storage requirements, emphasizing the impact of environmental factors on resource requirements. In conclusion, LiDAR SLAM is more suitable for the outdoors due to its comprehensive nature, while Visual SLAM excels indoors, compensating for sparse aspects in LiDAR SLAM. To facilitate further research, a technical guide was also provided for the researchers in related fields. [ABSTRACT FROM AUTHOR]

Extreme Mass Ratio Inspirals (EMRIs) are one of the key sources for future space-based gravitational wave interferometers. Measurements of EMRI gravitational waves are expected to determine the characteristics of their sources with subpercent precision. However, their waveform generation is challenging due to the long duration of the signal and the high harmonic content. Here, we present the first ready-to-use Schwarzschild eccentric EMRI waveform implementation in the frequency domain for use with either graphics processing units (GPUs) or central processing units (CPUs). We present the overall waveform implementation and test the accuracy and performance of the frequency domain waveforms against the time domain implementation. On GPUs, the frequency domain waveform takes in median 0.044 s to generate and is twice as fast to compute as its time domain counterpart when considering massive black hole masses > 2 x 106 M© and initial eccentricities eg > 0.2. On CPUs, the median waveform evaluation time is 5 s, and it is five times faster in the frequency domain than in the time domain. Using a sparser frequency array can further speed up the waveform generation, reaching up to 0.3 s. This enables us to perform, for the first time, EMRI parameter inference with fully relativistic waveforms on CPUs. Future EMRI models, which encompass wider source characteristics (particularly black hole spin and generic orbit geometries), will require significantly more harmonics. Frequency domain models will be essential analysis tools for these astrophysically realistic and important signals. [ABSTRACT FROM AUTHOR]

Simulated weather time series are often used in engineering and research practice to assess radar systems behavior and/or to evaluate the performance of novel techniques. There are two main approaches to simulating weather time series. One is based on summing individual returns from a large number of distributed weather particles to create a cumulative return. The other is aimed at creating simulated random signals based on the predetermined values of radar observables and is of interest herein. So far, several methods to simulate weather time series, using the latter approach, have been proposed. All of these methods are based on applying the inverse discrete Fourier transform to the spectral model with added random fluctuations. To meet the desired simulation accuracy, such an approach typically requires generating the number of samples that is larger than the base sample number due to the discrete Fourier transform properties. In that regard, a novel method to determine simulation length is proposed. It is based on a detailed theoretical development that demonstrates the exact source of errors incurred by this approach. Furthermore, a simple method for time series simulation that is based on the autocorrelation matrix exists. This method neither involves manipulations in the spectral domain nor requires generating the number of samples larger than the base sample number. Herein, this method is suggested for weather time series simulation and its accuracy and efficiency are analyzed and compared to the spectral-based approach. Significance Statement: All research articles published so far on the topic of weather time series simulation propose the use of inverse discrete Fourier transform (IDFT) when based on the desired Doppler moment values. Herein, a detailed theoretical development that demonstrates the exact source of errors incurred by this approach is presented. Also, a novel method to determine the simulation length that is based on the theoretical error computation is proposed. As an alternative, a computationally efficient general method (not using IDFT) previously developed for the simulation of sequences with desired properties is suggested for weather time series simulation. It is demonstrated that the latter method produces accurate results within overall shorter computational times. Moreover, it is shown that the use of graphics processing unit (GPU), ubiquitous in modern computers, significantly reduces computational times compared to the sole use of central processing unit (CPU) for all simulation-related calculations. [ABSTRACT FROM AUTHOR]

A low-complexity joint range and Doppler frequency-modulated continuous wave (FMCW) radar algorithm based on the number of targets is proposed in this paper. This paper introduces two low-complexity FMCW radar algorithms, that is, region of interest (ROI)-based and partial discrete Fourier transform (DFT)-based algorithms. We find the low-complexity condition of each algorithm by analyzing the complexity of these algorithms. From this analysis, it is found that the number of targets is an important factor in determining complexity. Based on this result, the proposed algorithm selects a low-complexity algorithm between two algorithms depending the estimated number of targets and thus achieves lower complexity compared two low-complexity algorithms introduced. The experimental results using real FMCW radar systems show that the proposed algorithm works well in a real environment. Moreover, central process unit time and count of float pointing are shown as a measure of complexity. [ABSTRACT FROM AUTHOR]

The parallel architecture can improve the training speed of Deep learning models and it is beneficial to model optimization. This research designs Optimal Interleaved Distributed Architecture (OIDA). Its characteristics are (1) the data set that each child node participates in training is fixed and unique; (2) multiple approaches ensure that the model parameters of each child node participating in training each time are always optimal; (3) the computing units of each child node are interleaved for training without stopping. The architecture can be deployed as Single Machine Parallel (SMP) or Multi Machine Distributed (MMD), or a combination of both. The experimental results show that its efficiency is obvious in a multi-machine multi-card environment, and the model speed of training millions of parameters in a 5-machine 10-card lightweight (Graphics Processing Unit (GPU) of 2GB memory) cluster can reach megapixels/s. When training the same amount of training data, GPU can process data faster than Central Processing Unit (CPU) with the same number of clusters. 4-machine 4-core GPU parallel saves 65.61% of time compared with 4-machine 4-core CPU parallel, while 4-machine 8-core GPU saves 83.32% of time compared with 4-machine 4-core CPU parallel. For polarized Synthetic Aperture Radar (SAR) Deep learning data sets, increasing the number of computers in the cluster can effectively save training time. In the experimental environment of this research, there is no situation that when the number of computers in the cluster increases due to network data transmission, the training time does not decrease. [ABSTRACT FROM AUTHOR]

In this work, we study the uplink (UL) of a cloud radio access network (C-RAN), where the central processing unit (CU) utilizes remote radio units (RU)s belonging to the same operator, i.e., the trusted RUs, as well as the RUs belonging to other operators or private owners, i.e., the untrusted RUs. In order to preserve information privacy against the untrusted RUs, the trusted RUs are enabled with full-duplex (FD) capability and transmit a jamming signal towards the exotic RUs, while receiving and forwarding UL signal to the CU. Note that the transmitted jamming signal degrades the decoding capability at the untrusted RUs, however, it can be later subtracted from the UL communication as it is apriori known by the CU. An optimization problem is then formulated to maximize the sum uplink private information rate by jointly designing the fronthaul compression, as well as the information and jamming transmission strategies. Due to the intractability of the resulting mathematical problem, an iterative solution is proposed with convergence to a point satisfying the Karush-Kuhn-Tucker (KKT) optimality conditions. Numerical simulations illustrate a notable gain obtained via the proposed sharing mechanism under the consideration of information privacy. [ABSTRACT FROM AUTHOR]

Evaluating the transmittance between two points along a ray is a key component in solving the light transport through heterogeneous participating media and entails computing an intractable exponential of the integrated medium's extinction coefficient. While algorithms for estimating this transmittance exist, there is a lack of theoretical knowledge about their behaviour, which also prevent new theoretically sound algorithms from being developed. For this purpose, we introduce a new class of unbiased transmittance estimators based on random sampling or truncation of a Taylor expansion of the exponential function. In contrast to classical tracking algorithms, these estimators are non-analogous to the physical light transport process and directly sample the underlying extinction function without performing incremental advancement. We present several versions of the new class of estimators, based on either importance sampling or Russian roulette to provide finite unbiased estimators of the infinite Taylor series expansion. We also show that the well known ratio tracking algorithm can be seen as a special case of the new class of estimators. Lastly, we conduct performance evaluations on both the central processing unit (CPU) and the graphics processing unit (GPU), and the results demonstrate that the new algorithms outperform traditional algorithms for heterogeneous mediums. [ABSTRACT FROM AUTHOR]

This paper presents the use of a terrestrial light detection and ranging (LiDAR) system to scan the vegetation of tree crops to estimate the so-called pixelated leaf wall area (PLWA). Scanning rows laterally and considering only the half-canopy vegetation to the line of the trunks, PLWA refers to the vertical projected area without gaps detected by LiDAR. As defined, PLWA may be different depending on the side from which the LiDAR is applied. The system is completed by a real-time kinematic global positioning system (RTK-GPS) sensor and an inertial measurement unit (IMU) sensor for positioning. At the end, a total leaf wall area (LWA) is computed and assigned to the X, Y position of each vertical scan. The final value of the area depends on the distance between two consecutive scans (or horizontal resolution), as well as the number of intercepted points within each scan, since PLWA is only computed when the laser beam detects vegetation. To verify system performance, tests were conducted related to the georeferencing task and synchronization problems between GPS time and central processing unit (CPU) time. Despite this, the overall accuracy of the system is generally acceptable. The Leaf Area Index (LAI) can then be estimated using PLWA as an explanatory variable in appropriate linear regression models. [ABSTRACT FROM AUTHOR]

Global Navigation Satellite System Reflectometry Bistatic Synthetic Aperture Radar (GNSS-R BSAR) is becoming more and more important in remote sensing because of its low power, low mass, low cost, and real-time global coverage capability. The Back Projection Algorithm (BPA) was usually selected as the GNSS-R BSAR imaging algorithm because it can process echo signals of complex geometric configurations. However, the huge computational cost is a challenge for its application in GNSS-R BSAR. Graphics Processing Units (GPU) provides an efficient computing platform for GNSS-R BSAR processing. In this paper, a solution accelerating the BPA of GNSS-R BSAR using GPU is proposed to improve imaging efficiency, and a matching pre-processing program was proposed to synchronize direct and echo signals to improve imaging quality. To process hundreds of gigabytes of data collected by a long-time synthetic aperture in fixed station mode, a stream processing structure was used to process such a large amount of data to solve the problem of limited GPU memory. In the improvement of the imaging efficiency, the imaging task is divided into pre-processing and BPA, which are performed in the Central Processing Unit (CPU) and GPU, respectively, and a pixel-oriented parallel processing method in back projection is adopted to avoid memory access conflicts caused by excessive data volume. The improved BPA with the long synthetic aperture time is verified through the simulation of and experimenting on the GPS-L5 signal. The results show that the proposed accelerating solution is capable of taking approximately 128.04 s, which is 156 times lower than pure CPU framework for producing a size of 600 m × 600 m image with 1800 s synthetic aperture time; in addition, the same imaging quality with the existing processing solution can be retained. [ABSTRACT FROM AUTHOR]

In this work, a context-based multisensor system, applied to pedestrian detection in urban environments, is presented. The proposed system comprises three main processing modules: (i) a LIDAR-based module acting as the primary object detector, (ii) a module which supplies the system with contextual information obtained from a semantic map of the roads, and (iii) an image-based detection module, using sliding window detectors, with the role of validating the presence of pedestrians in the regions of interest generated by the LIDAR module. A Bayesian strategy is used to combine information from sensors onboard the vehicle ('local' information) with information contained in a digital map of the roads ('global' information). To support experimental analysis, a multisensor dataset, named the Laser and Image Pedestrian Detection dataset (LIPD), is used. The LIPD dataset was collected in an urban environment, under daylight conditions, using an electrical vehicle driven at low speed. A down-sampling method, using support vectors extracted from multiple linear SVMs, was used to reduce the cardinality of the training set and, as a consequence, to decrease the CPU time during the training process of the image-based classifiers. The performance of the system is evaluated, in terms of detection rate and the number of false positives per frame, using three image-detectors: a linear SVM, a SVM-cascade, and a benchmark method. Additionally, experiments are performed to assess the impact of contextual information on the performance of the detection system. [ABSTRACT FROM AUTHOR]

Frequency-domain synthetic aperture radar (SAR) image formation algorithms are of lower computation cost (both in number of elementary operations and in required memory storage) than direct time-domain integration, and do not make the narrowband (monochromatic) assumption. Both advantages are critical to very-high-resolution imaging because a lower complexity yields a drastic computation time decrease as cross-range resolution increases, and the narrowband assumption is more and more a concern as range resolution (hence bandwidth) increases. Though an exact formulation exists (\omega- k algorithm) for a perfect linear uniform acquisition trajectory, in a real-life airborne case, the unavoidable trajectory deviation from a straight line needs to be compensated. This motion compensation (MoComp) operation is much more complicated in the case of frequency-domain processing. An efficient technique for this purpose is presented. This method keeps the parallel processing aspect, and has been programmed both for multithread on multicore/symmetrical multiprocessor central processing units (CPUs) and for graphic processor units (GPUs). [ABSTRACT FROM PUBLISHER]

Abstract: Remote sensing technologies, such as LIDAR, rapidly evolve and produce large datasets. The computers used to visualize these data have limited resources, which prevent detailed and real-time visualization. An approach to real-time visualization of virtually unlimited LIDAR datasets, at full detail with a hierarchical and out-of-core approach to data management and a modern point-based rendering technique, is presented. It is based on on-demand loading of data subsets into their optimal memory locations and on a two-pass point-based rendering method that utilizes elliptical weighted average filtering to reduce alias. In addition, points are rotated in accordance to their distance and orientation from the viewer. All graphics computations are implemented in programmable shaders on the GPU, so the CPU is free to perform other tasks. The capability of our approach is compared with the method. [ABSTRACT FROM AUTHOR]

Research on RCS evaluation for electrically large objects has been a hot topic for decades. Although multilevel fast multipole algorithm (MLFMA) has been the most popular method in scattering computation, due to the limitation of both CPU speed and memory size in a single computer, realistic large targets require discretization with millions of unknowns still cannot be solved by sequential implementations of MLFMA. In this paper, we introduce a Docker-enabled parallel MLFMA computing system based on MPI, which is proved to be friendly for deployment and economical for scalability, to solve electrically large scattering problems. In addition, the capability of the proposed system has been demonstrated by several canonical examples. [ABSTRACT FROM AUTHOR]

In the past years various methods have been developed to estimate high-resolution solar potential in urban areas, by simulating solar irradiance over surface models that originate from remote sensing data. In general, this requires discretisation of solar irradiance models that estimate direct, reflective, and diffuse irradiances. The latter is most accurately estimated by an anisotropic model, where the hemispherical sky dome from arbitrary surface's viewpoint consists of the horizon, the circumsolar and sky regions. Such model can be modified to incorporate the effects of shadowing from obstruction with a view factor for each sky region. However, state-of-the-art using such models for estimating solar potential in urban areas, only considers the sky view factor, and not circumsolar view factor, due to high computational load. In this paper, a novel parallelisation of solar potential estimation is proposed by using General Purpose computing on Graphics Processing Units (GPGPU). Modified anisotropic Perez model is used by considering diffuse shadowing with all three sky view factors. Moreover, we provide validation based on sensitivity analysis of the method's accuracy with independent meteorological measurements, by changing circumsolar sky region's half-angle and resolution of the hemispherical sky dome. Finally, the presented method using GPPGU was compared to multithreaded Central Processing Unit (CPU) approach, where on average a 70x computational speedup was achieved. Finally, the proposed method was applied over a ∼ 21 km 2 urban area, obtained from Light Detection And Ranging (LiDAR) data, where the computation of solar potential was performed in a reasonable time. • A new method for high-resolution solar potential estimation using GPGPU. • Novel incorporation of the modified Perez anisotropic diffuse irradiance model. • The method considers sky, circumsolar, and horizon view factors with shadowing. • In comparison to a multithreaded CPU approach, a 70x speedup can be achieved. [ABSTRACT FROM AUTHOR]

To move High-Performance Computing (HPC) closer to forward operating environments and missions, the Army Research Laboratory is developing approaches using hybrid, asymmetric core computing. By blending capabilities found in Graphics Processing Units (GPUs) and traditional von Neumann multicore Central Processing Units (CPUs), approaches are being developed and optimized to provide at or near real-time processing speeds for research project applications. Algorithms are designed to partition work to resources best designed to handle the processing load. The use of commodity resources allows the design to be flexible throughout the life cycle without the costly and time-consuming delays associated with Application-Specific Integrated Circuit (ASIC) development. This paradigm allows for rapid technology transfer to end users. In this paper, we describe a synchronous impulse reconstruction radar imaging algorithm that has been designed for hybrid CPU-GPU processing. We discuss various optimizations such as asynchronous task partitioning between the CPU and GPU as well as data movement reduction. We also discuss analysis and design of the algorithms within the context of two programming models: NVIDIA's CUDA and AMD's ATI Brook+. Finally, we report on the speedup achieved by this approach that allowed us to take a code once restricted to postprocessing and transform it into one that exceeds real-time performance requirements. [ABSTRACT FROM AUTHOR]

Abstract: Markov Random Field (MRF) approaches have been widely studied for Synthetic Aperture Radar (SAR) image segmentation, but they have a large computational cost and hence are not widely used in practice. Fortunately parallel algorithms have been documented to enjoy significant speedups when ported to run on a graphics processing units (GPUs) instead of a standard CPU. Presented here is an implementation of graphics processing units in General Purpose Computation (GPGPU) for SAR image segmentation based on the MRF method, using the C-oriented Compute Unified Device Architecture (CUDA) developed by NVIDIA. This experiment with GPGPU shows that the speed of segmentation can be increased by a factor of 10 for large images. [Copyright &y& Elsevier]

Abstract: In recent years improvements in spatial data acquisition technologies, such as LiDAR, resulted in an explosive increase in the volume of spatial data, presenting unprecedented challenges for computation capacity. At the same time, the kernel of computing platforms the CPU, also evolved from a single-core to multi-core architecture. This radical change significantly affected existing data processing algorithms. Exemplified by the problem of generating DEM from massive air-borne LiDAR point clouds, this paper studies how to leverage the power of multi-core platforms for large-scale geospatial data processing and demonstrates how multi-core technologies can improve performance. Pipelining is adopted to exploit the thread level parallelism of multi-core platforms. First, raw point clouds are partitioned into overlapped blocks. Second, these discrete blocks are interpolated concurrently on parallel pipelines. On the interpolation run, intermediate results are sorted and finally merged into an integrated DEM. This parallelization demonstrates the great potential of multi-core platforms with high data throughput and low memory footprint. This approach achieves excellent performance speedup with greatly reduced processing time. For example, on a 2.0GHz Quad-Core Intel Xeon platform, the proposed parallel approach can process approximately one billion LiDAR points (16.4GB) in about 12min and produces a 27,500×30,500 raster DEM, using less than 800MB main memory. [Copyright &y& Elsevier]

This paper aims to increase the Unmanned Aerial Vehicle's (UAV) capacity for target tracking. First, a control model based on fuzzy logic is created, which modifies the UAV's flight attitude in response to the target's motion status and changes in the surrounding environment. Then, an edge computing-based target tracking framework is created. By deploying edge devices around the UAV, the calculation of target recognition and position prediction is transferred from the central processing unit to the edge nodes. Finally, the latest Vision Transformer model is adopted for target recognition, the image is divided into uniform blocks, and then the attention mechanism is used to capture the relationship between different blocks to realize real-time image analysis. To anticipate the position, the particle filter algorithm is used with historical data and sensor inputs to produce a high-precision estimate of the target position. The experimental results in different scenes show that the average target capture time of the algorithm based on fuzzy logic control is shortened by 20% compared with the traditional proportional-integral-derivative (PID) method, from 5.2 s of the traditional PID to 4.2 s. The average tracking error is reduced by 15%, from 0.8 m of traditional PID to 0.68 m. Meanwhile, in the case of environmental change and target motion change, this algorithm shows better robustness, and the fluctuation range of tracking error is only half of that of traditional PID. This shows that the fuzzy logic control theory is successfully applied to the UAV target tracking field, which proves the effectiveness of this method in improving the target tracking performance. [ABSTRACT FROM AUTHOR]

Motivation The data deluge of high-throughput sequencing (HTS) has posed great challenges to data storage and transfer. Many specific compression tools have been developed to solve this problem. However, most of the existing compressors are based on central processing unit (CPU) platform, which might be inefficient and expensive to handle large-scale HTS data. With the popularization of graphics processing units (GPUs), GPU-compatible sequencing data compressors become desirable to exploit the computing power of GPUs. Results We present a GPU-accelerated reference-free read compressor, namely CURC, for FASTQ files. Under a GPU–CPU heterogeneous parallel scheme, CURC implements highly efficient lossless compression of DNA stream based on the pseudogenome approach and CUDA library. CURC achieves 2–6-fold speedup of the compression with competitive compression rate, compared with other state-of-the-art reference-free read compressors. Availability and implementation CURC can be downloaded from https://github.com/BioinfoSZU/CURC. Supplementary information Supplementary data are available at Bioinformatics online. [ABSTRACT FROM AUTHOR]

Recent advances in image data proccesing through deep learning allow for new optimization and performance-enhancement schemes for radiation detectors and imaging hardware. This enables radiation experiments, which includes photon sciences in synchrotron and X-ray free electron lasers as a subclass, through data-endowed artificial intelligence. We give an overview of data generation at photon sources, deep learning-based methods for image processing tasks, and hardware solutions for deep learning acceleration. Most existing deep learning approaches are trained offline, typically using large amounts of computational resources. However, once trained, DNNs can achieve fast inference speeds and can be deployed to edge devices. A new trend is edge computing with less energy consumption (hundreds of watts or less) and real-time analysis potential. While popularly used for edge computing, electronic-based hardware accelerators ranging from general purpose processors such as central processing units (CPUs) to application-specific integrated circuits (ASICs) are constantly reaching performance limits in latency, energy consumption, and other physical constraints. These limits give rise to next-generation analog neuromorhpic hardware platforms, such as optical neural networks (ONNs), for high parallel, low latency, and low energy computing to boost deep learning acceleration (LA-UR-23-32395). [ABSTRACT FROM AUTHOR]

Ice-sheet flow models capable of accurately projecting their future mass balance constitute tools to improve flood risk assessment and assist sea-level rise mitigation associated with enhanced ice discharge. Some processes that need to be captured, such as grounding-line migration, require high spatial resolution (under the kilometer scale). Conventional ice flow models mainly execute on central processing units (CPUs), which feature limited parallel processing capabilities and peak memory bandwidth. This may hinder model scalability and result in long run times, requiring significant computational resources. As an alternative, graphics processing units (GPUs) are ideally suited for high spatial resolution, as the calculations can be performed concurrently by thousands of threads, processing most of the computational domain simultaneously. In this study, we combine a GPU-based approach with the pseudo-transient (PT) method, an accelerated iterative and matrix-free solution strategy, and investigate its performance for finite elements and unstructured meshes with application to two-dimensional (2-D) models of real glaciers at a regional scale. For both the Jakobshavn and Pine Island glacier models, the number of nonlinear PT iterations required to converge a given number of vertices (N) scales in the order of O(N1.2) or better. We further compare the performance of the PT CUDA C implementation with a standard finite-element CPU-based implementation using the price-to-performance metric. The price of a single Tesla V100 GPU is 1.5 times that of two Intel Xeon Gold 6140 CPUs. We expect a minimum speedup of at least 1.5 times to justify the Tesla V100 GPU price to performance. Our developments result in a GPU-based implementation that achieves this goal with a speedup beyond 1.5 times. This study represents a first step toward leveraging GPU processing power, enabling more accurate polar ice discharge predictions. The insights gained will benefit efforts to diminish spatial resolution constraints at higher computing performance. The higher computing performance will allow for ensembles of ice-sheet flow simulations to be run at the continental scale and higher resolution, a previously challenging task. The advances will further enable the quantification of model sensitivity to changes in upcoming climate forcings. These findings will significantly benefit process-oriented sea-level-projection studies over the coming decades. [ABSTRACT FROM AUTHOR]

This paper addresses the problem of tracking a high-speed ballistic target in real time. Particle swarm optimization (PSO) can be a solution to overcome the motion of the ballistic target and the nonlinearity of the measurement model. However, in general, particle swarm optimization requires a great deal of computation time, so it is difficult to apply to realtime systems. In this paper, we propose a parallelized particle swarm optimization technique using field-programmable gate array (FPGA) to be accelerated for realtime ballistic target tracking. The realtime performance of the proposed method has been tested and analyzed on a well-known heterogeneous processing system with a field-programmable gate array. The proposed parallelized particle swarm optimization was successfully conducted on the heterogeneous processing system and produced similar tracking results. Also, compared to conventional particle swarm optimization, which is based on the only central processing unit, the computation time is significantly reduced by up to 3.89×. [ABSTRACT FROM AUTHOR]

Recent research has shown that field programmable gate arrays (FPGAs) have a large potential for accelerating demanding applications, such as high performance digital signal process applications with low-volume market. The loss of generality in the architecture is one disadvantage of using FPGAs, however, the reconfigurability of FPGAs allow reprogramming for other applications. Therefore, a uniform FPGA-based architecture, an efficient programming model, and a simple mapping method are paramount for the wide acceptance of FPGA technology. This paper presents MASALA, a dynamically reconfigurable FPGA-based accelerator for parallel programs written in thread-intensive and explicit memory management (TEMM) programming models. Our system uses a TEMM programming model to parallelize demanding applications, including application decomposition into separate thread blocks and compute and data load/store decoupling. Hardware engines are included into MASALA using partial dynamic reconfiguration modules, each of which encapsulates a thread process engine that implements the hardware's thread functionality. A data dispatching scheme is also included in MASALA to enable the explicit communication of multiple memory hierarchies such as interhardware engines, host processors, and hardware engines. Finally, this paper illustrates a multi-FPGA prototype system of the presented architecture: MASALA-SX. A large synthetic aperture radar image formatting experiment shows that MASALA's architecture facilitates the construction of a TEMM program accelerator by providing greater performance and less power consumption than current CPU platforms, without sacrificing programmability, flexibility, and scalability. [ABSTRACT FROM AUTHOR]

Laser spot detection and tracking play a critical role in laser techniques. However, traditional detection and tracking systems tend to be bulky and lack portability. Therefore, there is a growing emphasis on developing high-performance and miniaturized systems based on the field programmable gate array (FPGA). In this paper, a novel parallel multi-target detection and determination algorithm is proposed to address the issue of current FPGA-based systems' ineffective detection of laser spots in complex environments. Our simulation results demonstrate that the algorithm can effectively detect laser spots in complex environments. It can process a frame with an 800 × 480 resolution in only 7.88 ms at a 50 MHz image processing frequency, which means it can process more than 100 f/s and meet the real-time detection requirements. Such excellent detection performance is challenging to achieve with central processing units and advanced RISC machine microprocessors. Then, the algorithm is further deployed on an FPGA to build a prototype laser spot detection and tracking system. Practical tests show that the system can achieve a spot detection accuracy of around 90% under different luminous intensities, indicating excellent robustness of the designed algorithm. Besides, with the use of a piezoelectric actuator, speedy and precise tracking of the laser spot is implemented. The characteristics of speedy response, self-latching in power off, and no electromagnetic interference of the piezoelectric actuator give the system tremendous advantages in developing high-precision wireless communication control technology, which further broadens the application of the proposed system. [ABSTRACT FROM AUTHOR]

The local inertial two-dimensional (2D) flow model on LISFLOOD-FP, the so-called ACCeleration (ACC) uniform grid solver, has been widely used to support fast, computationally efficient fluvial/pluvial flood simulations. This paper describes new releases, on LISFLOOD-FP 8.1, for parallelised flood simulations on the graphical processing units (GPUs) to boost efficiency of the existing parallelised ACC solver on the central processing units (CPUs) and enhance it further by enabling a new non-uniform grid version. The non-uniform solver generates its grid using the multiresolution analysis (MRA) of the multiwavelets (MWs) to a Galerkin polynomial projection of the digital elevation model (DEM). This sensibly coarsens the resolutions where the local topographic details are below an error threshold ε and allows classes of land use to be properly adapted. Both the grid generator and the adapted ACC solver on the non-uniform grid are implemented in a GPU new codebase, using the indexing of Z -order curves alongside a parallel tree traversal approach. The efficiency performance of the GPU parallelised uniform and non-uniform grid solvers is assessed for five case studies, where the accuracy of the latter is explored for ε=10-4 and 10 -3 in terms of how close it can reproduce the prediction of the former. On the GPU, the uniform ACC solver is found to be 2–28 times faster than the CPU predecessor with increased number of elements on the grid, and the non-uniform solver can further increase the speed up to 320 times with increased reduction in the grid's elements and decreased variability in the resolution. LISFLOOD-FP 8.1, therefore, allows faster flood inundation modelling to be performed at both urban and catchment scales. It is openly available under the GPL v3 license, with additional documentation at https://www.seamlesswave.com/LISFLOOD8.0 (last access: 12 March 2023). [ABSTRACT FROM AUTHOR]

The precise geo-positioning of high-resolution satellite imagery (HRSI) without ground control points (GCPs) is an important and fundamental step in global mapping, three-dimensional modeling, and so on. In this paper, to improve the efficiency of large-scale bundle adjustment (BA), we propose a combined Preconditioned Conjugate Gradient (PCG) and Graphic Processing Unit (GPU) parallel computing approach for the BA of large-scale HRSI without GCPs. The proposed approach consists of three main components: 1) construction of a BA model without GCPs; 2) reduction of memory consumption using the Compressed Sparse Row sparse matrix format; and 3) improvement of the computational efficiency by the use of the combined PCG and GPU parallel computing method. The experimental results showed that the proposed method: 1) consumes less memory consumption compared to the conventional full matrix format method; 2) demonstrates higher computational efficiency than the single-core, Ceressolver and multi-core central processing unit computing methods, with 9.48, 6.82, and 3.05 times faster than the above three methods, respectively; 3) obtains comparable BA accuracy with the above three methods, with image residuals of about 0.9 pixels; and 4) is superior to the parallel bundle adjustment method in the reprojection error [ABSTRACT FROM AUTHOR]

The need for increased application performance in high-integrity systems such as those in avionics is on the rise as software continues to implement more complex functionalities. The prevalent computing solution for future high-integrity embedded products is multi-processor systems-on-chip (MPSoC) processors. MPSoCs include central processing unit (CPU) multicores that enable improving performance via thread-level parallelism. MPSoCs also include generic accelerators (graphics processing units [GPUs]) and application-specific accelerators. However, the data processing approach (DPA) required to exploit each of these underlying parallel hardware blocks carries several open challenges to enable the safe deployment in high-integrity domains. The main challenges include the qualification of its associated runtime system and the difficulties in analyzing programs deploying the DPA with out-of-the-box timing analysis and code coverage tools. In this work, we perform a thorough analysis of vector extensions (VExts) in current commercial off-the-shelf (COTS) processors for high-integrity systems. We show that VExts prevent many of the challenges arising with parallel programming models and GPUs. Unlike other DPAs, VExts require no runtime support, prevent design race conditions that might arise with parallel programming models, and have minimum impact on the software ecosystem, enabling the use of existing code coverage and timing analysis tools. We develop vectorized versions of neural network kernels and show that the NVIDIA Xavier VExts provide a reasonable increase in guaranteed application performance of up to 2.7x. Our analysis contends that VExts are the DPA approach with arguably the fastest path for adoption in high-integrity systems. [ABSTRACT FROM AUTHOR]

The range migration algorithm (RMA) based on Fourier transformation is widely applied in millimeter-wave (MMW) close-range imaging because of its few operations and small approximation. However, its interpolation stage is not effective due to the involved intensive logic controls, which limits the speed performance in a graphics processing unit (GPU) platform. Therefore, in this paper, we present an acceleration optimization method based on the hybrid GPU and central processing unit (CPU) parallel computation for implementing the RMA. The proposed method exploits the strong logic-control capability of the CPU to assist the GPU in processing the logic controls of the interpolation stage. The common positions of wavenumber-domain components to be interpolated are calculated by the CPU and stored in the constant memory for broadcast at any time. This avoids the repetitive computation consumed in a GPU-only scheme. Then the GPU is responsible for the remaining matrix-related steps and outputs the needed wavenumber-domain values. The imaging experiments verify the acceleration efficiency of the proposed method and demonstrate that the speedup ratio of our proposed method is more than 15 times of that by the CPU-only method, and more than 2 times of that by the GPU-only method. [ABSTRACT FROM AUTHOR]

Graphics processing units (GPUs) have become the target for high-speed and high-throughput computing in the last decade. The device provides excellent capabilities in speeding general-purpose computing in many applications. The main advantage of GPUs is the ability to process heavy parallel requests depending on thousands of parallel processing cores operating concurrently on solving numerical calculations. In this paper, the role of the GPUs in speeding up the encryption process is studied extensively. Advanced Encryption Standard (AES) algorithm is used to encrypt files in both Central Processing Units (CPUs) and GPUs. The encryption process consists of several sub-processes of which each is evaluated by both types of processors. Two different systems models were used in testing operations. Results showed that low-size encryption processes are not affected by the acceleration process and do not require GPU processing. On the other hand, large file size encryption relies heavily on the acceleration process resulting in less processing time. The analysis also showed that the acceleration speed remains constant after reaching the maximum load value. [ABSTRACT FROM AUTHOR]

Artificial neural networks (ANNs) have experienced a rapid advancement for their success in various application domains, including autonomous driving and drone vision. Researchers have been improving the performance efficiency and computational requirement of ANNs inspired by the mechanisms of the biological brain. Spiking neural networks (SNNs) provide a power-efficient and brain-inspired computing paradigm for machine learning applications. However, evaluating large-scale SNNs on classical von Neumann architectures (central processing units/graphics processing units) demands a high amount of power and time. Therefore, hardware designers have developed neuromorphic platforms to execute SNNs in and approach that combines fast processing and low power consumption. Recently, field-programmable gate arrays (FPGAs) have been considered promising candidates for implementing neuromorphic solutions due to their varied advantages, such as higher flexibility, shorter design, and excellent stability. This review aims to describe recent advances in SNNs and the neuromorphic hardware platforms (digital, analog, hybrid, and FPGA based) suitable for their implementation. We present that biological background of SNN learning, such as neuron models and information encoding techniques, followed by a categorization of SNN training. In addition, we describe state-of-the-art SNN simulators. Furthermore, we review and present FPGA-based hardware implementation of SNNs. Finally, we discuss some future directions for research in this field. [ABSTRACT FROM AUTHOR]

Deep learning-based object detection technology can efficiently infer results by utilizing graphics processing units (GPU). However, when using general deep learning frameworks in embedded systems and mobile devices, processing functionality is limited. This allows deep learning frameworks such as TensorFlow-Lite (TF-Lite) and TensorRT (TRT) to be optimized for different hardware. Therefore, this paper introduces a performance inference method that fuses the Jetson monitoring tool with TensorFlow and TRT source code on the Nvidia Jetson AGX Xavier platform. In addition, central processing unit (CPU) utilization, GPU utilization, object accuracy, latency, and power consumption of the deep learning framework were compared and analyzed. The model is You Look Only Once Version4 (YOLOv4), and the dataset uses Common Objects in Context (COCO) and PASCAL Visual Object Classes (VOC). We confirmed that using TensorFlow results in high latency. We also confirmed that TensorFlow-TensorRT (TF-TRT) and TRT using Tensor Cores provide the most efficiency. However, it was confirmed that TF-Lite showed the lowest performance because it utilizes a GPU limited to mobile devices. Through this paper, we think that when developing deep learning-related object detection technology on the Nvidia Jetson platform or desktop environment, services and research can be efficiently conducted through measurement results. [ABSTRACT FROM AUTHOR]

A vast amount of ice crystal imagery exists from a variety of field campaign initiatives that can be utilized for cloud microphysical research. Here, nine convolutional neural networks are used to classify particles into nine regimes on over 10 million images from the Cloud Particle Imager probe, including liquid and frozen states and particles with evidence of riming. A transfer learning approach proves that the Visual Geometry Group (VGG-16) network best classifies imagery with respect to multiple performance metrics. Classification accuracies on a validation dataset reach 97% and surpass traditional automated classification. Furthermore, after initial model training and preprocessing, 10 000 images can be classified in approximately 35 s using 20 central processing unit cores and two graphics processing units, which reaches real-time classification capabilities. Statistical analysis of the classified images indicates that a large portion (57%) of the dataset is unusable, meaning the images are too blurry or represent indistinguishable small fragments. In addition, 19% of the dataset is classified as liquid drops. After removal of fragments, blurry images, and cloud drops, 38% of the remaining ice particles are largely intersecting the image border ($10% cutoff) and therefore are considered unusable because of the inability to properly classify and dimensionalize. After this filtering, an unprecedented database of 1 560 364 images across all campaigns is available for parameter extraction and bulk statistics on specific particle types in a wide variety of storm systems, which can act to improve the current state of microphysical parameterizations. [ABSTRACT FROM AUTHOR]

In the field of communication, autoencoder (AE) refers to a system that replaces parts of the traditional transmitter and receiver with artificial neural networks (ANNs). To meet the system performance requirements, it is necessary for the AE to adapt to the changing wireless-channel conditions at runtime. Thus, online fine-tuning in the form of ANN-retraining is of great importance. Many algorithms on the ANN layer are developed to improve the AE's performance at the communication layer. Yet, the link of the system performance and the ANN topology to the hardware layer is not fully explored. In this paper, we analyze the relations between the design layers and present a hardware implementation of an AE-based demapper that enables fine-tuning to adapt to varying channel conditions. As a platform, we selected field-programmable gate arrays (FPGAs) which provide high flexibility and allow to satisfy the low-power and low-latency requirements of embedded communication systems. Furthermore, our cross-layer approach leverages the flexibility of FPGAs to dynamically adapt the degree of parallelism (DOP) to satisfy the system-level requirements and to ensure environmental adaptation. Our solution achieves 2000× higher throughput than a high-performance graphics processor unit (GPU), draws 5× less power than an embedded central processing unit (CPU) and is 5800× more energy efficient compared to an embedded GPU for small batch size. To the best of our knowledge, such a cross-layer design approach combined with FPGA implementation is unprecedented. [ABSTRACT FROM AUTHOR]

This paper presents a computer architecture developed for the instrument control unit (ICU) of the Spectrometer Infrared 2 (SIR-2) instrument onboard the Chandrayaan-1 mission to the Moon. Characteristic features of this architecture are its high autonomy, its high reliability, and its high performance, which are obtained by the following methods: 1) adopting state-of-the-art digital-construction techniques using one single radiation-tolerant field-programmable gate array for implementing an embedded system with a 32-bit central processing unit, commercial intellectual-property cores, and custom-specified logic; 2) implementing two independent communication buses, one for instrument commanding and instrument health monitoring and another one for transferring scientific and housekeeping data to the spacecraft; 3) implementing simple and well-arranged hardware, firmware, and software; and 4) implementing in-flight software-reconfiguration capabilities available from ground command. The SIR-2 ICU performs data acquisition, data processing, and temperature regulation. Per-spectrum averaging and per-pixel oversampling are supported to reduce measurement noise. A temperature regulator for the instrument sensor unit is also implemented, with the purpose of reducing dark current noise from the detector. The embedded real-time software is implemented as a multirate cyclic executive with interrupts. Five different tasks are maintained, running with a 10-ms base cycle time. A safe mode is implemented in the boot-loader, allowing in-flight software patching through the MIL-STD-1553B bus. The advanced features of this architecture make it an excellent choice for the control unit of the scientific SIR-2 instrument, compared with architectures from previous heritage. [ABSTRACT FROM AUTHOR]

This work aims to provide details on the latest technological developments regarding LiDAR (Light Imaging Detection And Ranging) systems, with particular reference to the techniques, architectures, and methodologies partially or entirely implemented by means of the FPGA (Field Programmable Gate Array) environment. Currently, LiDAR technology is considered of great interest as it is widely employed in a variety of application fields, such as automotive, seismology, archaeology, metrology, and military. For this reason, the required performances are gradually increasing, which leads to complex and stringent solutions. The growth in LiDAR systems' complexity suggests the use of high-end general-purpose computing units such as central processing units to perform very complex tasks and FPGAs to perform multiple tasks in real-time through the implementation of dedicated computational blocks. The latter, in recent architectures, are therefore used for the execution of specific tasks that require high computational speed and system flexibility. This paper reports some case studies recently applied in the LiDAR field, with the aim of illustrating the role of FPGA technology and its benefits. [ABSTRACT FROM AUTHOR]

LISFLOOD-FP 8.0 includes second-order discontinuous Galerkin (DG2) and first-order finite-volume (FV1) solvers of the two-dimensional shallow-water equations for modelling a wide range of flows, including rapidly propagating, supercritical flows, shock waves or flows over very smooth surfaces. The solvers are parallelised on multi-core CPU and Nvidia GPU architectures and run existing LISFLOOD-FP modelling scenarios without modification. These new, fully two-dimensional solvers are available alongside the existing local inertia solver (called ACC), which is optimised for multi-core CPUs and integrates with the LISFLOOD-FP sub-grid channel model. The predictive capabilities and computational scalability of the new DG2 and FV1 solvers are studied for two Environment Agency benchmark tests and a real-world fluvial flood simulation driven by rainfall across a 2500 km2 catchment. DG2's second-order-accurate, piecewise-planar representation of topography and flow variables enables predictions on coarse grids that are competitive with FV1 and ACC predictions on 2–4 times finer grids, particularly where river channels are wider than half the grid spacing. Despite the simplified formulation of the local inertia solver, ACC is shown to be spatially second-order-accurate and yields predictions that are close to DG2. The DG2-CPU and FV1-CPU solvers achieve near-optimal scalability up to 16 CPU cores and achieve greater efficiency on grids with fewer than 0.1 million elements. The DG2-GPU and FV1-GPU solvers are most efficient on grids with more than 1 million elements, where the GPU solvers are 2.5–4 times faster than the corresponding 16-core CPU solvers. LISFLOOD-FP 8.0 therefore marks a new step towards operational DG2 flood inundation modelling at the catchment scale. LISFLOOD-FP 8.0 is freely available under the GPL v3 license, with additional documentation and case studies at https://www.seamlesswave.com/LISFLOOD8.0 (last access: 2 June 2021). [ABSTRACT FROM AUTHOR]

Cell-free (CF) massive Multiple-Input Multiple-Output (MIMO) with large number of distributed access points (APs) has emerged as a new paradigm allowing higher macro diversity for randomly distributed users. However, the fronthaul traffic bandwidth between central processing unit and the APs can explode in particular in the uplink, requiring expensive star-topology with point-to-point fronthaul links. To achieve a scalable CF massive MIMO architecture and a cost-effective fronthauling solution, we consider, in this paper, a point-to-multipoint fronthaul topology where (a subset of) the APs share a serial fronthaul link offering a per-user limited fronthaul bandwidth. We develop a novel unified optimization framework for iterative power control and AP scheduling that provides a systematic user-centric solution towards scalable uplink CF massive MIMO. Experimental results show that power control is not sufficient to guarantee the best objective and, therefore, the appropriate association of the users to the APs is required to improve the overall system signal-to-noise ratio. Under the stringent fronthaul bandwidth, the proposed joint optimization framework results in i) significant 5% outage data rate increase ii) near uniform distribution of the served users per APs and, hence, an increased diversity and iii) fast convergence of the algorithm within a few iterations. [ABSTRACT FROM AUTHOR]

Cloud computing is to provide a on demand IT resources/services like server, storage, database, networking, analytics, software etc. over internet. It provide a diversity of distributed computing system, and it has a group of virtualized and inter-connected systems based on provider-stage agreements between the consumers and service providers. Here, a computer architecture and algorithms were developed for cloud platform via the dynamic provisioned of virtual systems to perform and support soft and real -time task scheduling. The architecture integrated soft real-time task scheduling algorithms, namely master node and virtual machine node schedules. In addition Adaptive Adaptive Scoring Job scheduling algorithm is also applied. The motive of cloud computing is to tie together the power of both distributed computing and parallel computing as well as aggregate idle resources on the Internet such as Central Processing Unit (CPU) cycles and storage spaces for better consumption. Cloud computing, which connects a commodity hardware with high speed networks, that can meet the same computing power as a supercomputer does, with a lower cost. However, cloud is a heterogeneous system. Independent tasks scheduling in cloud is more complicated. To make use of the power of cloud entirely, we require an well-organized job scheduling algorithm to allocate jobs to resources in a cloud. This project proposes an Adaptive Scoring Job scheduling algorithm (ASJS) for the cloud environment. Compared to other algorithms, it can reduce the time of job completion, which may compose of computing-intensive jobs and data-intensive jobs. Python 3.6 is used as the front end language to develop the application. [ABSTRACT FROM AUTHOR]

The third-generation meteorological satellites equipped with highly-improved imagers provide a huge amount of Earth observation data. Himawari-8 is the first unit of the Japan Meteorological Agency's third generation of geostationary satellites. After its starting operation in 2015, there are several websites that provide remotely sensed images in real time. However, it is hard to develop a real-time and full-resolution website, due to the large amount of data to be handled. Himawari-8 real-time web is only one website that provides full-resolution remotely sensed images in real time. To reduce network traffic and increase the access speed of it from other countries out of Japan, mirror websites of each country are needed. In this paper, we propose a cost-effective mirroring system for the Himawari-8 real-time web. A mirroring model is introduced to avoid the problem of big data processing in the mirror websites. We adopt a file copy tool based on high-performance and flexible protocol (HpFP) to transfer meteorological satellite data from the Himawari-8 real-time web to the mirror websites. Our first target is Thailand, one of the most disaster-prone countries in South-East Asia. The mirror website is set up at an institution in Thailand connected via collaborative international networks, e.g., Japan Gigabit Network (JGN) and Asia Pacific Advanced Network (APAN). The results show that the proposed mirroring system is able to overcome the big data issue by reducing the central processing unit (CPU) usage in the mirror website and transferring remotely sensed image files at high speed over international networks even under packet loss conditions. This suggests that our mirroring system has a potential for deployment in other Asian and Oceanian countries. [ABSTRACT FROM AUTHOR]

Rapid data processing is crucial for distributed optical fiber vibration sensing systems based on a phase-sensitive optical time domain reflectometer (Φ-OTDR) due to the huge amount of continuously refreshed sensing data. The vibration sensing principle is analyzed to study the data flow of Rayleigh backscattered light among the different processing units. A field-programmable gate array (FPGA) is first chosen to synchronously implement pulse modulation, data acquisition and transmission in parallel. Due to the parallelism characteristics of numerous independent algorithm kernels, graphics processing units (GPU) can be used to execute the same computation instruction by the allocation of multiple threads. As a conventional data processing method for the sensing system, a differential accumulation algorithm using co-processing parallel computation is verified with a time of 1.6 μs spent of the GPU, which is 21,250 times faster than a central processing unit (CPU) for a 2020 m length of optical fiber. Moreover, the cooperation processes of the CPU and GPU are realized for the spectrum analysis, which could shorten substantially the time of fast Fourier transform analysis processing. The combination of FPGA, CPU and GPU can largely enhance the capacity of data acquisition and processing, and improve the real-time performance of distributed optical fiber vibration sensing systems. [ABSTRACT FROM AUTHOR]