A Novel Dual Mode Decision Directed Multimodulus Algorithm (DM-DD-MMA) for Blind Adaptive Equalization

In this paper, we propose for the 16 quadrature amplitude modulation (QAM) input case, a dual-mode (DM), decision directed (DD) multimodulus algorithm (MMA) algorithm for blind adaptive equalization which we name as DM-DD-MMA. In this new proposed algorithm, the MMA method is switched to the DD algorithm, based on a previously obtained expression for the step-size parameter valid at the convergence state of the blind adaptive equalizer, that depends on the channel power, input signal statistics and on the properties of the chosen algorithm. Simulation results show that improved equalization performance is obtained for the 16 QAM input case compared with the DM-CMA (where CMA is the constant modulus algorithm), DM-MCMA (where MCMA is the modified CMA) and MCMA-MDDMA (where MDDMA is the modified decision directed modulus algorithm).

A Simple and Robust Equalization Algorithm for Variable Modulation Systems

This paper proposes a simple and robust variable modulation-decision-directed least mean square (VM-DDLMS) algorithm for reducing the complexity of conventional equalization algorithms and improving the stability of variable modulation (VM) systems. Compared to conventional adaptive equalization algorithms, known information was used as training sequences to reduce the bandwidth consumption caused by inserting training sequences; compared with conventional blind equalization algorithms, the parameters and decisions of the equalizer were determinate, which was conducive to a stable equalization performance. The simulation and implementation results show that the proposed algorithm has a better bit error rate (BER) performance than that of the constant modulus algorithm (CMA) and modified constant modulus algorithm (MCMA) while maintaining the same level of consumption of hardware resources. Compared to the conventional decision-directed least mean square (DDLMS) algorithm, the proposed algorithm only needs to make quadrature phase shift keying (QPSK) symbol decisions, which reduces the computational complexity. In parallel 11th-order equalization algorithms, the operating frequency of VM-DDLMS can reach up to 333.33 MHz.

Antisparsity as a Prior in Blind Separation of Correlated Sources

<div>This letter introduces the concept of antisparse Blind Source Separation (BSS), proposing a suitable criterion based on the $\ell_\infty$ norm to explore the antisparsity feature. </div><div>The effectiveness of the criterion is theoretically demonstrated and it is also evaluated by computational simulations, which consider up to ten distinct sources with different correlation levels. Moreover, we simulated a scenario in wireless communication with binary sources, comparing our approach to the Constant Modulus algorithm. Both the theoretical and the simulation results highlight the potentiality of using antisparsity as a prior in BSS.</div>

Antisparsity as a Prior in Blind Separation of Correlated Sources

<div>This letter introduces the concept of antisparse Blind Source Separation (BSS), proposing a suitable criterion based on the $\ell_\infty$ norm to explore the antisparsity feature. </div><div>The effectiveness of the criterion is theoretically demonstrated and it is also evaluated by computational simulations, which consider up to ten distinct sources with different correlation levels. Moreover, we simulated a scenario in wireless communication with binary sources, comparing our approach to the Constant Modulus algorithm. Both the theoretical and the simulation results highlight the potentiality of using antisparsity as a prior in BSS.</div>

Concurrent Modified Constant Modulus Algorithm and Decision Directed Scheme With Barzilai-Borwein Method

At present, in robot technology, remote control of robot is realized by wireless communication technology, and data anti-interference in wireless channel becomes a very important part. Any wireless communication system has an inherent multi-path propagation problem, which leads to the expansion of generated symbols on a time scale, resulting in symbol overlap and Inter-symbol Interference (ISI). ISI in the signal must be removed and the signal restores to its original state at the time of transmission or becomes as close to it as possible. Blind equalization is a popular equalization method for recovering transmitted symbols of superimposed noise without any pilot signal. In this work, we propose a concurrent modified constant modulus algorithm (MCMA) and the decision-directed scheme (DDS) with the Barzilai-Borwein (BB) method for the purpose of blind equalization of wireless communications systems (WCS). The BB method, which is two-step gradient method, has been widely employed to solve multidimensional unconstrained optimization problems. Considering the similarity of equalization process and optimization process, the proposed algorithm combines existing blind equalization algorithm and Barzilai-Borwein method, and concurrently operates a MCMA equalizer and a DD equalizer. After that, it modifies the DD equalizer's step size (SS) by the BB method. Theoretical investigation was involved and it demonstrated rapid convergence and improved equalization performance of the proposed algorithm compared with the original one. Additionally, the simulation results were consistent with the proposed technique.

