Search

In power systems, the application of wind power generation equipment and power electronic devices leads to an increased frequency of broadband oscillation events, and the detection of oscillation information becomes extremely difficult, due to the limitations of communication bandwidth and the sampling theorem. To ensure the safety and stability of a power system, this paper presents a new recognition method of broadband oscillation information, which combines compressed sensing (CS) technology and an ensemble empirical mode decomposition (EEMD) algorithm to solve the problem of wideband oscillation recognition. Firstly, the broadband oscillation signal data collected by the phasor measuring unit (PMU) is compressed and sampled by a Gaussian random matrix in the substation, then the low-dimensional data obtained is uploaded to the main station. Secondly, in the main station, the subspace pursuit (SP) algorithm is used to reconstruct the low-dimensional signal; the broadband oscillation signal is recovered without losing the main features of the signal. Finally, we use the EEMD algorithm to decompose the reconstructed signal; the intrinsic mode function (IMF) components containing wideband oscillation information are screened by the energy coefficient, and the wideband oscillation information is identified. [ABSTRACT FROM AUTHOR]

The sampling theorem for the offset linear canonical transform (OLCT) of bandlimited functions in polar coordinates is an important signal analysis tool in many fields of signal processing and optics. This paper investigates two sampling theorems for interpolating bandlimited and highest frequency bandlimited functions in the OLCT and offset linear canonical Hankel transform (OLCHT) domains by polar coordinates. Based on the classical Stark's interpolation formulas, we derive the sampling theorems for bandlimited functions in the OLCT and OLCHT domains, respectively. The first interpolation formula is concise and applicable. Due to the consistency of the OLCHT order, the second interpolation formula is superior to the first interpolation formula in computational complexity. [ABSTRACT FROM AUTHOR]

In this study, we defined a kind of Fourier expansion of set-valued square-integrable functions. In fact, we have seen that the classical Fourier basis also constitutes a basis for the Hilbert quasilinear space L 2 (− π , π , Ω (C)) of Ω (C) -valued square-integrable functions, where Ω (C) is the class of all compact subsets of complex numbers. Furthermore, we defined the quasi-Paley–Wiener space, Q P W , using the Fourier transform defined for set-valued functions and thus we showed that the sequence s i n c. − k k ∈ Z form also a basis for Q P W . We call this result Shannon's sampling theorem for set-valued functions. Finally, we gave an application based on this theorem. [ABSTRACT FROM AUTHOR]

For time division multiplexing multiple input multiple output (TDM MIMO) millimeter wave radar, the measurement of target range, velocity and other parameters depends on the phase of the received Intermediate Frequency (IF) signal. The coupling between range and velocity phases occurs when measuring moving targets, leading to inevitable errors in calculating range and velocity from the phase, which in turn affects measurement accuracy. Traditional two-dimensional fast fourier transform (2D FFT) estimation errors are particularly pronounced at high velocity, significantly impacting measurement accuracy. Additionally, due to limitations imposed by the Nyquist sampling theorem, there is a restricted range for velocity measurements that can result in aliasing. In this study, we propose a method to address the coupling of range and velocity based on the original signal as well as a method for velocity compensation to resolve aliasing issues. Our research findings demonstrate that this approach effectively reduces errors in measuring ranges and velocities of high-velocity moving targets while efficiently de-aliasing velocities. [ABSTRACT FROM AUTHOR]

As one of the most widely used spread spectrum techniques, the frequency-hopping spread spectrum (FHSS) has been widely adopted in both civilian and military secure communications. In this technique, the carrier frequency of the signal hops pseudo-randomly over a large range, compared to the baseband. To capture an FHSS signal, conventional non-cooperative receivers without knowledge of the carrier have to operate at a high sampling rate covering the entire FHSS hopping range, according to the Nyquist sampling theorem. In this paper, we propose an adaptive compressed method for joint carrier and direction of arrival (DOA) estimations of FHSS signals, enabling subsequent non-cooperative processing. The compressed measurement kernels (i.e., non-zero entries in the sensing matrix) have been adaptively designed based on the posterior knowledge of the signal and task-specific information optimization. Moreover, a deep neural network has been designed to ensure the efficiency of the measurement kernel design process. Finally, the signal carrier and DOA are estimated based on the measurement data. Through simulations, the performance of the adaptively designed measurement kernels is proved to be improved over the random measurement kernels. In addition, the proposed method is shown to outperform the compressed methods in the literature. [ABSTRACT FROM AUTHOR]

Photoacoustic imaging (PAI) is a rapidly developing emerging non-invasive biomedical imaging technique that combines the strong contrast from optical absorption imaging and the high resolution from acoustic imaging. Abnormal biological tissues (such as tumors and inflammation) generate different levels of thermal expansion after absorbing optical energy, producing distinct acoustic signals from normal tissues. This technique can detect small tissue lesions in biological tissues and has demonstrated significant potential for applications in tumor research, melanoma detection, and cardiovascular disease diagnosis. During the process of collecting photoacoustic signals in a PAI system, various factors can influence the signals, such as absorption, scattering, and attenuation in biological tissues. A single ultrasound transducer cannot provide sufficient information to reconstruct high-precision photoacoustic images. To obtain more accurate and clear image reconstruction results, PAI systems typically use a large number of ultrasound transducers to collect multi-channel signals from different angles and positions, thereby acquiring more information about the photoacoustic signals. Therefore, to reconstruct high-quality photoacoustic images, PAI systems require a significant number of measurement signals, which can result in substantial hardware and time costs. Compressed sensing is an algorithm that breaks through the Nyquist sampling theorem and can reconstruct the original signal with a small number of measurement signals. PAI based on compressed sensing has made breakthroughs over the past decade, enabling the reconstruction of low artifacts and high-quality images with a small number of photoacoustic measurement signals, improving time efficiency, and reducing hardware costs. This article provides a detailed introduction to PAI based on compressed sensing, such as the physical transmission model-based compressed sensing method, two-stage reconstruction-based compressed sensing method, and single-pixel camera-based compressed sensing method. Challenges and future perspectives of compressed sensing-based PAI are also discussed. [ABSTRACT FROM AUTHOR]

