Comparison of SPS and FA methods for Blind Carrier Frequency Offset Estimation in OFDM systems

In orthogonal frequency-division multiplexing (OFDM) systems, synchronization issues are of great importance since synchronization errors might destroy the orthogonality among all subcarriers and, therefore, introduce intercarrier interference (ICI) and intersymbol interference (ISI). Several schemes of frequency offset estimation in OFDM systems have been investigated. This paper compares performance and computational complexity of Smoothing Power Spectrum (SPS) and Frequency Analysis (FA) methods for blind carrier frequency offset (CFO) estimation in OFDM systems.

Five-axis trajectory generation considering synchronisation and nonlinear interpolation errors

This paper presents a novel real-time interpolation technique for 5-axis machine tools to attain higher speedand accuracy. To realize computationally efficient real-time interpolation of 6DOF tool motion, a joint workpiece-machine coordinate system interpolation scheme is proposed. Cartesian motion of the tool centre point (TCP) isinterpolated in the workpiece coordinate system (WCS), whereas tool orientation is interpolated in the machinecoordinate system (MCS) based on the finite impulse response (FIR) filtering. Such approach provides several ad-vantages: i) it eliminates the need for complex real-time spherical interpolation techniques, ii) facilitates efficientuse of slower rotary drive kinematics to compensate for the dynamic mismatch between Cartesian and rotary axesand achieve higher tool acceleration, iii) mitigates feed fluctuations while interpolating near kinematic singulari-ties. To take advantage of such benefits and realize accurate joint WCS-MCS interpolation scheme, tool orientationinterpolation errors are analysed. A novel approach is developed to adaptively discretize long linear tool movesand confine interpolation errors within user set tolerances. Synchronization errors between TCP and tool orienta-tion are also characterized, and peak synchronization error level is determined to guide the interpolation parameterselection. Finally, blending errors during non-stop continuous interpolation of linear toolpaths are modelled andconfined. Advantages of the proposed interpolation scheme are demonstrated through simulation studies and vali-dated experimentally. Overall, proposed technique can improve cycle times up to 10% while providing smooth and accurate non-stop real-time interpolation of tool motion in 5-axis machining.

Estimation Techniques for MIMO-OFDM-A Review

In the context of Third-Generation Partnership Project Long-Term Evolution (3GPP LTE), the target data rates are 100 Mb/s in downlink and 50 Mb/s in uplink, and other system features include flexible bandwidths and moderate power consumption of mobile terminals. While the previous 3GPP generations, namely, 3G UMTS and 3.5G HSPA, rely on code-division multiple access (CDMA), LTE adopts orthogonal frequency-division multiple access (OFDMA)-based technologies for its uplink and downlink. Due to high peak-to-average power ratio (PAPR) of OFDMA signals, the single- carrier frequency division multiple access (SC-FDMA), also known as discrete Fourier transform (DFT)-spread OFDMA, has been selected for the uplink transmission in 3GPP LTE systems. SC-FDMA has similar throughput performance as OFDMA but with lower PAPR to increase power efficiency and is less sensitive to frequency synchronization errors, which makes it favorable for mobile terminals.

Synchronization of a Memristor Chaotic System and Image Encryption

In this paper, a sliding-mode-based controller is designed for finite-time synchronization of Memristor Chaotic Systems (MCSs). It demonstrates that the synchronization errors of the MCSs reach the designed sliding-mode surface within a finite time and the finite-time stability is achieved on the surface, which implies that the finite-time synchronization for MCSs is achieved by employing the proposed sliding-mode-based controller. Furthermore, a new image encryption algorithm is proposed and implemented based on the results of finite-time synchronization. Finally, the numerical simulation and the corresponding statistical performance analysis are presented to verify the practicability, effectiveness and superiority of the presented sliding-mode-based controller and encryption algorithm, especially their potential applications in secure communication.

Leader-following Synchronization Control of Multiple Electrohydraulic Actuators Under Switching Network Topologies

A leader-following quasi-synchronization control is proposed in multiple electrohydraulic actuators (MEHAs) under different switching network topologies to guarantee the follower electrohydraulic actuators (EHAs) tracking the leader motion. Firstly, each electro-hydraulic actuator (EHA) has a 3-order nonlinear dynamics with unknown external load. Then by using Lie derivative technique, the MEHAs nonlinear models with $n+1$ nodes are feedback linearized for convenient control design. Furthermore, the leader node is constructed as a virtual simulation model to be stabilized by PI controller. Meanwhile, a quasi-synchronized controller together with a disturbance observer is designed by LMI and Lyapunov techniques to guarantee that the synchronization errors between the n follower nodes and the leader node 0 are uniformly ultimate boundaries. Finally, the effectiveness of the leader-following quasi-synchronized controller is verified by a MEHAs experimental bench with 3 EHAs under switching network topologies.