Semi-blind channel estimation based on Modified CMA and unitary scrambling for massive MIMO systems

Pilot contamination is one of the main impairments in multi-cell massive Multiple-Input Multiple-Output (MIMO) systems. In order to improve the channel estimation in this context, we propose to use a semi-blind channel estimator based on the constant modulus algorithm (CMA). We consider an enhanced version of the CMA namely the Modified CMA (MCMA) which modifies the cost function of the CMA algorithm to the sum of cost functions for real and imaginary parts. Due to pilot contamination, the channel estimator may estimate the channel of a contaminating user instead of that of the user of interest (the user for which the Base Station wants to estimate the channel and then the data). To avoid this, we propose to scramble the users sequences before transmission. We consider different methods to perform unitary scrambling based on rotating the transmitted symbols (one Dimensional (1-D) scrambling) and using unitary matrices (two-Dimensional (2-D) scrambling). At the base station, the received sequence of the user of interest is descrambled leading to a better convergence of the channel estimator. We also consider the case where the Automatic Repeat reQuest (ARQ) protocol is used. In this case, using scrambling leads to a significant gain in terms of BLock Error Rate (BLER) due to the change of the contaminating users data from one transmission to another induced by scrambling.

Modified constant modulus algorithm based on bat algorithm

In this work, modified constant modulus algorithm based on bat algorithm is proposed for wireless sensor communications systems. The bat algorithm is a swarm intelligence optimization algorithm, which mainly used to solve optimization problems. The proposed algorithm focused on modified constant modulus algorithm, which is also applicable to the constant modulus algorithm. The error function of blind equalization algorithm is used as the evaluation function of the bat algorithm, and then the initial value of the weight vector is calculated adaptively by the bat algorithm. Theoretical analysis is provided to illustrate that the proposed algorithm has a faster convergence speed than the original one and is suitable for almost all blind channel equalization algorithms. The simulation results support the newly proposed improved algorithm. The proposed algorithm could be applied to some more complex wireless channel environments to improve the reception performance of sensor communication systems.

AMC2N: Automatic Modulation Classification Using Feature Clustering-Based Two-Lane Capsule Networks

The automatic modulation classification (AMC) of a detected signal has gained considerable prominence in recent years owing to its numerous facilities. Numerous studies have focused on feature-based AMC. However, improving accuracy under low signal-to-noise ratio (SNR) rates is a serious issue in AMC. Moreover, research on the enhancement of AMC performance under low and high SNR rates is limited. Motivated by these issues, this study proposes AMC using a feature clustering-based two-lane capsule network (AMC2N). In the AMC2N, accuracy of the MC process is improved by designing a new two-layer capsule network (TL-CapsNet), and classification time is reduced by introducing a new feature clustering approach in the TL-CapsNet. Firstly, the AMC2N executes blind equalization, sampling, and quantization in trilevel preprocessing. Blind equalization is executed using a binary constant modulus algorithm to avoid intersymbol interference. To extract features from the preprocessed signal and classify signals accurately, the AMC2N employs the TL-CapsNet, in which individual lanes are incorporated to process the real and imaginary parts of the signal. In addition, it is robust to SNR variations, that is, low and high SNR rates. The TL-CapsNet extracts features from the real and imaginary parts of the given signal, which are then clustered based on feature similarity. For feature extraction and clustering, the dynamic routing procedure of the TL-CapsNet is adopted. Finally, classification is performed in the SoftMax layer of the TL-CapsNet. This study proves that the AMC2N outperforms existing methods, particularly, convolutional neural network(CNN), Robust-CNN (R-CNN), curriculum learning(CL), and Local Binary Pattern (LBP), in terms of accuracy, precision, recall, F-score, and computation time. All metrics are validated in two scenarios, and the proposed method shows promising results in both.