High-pixel-number synchrotron radiation computed tomography (CT) has the advantages of high sensitivity, high resolution, and a large field of view. It has been widely used in biomedicine, cultural heritage research, non-destructive testing, and other fields. The Nyquist sampling theorem states that when the detector's pixels per row are increased, it requires more CT projections, resulting in a lengthened CT scan time and increased radiation damage. Sparse-view CT can significantly reduce radiation damage and improve the projection data acquisition speed. However, there is insufficient sparse projection data, and the slices reconstructed show aliasing artifacts. Currently, aliasing artifact correction processes more medical CT images, and the number of pixels of such images is small (mainly 512 × 512 pixels). This paper presents an aliasing artifact correction algorithm based on deep learning for synchrotron radiation CT with a high pixel number ( 1728 × 1728 pixels). This method crops high-pixel-number CT images with aliasing artifacts into patches with overlapping features. During the network training process, a convolutional neural network is utilized to enhance the details of the patches, after which the patches are reintegrated into a new CT slice. Subsequently, the network parameters are updated to optimize the new CT slice that closely approximates the full-view slice. To align with practical application requirements, the neural network is trained using only three samples to optimize network parameters and applied successfully to untrained samples for aliasing artifact correction. Comparative analysis with typical deep learning aliasing artifact correction algorithms demonstrates the superior ability of our method to correct aliasing artifacts while preserving image details more effectively. Furthermore, the effect of aliasing artifact correction at varying levels of projection sparsity is investigated, revealing a positive correlation between image quality after deep learning processing and the number of projections. However, the trade-off between rapid experimentation and artifact correction remains a critical consideration. [ABSTRACT FROM AUTHOR]

A novel compressive sensing (CS) synthetic-aperture radar (SAR) called AgileSAR has been proposed to increase swath width for sparse scenes while preserving azimuthal resolution. AgileSAR overcomes the limitation of the Nyquist sampling theorem so that it has a small amount of data and low system complexity. However, traditional CS optimization-based algorithms suffer from manual tuning and pre-definition of optimization parameters, and they generally involve high time and computational complexity for AgileSAR imaging. To address these issues, a pseudo- L 0 -norm fast iterative shrinkage algorithm network (pseudo- L 0 -norm FISTA-net) is proposed for AgileSAR imaging via the deep unfolding network in this paper. Firstly, a pseudo- L 0 -norm regularization model is built by taking an approximately fair penalization rule based on Bayesian estimation. Then, we unfold the operation process of FISTA into a data-driven deep network to solve the pseudo- L 0 -norm regularization model. The network's parameters are automatically learned, and the learned network significantly increases imaging speed, so that it can improve the accuracy and efficiency of AgileSAR imaging. In addition, the nonlinearly sparsifying transform can learn more target details than the traditional sparsifying transform. Finally, the simulated and data experiments demonstrate the superiority and efficiency of the pseudo- L 0 -norm FISTA-net for AgileSAR imaging. [ABSTRACT FROM AUTHOR]

Pulse Wave Velocity (PWV) analysis is valuable for assessing arterial stiffness and cardiovascular health and potentially for estimating blood pressure cufflessly. However, conventional PWV analysis from two transducers spaced closely poses challenges in data management, battery life, and developing the device for continuous real-time applications together along an artery, which typically need data to be recorded at high sampling rates. Specifically, although a pulse signal consists of low-frequency components when used for applications such as determining heart rate, the pulse transit time for transducers near each other along an artery takes place in the millisecond range, typically needing a high sampling rate. To overcome this issue, in this study, we present a novel approach that leverages the Nyquist–Shannon sampling theorem and reconstruction techniques for signals produced by bioimpedance transducers closely spaced along a radial artery. Specifically, we recorded bioimpedance artery pulse signals at a low sampling rate, reducing the data size and subsequently algorithmically reconstructing these signals at a higher sampling rate. We were able to retain vital transit time information and achieved enhanced precision that is comparable to the traditional high-rate sampling method. Our research demonstrates the viability of the algorithmic method for enabling PWV analysis from low-sampling-rate data, overcoming the constraints of conventional approaches. This technique has the potential to contribute to the development of cardiovascular health monitoring and diagnosis using closely spaced wearable devices for real-time and low-resource PWV assessment, enhancing patient care and cardiovascular disease management. [ABSTRACT FROM AUTHOR]

An effective near-field to far-field transformation using a reduced number of near-field measurements collected via a spherical scan over the upper hemisphere, due to the presence of a flat metallic ground, is devised in this paper. Such a transformation relies on the non-redundant sampling representations of electromagnetic fields and exploits the image principle to properly account for the metallic ground, supposed to be of infinite extent and realised by perfectly conducting material. The sampling representation of the probe voltage over the upper hemisphere is developed by modelling the antenna under test and its image by a very adaptable convex surface, which is able to fit as much as possible the geometry of any kind of antenna, thus minimising the volumetric redundancy and, accordingly, the number of required samples as well as the measurement time. Then, the use of a two-dimensional optimal sampling interpolation algorithm allows the reconstruction of the voltage value at each sampling point of the spherical grid required by the classical near-field-to-far-field transformation developed by Hansen. Numerical examples proving the effectiveness of the developed sampling representation and related near-field-to-far-field transformation techniques are reported. [ABSTRACT FROM AUTHOR]

The existing ultrasonic thickness measurement systems require high sampling frequencies for echo signal acquisition, leading to complex circuit designs and high costs. Moreover, extracting the characteristics of ultrasonic echo signals for accurate thickness measurement poses significant challenges. To address these issues, this paper proposes a method that utilizes conventional sampling frequencies to acquire high-frequency ultrasonic echo signals, overcoming the limitations of high-frequency data acquisition imposed by the Nyquist–Shannon sampling theorem. By employing an improved sampling reconstruction technique, the multi-cycle sampling signals are reconstructed and rearranged within a single cycle, effectively increasing the equivalent sampling frequency. Additionally, a combination of coarse estimation using fast Fourier transform (FFT) and precise phase extraction using the moving sine fitting algorithm is proposed for accurate thickness measurement, resolving the limitations of common thickness measurement methods such as peak detection, envelope detection, and Hilbert autocorrelation in terms of low measurement accuracy. Experimental results obtained from thickness measurements on 45 steel ultrasonic test blocks within the range of 3 mm to 20 mm indicate a measurement error of ±0.01 mm, while for thicknesses ranging from 1 mm to 50 mm, the measurement error is ±0.05 mm. [ABSTRACT FROM AUTHOR]