Synchronization of Chaotic Systems: A Generic Nonlinear Integrated Observer-Based Approach

The purpose of this research is to study the synchronization of two integrated nonlinear systems with time delay and disturbances. A nonlinear system is a system in which the difference in output is not relative to the difference in input. A new control methodology for synchronization of the two chaotic systems master and slave is recognized by means of the unique integrated chaotic synchronous observer and the integrated chaotic adaptive synchronous observer. The instantaneous approximation states of the master and slave systems are accomplished by means of methods for suggesting observers for every one of the master and slave systems and by the production of error signals between these approximated states. This approximated synchronization error signal and state approximation errors meet at the origin by means of methods involving a particular observer-based feedback control signal to ensure synchronization and state approximation. Using Lyapunov stability theory, adaptive and nonadaptive laws for control systems, and nonlinear properties, the intermingling conditions for state approximation errors and approximated synchronization errors are established as nonlinear matrix inequalities. A solution to the resulting inequality constraints using a two-step linear matrix inequality (LMI)-based approach is introduced, giving essential and adequate conditions to extract values from the controller gain and observer gain matrices. Simulation of the suggested synchronization procedure for FitzHugh–Nagumo neuronal systems is demonstrated to expand the viability of the suggested observer-based control techniques.

Characterization of GFDM Signal with Timing Offset, CFO, Non-Linearity, and PN

In this paper, we study the joint effects of timing offset (TO), carrier frequency offset (CFO), nonlinear power amplifier distortion, and phase noise (PN) on generalized frequency division multiplexing (GFDM) system. Closed form expressions for signal-to-interference ratio (SIR) at GFDM receiver with synchronization errors and PN using a nonlinear power amplifier is derived. Then, we have been conducted simulation studies to compare the performance of GFDM systems with orthogonal frequency division multiplexing (OFDM) systems using matched filter (MF) and zero forcing (ZF), in presence of these impairments. The results show that GFDM systems are more robust against TO and PN while they are more sensitive to CFO and nonlinear distortion compared to OFDM systems.

Synchronization Strings: Codes for Insertions and Deletions Approaching the Singleton Bound

We introduce synchronization strings , which provide a novel way to efficiently deal with synchronization errors , i.e., insertions and deletions. Synchronization errors are strictly more general and much harder to cope with than more commonly considered Hamming-type errors , i.e., symbol substitutions and erasures. For every ε > 0, synchronization strings allow us to index a sequence with an ε -O(1) -size alphabet, such that one can efficiently transform k synchronization errors into (1 + ε)k Hamming-type errors . This powerful new technique has many applications. In this article, we focus on designing insdel codes , i.e., error correcting block codes (ECCs) for insertion-deletion channels. While ECCs for both Hamming-type errors and synchronization errors have been intensely studied, the latter has largely resisted progress. As Mitzenmacher puts it in his 2009 survey [30]: “ Channels with synchronization errors...are simply not adequately understood by current theory. Given the near-complete knowledge, we have for channels with erasures and errors...our lack of understanding about channels with synchronization errors is truly remarkable. ” Indeed, it took until 1999 for the first insdel codes with constant rate, constant distance, and constant alphabet size to be constructed and only since 2016 are there constructions of constant rate insdel codes for asymptotically large noise rates. Even in the asymptotically large or small noise regimes, these codes are polynomially far from the optimal rate-distance tradeoff. This makes the understanding of insdel codes up to this work equivalent to what was known for regular ECCs after Forney introduced concatenated codes in his doctoral thesis 50 years ago. A straightforward application of our synchronization strings-based indexing method gives a simple black-box construction that transforms any ECC into an equally efficient insdel code with only a small increase in the alphabet size. This instantly transfers much of the highly developed understanding for regular ECCs into the realm of insdel codes. Most notably, for the complete noise spectrum, we obtain efficient “near-MDS” insdel codes, which get arbitrarily close to the optimal rate-distance tradeoff given by the Singleton bound. In particular, for any δ ∈ (0,1) and ε > 0, we give a family of insdel codes achieving a rate of 1 - δ - ε over a constant-size alphabet that efficiently corrects a δ fraction of insertions or deletions.