Clustering algorithms for Stokes space modulation format recognition
نویسندگان
چکیده
منابع مشابه
Clustering algorithms for Stokes space modulation format recognition.
Stokes space modulation format recognition (Stokes MFR) is a blind method enabling digital coherent receivers to infer modulation format information directly from a received polarization-division-multiplexed signal. A crucial part of the Stokes MFR is a clustering algorithm, which largely influences the performance of the detection process, particularly at low signal-to-noise ratios. This paper...
متن کاملApplication of Pattern Recognition Algorithms for Clustering Power System to Voltage Control Areas and Comparison of Their Results
Finding the collapse susceptible portion of a power system is one of the purposes of voltage stability analysis. This part which is a voltage control area is called the voltage weak area. Determining the weak area and adjecent voltage control areas has special importance in the improvement of voltage stability. Designing an on-line corrective control requires the voltage weak area to be determi...
متن کاملApplication of Pattern Recognition Algorithms for Clustering Power System to Voltage Control Areas and Comparison of Their Results
Finding the collapse susceptible portion of a power system is one of the purposes of voltage stability analysis. This part which is a voltage control area is called the voltage weak area. Determining the weak area and adjecent voltage control areas has special importance in the improvement of voltage stability. Designing an on-line corrective control requires the voltage weak area to be determi...
متن کاملSearch Space Modulation in Genetic Algorithms
An experimental form of Modulation (Reinterpretation) of the Search Space is presented. This modulation is developed as a mathematical method that can be implemented directly into existing evolutionary algorithms without writing special operators, changing the program loop etc. The main mathematical principle behind this method is the dynamic sinusoidal envelope of the search space. This method...
متن کاملReduction and Null Space Algorithms for the Subspace Clustering Problem
This paper presents two algorithms for clustering high-dimensional data points that are drawn from a union of lower dimensional subspaces. The first algorithm is based on binary reduced row echelon form of a data matrix. It can solve the subspace segmentation problem perfectly for noise free data, however, it is not reliable for noisy cases. The second algorithm is based on Null Space represent...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Optics Express
سال: 2015
ISSN: 1094-4087
DOI: 10.1364/oe.23.015521