Compressive sensing and arbitrary sampling are techniques of data volume reduction challenging the Shannon sampling theorem and expected to provide efficient storage while preserving original information. Irregularity of sampling is either a result of intentional optimization of a sampling grid or stems from sporadic occurrence or intermittent observability of a phenomenon. Quantitative comparison of irregular patterns similarity is usually preceded by a projection to a regular sampling space. In this paper, we study methods for direct comparison of time series in their original non-uniform grids. We also propose a linear graph to be a representation of the non-uniform signal and apply the Mutual Graph Approximation (MGA) method as a metric to infer the degree of similarity of the considered patterns. The MGA was implemented together with four state-of-the-art methods and tested with example speech signals and electrocardiograms projected to bandwidth-related and random sampling grids. Our results show that the performance of the proposed MGA method is comparable to most accurate (correlation of 0.964 vs. Frechet: 0.962 and Kleinberg: 0.934 for speech signals) and to less computationally expensive state-of-the-art distance metrics (both MGA and Hausdorf: O (L 1 + L 2) ). Moreover, direct comparison of non-uniform signals can be equivalent to cross-correlation of resampled signals (correlation of 0.964 vs. resampled: 0.960 for speech signals, and 0.956 vs. 0.966 for electrocardiograms) in applications as signal classification in both accuracy and computational complexity. Finally, the bandwidth-based resampling model plays a substantial role; usage of random grid is the primary cause of inaccuracy (correlation of 0.960 vs. for random sampling grid: 0.900 for speech signals, and 0.966 vs. 0.878, respectively, for electrocardiograms). These figures indicate that the proposed MGA method can be used as a simple yet effective tool for scoring similarity of signals directly in non-uniform sampling grids. [ABSTRACT FROM AUTHOR]

The multi-resolution analysis (MRA) associated with quadratic phase Fourier transform (QPFT) serves as a tool to construct orthogonal bases of the L 2 (R) . Consequently, it assumes a pivotal role in facilitating potential applications of QPFT. Inspired by the sampling theorem applicable to band-limited signals in the QPFT domain, this paper formulates the development of the MRA linked with QPFT. Subsequently, we develop a method for constructing orthogonal bases for L 2 (R) , followed by some examples. [ABSTRACT FROM AUTHOR]

Spectrum aliasing occurs in signal echoes when the sampling frequency does not comply with the Nyquist Sampling Theorem. In this scenario, the extraction of micro-motion parameters becomes challenging. This paper proposes a spectral de-aliasing method for micro-motion signals based on a complex-valued U-Net network. Zero interpolation is employed to insert zeros into the echo, effectively increasing the sampling frequency. After zero interpolation, the micro-motion signal contains both real micro-motion signal frequency components and new frequency components. Short-Time Fourier Transform (STFT) is then applied to transform the zero-interpolated echo from the time domain to the time–frequency domain. Furthermore, a complex-valued U-Net training model is utilized to eliminate redundant frequency components generated by zero interpolation, thereby achieving the frequency reconstruction of micro-motion signal echoes. Finally, the training models are employed to process the measured data. The theoretical analysis, simulations, and experimental results demonstrate that this method is robust and feasible, and is capable of addressing the problem of micro-motion signal echo spectrum aliasing in narrowband radar. [ABSTRACT FROM AUTHOR]

This paper examines various aspects related to digital signal processing in digital control circuits used in power electronics. The discussion focuses on several common issues, including the sampling rate of signals (including phenomena such as aliasing and synchronization), coherent sampling, jitter of sampling pulses, sequential versus simultaneous sampling in multichannel systems, signal resolution (including signal-to-noise ratio, noise-shaping circuits, and changes in sampling speed), interpolation and decimation, and the conversion of analog circuits into digital form. One of the key contributions of this paper is the introduction of a new formula for calculating the resultant signal-to-noise ratio for three-stage digital control circuits. By carefully considering and correcting for sources of error, it is possible to increase the signal-to-noise ratio and minimize distortion components. This, in turn, leads to improved output/input current and voltage parameters, which can have a positive impact on the overall quality of energy processing in power electronic circuits. [ABSTRACT FROM AUTHOR]

Single-pixel imaging (SPI) uses a single-pixel detector instead of a detector array with a lot of pixels in traditional imaging techniques to realize two-dimensional or even multi-dimensional imaging. For SPI using compressed sensing, the target to be imaged is illuminated by a series of patterns with spatial resolution, and then the reflected or transmitted intensity is compressively sampled by the single-pixel detector to reconstruct the target image while breaking the limitation of the Nyquist sampling theorem. Recently, in the area of signal processing using compressed sensing, many measurement matrices as well as reconstruction algorithms have been proposed. It is necessary to explore the application of these methods in SPI. Therefore, this paper reviews the concept of compressive sensing SPI and summarizes the main measurement matrices and reconstruction algorithms in compressive sensing. Further, the performance of their applications in SPI through simulations and experiments is explored in detail, and then their advantages and disadvantages are summarized. Finally, the prospect of compressive sensing with SPI is discussed. [ABSTRACT FROM AUTHOR]

X-ray tomography is often affected by noise and artifacts during the reconstruction process, such as detector offset, calibration errors, metal artifacts, etc. Conventional algorithms, including FDK and SART, are unable to satisfy the sampling theorem requirements for 3D reconstruction under sparse-view constraints, exacerbating the impact of noise and artifacts. This paper proposes a novel 3D reconstruction algorithm tailored to sparse-view cone-beam computed tomography (CBCT). Drawing upon compressed sensing theory, we incorporate the weighted Schatten p-norm minimization (WSNM) algorithm for 2D image denoising and the adaptive steepest descent projection onto convex sets (ASD-POCS) algorithm, which employs a total variation (TV) regularization term. These inclusions serve to reduce noise and ameliorate artifacts. Our proposed algorithm extends the WSNM approach into three-dimensional space and integrates the ASD-POCS algorithm, enabling 3D reconstruction with digital brain phantoms, clinical medical data, and real projections from our portable CBCT system. The performance of our algorithm surpasses traditional methods when evaluated using root mean square error (RMSE), peak signal-to-noise ratio (PSNR), and structural similarity index measure (SSIM) metrics. Furthermore, our approach demonstrates marked enhancements in artifact reduction and noise suppression. [ABSTRACT FROM AUTHOR]

The recovery of bandlimited signals with high dynamic range is a hot issue in sampling research. The unlimited sampling theory expands the recordable range of traditional analog-to-digital converters (ADCs) arbitrarily, and the signal is folded back into a low dynamic range measurement, avoiding the saturation problem. Since the non-bandlimited signal in the Fourier domain cannot be directly applied to its existing theory, the non-bandlimited signal in the Fourier domain may be bandlimited in the fractional Fourier domain. Therefore, this brief report studies the unlimited sampling problem of high dynamic non-bandlimited signals in the Fourier domain based on the fractional Fourier transform. Firstly, a mathematical signal model for unlimited sampling is proposed. Secondly, based on this mathematical model, the annihilation filtering method is used to estimate the arbitrary folding time. Finally, a novel fractional Fourier domain unlimited sampling theorem is obtained. The theory proves that, based on the folding characteristics of the self-reset ADC, the number of samples is not affected by the modulo threshold, and any folding time can be handled. [ABSTRACT FROM AUTHOR]

The Fresnel transform (FrT) is commonly used to describe the free-space propagation of optical waves. In this work, we present new definitions for the convolution, correlation and generalized shift operations based on the FrT. The generalized shift operation is defined by using simultaneous space and phase shifts. The generalized shift operation is useful for centred optical systems in the Fresnel domain (FrD) when the data distributions at the input plane of the optical system are shifted. The new convolution and correlation operations defined in terms of the FrT, the wavelength and the propagation distance, can be considered as a generalization of the usual convolution and correlation operations. The sampling theorem for distributions, whose resulting FrT has finite support, is formulated by using the new convolution operation introduced in this work and a new definition of the Dirac comb function. These new definitions and results could be applied to describe, design and implement optical processing systems related to the FrT. Finally, we present a centred optical systems used in holography and optical security systems that can be described or modelled by the new definitions of the operations proposed in this paper. [ABSTRACT FROM AUTHOR]

Although various infrared imaging spectrometers have been studied, most of them are developed under the Nyquist sampling theorem, which severely burdens 3D data acquisition, storage, transmission, and processing, in terms of both hardware and software. Recently, computational imaging, which avoids direct imaging, has been investigated for its potential in the visible field. However, it has been rarely studied in the infrared domain, as it suffers from inconsistency in spectral response and reconstruction. To address this, we propose a novel mid-wave infrared snapshot compressive spectral imager (MWIR-SCSI). This design scheme provides a high degree of randomness in the measurement projection, which is more conducive to the reconstruction of image information and makes spectral correction implementable. Furthermore, leveraging the explainability of model-based algorithms and the high efficiency of deep learning algorithms, we designed a deep infrared denoising prior plug-in for the optimization algorithm to perform in terms of both imaging quality and reconstruction speed. The system calibration obtains 111 real coded masks, filling the gap between theory and practice. Experimental results on simulation datasets and real infrared scenarios prove the efficacy of the designed deep infrared denoising prior plug-in and the proposed acquisition architecture that acquires mid-infrared spectral images of 640 pixels × 512 pixels × 111 spectral channels at an acquisition frame rate of 50 fps. [ABSTRACT FROM AUTHOR]

This paper proposes a cumulative distribution modelling method for pavement performance indexes based on the sampling theorem and implements clustering analysis of similar road sections through the K-means algorithm. The results show that: (1) The modelling method proposed in this paper can convert discrete pavement performance data into a continuous function of pavement performance indexes and a continuous function of pavement performance cumulative distribution and achieve the acquisition of a large amount of pavement performance data. (2) Based on the cumulative distribution and K-means clustering, it is possible to understand the overall pavement performance status of the network and identify road sections with similar decay models and poor decay status for focused attention, which constructed the pavement performance evaluation system of the three-level system of road network–road section–unit road section. [ABSTRACT FROM AUTHOR]

The current journal paper proposes an end-to-end analysis for the numerical implementation of a two-degrees-of-freedom (2DOF) control structure, starting from the sampling rate selection mechanism via a quasi-optimal manner, along with the estimation of the worst-case execution time (WCET) for the specified controller. For the sampling rate selection, the classical Shannon–Nyquist sampling theorem is replaced by an optimization problem that encompasses the trade-off between the fidelity of the controllers' representation, along with the fidelity of the resulting closed-loop systems, and the implementation difficulty of the controllers. Additionally, the WCET analysis can be seen as a verification step before automatic code generation, a computational model being provided. The proposed computational model encompasses infinite-impulse response (IIR) and finite-impulse response (FIR) filter models for the controller implementation, along with additional relevant phenomena being discussed, such as saturation, signal scaling and anti-windup techniques. All proposed results will be illustrated on a DC motor benchmark control problem. [ABSTRACT FROM AUTHOR]

A linear canonical S transform (LCST) is considered a generalization of the Stockwell transform (ST). It analyzes signals and has multi-angle, multi-scale, multiresolution, and temporal localization abilities. The LCST is mostly suitable to deal with chirp-like signals. It aims to possess the characteristics lacking in a classical transform. Our aim in this paper was to derive the sampling theorem for the LCST with the help of a multiresolution analysis (MRA) approach. Moreover, we discuss the truncation and aliasing errors for the proposed sampling theory. These types of sampling results, as well as methodologies for solving them, have applications in a wide range of fields where symmetry is crucial. [ABSTRACT FROM AUTHOR]

The resonant interaction of a plane wave and a one-dimensional Gaussian beam with a high-contrast dielectric grating was analyzed. Rigorous coupled wave analysis (RCWA) was used to numerically model the diffraction of a plane wave by the grating. RCWA, a discrete Fourier transform at the fulfillment (of the conditions) of the sampling theorem, was used to study diffraction of the Gaussian beam. The grating can be considered as a one-dimensional photonic crystal along which the waveguide mode propagates under resonance. The corresponding photonic crystal has both allowed and forbidden photonic bands for the propagating waveguide mode under resonance due to the high-contrast dielectric permittivity. There is no significant difference between the spectral and angular characteristics under the interaction of the plane wave or the Gaussian beam with grating, if the waveguide mode is in the forbidden photonic bandgap. The reflection coefficient from the grating is practically equal to unity for both cases. Resonant spectral and angular characteristics become wider at the Gaussian beam diffraction compared to the resonance curves for the plane wave in the case when the waveguide mode is in the allowed photon bandgap. The reflection coefficient from the grating becomes less than unity and its value tends to unity when the Gaussian beam width increases. [ABSTRACT FROM AUTHOR]

This paper deals with the stability characteristics of zeros for sampled-data models with a class of triangle sample and hold realized by a traditional zero-order hold. For any controlled models in the modern industrial system, using a digital control strategy has been shown to provide the means to achieve the assigned objectives. In this process, one must utilize the sample and hold device to obtain the sampled-data models. Previous studies have shown that the triangle sample and hold can improve the stability properties of zeros of a sampled-data control system compared with zero-order hold. However, it is difficult to use triangle sample and hold in practice. In this paper, an approximated method of using triangle sample and hold is proposed. More importantly, on the basis of that method, we explicitly derive the corresponding accurate sampled-data model of controlled models. In addition, we also provide the expression for sampling zeros and the theorem for the stability of a linear control system in the fast sampling process. The results of this paper show that the proposed method has the same advantages as the accurate one. Finally, theoretical findings are validated through numerical simulations with different considerations. [ABSTRACT FROM AUTHOR]

Recently, the frequent occurrence of the misuse and intrusion of UAVs has made it a research challenge to identify and detect them effectively, and relatively high bandwidth and pressure on data transmission and real-time processing exist when sampling UAV communication signals using the RF detection method. In this paper, firstly, for data sampling, we chose a compressed sensing technique to replace the traditional sampling theorem and used a multi-channel random demodulator to sample the signal; secondly, for the detection and identification of the presence, type, and flight pattern of UAVs, a multi-stage deep learning-based UAV identification and detection method was proposed by exploiting the difference in communication signals between UAVs and controllers under different circumstances. The data samples are first passed by detectors that detect the presence of UAVs, then classifiers are used to identify the type of UAVs, and finally flight patterns are judged by the corresponding classifiers, for which two neural network structures (DNN and CNN) are constructed by deep learning algorithms and evaluated and validated by a 10-fold cross-validation method, with the DNN network used for detectors and the CNN network for subsequent type and flying mode classification. The experimental results demonstrate, first, the effectiveness of using compressed sensing for sampling the communication signals of UAVs and controllers; and second, the detecting method with multi-stage DL detects higher efficiency and accuracy compared with existing detecting methods, detecting the presence, type, and flight model of UAVs with an accuracy of over 99%. [ABSTRACT FROM AUTHOR]

With the development of intelligent networks such as the Internet of Things, network scales are becoming increasingly larger, and network environments increasingly complex, which brings a great challenge to network communication. The issues of energy-saving, transmission efficiency, and security were gradually highlighted. Compressed sensing (CS) helps to simultaneously solve those three problems in the communication of intelligent networks. In CS, fewer samples are required to reconstruct sparse or compressible signals, which breaks the restrict condition of a traditional Nyquist–Shannon sampling theorem. Here, we give an overview of recent CS studies, along the issues of sensing models, reconstruction algorithms, and their applications. First, we introduce several common sensing methods for CS, like sparse dictionary sensing, block-compressed sensing, and chaotic compressed sensing. We also present several state-of-the-art reconstruction algorithms of CS, including the convex optimization, greedy, and Bayesian algorithms. Lastly, we offer recommendation for broad CS applications, such as data compression, image processing, cryptography, and the reconstruction of complex networks. We discuss works related to CS technology and some CS essentials. [ABSTRACT FROM AUTHOR]

Compressive sensing is a very attractive technique to detect weak signals in a noisy background, and to overcome limitations from traditional Nyquist sampling. A very important part of this approach is the measurement matrix and how it relates to hardware implementation. However, reconstruction accuracy, resistance to noise and construction time are still open challenges. To address these problems, we propose a measurement matrix based on a cyclic direct product and QR decomposition (the product of an orthogonal matrix Q and an upper triangular matrix R). Using the definition and properties of a direct product, a set of high-dimensional orthogonal column vectors is first established by a finite number of cyclic direct product operations on low-dimension orthogonal "seed" vectors, followed by QR decomposition to yield the orthogonal matrix, whose corresponding rows are selected to form the measurement matrix. We demonstrate this approach with simulations and field measurements of a scaled submarine in a freshwater lake, at frequencies of 40 kHz–80 kHz. The results clearly show the advantage of this method in terms of reconstruction accuracy, signal-to-noise ratio (SNR) enhancement, and construction time, by comparison with Gaussian matrix, Bernoulli matrix, partial Hadamard matrix and Toeplitz matrix. In particular, for weak signals with an SNR less than 0 dB, this method still achieves an SNR increase using less data. [ABSTRACT FROM AUTHOR]

In this paper, we propose a novel energy-efficient approach for mobile activity recognition system (ARS) to detect human activities. The proposed energy-efficient ARS, using low sampling rates, can achieve high recognition accuracy and low energy consumption. A novel classifier that integrates hierarchical support vector machine and context-based classification (HSVMCC) is presented to achieve a high accuracy of activity recognition when the sampling rate is less than the activity frequency, i.e., the Nyquist sampling theorem is not satisfied. We tested the proposed energy-efficient approach with the data collected from 20 volunteers (14 males and six females) and the average recognition accuracy of around 96.0% was achieved. Results show that using a low sampling rate of 1Hz can save 17.3% and 59.6% of energy compared with the sampling rates of 5 Hz and 50 Hz. The proposed low sampling rate approach can greatly reduce the power consumption while maintaining high activity recognition accuracy. The composition of power consumption in online ARS is also investigated in this paper. [ABSTRACT FROM AUTHOR]

Using the Kaczmarz algorithm, we prove that for any singular Borel probability measure μ on [0, 1), every f υ L²(m) possesses a Fourier series of the form f (x) = .... We show that the coefficients cn can be computed in terms of the quantities f(n) = .... We also demonstrate a Shannon-type sampling theorem for functions that are in a sense m-bandlimited. [ABSTRACT FROM AUTHOR]

Compressive sensing (CS) is a new technology in digital signal processing capable of high-resolution capture of physical signals from few measurements, which promises impressive improvements in the field of wireless sensor networks (WSNs). In this work, we extensively investigate the effectiveness of compressive sensing (CS) when real COTSresource-constrained sensor nodes are used for compression, evaluating how the different parameters can affect the energy consumption and the lifetime of the device. Using data from a real dataset, we compare an implementation of CS using dense encoding matrices, where samples are gathered at a Nyquist rate, with the reconstruction of signals sampled at a sub-Nyquist rate. The quality of recovery is addressed, and several algorithms are used for reconstruction exploiting the intra- and inter-signal correlation structures. We finally define an optimal under-sampling ratio and reconstruction algorithm capable of achieving the best reconstruction at the minimum energy spent for the compression. The results are verified against a set of different kinds of sensors on several nodes used for environmental monitoring. [ABSTRACT FROM AUTHOR]

In 1937, Boas gave a smart proof for an extension of the Bernstein theorem for trigonometric series. It is the purpose of the present note (i) to point out that a formula which Boas used in the proof is related with the Shannon sampling theorem; (ii) to present a generalized Parseval formula, which is suggested by the Boas' formula; and (iii) to show that this provides a very smart derivation of the Shannon sampling theorem for a function which is the Fourier transform of a distribution involving the Dirac delta function. It is also shows that, by the argument giving Boas' formula for the derivative f'(x) of a function f(x), we can derive the corresponding formula for f'''(x), by which we can obtain an upperbound of |f'''(x)+3R²f'(x)|. Discussions are given also on an extension of the Szegö theorem for trigonometric series, which Boas mentioned in the same paper. [ABSTRACT FROM AUTHOR]

Several techniques have been proposed that attempt to reconstruct a sparse signal from fewer samples than the ones required by the Nyquist theorem. In this paper, an undersampling technique is presented that allows the reconstruction of the sparse information that is transmitted through Orthogonal Frequency Division Multiplexing (OFDM) modulation. The properties of the Discrete Fourier Transform (DFT) that is employed by the OFDM modulation, allow the estimation of several samples from others that have already been obtained on the side of the receiver, provided that special relations are valid between the original data values. The inherent sparseness of the original data, as well as the Forward Error Correction (FEC) techniques employed, can assist the information recovery from fewer samples. It will be shown that up to 1/4 of the samples can be omitted from the sampling process and substituted by others on the side of the receiver for the successful reconstruction of the original data. In this way, the size of the buffer memory used for sample storage, as well as the storage requirements of the Fast Fourier Transform (FFT) implementation at the receiver, may be reduced by up to 25%. The power consumption of the Analog Digital Converter on the side of the receiver is also reduced when a lower sampling rate is used. [ABSTRACT FROM AUTHOR]

The paper is concerned with Shannon sampling reconstruction formulae of derivatives of bandlimited signals as well as of derivatives of their Hilbert transform, and their application to Boas-type formulae for higher order derivatives. The essential aim is to extend these results to non-bandlimited signals. Basic is the fact that by these extensions aliasing error terms must now be added to the bandlimited reconstruction formulae. These errors will be estimated in terms of the distance functional just introduced by the authors for the extensions of basic relations valid for bandlimited functions to larger function spaces. This approach can be regarded as a mathematical foundation of aliasing error analysis of many applications. [ABSTRACT FROM AUTHOR]

Distributed radar array brings several new forthcoming advantages in aerospace target detection and imaging. The two-dimensional distributed array avoids the imperfect motion compensation in coherent processing along slow time and can achieve single snapshot 3D imaging. Some difficulties exist in the 3D imaging processing. The first one is that the distributed array may be only in small amount. This means that the sampling does not meet the Nyquist sample theorem. The second one refers to echoes of objects in the same beam that will be mixed together, which makes sparse optimization dictionary too long for it to bring the huge computation burden in the imaging process. In this paper, we propose an innovative method on 3D imaging of the aerospace targets in the wide airspace with sparse radar array. Firstly, the case of multiple targets is not suitable to be processed uniformly in the imaging process. A 3D Hough transform is proposed based on the range profiles plane difference, which can detect and separate the echoes of different targets. Secondly, in the subsequent imaging process, considering the non-uniform sparse sampling of the distributed array in space, the migration through range cell (MTRC)-tolerated imaging method is proposed to process the signal of the two-dimensional sparse array. The uniformized method combining compressed sensing (CS) imaging in the azimuth direction and matched filtering in the range direction can realize the 3D imaging effectively. Before imaging in the azimuth direction, interpolation in the range direction is carried out. The main contributions of the proposed method are: (1) echo separation based on 3D transform avoids the huge amount of computation of direct sparse optimization imaging of three-dimensional data, and ensures the realizability of the algorithm; and (2) uniformized sparse solving imaging is proposed, which can remove the difficulty cause by MTRC. Simulation experiments verified the effectiveness and feasibility of the proposed method. [ABSTRACT FROM AUTHOR]

In this work, the diffraction of a Gaussian beam on a volume phase grating was researched theoretically and numerically. The proposed method is based on rigorous coupled-wave analysis (RCWA) and Fourier transform. The Gaussian beam is decomposed into plane waves using the Fourier transform. The number of plane waves is determined using the sampling theorem. The complex reflected and transmitted amplitudes are calculated for each RCWA plane wave. The distribution of the fields along the grating for the reflected and transmitted waves is determined using inverse Fourier transform. The powers of the reflected and transmitted waves are determined based on these distributions. Our method shows that the energy conservation law is satisfied for the phase grating. That is, the power of the incident Gaussian beam is equal to the sum of the powers of the reflected and transmitted beams. It is demonstration of our approach correctness. The numerous studies have shown that the spatial shapes of the reflected and transmitted beams differ from the Gaussian beam under resonance. In additional, the waveguide mode appears also in the grating. The spatial forms of the reflected and transmitted beams are Gaussian in the absence of resonance. It was found that the width of the resonance curves is wider for the Gaussian beam than for the plane wave. However, the spectral and angular sensitivities are the same as for the plane wave. The resonant wavelengths are slightly different for the plane wave and the Gaussian beam. Numerical calculations for four refractive index modulation coefficients of the grating medium were carried out by the proposed method. The widths of the resonance curves decrease with the increasing in the refractive index modulation. Moreover, the reflection coefficient also increases. [ABSTRACT FROM AUTHOR]

In this article, the question of how to sample the square amplitude of the radiated field in the framework of phaseless antenna diagnostics is addressed. In particular, the goal of the article is to find a discretization scheme that exploits a non-redundant number of samples and returns a discrete model whose mathematical properties are similar to those of the continuous one. To this end, at first, the lifting technique is used to obtain a linear representation of the square amplitude of the radiated field. Later, a discretization scheme based on the Shannon sampling theorem is exploited to discretize the continuous model. More in detail, the kernel of the related eigenvalue problem is first recast as the Fourier transform of a window function, and after, it is evaluated. Finally, the sampling theory approach is applied to obtain a discrete model whose singular values approximate all the relevant singular values of the continuous linear model. The study refers to a strip source whose square magnitude of the radiated field is observed in the Fresnel zone over a 2D observation domain. [ABSTRACT FROM AUTHOR]

Compressed sensing (CS) has been proposed to improve the efficiency of signal processing by simultaneously sampling and compressing the signal of interest under the assumption that the signal is sparse in a certain domain. This paper aims to improve the CS system performance by constructing a novel sparsifying dictionary and optimizing the measurement matrix. Owing to the adaptability and robustness of the Takenaka–Malmquist (TM) functions in system identification, the use of it as the basis function of a sparsifying dictionary makes the represented signal exhibit a sparser structure than the existing sparsifying dictionaries. To reduce the mutual coherence between the dictionary and the measurement matrix, an equiangular tight frame (ETF) based iterative minimization algorithm is proposed. In our approach, we modify the singular values without changing the properties of the corresponding Gram matrix of the sensing matrix to enhance the independence between the column vectors of the Gram matrix. Simulation results demonstrate the promising performance of the proposed algorithm as well as the superiority of the CS system, designed with the constructed sparsifying dictionary and the optimized measurement matrix, over existing ones in terms of signal recovery accuracy. [ABSTRACT FROM AUTHOR]

High requirements for power systems, and hence for electrical devices used in industrial processes, make it necessary to ensure adequate power quality. The main parameters of the power system include the rms-values of the current, voltage, and active and reactive power consumed by the loads. In previous articles, the authors investigated the use of low-frequency sampling to measure these parameters of the power system, showing that the method can be easily implemented in simple microcontrollers and PLCs. This article discusses the methods of measuring electrical quantities by devices with low computational efficiency and low sampling frequency up to 1 kHz. It is not obvious that the signal of 50–500 Hz can be processed using the sampling frequency of fs = 47.619 Hz because it defies the Nyquist–Shannon sampling theorem. This theorem states that a reconstruction of a sampled signal is only guaranteed possible for a bandlimit fmax < fs, where fmax is the maximum frequency of a sampled signal. Therefore, theoretically, neither 50 nor 500 Hz can be identified by such a low-frequency sampling. Although, it turns out that if we have a longer period of a stable multi-harmonic signal, which is band-limited (from the bottom and top), it allows us to map this band to the lower frequencies, thus it is possible to use the lower sampling ratio and still get enough precise information of its harmonics and rms value. The use of aliasing for measurement purposes is not often used because it is considered a harmful phenomenon. In our work, it has been used for measurement purposes with good results. The main advantage of this new method is that it achieves a balance between PLC processing power (which is moderate or low) and accuracy in calculating the most important electrical signal indicators such as power, RMS value and sinusoidal-signal distortion factor (e.g., THD). It can be achieved despite an aliasing effect that causes different frequencies to become indistinguishable. The result of the research is a proposal of error reduction in the low-frequency measurement method implemented on compact PLCs. Laboratory tests carried out on a Mitsubishi FX5 compact PLC controller confirmed the correctness of the proposed method of reducing the measurement error. [ABSTRACT FROM AUTHOR]

In this paper, we establish generalized sampling theorems, generalized stability theorems and new inequalities in the setting of shift-invariant subspaces of Lebesgue and Wiener amalgam spaces with mixed-norms. A convergence theorem of general iteration algorithms for sampling in some shift-invariant subspaces of L p → (R d) are also given. [ABSTRACT FROM AUTHOR]

Important state parameters, such as torque and angle obtained from the servo control and drive system, can reflect the operating condition of the equipment. However, there are two problems with the information obtained through the network from the control and drive system: the low sampling rate, which does not meet the sampling theorem and the nonuniformity of the sampling points. By combing equivalent sampling and nonuniform signal reconstruction theory, this paper proposes a reconstruction method for signal obtained from servo system in periodic reciprocating motion. Equivalent sampling combines the low rate and nonuniform samples from multiple periods into one single period, so that the equivalent sampling rate is far increased. Then, the nonuniform samples with high density are further resampled to meet the reconstruction conditions. This step can avoid the amplitude error in the reconstructed signal and increase the possibility of successful reconstruction. Finally, the reconstruction formula derived from basis theory is applied to recover the signal. This method has been successfully verified by the simulation signal of the robot swing process and the actual current signal collected on the robot arm testbed. [ABSTRACT FROM AUTHOR]

By means of compressive sampling (CS), a sparse signal can be efficiently recovered from its far fewer samples than that required by the Nyquist–Shannon sampling theorem. However, recovering a speech signal from its CS samples is a challenging problem, as it is not sparse enough on any existing canonical basis. To solve this problem, we propose a method which combines the approximate message passing (AMP) and Markov chain that exploits the dependence between the modified discrete cosine transform (MDCT) coefficients of a speech signal. To reconstruct the speech signal from CS samples, a turbo framework, which alternately iterates AMP and belief propagation along the Markov chain, is utilized. In addtion, a constrain is set to the turbo iteration to prevent the new method from divergence. Extensive experiments show that, compared to other traditional CS methods, the new method achieves a higher signal-to-noise ratio, and a higher perceptual evaluation of speech quality (PESQ) score. At the same time, it maintaines a better similarity of the energy distribution to the original speech spectrogram. The new method also achieves a comparable speech enhancement effect to the state-of-the-art method. [ABSTRACT FROM AUTHOR]

In this paper the problem of sampling the field radiated by a planar source observed over a finite planar aperture located in the near-field is addressed. The problem is cast as the determination of the spatial measurement positions which allow us to discretize the radiation problem so that the singular values of the radiation operator are well-approximated. More in detail, thanks to a suitably warping transformation of the observation variables, the kernel function of the relevant operator is approximated by a band-limited function and hence the sampling theorem applied to achieved discretization. It results in the sampling points having to be non-linearity arranged across the measurement aperture and their number can be considerably lowered as compared to more standard sampling approach. It is shown that the proposed sampling scheme works well for measurement apertures that are not too large as compared to the source's size. As a consequence, the method appears better suited for broad-side large antenna whose radiated field is mainly concentrated in front of the antenna. A numerical analysis is included to check the theoretical findings and to study the trade-off between the field accuracy representation (over the measurement aperture) and the truncation error in the estimated far-field radiation pattern. [ABSTRACT FROM AUTHOR]

"Discretization" usually denotes the operation of mapping continuous functions to infinite or finite sequences of discrete values. It may also mean to map the operation itself from one that operates on functions to one that operates on infinite or finite sequences. Advantageously, these two meanings coincide within the theory of generalized functions. Discretization moreover reduces to a simple multiplication. It is known, however, that multiplications may fail. In our previous studies, we determined conditions such that multiplications hold in the tempered distributions sense and, hence, corresponding discretizations exist. In this study, we determine, vice versa, conditions such that discretizations can be reversed, i.e., functions can be fully restored from their samples. The classical Whittaker-Kotel'nikov-Shannon (WKS) sampling theorem is just one particular case in one of four interwoven symbolic calculation rules deduced below. [ABSTRACT FROM AUTHOR]

The gyrator transform (GT) is used for images processing in applications of light propagation. We propose new image processing operators based on the GT, these operators are: Generalized shift, convolution and correlation. The generalized shift is given by a simultaneous application of a spatial shift and a modulation by a pure linear phase term. The new operators of convolution and correlation are defined using the GT. All these image processing operators can be used in order to design and implement new optical image processing systems based on the GT. The sampling theorem for images whose resulting GT has finite support is developed and presented using the previously defined operators. Finally, we describe and show the results for an optical image encryption system using a nonlinear joint transform correlator and the proposed image processing operators based on the GT. [ABSTRACT FROM AUTHOR]

In this paper, a wavenumber–searching method based on time-domain compensation is proposed to obtain the wavenumber of the Lamb wave array received signal. In the proposed method, the time-domain sampling signal of the linear piezoelectric transducer (PZT) sensor array is converted into a spatial sampling signal using the searching wavenumber. The two–dimensional time-spatial-domain Lamb wave received signal of the linear PZT sensor array is then converted into a one-dimensional synthesized spatial sampling signal. Further, the sum of squared errors between the synthesized spatial sampling signal and its Morlet wavelet fitting signal is calculated at each searching wavenumber. Finally, the wavenumber of the Lamb wave array received signal is obtained as the searching wavenumber corresponding to the minimum error. This method was validated on a 2024-T3 aluminum alloy. The validation results showed that the proposed method can successfully obtain the wavenumber of the Lamb wave array received signal, whose spatial sampling rate does not satisfy the Nyquist sampling theorem; the wavenumber error does not exceed 2.2 rad/m. Damage localization based on the proposed method was also validated on a carbon fiber composite laminate plate, and the maximum damage localization error was no more than 2.11 cm. [ABSTRACT FROM AUTHOR]

The sampling reconstruction theory is one of the great areas of the analysis in which Paul Leo Butzer earned longstanding and excellent theoretical results. Thus, we are forced either by earlier exhaustive presentations of his research activity and/or the highly voluminous material to restrict ourselves to a more narrow and precise sub-area in consideration; we discuss here, giving deeper insight, Paul Butzer's sampling theoretical work with special attention concerning sampling stochastic signals. [ABSTRACT FROM AUTHOR]

Computed tomography (CT) image reconstruction and restoration are very important in medical image processing, and are associated together to be an inverse problem. Image iterative reconstruction is a key tool to increase the applicability of CT imaging and reduce radiation dose. Nevertheless, traditional image iterative reconstruction methods are limited by the sampling theorem and also the blurring of projection data will propagate unhampered artifact in the reconstructed image. To overcome these problems, image restoration techniques should be developed to accurately correct a wide variety of image degrading effects in order to effectively improve image reconstruction. In this paper, a blind image restoration technique is embedded in the compressive sensing CT image reconstruction, which can result in a high-quality reconstruction image using fewer projection data. Because a small amount of data can be obtained by radiation in a shorter time, high-quality image reconstruction with less data is equivalent to reducing radiation dose. Technically, both the blurring process and the sparse representation of the sharp CT image are first modeled as a serial of parameters. The sharp CT image will be obtained from the estimated sparse representation. Then, the model parameters are estimated by a hierarchical Bayesian maximum posteriori formulation. Finally, the estimated model parameters are optimized to obtain the final image reconstruction. We demonstrate the effectiveness of the proposed method with the simulation experiments in terms of the peak signal to noise ratio (PSNR), and structural similarity index (SSIM). [ABSTRACT FROM AUTHOR]

The Nyquist folding receiver (NYFR) can achieve a high-probability interception of an ultra-wideband (UWB) signal with fewer devices, while the output of the NYFR is converted into a hybrid modulated signal of the local oscillator (LO) and the received signal, which requires the matching parameter estimation methods. The linear frequency modulation (LFM) signal is a typical low probability of intercept (LPI) radar signal. In this paper, an estimation method of both the Nyquist Zone (NZ) index and the chirp rate for the LFM signal intercepted by NYFR was proposed. First, according to the time-frequency characteristics of the LFM signal, the accurate NZ and the rough chirp rate was estimated based on least squares (LS) and random sample consensus (RANSAC). Then, the information of the LO was removed from the hybrid modulated signal by the known NZ, and the precise chirp rate was obtained by using the fractional Fourier transform (FrFT). Moreover, a fast search method of FrFT optimal order was presented, which could obviously reduce the computational complexity. The simulation demonstrated that the proposed method could precisely estimate the parameters of the hybrid modulated output signal of the NYFR. [ABSTRACT FROM AUTHOR]

A continuous-time white Gaussian channel can be formulated using a white Gaussian noise, and a conventional way for examining such a channel is the sampling approach based on the Shannon–Nyquist sampling theorem, where the original continuous-time channel is converted to an equivalent discrete-time channel, to which a great variety of established tools and methodology can be applied. However, one of the key issues of this scheme is that continuous-time feedback and memory cannot be incorporated into the channel model. It turns out that this issue can be circumvented by considering the Brownian motion formulation of a continuous-time white Gaussian channel. Nevertheless, as opposed to the white Gaussian noise formulation, a link that establishes the information-theoretic connection between a continuous-time channel under the Brownian motion formulation and its discrete-time counterparts has long been missing. This paper is to fill this gap by establishing causality-preserving connections between continuous-time Gaussian feedback/memory channels and their associated discrete-time versions in the forms of sampling and approximation theorems, which we believe will play important roles in the long run for further developing continuous-time information theory. As an immediate application of the approximation theorem, we propose the so-called approximation approach to examine continuous-time white Gaussian channels in the point-to-point or multi-user setting. It turns out that the approximation approach, complemented by relevant tools from stochastic calculus, can enhance our understanding of continuous-time Gaussian channels in terms of giving alternative and strengthened interpretation to some long-held folklore, recovering "long-known" results from new perspectives, and rigorously establishing new results predicted by the intuition that the approximation approach carries. More specifically, using the approximation approach complemented by relevant tools from stochastic calculus, we first derive the capacity regions of continuous-time white Gaussian multiple access channels and broadcast channels, and we then analyze how feedback affects their capacity regions: feedback will increase the capacity regions of some continuous-time white Gaussian broadcast channels and interference channels, while it will not increase capacity regions of continuous-time white Gaussian multiple access channels. [ABSTRACT FROM AUTHOR]